Optimal strategies for maintaining a chain of relays between an explorer and a base camp-Reference-Cited by-同舟云学术

Optimal strategies for maintaining a chain of relays between an explorer and a base camp

Published:2009-08 Issue:36 Volume:410 Page:3391-3405
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Kutyłowski Jarosław,Meyer auf der Heide Friedhelm

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. Distributed memoryless point convergence algorithm for mobile robots with limited visibility;Ando;IEEE Transactions on Robotics and Automation,1999

2. N. Agmon, D. Peleg, Fault-tolerant gathering algorithms for autonomous mobile robots, in: Proc. of the 15th ACM-SIAM Symp. on Discrete Algorithms, SODA, 2004, pp. 1063–1071

3. M. Cieliebak, P. Flocchini, G. Prencipe, N. Santoro, Solving the robots gathering problem, in: Proc. of the 30th Int. Colloq. on Automata, Languages and Programming, ICALP, 2003, pp. 1181–1196

4. Distributed circle formation for anonymous oblivious robots;Chatzigiannakis,2004

5. Gathering autonomous mobile robots;Cieliebak,2002

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

1. Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation;Theoretical Computer Science;2023-01

2. A discrete and continuous study of the Max-Chain-Formation problem;Information and Computation;2022-05

3. Gathering a Euclidean Closed Chain of Robots in Linear Time;Algorithms for Sensor Systems;2021

4. The Max-Line-Formation Problem;Lecture Notes in Computer Science;2021

5. A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06