Skip to content

Latest commit

 

History

History
11 lines (6 loc) · 691 Bytes

File metadata and controls

11 lines (6 loc) · 691 Bytes

Code implementation for trajectory optimization via sequential convex programming

License: MIT

This code implements trajectory optimization via vanilla sequential convex programming. An example for swinging-up a cart pole is given, and the algorithm is applied to quadrotor fleet trajectory optimization. Collision avoidance constraint is linearized according to this paper Parts of the code are adapted from AA203 at Stanford.

Installation

This code requires CVXPY and JAX