How many oblivious robots can explore a line

Information Processing Letters

Volumn 111, Issue 20, 2011, Pages 1027-1031

  Flocchini, Paola ^a   Ilcinkas, David ^b   Pelc, Andrzej ^c   Santoro, Nicola ^d  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

Asynchronous; Distributed computing; Exploration; Line; Mobile robots; Oblivious

Indexed keywords

ASYNCHRONOUS; IMPOSSIBILITY RESULTS; LINE; OBLIVIOUS; OBLIVIOUS ROBOTS;

DISTRIBUTED COMPUTER SYSTEMS;

MOBILE ROBOTS;

EID: 81155158886     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2011.07.018     Document Type: Article

References (19)

1. N. Agmon, and D. Peleg Fault-tolerant gathering algorithms for autonomous mobile robots SIAM J. Comput. 36 1 2006 56 82 (Pubitemid 46374018)
2. I. Averbakh, and O. Berman A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree Discrete Appl. Math. 68 1996 17 32 (Pubitemid 126372052)
3. I. Averbakh, and O. Berman (p - 1) / (p + 1) -approximate algorithms for p-traveling salesmen problems on a tree with minmax objective Discrete Appl. Math. 75 1997 201 216 (Pubitemid 127402644)
4. M.A. Bender, A. Fernandez, D. Ron, A. Sahai, S. Vadhan, The power of a pebble: exploring and mapping directed graphs, in: Proc. 30th Ann. Symp. on Theory of Computing, STOC 1998, pp. 269-278.
5. M.A. Bender, D. Slonim, The power of team exploration: Two robots can learn unlabeled directed graphs, in: Proc. 35th Ann. Symp. on Foundations of Comp. Science, FOCS 1994, pp. 75-85.
6. J. Chalopin, P. Flocchini, B. Mans, and N. Santoro Network exploration by silent and oblivious robots 36th Int. Work. on Graph Theoretic Concepts in Computer Science, WG 2010 LNCS vol. 6410 2010 Springer 208 219
7. M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro Solving the robots gathering problem Proc. 30th Int. Col. Automata, Languages and Progr., ICALP 2003 LNCS vol. 2719 2003 Springer 1181 1196
8. R. Cohen, and D. Peleg Convergence properties of the gravitational algorithm in asynchronous robot systems SIAM J. Comput. 34 6 2005 1516 1528 (Pubitemid 43003154)
9. R. Cohen, and D. Peleg Robot convergence via center-of-gravity algorithms Proc. 11th Int. Col. on Structural Information and Comm. Complexity, SIROCCO 2004 LNCS vol. 3104 2004 Springer 79 88
10. S. Das, P. Flocchini, S. Kutten, A. Nayak, and N. Santoro Map construction of unknown graphs by multiple agents Theoret. Comput. Sci. 385 2007 34 48 (Pubitemid 47419154)
11. X. Défago, and S. Souissi Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity Theoret. Comput. Sci. 396 1-3 2008 97 112
12. P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro Remembering without memory: tree exploration by asynchronous oblivious robots Theoret. Comput. Sci. 411 2010 1583 1598
13. P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro Computing without communicating: Ring exploration by asynchronous oblivious robots Proc. 11th International Conference on Principles of Distributed Systems, OPODIS 2007 LNCS vol. 4878 2007 Springer 105 118
14. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer Arbitrary pattern formation by asynchronous, anonymous, oblivious robots Theoret. Comput. Sci. 407 2008 412 447
15. P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc Collective tree exploration Proc. Latin American Theoretical Informatics, LATIN2004 LNCS vol. 2976 2004 Springer 141 151
16. G.N. Frederickson, M.S. Hecht, and C.E. Kim Approximation algorithms for some routing problems SIAM J. Comput. 7 1978 178 193
17. R. Klasing, A. Kosowski, and A. Navarra Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring Theoret. Comput. Sci. 411 2010 3235 3246
18. R. Klasing, E. Markou, and A. Pelc Gathering asynchronous oblivious mobile robots in a ring Theoret. Comput. Sci. 390 2008 27 39 (Pubitemid 350309471)
19. I. Suzuki, and M. Yamashita Distributed anonymous mobile robots: formation of geometric patterns SIAM J. Comput. 28 4 1999 1347 1363