Home /Research /Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization
OTHER

Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization

John Schulman, Jonathan Ho, Alex Pui‐Wai Lee, Ibrahim Awwal, Henry Bradlow, Pieter Abbeel

Year
2013
Citations
429
Access
Open access

Abstract

We present a novel approach for incorporating collision avoidance into trajectory optimization as a method of solving robotic motion planning problems. At the core of our approach are (i) A sequential convex optimization procedure, which penalizes collisions with a hinge loss and increases the penalty coefficients in an outer loop as necessary. (ii) An efficient formulation of the no-collisions constraint that directly considers continuous-time safety and enables the algorithm to reliably solve motion planning problems, including problems involving thin and complex obstacles.

Keywords

CollisionRegular polygonMathematical optimizationComputer scienceConvex optimizationCollision avoidanceMathematicsGeometryComputer security

Related papers

Browse all OTHER papers