Path planning for mobile manipulators for multiple task execution

June 1991

Path planning for mobile manipulators for multiple task execution

Authors:

W. F. Carriker, Pradeep Khosla, and Bruce Krogh

Abstract:

The planning problem for a mobile manipulator system that must perform a sequence of tasks defined by position, orientation, force, and moment vectors at the end-effector is considered. 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 manipulator system with three degrees of freedom mounted on a base with two degrees of freedom. The results are compared with results obtained by conventional nonlinear programming techniques customized for the particular example system.
@article{Carriker-1991-13269,
author = {W. F. Carriker And Pradeep Khosla And Bruce Krogh},
title = {Path planning for mobile manipulators for multiple task execution},
journal = {Proceedings of IEEE Transactions on Robotics and Automation},
year = {1991},
month = {June},
volume = {7},
number = {3},
pages = {403 - 408},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.