行動的多様性を持つマルチエージェント探索のための分散タスク割り当て
Behaviorally Heterogeneous Multi-Agent Exploration Using Distributed Task Allocation
行動特性の異なるロボット群がSLAMで地図を作りながら探索すべきフロンティアを分散ゲーム理論で割り当てる手法を提案し、異種チームの有効性をシミュレーションで示した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Nirabhra Mandal, Aamodh Suresh, Carlos Nieto-Granda, Sonia Martínez
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
We study a problem of multi-agent exploration with behaviorally heterogeneous robots. Each robot maps its surroundings using SLAM and identifies a set of areas of interest (AoIs) or frontiers that are the most informative to explore next. The robots assess the utility of going to a frontier using Behavioral Entropy (BE) and then determine which frontier to go to via a distributed task assignment scheme. We convert the task assignment problem into a non-cooperative game and use a distributed algorithm (d-PBRAG) to converge to the Nash equilibrium (which we show is the optimal task allocation solution). For unknown utility cases, we provide robust bounds using approximate rewards. We test our algorithm (which has less communication cost and fast convergence) in simulation, where we explore the effect of sensing radii, sensing accuracy, and heterogeneity among robotic teams with respect to the time taken to complete exploration and path traveled. We observe that having a team of agents with heterogeneous behaviors is beneficial.
