We propose a fast algorithm for on-line path search in grid-like undirected planar graphs with real edge costs (aka terrains). Our algorithm depends on an off-line analysis of the graph, requiring poly-logarithmic time and space. The off-line preprocessing constructs a hierarchical representation which allows detection of features specific to the terrain. While our algorithm is not guaranteed to find an optimal path, we demonstrate empirically that it is very fast, and that the difference from optimal is almost always small. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Mould, D., & Horsch, M. C. (2004). An hierarchical terrain representation for approximately shortest paths. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3157, pp. 104–113). Springer Verlag. https://doi.org/10.1007/978-3-540-28633-2_13
Mendeley helps you to discover research relevant for your work.