A dynamic programming approach to redundancy resolution with multiple criteria
This paper studies the problem of generating optimal joint trajectories for redundant manipulators when multiple criteria need to be considered and proposes a novel approach based on Dynamic Programming and the use of the Pareto optimality condition. The drawbacks of the traditional weighting method in optimization for generating the Pareto optimal set are discussed and an alternate approach using dynamic programming is proposed. The two approaches are implemented on the model of a 7-DOF redundant manipulator with the end-effector moving along a prescribed trajectory, while the joint trajectories are required to minimize two particular criteria. The results illustrate that the dynamic programming approach provides a better approximation of the Pareto optimal set and a more flexible and predictable framework to control the objective vectors.
|2007 IEEE International Conference on Robotics and Automation, ICRA'07|
|Organisation||Department of Mechanical and Aerospace Engineering|
Guigue, A. (A.), Ahmadi, M, Hayes, M.J.D, Langlois, R.G, & Tang, F.C. (F. C.). (2007). A dynamic programming approach to redundancy resolution with multiple criteria. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 1375–1380). doi:10.1109/ROBOT.2007.363176