This paper presents a novel approach to solve multiobjective robotic trajectory planning problems. It proposes to find the Pareto optimal set, rather than a single solution usually obtained through scalarization, e.g., weighting the objective functions. Using the trajectory planning problem for a redundant manipulator as part of a captive trajectory simulation system, the general discrete dynamic programming (DDP) approximation method presented in our previous work is shown to be a promising approach to obtain a close representation of the Pareto optimal set. When compared with the set obtained by varying the weights, the results confirm that the DDP approximation method can find approximate Pareto objective vectors, where the weighting method fails, and can generally provide a closer representation of the actual Pareto optimal set.

Additional Metadata
Keywords Dynamic programming, multiobjective trajectory planning, Pareto optimality, redundant robotic manipulator
Persistent URL
Journal IEEE Transactions on Robotics
Guigue, A. (Alexis), Ahmadi, M, Langlois, R.G, & Hayes, M.J.D. (2010). Pareto optimality and multiobjective trajectory planning for a 7-DOF redundant manipulator. IEEE Transactions on Robotics, 26(6), 1094–1099. doi:10.1109/TRO.2010.2068650