Answer Set Programmingを用いた競合解消に基づく動的マルチエージェント経路計画
Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming
エージェントの参加・離脱が動的に起こる環境で、競合する最小限のエージェント部分集合のみを再計画することで全体再計画を避けるD-MAPF手法を提案した。
著者: Basem Atiq, Volkan Patoglu, Esra Erdem
分類: cs.AI, cs.LO, cs.MA, cs.RO
原文アブストラクト
We study a dynamic version of multi-agent path finding problem (called D-MAPF) where existing agents may leave and new agents may join the team at different times. We introduce a new method to solve D-MAPF based on conflict-resolution. The idea is, when a set of new agents joins the team and there are conflicts, instead of replanning for the whole team, to replan only for a minimal subset of agents whose plans conflict with each other. We utilize answer set programming as part of our method for planning, replanning and identifying minimal set of conflicts.
