故障に耐えるオフライン複数エージェント経路計画
Fault-Tolerant Offline Multi-Agent Path Planning
実行中に一部のエージェントが故障して作業空間を塞ぐ状況でも、残りの正常なエージェントが衝突やデッドロックなく目的地に到達できるよう、経路と切り替え規則をオフラインで計画する手法を提案した。
著者: Keisuke Okumura, Sébastien Tixeuil
分類: cs.RO, cs.AI, cs.MA
原文アブストラクト
We study a novel graph path planning problem for multiple agents that may crash at runtime, and block part of the workspace. In our setting, agents can detect neighboring crashed agents, and change followed paths at runtime. The objective is then to prepare a set of paths and switching rules for each agent, ensuring that all correct agents reach their destinations without collisions or deadlocks, despite unforeseen crashes of other agents. Such planning is attractive to build reliable multi-robot systems. We present problem formalization, theoretical analysis such as computational complexities, and how to solve this offline planning problem.
