An Hierarchical Terrain Representation for Approximately Shortest Paths

@inproceedings{Mould2004AnHT,
  title={An Hierarchical Terrain Representation for Approximately Shortest Paths},
  author={David Mould and Michael C. Horsch},
  booktitle={PRICAI},
  year={2004}
}
We propose a fast algorithm for on-line path search in gridlike undirected planar graphs with real edge costs (aka terrains). Our algorithm depends on an off-line analysis of the graph, requiring polylogarithmic 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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Heuristics - intelligent search strategies for computer problem solving

Addison-Wesley series in artificial intelligence • 1984
View 4 Excerpts
Highly Influenced

Introduction to A.I. Robotics

Robin R. Murphy
2000
View 1 Excerpt

Real-Time Heuristic Search

Artif. Intell. • 1990
View 1 Excerpt

Efficient algorithms for shortest paths in sparse networks

D. B. Johnson
J. Assoc. Comput. Mach., • 1977
View 1 Excerpt

Similar Papers

Loading similar papers…