強連結有向グラフ上のマルチエージェント経路探索:実行可能性と解法アルゴリズム
Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
強連結有向グラフ上でのマルチエージェント経路探索問題に対し、穴が2つ以上ある場合に実行可能性を線形時間で判定し、多項式時間で実行可能解を求めるアルゴリズムを提案した。
著者: Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli
分類: cs.MA, cs.RO
原文アブストラクト
On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known to be NP-hard, and computation times grows exponentially with the number of agents. However, in industrial applications, it is important to find feasible, suboptimal solutions, in a time that grows polynomially with the number of agents. Such algorithms exist for undirected and biconnected directed graphs. Our main contribution is to generalize these algorithms to the more general case of strongly connected directed graphs. In particular, given a MAPF problem with at least two holes, we present an algorithm that checks the problem feasibility in linear time with respect to the number of nodes, and provides a feasible solution in polynomial time.
