Gathering multiple robotic a(ge)nts with limited sensing capabilities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3172 LNCS, Issue , 2004, Pages 142-153

  Gordon, Noam ^a   Wagner, Israel A ^a   Bruckstein, Alfred M ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; CONTINUOUS TIME SYSTEMS;

ANALYSIS AND SIMULATION; COMMUNICATION CAPABILITIES; CONTINUOUS SPACES; CONTINUOUS TIME LIMITS; DISCRETE-TIME CASE; LIMITED SENSING CAPABILITIES; MEASURE DISTANCE; SIMPLE ALGORITHM; GLOBAL BEHAVIORS;

SWARM INTELLIGENCE; ARTIFICIAL INTELLIGENCE;

EID: 77049102898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_13     Document Type: Conference Paper

References (16)

1. H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. A distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. on Robotics and Automation, 15(5):818-828, 1999.
2. A. M. Bruckstein, N. Cohen, and A. Efrat. Ants, crickets and frogs in cyclic pursuit. Technical Report CIS-9105, Technion - IIT, 1991.
3. A. M. Bruckstein, C. L. Mallows, and I. A. Wagner. Probabilistic pursuits on the grid. American Mathematical Monthly, 104(4):323-343, April 1997.
4. A. M. Bruckstein and O. Zeitouni. A puzzling feedback quantizer. Technical Report 879, EE Department, Technion IIT, May 1993.
5. The Center of Intelligent Systems, Technion IIT web site: http://www.cs.technion.ac.il/Labs/Isl/index.html.
6. M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro. Solving the robots gathering problem. In Proc. of ICALP 2003, 2003.
7. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Gathering of autonomous mobile robots with limited visibility. In Proc. of STACS 2001, 2001.
8. N. Gordon, I. A. Wagner, and A. M. Bruckstein. Discrete bee dance algorithms for pattern formation on a grid. In Proc. of IEEE Intl. Conf. on Intelligent Agent Technology (IAT03), pages 545-549, October 2003.
9. T. A. Henzinger. The theory of hybrid automata. In Proc. of LICS, pages 278-292, 1996.
10. B. D. Hughes. Random Walks and Random Environments, volume 1. Oxford University Press, 1995.
11. Z. Lin, M. E. Broucke, and B. A. Francis. Local control strategies for groups of mobile autonomous agents. IEEE Trans. on Automatic Control, 49(4):622-629, April 2004.
12. J. A. Marshall, M. E. Broucke, and B. A. Francis. A pursuit strategy for wheeled-vehicle formations. In Proc. of CDC03, pages 2555-2560, 2003.
13. C. R. Melhuish, O. Holland, and S. Hoddell. Convoying: using chorusing to form travelling groups of minimal agents. Robotics and Autonomous Systems, 28:207-216, August 1999.
14. K. Schlude. From robotics to facility location: Contraction functions, weber point, convex core. Technical Report 403, CS, ETHZ, 2003.
15. K. Sugihara and I. Suzuki. Distributed algorithms for formation of geometric patterns with many mobile robots. Journal of Robotic Systems, 13(3):127-139, 1996.
16. I. Suzuki and M. Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing, 28(4):1347-1363, 1999.