Competitive searching in polygons—Beyond generalised streets

  • Amitava Datta
  • Christoph A. Hipke
  • Sven Schuierer
Session 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1004)


We consider a robot inside an unknown polygon P which has to find a path from a starting point s to a target point t. It is equipped with on-board cameras through which it can get the visibility map of its immediate surroundings. We define two new classes of polygons and provide strategies for searching these classes of polygons.

The first class of polygons is called horizontal-vertical streets or HV-streets and for a polygon in this class, every point on the boundary is visible from either a vertical or a horizontal line segment connecting the two polygonal chains from s to t. We provide a strategy under which the robot walks at most 14.5 times the distance of the shortest path from s to t to reach the point t. We also prove that this is an optimal strategy for searching such polygons. The second class of polygons is called θ-generalized-streets or θ-G-streets and every point on such a polygon is visible from at least one line segment at an angle θ connecting the two polygonal chains between s and t. Here, θ is an arbitrary but fixed angle with respect to the x axis. We provide a strategy for searching an isothetic polygon of this class and the robot travels at most 19.97 times the shortest distance between s and t under our strategy.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Blum and P. Chalasani. “An on-line algorithm for improving performance in navigation” Proc. of 34th Annual IEEE Conference on Foundations of Computer Science, (1993), pp. 2–11.Google Scholar
  2. 2.
    R. Baeza-Yates, J. Culberson and G. Rawlins. “Searching in the plane”, Information and Computation, Vol. 106, (1993), pp. 234–252.Google Scholar
  3. 3.
    A. Blum, P. Raghavan and B. Schieber. “Navigating in unfamiliar geometric terrain”, Proc. of 23rd Annual ACM Symp. on Theory of Computing, (1991), pp. 494–504.Google Scholar
  4. 4.
    A. Datta and Ch. Icking. “Competitive searching in a generalized street”, Proc. of 10th Annual ACM Sypm. on Computational Geometry, (1994), pp. 175–182.Google Scholar
  5. 5.
    R. Klein. “Walking an unknown street with bounded detour”, Computational Geometry: Theory and Applications 1, (1992), pp. 325–351.Google Scholar
  6. 6.
    J. Kleinberg. “On-line search in a simple polygon”, Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, (1994), pp. 8–15.Google Scholar
  7. 7.
    V. J. Lumelsky and A. A. Stepanov. “Path-planning strategies of a point mobile automaton moving amidst unknown obstacles of arbitrary shape”, Algorithmica 2, (1987), pp. 403–430.Google Scholar
  8. 8.
    A. Mei and Y. Igarashi. “Efficient strategies for robot navigation in unknown environment” Proc. of 21st International Colloquium on Automata, Languages and Programming, (1994), to appear.Google Scholar
  9. 9.
    C. H. Papadimitriou and M. Yannakakis. “Shortest paths without a map”, Theoretical Computer Science 84, (1991), pp. 127–150.Google Scholar
  10. 10.
    D. D. Sleator and R. E. Tarjan. “Amortized efficiency of list update and paging rules”, Communications of the ACM 28, (1985), pp. 202–208.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Amitava Datta
    • 1
  • Christoph A. Hipke
    • 2
  • Sven Schuierer
    • 2
  1. 1.Department of Mathematics, Statistics and Computing ScienceUniversity of New EnglandArmidaleAustralia
  2. 2.Institut für InformatikUniversität FreiburgFreiburg i. Br.FRG

Personalised recommendations