Map construction of unknown graphs by multiple agents

Theoretical Computer Science

Volumn 385, Issue 1-3, 2007, Pages 34-48

  Das, Shantanu ^a   Flocchini, Paola ^a   Kutten, Shay ^b   Nayak, Amiya ^a   Santoro, Nicola ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Anonymous mobile agents; Graph exploration; Labelled Map Construction; Leader election; Rendezvous

Indexed keywords

ALGORITHMS; BULLETIN BOARDS; COMPUTER GRAPHICS; PROBLEM SOLVING; SOCIAL ASPECTS;

ANONYMOUS MOBILE AGENTS; GRAPH EXPLORATION; LABELLED MAP CONSTRUCTION; LEADER ELECTION;

MOBILE AGENTS;

EID: 34548667197     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.05.011     Document Type: Article

References (31)

1. Afek Y., and Gafni E. Distributed algorithms for unidirectional networks. SIAM Journal on Computing 23 6 (1994) 1152-1178
2. Albers S., and Henzinger M.R. Exploring unknown environments. SIAM Journal on Computing 29 (2000) 1164-1188
3. Alpern S., and Gal S. The Theory of Search Games and Rendezvous (2003), Kluwer
4. D. Angluin, Local and global properties in networks of processors, in: Proc. of 12th Symposium on Theory of Computing, STOC'80, 1980, pp. 82-93
5. Averbakh I., and Berman O. (p - l) / (p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Discrete Applied Mathematics 75 (1997) 201-216
6. L. Barrière, P. Flocchini, P. Fraigniaud, N. Santoro, Can we elect if we cannot compare? in: Proc. 15th ACM Symp. on Parallel Algorithms and Architectures, SPAA'03, 2003, pp. 200-209
7. Barrière L., Flocchini P., Fraigniaud P., and Santoro N. Rendezvous and election of mobile agents: impact of sense of direction. Theory of Computing Systems 40 2 (2007) 143-162 Preliminary version in Proc. 10th Coll. on Structural Information and Communication complexity, SIROCCO'03, 2003, pp. 17-32
8. M. Bender, A. Fernandez, D. Ron, A. Sahai, S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, in: Proc. 30th ACM Symp. on Theory of Computing, STOC'98, 1998, pp. 269-287
9. M. Bender, D.K. Slonim, The power of team exploration: Two robots can learn unlabeled directed graphs, in: Proc. 35th Symp. on Foundations of Computer Science, FOCS'94, 1994, pp. 75-85
10. P. Boldi, S. Vigna, An effective characterization of computability in anonymous networks, in: Proc. of 15th Int. Conference on Distributed Computing, DISC'01, 2001, pp. 33-47
11. Burns J.E., and Pachl J. Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems 11 2 (1989) 330-344
12. S. Das, P. Flocchini, A. Nayak, N. Santoro, Distributed exploration of an unknown graph, in: Proc. 12th Coll. on Structural Information and Communication Complexity, SIROCCO'05, 2005, pp. 99-114
13. Deng X., and Papadimitriou C.H. Exploring an unknown graph. Journal of Graph Theory 32 3 (1999) 265-297
14. A. Dessmark, P. Fraigniaud, A. Pelc, Deterministic rendezvous in graphs, in: Proc. 11th European Symposium on Algorithms, ESA'03, 2003, pp. 184-195
15. Dessmark A., and Pelc A. Optimal graph exploration without good maps. Theoretical Computer Science 326 1-3 (2004) 343-362
16. Diks K., Fraigniaud P., Kranakis E., and Pelc A. Tree exploration with little memory. Journal of Algorithms 51 (2004) 38-63
17. Dudek G., Jenkin M., Milios E., and Wilkes D. Robotic exploration as graph construction. Transactions on Robotics and Automation 7 6 (1991) 859-865
18. P. Flocchini, E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk, Multiple mobile agent rendezvous in a ring, in: Proc. 6th Latin American Theoretical Informatics Symposium, LATIN'04, 2004, pp. 599-608
19. P. Fraigniaud, L. Gasieniec, D. Kowalski, A. Pelc, Collective tree exploration, in: 6th Latin American Theoretical Informatics Symp., LATIN'04, 2004, pp. 141-151
20. P. Fraigniaud, D. Ilcinkas, Digraph exploration with little memory, in: 21st Symp. on Theoretical Aspects of Computer Science, STACS'04, 2004, pp. 246-257
21. Frederickson G.N., Hecht M.S., and Kim C.E. Approximation algorithms for some routing problems. SIAM Journal on Computing 7 (1978) 178-193
22. Gallager R.G., Humblet P.A., and Spira P.M. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems 5 1 (1983) 66-77
23. L. Gasieniec, A. Pelc, T. Radzik, X. Zhang, Tree exploration with logarithmic memory, in: 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 07, 2007
24. Korach E., Kutten S., and Moran S. A modular technique for the design of efficient distributed leader finding algorithms. ACM Transactions on Programming Languages and Systems 12 1 (1990) 84-101
25. E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk, Mobile agent rendezvous in a ring, in: Int. Conf. on Distributed Computing Systems, ICDCS 03, 2003, pp. 592-599
26. S. Kutten, Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks or: Traversing one way streets with no map, in: Proc. of Ninth Int. Conference on Computer Communication, ICCC, 1988, pp. 446-452
27. Panaite P., and Pelc A. Exploring unknown undirected graphs. Journal of Algorithms 33 (1999) 281-295
28. N. Sakamoto, Comparison of initial conditions for distributed algorithms on anonymous networks, in: Proc. of the 18th Annual ACM Symp. on Principles of Distributed Computing, PODC '99, 1999, pp. 173-179
29. Tarjan R.E. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1 2 (1972) 146-160
30. Yamashita M., and Kameda T. Computing on anonymous networks: Part I- Characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems 7 1 (1996) 69-89
31. X. Yu, M. Yung, Agent rendezvous: A dynamic symmetry-breaking problem, in: Int. Coll. on Automata Languages and Programming, ICALP'96, 1996, pp. 610-621