On-line parallel heuristics, processor scheduling and robot searching under the competitive framework

Theoretical Computer Science

Volumn 310, Issue 1-3, 2004, Pages 527-537

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

^a UNIVERSITY OF WATERLOO   (Canada)

^b Institut fur Informatik   (Germany)

Author keywords

Competitive ratio; Contract algorithms; On line searching; Scheduling Heuristic scheduling

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MOTION PLANNING; PROBLEM SOLVING; PROGRAM PROCESSORS; ROBOTS; THEOREM PROVING;

ROBOT SEARCHING;

COMPUTER SCIENCE;

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

References (23)

1. Althöfer I. A symbiosis of man and machine beats grandmaster Timoshchenko. J. Internat. Comput. Chess Assoc. 20(1):1997;187ff.
2. Baeza-Yates R., Culberson J., Rawlins G. Searching in the plane. Inform. and Computation. 106:1993;234-252.
3. Baeza-Yates R., Schott R. Parallel searching in the plane. Comput. Geom. Theory Appl. 5:1995;143-154.
4. M. Betke, R.L. Rivest, M. Singh, Piecemeal learning of an unknown environment, in: Sixth ACM Conf. on Computational Learning Theory (COLT 93), July 1993, pp. 277-286.
5. A. Datta, Ch. Hipke, S. Schuierer, Competitive searching in polygons - beyond generalized streets, in: Proc. Sixth Annu. Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1004, 1995, pp. 32-41.
6. A. Datta, Ch. Icking, Competitive searching in a generalized street, in: Proc. 10th Annu. ACM Symp. Comput. Geom., 1994, pp. 175-182.
7. Gal S. Search Games. 1980;Academic Press, New York.
8. M. Hammar, B. Nilsson, S. Schuierer, Parallel searching on m rays, in: Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1563, 1999, pp. 132-142.
9. Ch. Hipke, Online-algorithmen zur kompetitiven suche in einfachen polygonen, Master's Thesis, Universität Freiburg, 1994.
10. M.-Y. Kao, Y. Ma, M. Sipser, Y. Yin, Optimal constructions of hybrid algorithms, Proc. Fifth ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 372-381.
11. M.-Y. Kao, J.H. Reif, S.R. Tate, Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem, in: Proc. Fourth ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 441-447.
12. King D. Kasparov versus Deeper Blue. J. Internat. Comput. Chess Assoc. 20(3):1997;187ff.
13. Klein R. Walking an unknown street with bounded detour. Comput. Geom. Theory Appl. 1:1992;325-351.
14. J.M. Kleinberg, On-line search in a simple polygon, in: Proc. Fifth ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 8-15.
15. A. López-Ortiz, On-line searching on bounded and unbounded domains, Ph.D. Thesis, Department of Computer Science, University of Waterloo, 1996.
16. A. López-Ortiz, S. Schuierer, Generalized streets revisited, in: M.S.J. Diaz (Ed.), Proc. Fourth European Symp. on Algorithms, Lecture Notes in Computer Science, Vol. 1136, 1996, pp. 546-558.
17. López-Ortiz A., Schuierer S. The ultimate strategy to search on. m rays? Theoret. Comput. Sci. 261(1):2001;267-295.
18. A. López-Ortiz, G. Sweet, Parallel searching on a lattice, in: Proc. 13th Canadian Conf. on Computational Geometry, 2001, pp. 125-128.
19. A. Mei, Y. Igarashi, Efficient strategies for robot navigation in unknown environment, in: Proc. 21st Internat. Colloq. on Automata, Languages and Programming, 1994, pp. 51-56.
20. C.H. Papadimitriou, M. Yannakakis, Shortest paths without a map, in: Proc. 16th Internat. Colloq. Automata Lang. Program., Lecture Notes in Computer Science, Vol. 372, Springer, 1989, pp. 610-620.
21. Schuierer S. Lower bounds in on-line geometric searching. Comput. Geom. Theory Appl. 18(1):2001;37-53.
22. Sleator D.D., Tarjan R.E. Amortized efficiency of list update and paging rules. Comm. ACM. 28:1985;202-208.
23. Y. Yin, Teaching, learning, and exploration, Ph.D. Thesis, Department of Mathematics and Laboratory for Computer Science, MIT, Cambridge, MA, 1994.