確率的ピア意図とマルチホップ計画伝播による分散型マルチロボット探索
Decentralized Multi-Robot Exploration with Probabilistic Peer Intent and Multi-hop Plan Propagation
限られた通信下での分散マルチロボット探索において、ピアの意図を確率的な空間表現に変換してMCTSに組み込み、さらにマルチホップで計画を伝播させる手法を提案し、シミュレーションと実機3台で有効性を示した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Saurbh Singh Jamwal, Nived Chebrolu, Shivaram Kalyanakrishnan
分類: cs.RO, cs.MA
原文アブストラクト
Efficient coordination under limited communication remains a key challenge in decentralized multi-robot exploration. While centralized approaches benefit from global information sharing, they are often impractical in large-scale or communication-constrained environments. Existing Monte Carlo Tree Search (MCTS)-based approaches, such as Decentralized Monte Carlo Exploration (DMCE), enable decentralized planning by taking peer intent into account. This peer intent is obtained by communicating sequences of planned waypoints with robots within direct communication range. In this work, we extend this idea by introducing Probabilistic Peer Intent (PPI), which converts peer trajectories into a continuous spatial representation of predicted intent and incorporates it into local MCTS action evaluation. We additionally study the effects of sharing peer intent beyond direct communication range by propagating plans over multiple hops. Experiments across multiple simulated environments and team sizes show that PPI and Multi-hop propagation can each improve decentralized exploration, with their relative benefits depending on environment structure and team size. We also demonstrate the real-world deployment of our method on three robots operating in different environment types.
