By Topic

Real-Time Robot Path Planning via a Distance-Propagating Dynamic System with Obstacle Clearance

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)
Willms, A.R. ; Sch. of Eng., Guelph Univ., Guelph, ON ; Yang, Simon X.

An efficient grid-based distance-propagating dynamic system is proposed for real-time robot path planning in dynamic environments, which incorporates safety margins around obstacles using local penalty functions. The path through which the robot travels minimizes the sum of the current known distance to a target and the cumulative local penalty functions along the path. The algorithm is similar to but does not maintain a sorted queue of points to update. The resulting gain in computational speed is offset by the need to update all points in turn. Consequently, in situations where many obstacles and targets are moving at substantial distances from the current robot location, this algorithm is more efficient than . The properties of the algorithm are demonstrated through a number of simulations. A sufficient condition for capture of a target is provided.

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:38 ,  Issue: 3 )