In:
Journal of Advanced Computational Intelligence and Intelligent Informatics, Fuji Technology Press Ltd., Vol. 18, No. 3 ( 2014-05-20), p. 315-319
Abstract:
Decentralized algorithms are often used in the cooperative robotics field, especially by large swarm systems. We present a distributed algorithm for a problem in which a group of autonomous mobile robots must surround a given target. These robots are oblivious, i.e., they have no memory of the past. They use only local sensing and need no dedicated communication among themselves. We introduce, then solve the problem in which the group of autonomous mobile robots must surround a given target – we call it the “discrete multiorbit target surrounding problem” (DMTSP). We evaluate our solution using simulation and prove that our solution invariably ensures that robots enclose the target in finite time.
Type of Medium:
Online Resource
ISSN:
1883-8014
,
1343-0130
DOI:
10.20965/jaciii.2014.p0315
Language:
English
Publisher:
Fuji Technology Press Ltd.
Publication Date:
2014
Permalink