The polygon exploration problem

SIAM Journal on Computing

Volumn 31, Issue 2, 2001, Pages 577-600

  Hoffmann, Frank ^a   Icking, Christian ^b   Klein, Rolf ^c   Kriegel, Klaus ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF HAGEN   (Germany)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

Angle hull; Competitive strategy; Computational geometry; Curve length; Motion planning; Navigation; On line algorithm; Optimum watchman tour; Polygon; Robot

Indexed keywords

ALGORITHMS; MATHEMATICAL OPERATORS; MOBILE ROBOTS; MOTION PLANNING; TRAVELING SALESMAN PROBLEM;

POLYGON EXPLORATION PROBLEM;

COMPUTATIONAL GEOMETRY;

EID: 0036252674     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799348670     Document Type: Article

References (29)

1. O. AICHHOLZER, F. AURENHAMMER, C. ICKING, R. KLEIN, E. LANGETEPE, AND G. ROTE, Generalized self-approaching curves, in Proceedings of the 9th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 1533, Springer-Verlag, Berlin, 1998, pp. 317-326.
2. S. ALBERS, K. KURSAWE, AND S. SCHUIERER, Exploring unknown environments with obstacles, in Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, 1999, pp. 842-843.
3. E. M. ARKIN, S. P. FEKETE, AND J. S. B. MITCHELL, Approximation Algorithms for Lawn Mowing and Milling, Tech. Report, Mathematisches Institut, Universität zu Köln, 1997.
4. P. BERMAN, On-line searching and navigation, in On-line Algorithms: The State of the Art, A. Fiat and G. Woeginger, eds., Springer-Verlag, Berlin, 1998, pp. 232-241.
5. A. BLUM, P. RAGHAVAN, AND B. SCHIEBER, Navigating in unfamiliar geometric terrain, SIAM J. Comput., 26 (1997), pp. 110-137.
6. S. CARLSSON AND H. JONSSON, Computing a shortest watchman path in a simple polygon in polynomial time, in Proceedings of the 4th Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 955, Springer-Verlag, Berlin, 1995, pp. 122-134.
7. S. CARLSSON, H. JONSSON, AND B. J. NILSSON, Finding the shortest watchman route in a simple polygon, in Proceedings of the 4th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 762, Springer-Verlag, Berlin, 1993, pp. 58-67.
8. O. CHEONG AND R. VAN OOSTRUM, Reaching a polygon with directional uncertainty, Internat. J. Comput. Geom. Appl., (2001), to appear.
9. W.-P. CHIN AND S. NTAFOS, Shortest watchman routes in simple polygons, Discrete Comput. Geom., 6 (1991), pp. 9-31.
10. M. DE BERG, L. GUIBAS, D. HALPERIN, M. OVERMARS, O. SCHWARZKOPF, M. SHARIR, AND M. TEILLAUD, Reaching a goal with directional uncertainty, Theoret. Comput. Sci., 140 (1995), pp. 301-317.
11. X. DENG, T. KAMEDA, AND C. PAPADIMITRIOU, How to learn an unknown environment, in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, Los Alamitos, CA, 1991, pp. 298-303.
12. X. DENG, T. KAMEDA, AND C. PAPADIMITRIOU, How to learn an unknown environment I: The rectilinear case, J. ACM, 45 (1998), pp. 215-245.
13. A. FIAT AND G. WOEGINGER, EDS., On-line Algorithms: The State of the Art, Lecture Notes in Comput. Sci. 1422, Springer-Verlag, Berlin, 1998.
14. M. HAMMAR AND B. J. NILSSON, Concerning the time bounds of existing shortest watchman route algorithms, in Proceedings of the 11th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. 1279, Springer-Verlag, Berlin, 1997, pp. 210-221.
15. F. HOFFMANN, C. ICKING, R. KLEIN, AND K. KRIEGEL, A competitive strategy for learning a polygon, in Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, 1997, pp. 166-174.
16. F. HOFFMANN, C. ICKING, R. KLEIN, AND K. KRIEGEL, Moving an angle around a region, in Proceedings of the 6th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 1432, Springer-Verlag, Berlin, 1998, pp. 71-82.
17. F. HOFFMANN, C. ICKING, R. KLEIN, AND K. KRIEGEL, The polygon exploration problem: A new strategy and a new analysis technique, in Robotics: The Algorithmic Perspective, Proceedings of the 3rd Workshop on Algorithmic Foundations of Robotics, A.K. Peters, Wellesley, MA, 1998, pp. 211-222.
18. C. ICKING AND R. KLEIN, Searching for the kernel of a polygon: A competitive strategy, in Proceedings of the 11th Annual ACM Symposium on Computational Geometry, ACM, New York, 1995, pp. 258-266.
19. C. ICKING, R. KLEIN, AND E. LANGETEPE, An optimal competitive strategy for walking in streets, in Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1563, Springer-Verlag, Berlin, 1999, pp. 110-120.
20. C. ICKING, R. KLEIN, AND L. MA, How to look around a corner, in Proceedings of the 5th Canadian Conference on Computational Geometry, University of Waterloo, Waterloo, ON, Canada, 1993, pp. 443-448.
21. J. S. B. MITCHELL, Geometric shortest paths and network optimization, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier, North-Holland, Amsterdam, 2000, pp. 633-701.
22. S. NTAFOS, Watchman routes under limited visibility, in Proceedings of the 2nd Canadian Conference on Computational Geometry, University of Ottawa, Ottawa, ON, Canada, 1990, pp. 89-92.
23. N. S. V. RAO, S. KARETI, W. SHI, AND S. S. IYENGAR, Robot Navigation in Unknown Terrains: Introductory Survey of Non-heuristic Algorithms, Tech. Report ORNL/TM-12410, Oak Ridge National Laboratory, Oak Ridge, TN, 1993.
24. G. ROTE, Curves with increasing chords, Math. Proc. Cambridge Philos. Soc., 115 (1994), pp. 1-12.
25. J.-R. SACK AND J. URRUTIA, EDS., Handbook of Computational Geometry, North-Holland, Amsterdam, 2000.
26. R. SEIDEL, private communication, 1997.
27. D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Commun. ACM, 28 (1985), pp. 202-208.
28. X. TAN AND T. HIRATA, Constructing shortest watchman routes by divide-and-conguer, in Proceedings of the 4th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 762, Springer-Verlag, Berlin, 1993, pp. 68-77.
29. X. TAN, T. HIRATA, AND Y. INAGAKI, Corrigendum to "An incremental algorithm for constructing shortest watchman routes," Internat. J. Comput. Geom. Appl., 9 (1999), pp. 319-323.