勾配計算に基づくシンプルな群れ探索アルゴリズム
Simple Swarm Foraging Algorithm Based on Gradient Computation
限られた通信範囲と記憶容量を持つ群れロボットが、他ロボットからの引力・斥力信号に応じてランダムウォークの旋回確率を調整し、未知環境で効率的に目標を探索・回収するアルゴリズムを提案した。
著者: Simon O. Obute, Mehmet R. Dogar, Jordan H. Boyle
分類: cs.RO, cs.MA
原文アブストラクト
Swarm foraging is a common test case application for multi-robot systems. In this paper we present a novel algorithm for controlling swarm robots with limited communication range and storage capacity to efficiently search for and retrieve targets within an unknown environment. In our approach, robots search using random walk and adjust their turn probability based on attraction and repulsion signals they sense from other robots. We compared our algorithm with five different variations reflecting absence or presence of attractive and/or repulsive communication signals. Our results show that best performance is achieved when both signals are used by robots for communication. Furthermore, we show through hardware experiments how the communication model we used in the simulation could be realized on real robots.
