Local spreading algorithms for autonomous robot systems

被引:59
作者
Cohen, Reuven [2 ]
Peleg, David [1 ]
机构
[1] Weizmann Inst Sci, Dept Appl Math & Comp Sci, IL-76100 Rehovot, Israel
[2] Bar Ilan Univ, Dept Math, IL-52900 Ramat Gan, Israel
基金
以色列科学基金会;
关键词
mobile autonomous robots; robot swarms; spreading;
D O I
10.1016/j.tcs.2008.02.007
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:71 / 82
页数:12
相关论文
共 30 条
[1]  
Akansu A.N., 1992, Multiresolution Signal Decomposition: Transforms, Subbands, and Wavelets
[2]  
ANDO H, 1995, PROCEEDINGS OF THE 1995 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL, P453, DOI 10.1109/ISIC.1995.525098
[3]  
Balch T., 1998, IEEE T ROBOTICS AUTO, V14
[4]  
BENI G, 1992, P DARS 92, P39
[5]   Cooperative mobile robotics: Antecedents and directions [J].
Cao, YU ;
Fukunaga, AS ;
Kahng, AB .
AUTONOMOUS ROBOTS, 1997, 4 (01) :7-27
[6]  
CHATZIGIANNAKIS I, 2004, P 3 WORKSH EFF EXP A, P159
[7]  
CIELIEBAK M, 2003, P 30 INT C AUT LANG, P1181
[8]  
Cohen R, 2006, LECT NOTES COMPUT SC, V4056, P29
[9]  
Defago Xavier., 2002, POMC, P97, DOI DOI 10.1145/584490.584509
[10]  
Dijkstra E.W., 1982, SELECTED WRITINGS CO, P34