Fast Second-order Cone Programming for Safe Mission Planning
Kai Zhong, Prateek Jain, Ashish Kapoor

TL;DR
This paper introduces a fast, memory-efficient algorithm for second-order cone programming (SOCP) that enables real-time safe mission planning for robots, significantly outperforming standard solvers like SDPT3.
Contribution
The paper presents a novel SOCP algorithm based on Wolfe's method, optimized for embedded systems, with demonstrated 1000x speedup over existing solvers in robotic applications.
Findings
Achieves 1000x speedup over SDPT3 in quadrotor problems
Enables real-time safe mission planning on embedded devices
Provides a two-level Gaussian Process sensing method for complex obstacles
Abstract
This paper considers the problem of safe mission planning of dynamic systems operating under uncertain environments. Much of the prior work on achieving robust and safe control requires solving second-order cone programs (SOCP). Unfortunately, existing general purpose SOCP methods are often infeasible for real-time robotic tasks due to high memory and computational requirements imposed by existing general optimization methods. The key contribution of this paper is a fast and memory-efficient algorithm for SOCP that would enable robust and safe mission planning on-board robots in real-time. Our algorithm does not have any external dependency, can efficiently utilize warm start provided in safe planning settings, and in fact leads to significant speed up over standard optimization packages (like SDPT3) for even standard SOCP problems. For example, for a standard quadrotor problem, our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
