Published January 2019 | Version Accepted Version
Conference Paper Open

Solving Optimal Control with Nonlinear Dynamics Using Sequential Convex Programming

Abstract

Sequential convex programming (SCP) is a useful tool in obtaining real-time solutions to direct optimal control, but it is unable to adequately model nonlinear dynamics due to the linearization and discretization required. As nonlinear program solvers are not yet functioning in real-time, a tool is needed to bridge the gap between satisfying the nonlinear dynamics and completing execution fast enough to be useful. This paper presents a real-time control algorithm, sequential convex programming with nonlinear dynamics correction (SCPn), which ameliorates the performance of SCP under nonlinear dynamics. Simulations are presented to validate the efficacy of the method.

Additional Information

© 2019 AIAA. AIAA Paper 2019-0652. The work of Rebecca Foust was supported by a NASA Space Technology Research Fellowship and in part by the Jet Propulsion Laboratory (JPL). Government sponsorship is acknowledged. The authors also thank Amir Rahmani and Christian Chilan for their technical input.

Attached Files

Accepted Version - Scitech_control_ID_3032436_Foust_GNC_10.pdf

Files

Scitech_control_ID_3032436_Foust_GNC_10.pdf

Files (532.9 kB)

Name Size Download all
md5:fbb2b81dc692dc6c1fcdee1f430ed72d
532.9 kB Preview Download

Additional details

Identifiers

Eprint ID
92176
Resolver ID
CaltechAUTHORS:20190109-132944040

Funding

NASA Space Technology Research Fellowship
JPL

Dates

Created
2019-01-09
Created from EPrint's datestamp field
Updated
2021-11-16
Created from EPrint's last_modified field

Caltech Custom Metadata

Caltech groups
GALCIT
Other Numbering System Name
AIAA Paper
Other Numbering System Identifier
2019-0652