Abstract
Suppose that a robot is required to traverse a terrain spred with impenetrable rectangular obstacles. The robot has no information of the terrain in advance, but it can see and move in any direction. In this paper we construct an on-line algorithm for the robot to determine an obstacle-free path to its destination dynamically. Our algorithm guarantees that the ratio of the distance traversed to the length of the shortest path is optimized.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Asano, T. Asano, L. Guibas, J. Hershberger and H. Imai, Visibility of Disjoint Polygons, Algorithmica, 1, 1986, 49–63.
M. Bern, D.H. Greene, A. Raghunathan, and M. Sudan, Online Algorithms for Locating Checkpoints, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, 359–368.
K.F. Chan, Two Results in Algorithm Design, Manuscript.
R. Cole, and A. Raghunathan, Online Algorithms for Finger Searching, Proceedings of 31st Annual Symposium on Foundations of Computer Science, 1990, 480–489.
P. Eades, X. Lin and N.C. Wormald, Performance Guarantees For Motion Planning With Temporal Uncertainty, Manuscript.
A. Fiat, Y. Tabani, Y. Ravid, Competitive k-Server Algorithms, Proceedings of 31st Annual Symposium on Foundations of Computer Science, 1990, 454–463.
A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator, Competitive Snoopy Caching, Algorithmica, 3, 1988, 79–119.
D.T. Lee, T.H. Chen and C.D. Yang, Shortest Rectilinear Paths Among Weighted Obstacles, Proceedings of the 6th Annual ACM Symposium on Computational Geometry, 1990, 301–310.
V.J. Lumelsky and A.A. Stepanov, Path-Planning Strategies For a Point Mobile Automaton Moving Amidst Obstacles of Arbitrary Shape, Algorithmica, 2, 1987, 403–430.
M.S. Manasse, L.A. McGeoch, and D.D. Sleator, Competitive Algorithms for On-line Algorithms, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, 322–333.
J.S.B. Mitchell, Planning Shortest Paths, Ph.D. Dissertation, Dept. of Oper. Res., Stanford University, 1986.
J.S.B. Mitchell and C.H. Papadimitriou, The Weighted Region Problem: Finding shortest Paths Through a Weighted Planar Subdivision, Journal of the Association for Computing Machinery, 38(1), 1991, 18–73.
C.H. Papadimitriou and M. Yannakakis, Shortest Paths Without a Map, Proceedings of ICALP 1989, 610–620.
J.F. Schwartz and M. Sharir, Algorithmic Motion Planning in Robotics, Handbook of Theoretical Computer Science, 1990, MIT Press, 391–430.
D.D. Sleator and R.E. Tarjan, Amortized Efficiency of List Update and Paging Rules, Communications of the ACM, 28(2), 1985, 202–208.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, Kf., Lam, T.W. (1991). An on-line algorithm for navigating in unknown terrain. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_56
Download citation
DOI: https://doi.org/10.1007/3-540-54945-5_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54945-1
Online ISBN: 978-3-540-46600-0
eBook Packages: Springer Book Archive