群制御arXiv:1702.05515
マルチエージェント経路計画の実世界適用への一般化
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
MAPFを実世界シナリオに適用する際に生じる課題を整理し、それらに対処する4つの研究方向を論じた概説論文。
著者: Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hoenig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig Tovey, Guni Sharon
分類: cs.AI, cs.MA, cs.RO
原文アブストラクト
Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when generalizing MAPF methods to real-world scenarios and four research directions that address them. We emphasize the importance of addressing these issues as opposed to developing faster methods for the standard formulation of the MAPF problem.
