Publication

I. Saccani, K. Janovska and P. Surynek. Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding [Extended Abstract]. In International Symposium on Combinatorial Search (SoCS), 2024.

Abstract: 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.

Download the paper in pdf.