By Topic

Path-planning using the behavior cost and the path length with a multi-resolution scheme

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

4 Author(s)
Lin, H.Y. ; Dept. of Electr. Eng., Nat. Chung Hsing Univ., Taichung, Taiwan ; Taur, J.S. ; Chen, W.Z. ; Tao, C.W.

Path planning is an important research topic in the autonomous robot applications. In this paper, a path is obtained by optimizing a cost function which is composed of the costs of the path length and the desired behavior. It is assumed that the desired behavior of the robot is the wall following with obstacle avoidance. First, a map of an operational environment is constructed. The cost of the desired behavior can then be assigned for the map. After that, a path can be obtained based on the behavior cost and the path length to the target. In order to operate on a fine grid map with an acceptable computation time, a multi-resolution scheme is used to acquire the optimal path. Initially, a path is obtained on a coarse resolution. Then the final path on the original fine resolution can be found within a band containing the initial path. Simulation results show that the proposed approach can find the optimal path efficiently.

Published in:

Systems Man and Cybernetics (SMC), 2010 IEEE International Conference on

Date of Conference:

10-13 Oct. 2010