Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 2019 | Accepted Version
Book Section - Chapter Open

Trajectory Optimization for Chance-Constrained Nonlinear Stochastic Systems

Abstract

This paper presents a new method of computing a sub-optimal solution of a continuous-time continuous-space chance-constrained stochastic nonlinear optimal control problem (SNOC) problem. The proposed method involves two steps. The first step is to derive a deterministic nonlinear optimal control problem (DNOC) with convex constraints that are surrogate to the SNOC by using generalized polynomial chaos (gPC) expansion and tools taken from chance-constrained programming. The second step is to solve the DNOC problem using sequential convex programming (SCP) for trajectory generation. We prove that in the unconstrained case, the optimal value of the DNOC converges to that of SNOC asymptotically and that any feasible solution of the constrained DNOC is a feasible solution of the chance-constrained SNOC because the gPC approximation of the random variables converges to the true distribution. The effectiveness of the gPC-SCP method is demonstrated by computing safe trajectories for a second-order planar robot model with multiplicative stochastic uncertainty entering at the input while avoiding collisions with a specified probability.

Additional Information

© 2019 IEEE. This work was in part funded by the Jet Propulsion Laboratory, California Institute of Technology and the Raytheon Company.

Attached Files

Accepted Version - CDC19_1693_FI.pdf

Files

CDC19_1693_FI.pdf
Files (318.3 kB)
Name Size Download all
md5:95eb940ea4bb745328ebe525c70dd1ea
318.3 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 18, 2023