Skip to content

Latest commit

 

History

History
36 lines (25 loc) · 1.95 KB

README.md

File metadata and controls

36 lines (25 loc) · 1.95 KB

Trajectory Optimization With SOCPs

Build Status Build Status Coverage Coverage Status

Project Goal: Fast and Robust Trajectory Optimization for the Rocket Soft-Landing Problem

With extensions to other second-order cone programs.

Overview

A native Julia library to solve trajectory optimization problems that contain second-order cone constraints.

Who and How?

Author: Daniel Neamati (Summer 2020) (Please also see my Portfolio)

Advisor: Prof. Zachary Manchester (REx Lab at Stanford University)

Funding graciously provided by Caltech SURF program and the Homer J. Stewart Fellowship.

Related Content

See also the registered Julia package: TrajectoryOptimization.jl

How do I start?

Check out the documentation at

Do you want to contribute? Here are some next steps

  1. Add remaining test to improve code coverage.
  2. Introduce more descriptive dynamics.
  3. Integrate into the TrajectoryOptimization.jl framework.