By Topic

A Simple yet Efficient Dynamic System for Robot 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)
Willms, A. ; Dept. of Math. & Stat., Guelph Univ., Ont. ; Yang, Simon X.

In this paper, a simple yet efficient dynamic system is proposed for real-time collision-free robot path planning. Like most robot path-planning approaches, the environment is represented by a topologically organized map. Each grid point on the map has only local connections to its neighboring grid points. Thus the computational complexity linearly depends on the number of grid points. Unlike the neural network based path-planning model proposed by Yang and Meng (2001), the proposed algorithm efficiently propagate the distance from the target to the entire robot workspace. Thus the real-time optimal robot path is generated through the dynamic distance landscape without explicitly searching over the global free workspace nor the collision paths, without explicitly optimizing any global cost functions, and without any prior knowledge of the dynamic environment. Therefore the model algorithm is computationally efficient. The effectiveness and efficiency of the proposed dynamic system are demonstrated through simulation and comparison studies

Published in:

Robotics and Biomimetics, 2004. ROBIO 2004. IEEE International Conference on

Date of Conference:

22-26 Aug. 2004