Smart robot teams exploring sparse trees

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

Volumn 4162 LNCS, Issue , 2006, Pages 327-338

  Dynia, M ^a   Kutyllowski J ^a   Auf Der Heide, F Meyer ^a   Schindelhauer, C ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; GRAPH THEORY; MOBILE ROBOTS; PROBLEM SOLVING; TELECOMMUNICATION;

COMPETITIVE RATIO; SMART ROBOT; SPARSE TREES;

ROBOTIC ASSEMBLY;

EID: 33750069411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_29     Document Type: Conference Paper

References (16)

1. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York, NY, USA (1998)
2. Rao, N., Kareti, S., Shi, W., Iyenagar, S.: Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Technical Report ORNL/TM-12410 (1993)
3. Frederickson, G., Hecht, M., Kim, C.: Approximation algorithms for some routing problems. SIAM Journal on Computing 7 (1978) 178 - 193
4. Averbakh, I., Berman, O.: Minmax p-traveling salesmen location problems on a tree. Annals of Operations Research 110 (2002) 55 - 68
5. Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-aware collective tree exploration. In Grass, W., ed.: Proceedings of ARCS'06. LNCS 3894, Springer Verlag (2006) 341 - 351
6. Even, G., Garg, N., Könemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Operations Research Letters 32 (2004) 309 - 315
7. Averbakh, I., Berman, O.: (p - 1)/(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Discrete Applied Mathematics 75 (1997) 201 - 216
8. Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discrete Applied Mathematics 68 (1996) 17 -32
9. Bender, M., Slonim, D.: The power of team exploration: two robots can learn unlabeled directed graphs. In: Proc. FOCS 1994. (1994) 75 - 85
10. Bender, M., Fernández, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: exploring and mapping directed graphs. In: Proc. 30th Symp. Theory of Computing, ACM (1998) 269 - 278
11. Panaite, P., Pelc, A.: Exploring unknown undirected graphs. In: SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (1998) 316 - 322
12. Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot. Information and Computation 152 (1999) 155 - 172
13. Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. In: Algorithms - ESA 2002: 10th Annual European Symposium. Volume 2461., Springer (2002) 374 - 386
14. Fleischer, R., Trippen, G.: Exploring an unknown graph efficiently. In: 13th Annual European Symposium. Volume 3669., Springer (2005) 11-22
15. Fraigniaud, P., Gasieniec, L., Kowalski, D., Pelc, A.: Collective tree exploration. In: Proc. LATIN 2004. Volume 2976. (2004) 141-151
16. Fraigniaud, P., Ilcinkas, D., Rajsbaum, S., Tixeuil, S.: Space lower bounds for graph exploration via reduced automata. In: Structural Information and Communication Complexity: 12 International Colloquium. Volume 3499. (2005) 140 - 154