By Topic

Solving find path problem in mapped environments using modified A* algorithm

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)
Kuo-Chin Fan ; Inst. of Comput. Sci. & Electron. Eng., Nat. Central Univ., Chung-Li, Taiwan ; Po-Chang Lui

Presents a path planning algorithm to solve the find path problem in mapped environments. The moving objects considered in this paper can be any shape, which is approximated by its bounding convex polygon. Since the actual translating and rotating movement of the object in the free space is considered in the finding of a collision-free path, it won't miss those paths which require rotational maneuvering. In addition to the progressing strategy, a modified A* algorithm based on the revised depth-first search in setting up the h' value is also proposed to find the optimal path. From the experimental results, the modified A* algorithm is proved to be a very good method

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:24 ,  Issue: 9 )