By Topic

An Exact Euclidean Distance Transform for Universal Path Planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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.

Published in:

Electronics, Robotics and Automotive Mechanics Conference (CERMA), 2010

Date of Conference:

Sept. 28 2010-Oct. 1 2010