Time-Optimal Path Tracking for Robots: A Convex Optimization Approach

Diederik Verscheure, Bram Demeulenaere, Jan Swevers, Joris De Schutter, Moritz Diehl

IEEE Transactions on Automatic Control · 2009 · 539 citations · 30 references

DOIFull text

Open access

Concepts

TL;DR

Time‑optimal path tracking is a subproblem of time‑optimal motion planning for robots. By applying a nonlinear change of variables, the authors reformulate the problem as a convex optimal‑control problem with a single state, extend it with convexity‑preserving techniques, and solve it via a direct transcription that reduces the globally optimal trajectory search to a second‑order cone program using robust numerical algorithms. The method is validated on known examples and a complex case, demonstrating its versatility and practicality.

Abstract

This paper focuses on time-optimal path tracking, a subproblem in time-optimal motion planning of robot systems. Through a nonlinear change of variables, the time-optimal path tracking problem is transformed here into a convex optimal control problem with a single state. Various convexity-preserving extension are introduced, resulting in a versatile approach for optimal path tracking. A direct transcription method is presented that reduces finding the globally optimal trajectory to solving a second-order cone program using robust numerical algorithms that are freely available. Validation against known examples and application to a more complex example illustrate the versatility and practicality of the new method.

References

30