Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Robot motion planning by a hierarchical search on a modified discretized configuration space

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)
Autere, A. ; Dept. of Comput. Sci., Helsinki Univ. of Technol., Espoo, Finland ; Lehtinen, J.

In this paper, a hierarchical A*-based method for motion planning of robot manipulators is presented. The algorithm's advantage is its simplicity. The algorithm is also shown to be resolution complete. The algorithm searches the robot's configuration space with many different “step sizes” at the same time. The step size denotes the distance between the nodes A* expands during the search. When a path candidate goes far from the obstacles, a big step size is used. When it goes near the obstacle surfaces, a smaller step size is used. Two simulated robot workcells are provided for experimental study. The motion planning of 5 and 6-degrees-of-freedom industrial robots appears to be reasonably fast

Published in:

Intelligent Robots and Systems, 1997. IROS '97., Proceedings of the 1997 IEEE/RSJ International Conference on  (Volume:2 )

Date of Conference:

7-11 Sep 1997