Universal path planning is a major issue in order to facilitate the task required for autonomous systems. Distance transform (wavefront) algorithm is a good path planner and can be used to determine a path near to optimum. We present a new algorithm for universal path planning in exact cell decomposition, using a raster scan method for generating an exact euclidean distance transform (EEDT). This algorithm also find, for every cell in the map, the point sequence to the goal (path smoothing), without post processing. These point sequences are computing by visibility verification between cells.
An Exact Euclidean Distance Transform for Universal Path Planning
01.09.2010
1809105 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
New sequential exact Euclidean distance transform algorithms based on convex analysis
British Library Online Contents | 2009
|On Computing the Exact Euclidean Distance Transform on Rectangular and Hexagonal Grids
British Library Online Contents | 1999
|Exact medial axis with euclidean distance
British Library Online Contents | 2005
|Efficient Computation of the Euclidean Distance Transform
British Library Online Contents | 2000
|Multidimensional Alignment Using the Euclidean Distance Transform
British Library Online Contents | 1997
|