待機ノードを活用したマルチエージェント搬送のデッドロック回避法
Standby-Based Deadlock Avoidance Method for Multi-Agent Pickup and Delivery Tasks
迷路状の狭い環境でのマルチエージェント搬送において、関節点探索でリアルタイムに待機ノードを決めてエージェントを有限時間滞在させ、デッドロックを回避する手法を提案した。
著者: Tomoki Yamauchi, Yuki Miyashita, Toshiharu Sugawara
分類: cs.MA, cs.AI, cs.RO
原文アブストラクト
The multi-agent pickup and delivery (MAPD) problem, in which multiple agents iteratively carry materials without collisions, has received significant attention. However, many conventional MAPD algorithms assume a specifically designed grid-like environment, such as an automated warehouse. Therefore, they have many pickup and delivery locations where agents can stay for a lengthy period, as well as plentiful detours to avoid collisions owing to the freedom of movement in a grid. By contrast, because a maze-like environment such as a search-and-rescue or construction site has fewer pickup/delivery locations and their numbers may be unbalanced, many agents concentrate on such locations resulting in inefficient operations, often becoming stuck or deadlocked. Thus, to improve the transportation efficiency even in a maze-like restricted environment, we propose a deadlock avoidance method, called standby-based deadlock avoidance (SBDA). SBDA uses standby nodes determined in real-time using the articulation-point-finding algorithm, and the agent is guaranteed to stay there for a finite amount of time. We demonstrated that our proposed method outperforms a conventional approach. We also analyzed how the parameters used for selecting standby nodes affect the performance.
