未知の広域環境における非同期ネットワーク形成
Asynchronous Network Formation in Unknown Unbounded Environments
通信範囲が限られた複数ロボットが未知の広い環境で情報を全員に素早く伝えるためのオンラインアルゴリズムを提案し、競合比の理論保証と実機実験で有効性を示した。
著者: Selim Engin, Volkan Isler
分類: cs.RO
原文アブストラクト
In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information which has to be propagated to all other robots. What strategy should the robots pursue to disseminate the information to the rest of the robots as quickly as possible? The initial locations of the robots are unknown to each other, therefore the problem must be solved in an online fashion. For this problem, we present an algorithm whose competitive ratio is $O(H \cdot \max\{M,\sqrt{M H}\})$ for arbitrary robot deployments, where $M$ is the largest edge length in the Euclidean minimum spanning tree on the initial robot configuration and $H$ is the height of the tree. We also study the case when the robot initial positions are chosen uniformly at random and improve the ratio to $O(M)$. Finally, we present simulation results to validate the performance in larger scales and demonstrate our algorithm using three robots in a field experiment.
