Paper Info
Title
Local spreading algorithms for autonomous robot systems
Abstract
This paper studies local algorithms for autonomous robot systems, namely, algorithms that use only information of the positions of a bounded number of their nearest neighbors. The paper focuses on the spreading problem. It defines measures for the quality of spreading, presents a local algorithm for the one-dimensional spreading problem, proves its convergence to the equally spaced configuration and discusses its convergence rate in the synchronous and semi-synchronous settings. It then presents a local algorithm achieving the exact equally spaced configuration in finite time in the synchronous setting, and proves it is time optimal for local algorithms. Finally, the paper also proposes a possible algorithm for the two-dimensional case and presents partial simulation results of its effectiveness.
Year
DOI
Venue
2008
10.1016/j.tcs.2008.02.007
Theor. Comput. Sci.
Keywords
DocType
Volume
Robot swarms,bounded number,autonomous robot system,spaced configuration,Spreading,time optimal,possible algorithm,synchronous setting,local algorithm,convergence rate,Mobile autonomous robots,finite time,paper studies local algorithm
Journal
399
Issue
ISSN
Citations 
1-2
Theoretical Computer Science
39
PageRank 
References 
Authors
1.51
20
2
Name
Order
Citations
PageRank
Reuven Cohen178870.03
David Peleg26662824.19