By Topic

Heuristics for local 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)
Elnagar, A. ; Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada ; Basu, A.

A heuristic technique for solving the problem of path planning based on local information for a mobile robot with acceleration constraints moving amidst a set of stationary obstacles is described. The concept of safety is used to design a planning strategy. A path based on local information that maximizes the product of safety and attraction towards the goal is chosen. The safety function depends on the acceleration bounds. The attraction towards the goal depends on the distance from the goal. Two additional heuristics are proposed to improve the efficiency of the search process, and to enhance the ability of the robot to avoid obstacles

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:23 ,  Issue: 2 )