レヴィフライトと人工ポテンシャル場を組み合わせたマルチロボット探索アルゴリズム
Multi-Robot Searching Algorithm Using Levy Flight and Artificial Potential Field
生物に着想を得たレヴィフライト探索と人工ポテンシャル場法を組み合わせ、複数ロボットで広大な未知環境を効率的に探索する汎用フレームワークを提案し、シミュレーションと実機で他手法と比較評価した。
著者: Donny K. Sutantyo, Serge Kernbach, Valentin A. Nepomnyashchikh, Paul Levi
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
An efficient search algorithm is very crucial in robotic area, especially for exploration missions, where the target availability is unknown and the condition of the environment is highly unpredictable. In a very large environment, it is not sufficient to scan an area or volume by a single robot, multiple robots should be involved to perform the collective exploration. In this paper, we propose to combine bio-inspired search algorithm called Levy flight and artificial potential field method to perform an efficient searching algorithm for multi-robot applications. The main focus of this work is not only to prove the concept or to measure the efficiency of the algorithm by experiments, but also to develop an appropriate generic framework to be implemented both in simulation and on real robotic platforms. Several experiments, which compare different search algorithms, are also performed.
