Open Access Open Access  Restricted Access Subscription Access

Any-Angle Path Planning

Alex Nash, Sven Koenig

Abstract


In robotics and video games, one often discretizes continuous terrain into a grid with blocked and unblocked grid cells and then uses path-planning algorithms to find a shortest path on the resulting grid graph. This path, however, is typically not a shortest path in the continuous terrain. In this overview article, we discuss a path-planning methodology for quickly finding paths in continuous terrain that are typically shorter than shortest grid paths. Any-angle path-planning algorithms are variants of the heuristic path-planning algorithm A* that find short paths by propagating information along grid edges (like A*, to be fast) without constraining the resulting paths to grid edges (unlike A*, to find short paths).

Full Text:

PDF


DOI: http://dx.doi.org/10.1609/aimag.v34i4.2512

Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.