マルチエージェント経路探索問題に対する柔軟で説明可能な解法
Flexible and Explainable Solutions for Multi-Agent Path Finding Problems
複数ロボットの衝突回避経路計画(MAPF)とその変種に対し、柔軟性と説明可能性を両立する解法を提案する。
著者: Aysu Bogatarkan
分類: cs.AI, cs.LO, cs.MA, cs.RO
原文アブストラクト
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. The real-world applications of MAPF require flexibility (e.g., solving variations of MAPF) as well as explainability. In this study, both of these challenges are addressed and some flexible and explainable solutions for MAPF and its variants are introduced.
