Home/Efficient Optimal Search of Euclidean-Cost Grids and Lattices

Efficient Optimal Search of Euclidean-Cost Grids and Lattices

James Kuffner
Conference Paper, Proceedings of Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS'04), September, 2004

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


We describe a simple technique to speed up optimal path planning on Euclidean-cost grids and lattices. Many robot navigation planning algorithms build approximate grid representations of the environment and use Djikstra? algorithm or A* to search the resulting embedded graph for an optimal path between given start and goal locations. However, the classical implementations of these search algorithms were designed to find optimal paths on arbitrary graphs with edges having arbitrary positive weight values. This paper explains how to exploit the structure of optimal paths on Euclidean-cost grids and lattices in order to reduce the number of neighboring nodes considered during a node expansion step. The result is a reduction in both the total nodes examined as well as the overall cost of the search. The algorithm presented increases the efficiency of robot navigation planning on 2D and 3D grids, and generalizes to any other search problem that involves searching Euclideancost grids and lattices in higher dimensions.

author = {James Kuffner},
title = {Efficient Optimal Search of Euclidean-Cost Grids and Lattices},
booktitle = {Proceedings of Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS'04)},
year = {2004},
month = {September},
publisher = {IEEE},
keywords = {path planning, graph search, grids and lattices},
} 2017-09-13T10:43:50-04:00