Gathering of Asynchronous Oblivious Robots with Limited Visibility-Reference-Cited by-同舟云学术

Gathering of Asynchronous Oblivious Robots with Limited Visibility

Published:2001 Issue: Volume: Page:247-258
ISSN:0302-9743
Container-title:STACS 2001
language:
Short-container-title:

Author:

Flocchini Paola,Prencipe Giuseppe,Santoro Nicola,Widmayer Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44693-1_22

Reference12 articles.

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 Autom., 15(5):818–828, 1999.

2. G. Beni and S. Hackwood. Coherent Swarm Motion Under Distributed Control. In Proc. DARS’92, pages 39–52, 1992.

3. E. H. Durfee. Blissful Ignorance: Knowing Just Enough to Coordinate Well. In ICMAS, pages 406–413, 1995.

4. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. In ISAAC’ 99, pages 93–102.

5. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Limited Visibility Gathering by a Set of Autonomous Mobile Robots. Technical Report TR-00-09, Carleton University, 2000.

Cited by 42 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed algorithms for barrier coverage using relocatable sensors;Distributed Computing;2016-04-07

2. Information Spreading by Mobile Particles on a Line;Structural Information and Communication Complexity;2015

3. Deterministic polynomial approach in the plane;Distributed Computing;2014-04-21

4. Deterministic Polynomial Approach in the Plane;Automata, Languages, and Programming;2013

5. Deterministic rendezvous in networks: A comprehensive survey;Networks;2012-01-23