By Topic

The use of simulated annealing to solve the mobile manipulator path planning problem

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
$33 $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

3 Author(s)
W. F. Carriker ; Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA ; P. K. Khosla ; B. H. Krogh

The planning problem is considered for a mobile manipulator system which must perform a sequence of tasks defined by position, orientation, force, and moment vectors at the end effector. Each task can be performed in multiple configurations due to the redundancy introduced by mobility. The planning problem is formulated as an optimization problem in which the decision variables for mobility (base position) are separated from the manipulator joint angles in the cost function. The resulting numerical problem is nonlinear with nonconvex, unconnected feasible regions in the decision space. Simulated annealing is proposed as a general solution method for obtaining near-optimal results. The problem formulation and numerical solution by simulated annealing are illustrated for a positioning system with five degrees of freedom. These results are compared with results obtained by conventional nonlinear programming techniques customized for the particular example system

Published in:

Robotics and Automation, 1990. Proceedings., 1990 IEEE International Conference on

Date of Conference:

13-18 May 1990