An Optimal Competitive Strategy for Walking in Streets

A simple polygon P with two distinguished vertices, s and t, is called a street if the two boundary chains from s to t are mutually weakly visible. We present an on-line strategy that walks from s to t, in any unknown street, on a path at most $\sqrt{2}$ times longer than the shortest path. This matches the best lower bound previously known and settles an open problem in the area of competitive path planning. (The result was simultaneously and independently obtained by the first three authors and by the last two authors. Both papers, [C. Icking, R. Klein, and E. Langetepe, Proceedings of the 16th Symposium on Theoretical Aspects in Computer Science, Lecture Notes in Comput. Sci. 1563, Springer-Verlag, Berlin, 1999, pp. 110--120] and [S. Schuierer and I. Semrau, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, pp. 121--131], were presented at STACS'99. The present paper contains a joint full version.)

[1]  Sven Schuierer,et al.  Searching Rectilinear Streets Completely , 1999, WADS.

[2]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[3]  Piotr Berman,et al.  On-line Searching and Navigation , 1996, Online Algorithms.

[4]  D. T. Lee,et al.  Two-Guard Walkability of Simple Polygons , 1998, Int. J. Comput. Geom. Appl..

[5]  Rolf Klein.  Walking an Unknown Street with Bounded Detour , 1991, Comput. Geom..

[6]  Jeffery R. Westbrook,et al.  Robot navigation with range queries , 1996, STOC '96.

[7]  Pallab Dasgupta,et al.  A New Competitive Algorithm for Agent Searching in Unknown Streets , 1996, FSTTCS.

[8]  Evangelos Kranakis,et al.  Almost optimal on-line search in unknown streets , 1997, CCCG.

[9]  Sven Schuierer,et al.  An Optimal Strategy for Searching in Unknown Streets , 1999, STACS.

[10]  Rolf Klein,et al.  The Polygon Exploration Problem , 2001, SIAM J. Comput..

[11]  Jon M. Kleinberg,et al.  On-line search in a simple polygon , 1994, SODA '94.

[12]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[13]  Leen Stougie,et al.  The Online TSP Against Fair Adversaries , 2001, INFORMS J. Comput..

[14]  Rolf Klein,et al.  How to Look Around a Corner , 1993, CCCG.

[15]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[16]  J. Sack,et al.  Handbook of computational geometry , 2000 .

[17]  Baruch Schieber,et al.  Navigating in Unfamiliar Geometric Terrain , 1997, SIAM J. Comput..

[18]  Al L ''opez-Ortiz.  The Exact Cost of Exploring Streets with CAB , 1998 .

[19]  Sven Schuierer.  Lower Bounds in On-Line Geometric Searching , 1997, FCT.

[20]  Alejandro López-Ortiz,et al.  Generalized Streets Revisited , 1996, ESA.

[21]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[22]  Rolf Klein,et al.  Searching for the kernel of a polygon—a competitive strategy , 1995, SCG '95.

[23]  Alejandro López-Ortiz,et al.  Position-Independent Street Searching , 1999, WADS.

[24]  Svante Carlsson,et al.  Computing Vision Points in Polygons , 1999, Algorithmica.

[25]  Bruce W. Char,et al.  Maple V Language Reference Manual , 1993, Springer US.

[26]  Amitava Datta,et al.  Competitive searching in a generalized street , 1999, Comput. Geom..

[27]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[28]  Giri Narasimhan,et al.  LR-visibility in Polygons , 1997, Comput. Geom..

[29]  Rolf Klein,et al.  An Optimal Competitive Strategy for Walking in Streets , 1999, STACS.

[30]  Alejandro López-Ortiz,et al.  Walking Streets Faster , 1996, SWAT.

[31]  Alejandro López-Ortiz,et al.  On-line target searching in bounded and unbounded domains , 1996 .

[32]  Amitava Datta,et al.  Competitive Searching in Polygons - Beyond Generalised Streets , 1995, ISAAC.

[33]  Subir Kumar Ghosh,et al.  Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets , 1997, Comput. Geom..

[34]  Alejandro López-Ortiz,et al.  Going Home Through an Unknown Street , 1995, WADS.

[35]  Alejandro López-Ortiz,et al.  Online Parallel Heuristics and Robot Searching under the Competitive Framework , 2002, SWAT.