Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract).
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00381395" target="_blank" >RIV/68407700:21240/24:00381395 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1609/socs.v17i1.31581" target="_blank" >https://doi.org/10.1609/socs.v17i1.31581</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1609/socs.v17i1.31581" target="_blank" >10.1609/socs.v17i1.31581</a>
Alternative languages
Result language
angličtina
Original language name
Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract).
Original language description
We address rule-based algorithms for multi-agent path finding (MAPF). MAPF is a task of finding non-conflicting paths connecting agents' initial and goal positions in a shared environment specified via an undirected graph. Rule-based algorithms use a fixed set of predefined primitive operations to move agents to their goal positions in a complete manner. We propose to apply spectral clustering on the underlying graph to decompose the graph into highly connected components and move agents to their goal cluster first before the rule-based algorithm is applied. The benefit of this approach is twofold: (1) the rule-based algorithms are often more efficient on highly connected clusters and (2) we can potentially run the algorithms in parallel on individual clusters.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA22-31346S" target="_blank" >GA22-31346S: logicMOVE: Logic Reasoning in Motion Planning for Multiple Robotic Agents</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Seventeenth International Symposium on Combinatorial Search (SoCS 2024)
ISBN
978-1-57735-891-6
ISSN
2832-9171
e-ISSN
2832-9163
Number of pages
2
Pages from-to
281-282
Publisher name
AAAI Press
Place of publication
Menlo Park
Event location
Kananaskis
Event date
Jun 6, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—