Abstract
We study several versions of the shortest-path problem when the map is not known in advanced, but is specified dynamically. We are seeking dynamic decision rules that optimize the worst-case ratio of the distance covered to the length of the (statically) optimal path. We describe optimal decision rules for two cases: Layered graphs of bounded width, and two-dimensional scenes with unit square obstacles. The optimal rules turn out to be intuitive, common-sense heuristics. For slightly more general graphs and scenes, we show that no bounded ratio is possible. We also show that the computational problem of devising a strategy that achieves a given worst-case ratio to the optimum path in a graph is a universal two-person game, and thus PSPACE-complete, whereas optimizing the expected ratio is #P-hard.
Research supported by the National Science Foundation.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Canny and J. Reif, Proceedinds 1987 FOCS.
S. E. Dreyfus “An Appraisal of Some Shortest Path Algorithms” Operations Research 17, pp. 395–411, 1969.
M. R. Garey, D. S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979.
E. L. Lawler Combinatorial Optimization: Networks and Matroids, Holt, 1977.
J. S. B. Mitchell “Shortest Paths in the Plane among Obstacles”, Technical Report, Stanford OR, 1986.
J. S. B. Mitchell “Planning Shortest Paths”, Ph.D. Dissertation, Stanford OR, 1987.
J. S. B. Mitchell, private communication, October 1988.
J. S. B. Mitchell, D. Mount, C. H. Papadimitriou “The Discrete Geodesic Problem”, SIAM J. Computing, 1987.
J. S. B. Mitchell, C. H. Papadimitriou “THe Weighted Regions Problem”, to appear in J.ACM, 1988.
C.H. Papadimitriou “An Algorithm for Shortest-Path Motion in Three Dimensions”, Information Processing Letters 20, pp. 259–263, 1985.
C.H. Papadimitriou “Shortest Path Motion”, Proc. 1987 FST-TCS Conference, New Delhi, Springer.
C.H.Papadimitriou and K.Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Inc., 1982.
J. Pearl Heuristics, Addison, 1984.
D. Sleator, R. E. Tarjan, C.ACM 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papadimitriou, C.H., Yannakakis, M. (1989). Shortest paths without a map. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035787
Download citation
DOI: https://doi.org/10.1007/BFb0035787
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive