Online searching with turn cost

Theoretical Computer Science

Volumn 361, Issue 2-3, 2006, Pages 342-355

  Demaine, Erik D ^a   Fekete, Sándor P ^b   Gal, Shmuel ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

Competitive ratio; Cow path problem; Infinite linear programs; Linear search problem; Online problems; Randomized strategies; Search games; Star search; Turn cost

Indexed keywords

COMPUTATIONAL COMPLEXITY; GAME THEORY; OPTIMIZATION; PROBLEM SOLVING;

COMPETITIVE RATIO; COW-PATH PROBLEM; INFINITE LINEAR PROGRAMS; LINEAR-SEARCH PROBLEM; ONLINE PROBLEMS; RANDOMIZED STRATEGIES; SEARCH GAMES; STAR SEARCH; TURN COST;

ONLINE SEARCHING;

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

References (30)

1. Alpern S., and Beck A. Pure strategy asymmetric rendezvous on the line with an unknown initial distance. Oper. Res. 48 (2000) 498-501
2. S. Alpern, S. Gal, The Theory of Search Games and Rendezvous, Kluwer Academic Publishers, Dordrecht.
3. E. Arkin, M. Bender, E. Demaine, S.P. Fekete, J.S.B. Mitchell, S. Sethia, Optimal covering tours with turn costs, Proc. SODA 01, ACM-SIAM Symp. on Discrete Algorithms, 2001, pp. 138-147.
4. R.A. Baeza-Yates, J.C. Culberson, G.J.E. Rawlins, Searching with uncertainty, Proc. SWAT 88, First Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 318, Springer, Berlin, 1988, pp. 176-189.
5. Baeza-Yates R.A., Culberson J.C., and Rawlins G.J.E. Searching in the plane. Inform. and Comput. 106 (1993) 234-252
6. Beck A. On the linear search problem. Naval Res. Logist. 2 (1964) 221-228
7. Beck A., and Newman D.J. Yet more on the linear search problem. Israel J. Math. 8 (1970) 419-429
8. Bellman R. An optimal search problem. SIAM Rev. 5 (1963) 274
9. C.A. Brocker, S. Schuierer, Searching rectilinear streets completely, in: Proc. WADS 99 Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 1663, Springer, Berlin, 1999, pp. 98-109.
10. Chvátal V. Linear Programming (1983), Freeman, New York
11. CPLEX 〈http://www.ilog/com/products/cplex〉.
12. S.P. Fekete, R. Klein, A. Nüchter, Online searching with an autonomous robot, Comput. Geometry Theory Appl. 34(2) (2006) 102-115.
13. S.P. Fekete, R. Klein, A. Nüchter, Searching with an autonomous robot (Video + abstract), in: 20th ACM Symp. on Computational Geometry, 2004, pp. 449-450.
14. A. Fiat, G.J. Woeginger, Online Optimization, the State of the Art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998.
15. Gal S. A general search game. Israel J. Math. 12 (1972) 32-45
16. Gal S. Minimax solutions for linear search problems. SIAM J. Appl. Math. 27 (1974) 17-30
17. Gal S. Search Games (1980), Academic Press, New York
18. Gal S., and Chazan D. On the optimality of the exponential functions for some minimax problems. SIAM J. Appl. Math. 30 (1976) 324-348
19. Grötschel M., Krumke S., and Rambau J. Online Optimization of Large Scale Systems: The State of the Art (2001), Springer, Berlin
20. M. Hammar, B.J. Nilsson, S. Schuierer, Parallel searching on m rays, Proc. STACS 99, Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999, pp. 132-142.
21. Hipke C., Icking C., Klein R., and Langetepe E. How to find a point on a line within a fixed distance. Discrete Appl. Math. 93 (1999) 67-73
22. Hoffmann F., Icking C., Klein R., and Kriegel K. The polygon exploration problem. SIAM J. Comput. 31 (1999) 577-600
23. Jaillet P., and Stafford M. Online searching. Oper. Res. 49 (2001) 501-515
24. Kao M.Y., Reif J.H., and Tate S.R. Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inform. and Comput. 131 (1996) 63-79
25. Kella O. Star search-a different show. Israel J. Math. 81 (1993) 145-159
26. Knuth D.E. Searching and Sorting (1973), Addison Wesley, Reading, MA
27. A. Lopez-Ortiz, Searching in bounded and unbounded domains, Ph.D. Thesis, Department of Computer Science, University of Waterloo, 1996, also available as technical report CS-96-25.
28. A. Lopez-Ortiz, S. Schuierer, Position-independent near optimal searching and on-line recognition in a star polygon, Proc. WADS 97, Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 1272, Springer, Berlin, 1997, pp. 284-296.
29. Lopez-Ortiz A., and Schuierer S. The ultimate strategy to search on m rays?. Theoret. Comput. Sci. 261 (2001) 267-295
30. Schuierer S. Lower bounds in on-line geometric searching. Comput. Geometry Theory Appl. 18 (2001) 37-53