A Dynamic Programming Framework for Optimal Planning of Redundant Robots Along Prescribed Paths With Kineto-Dynamic Constraints

Abstract--Offline optimal planning of trajectories for redundant we go through the whole process of planning and executing robots along prescribed task space paths is usually a time-optimal trajectory on a real robot, and discuss some broken down into two consecutive processes: first, the task practical details, such as trajectory smoothness and actuator space path is inverted to obtain a joint space path, then, the saturation, aiding the practitioners in deploying our algorithm latter is parametrized with a time law. If the two processes effectively. Currently, the algorithm's applicability is limited are separated, they cannot optimize the same objective function, to those cases where hours are available for planning, hence ultimately providing sub-optimal results. In this paper, it is not well-suited for those cases where the robot activity a unified approach is presented where dynamic programming has to change frequently. By replacing the underlying dynamic is the underlying optimization technique. Its flexibility allows programming engine with a different methodology, such as accommodating arbitrary constraints and objective functions, randomized algorithms, the planning time could be controlled thus providing a generic framework for optimal planning of real to be upper-bounded, thus returning the most efficient solution systems. To demonstrate its applicability to a real world scenario, that can be achieved in the time available for reconfiguring the the framework is instantiated for time-optimality on Franka production. Other applications of interest include optimal ground Emika's Panda robot.