TRON: A Fast Solver for Trajectory Optimization with Non-Smooth Cost Functions
This addresses a bottleneck in control and planning for complex robots, offering an incremental improvement for applications with non-smooth costs.
The paper tackles the slow convergence of trajectory optimization methods for non-smooth cost functions by introducing TRON, an iterative solver that adaptively smooths the cost, resulting in faster convergence and lower final costs in simulated tasks like mobile robot motion planning.
Trajectory optimization is an important tool for control and planning of complex, underactuated robots, and has shown impressive results in real world robotic tasks. However, in applications where the cost function to be optimized is non-smooth, modern trajectory optimization methods have extremely slow convergence. In this work, we present TRON, an iterative solver that can be used for efficient trajectory optimization in applications with non-smooth cost functions that are composed of smooth components. TRON achieves this by exploiting the structure of the objective to adaptively smooth the cost function, resulting in a sequence of objectives that can be efficiently optimized. TRON is provably guaranteed to converge to the global optimum of the non-smooth convex cost function when the dynamics are linear, and to a stationary point when the dynamics are nonlinear. Empirically, we show that TRON has faster convergence and lower final costs when compared to other trajectory optimization methods on a range of simulated tasks including collision-free motion planning for a mobile robot, sparse optimal control for surgical needle, and a satellite rendezvous problem.