Online parallel heuristics and robot searching under the competitive framework

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

Volumn 2368, Issue , 2002, Pages 260-269

  López Ortiz, Alejandro ^a   Schuierer, Sven ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Institut für Informatik   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

COMPETITIVE RATIO; COW-PATH PROBLEMS; HEURISTIC SEARCH; PARALLEL SEARCH; POINT TARGETS; ROBOT MOTION PLANNING;

ROBOT PROGRAMMING;

EID: 23044532716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_27     Document Type: Conference Paper

References (21)

1. R. Baeza-Yates, J. Culberson, and G. Rawlins. Searching in the plane. Information and Computation, 106:234–252, 1993.
2. R. Baeza-Yates and R. Schott. Parallel searching in the plane. Comput. Geom. Theory Appl., 5:143–154, 1995.
3. Margrit Betke, Ronald L. Rivest, and Mona Singh. Piecemeal learning of an unknown environment. In Sixth ACM Conference on Computational Learning Theory (COLT 93), pages 277–286, July 1993.
4. A. Datta, Ch. Hipke, and S. Schuierer. Competitive searching in polygons—beyond generalized streets. In Proc. Sixth Annual International Symposium on Algorithms and Computation, pages 32–41. LNCS 1004, 1995.
5. A. Datta and Ch. Icking. Competitive searching in a generalized street. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 175–182, 1994.
6. S. Gal. Search Games. Academic Press, 1980.
7. M. Hammar, B. Nilsson, and S. Schuierer. Parallel searching on m rays. In Symp. on Theoretical Aspects of Compute Science, pages 132–142. LNCS 1563, 1999.
8. Ch. Hipke. Online-Algorithmen zur kompetitiven Suche in einfachen Polygonen. Master’s thesis, Universit¨at Freiburg, 1994.
9. M.-Y. Kao, Y. Ma, M. Sipser, and Y. Yin. Optimal constructions of hybrid algorithms. Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pp. 372–381, 1994.
10. M.-Y. Kao, J. H. Reif, and S. R. Tate. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 441–447, 1993.
11. R. Klein. Walking an unknown street with bounded detour. Comput. Geom. Theory Appl., 1:325–351, 1992.
12. J. M. Kleinberg. On-line search in a simple polygon. In Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, pages 8–15, 1994.
13. A. López-Ortiz. On-line Searching on Bounded and Unbounded Domains. PhD thesis, Department of Computer Science, University of Waterloo, 1996.
14. A. López-Ortiz and S. Schuierer. Generalized streets revisited. In M. Serna J. Diaz, editor, Proc. 4th European Symp. on Algorithms, pp. 546–558. LNCS 1136, 1996.
15. A. López-Ortiz and S. Schuierer. The ultimate strategy to search on m rays? Theoretical Computer Science, 261(1):267–295, 2001.
16. A. López-Ortiz and G. Sweet. Parallel searching on a lattice. In Proc. 13th Canadian Conference on Computational Geometry, pages 125–128, 2001.
17. A. Mei and Y. Igarashi. Efficient strategies for robot navigation in unknown environment. In Proc. of 21st Intl. Colloquium on Automata, Languages and Programming, pages 51–56, 1994.
18. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. In Proc. 16th Internat. Colloq. Automata Lang. Program., volume 372 of Lecture Notes in Computer Science, pages 610–620. Springer-Verlag, 1989.
19. S. Schuierer. Lower bounds in on-line geometric searching. Computational Geometry: Theory and Applications, 18(1):37–53, 2001.
20. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.
21. Y. Yin. Teaching, Learning, and Exploration. PhD thesis, Department of Mathematics and Laboratory for Computer Science, MIT, 1994.