Chance-Constrained Sequential Convex Programming for Robust Trajectory Optimization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Chance-Constrained Sequential Convex Programming for Robust Trajectory Optimization

Résumé

Planning safe trajectories for nonlinear dynamical systems subject to model uncertainty and disturbances is challenging. In this work, we present a novel approach to tackle chance-constrained trajectory planning problems with nonconvex constraints, whereby obstacle avoidance chance constraints are reformulated using the signed distance function. We propose a novel sequential convex programming algorithm and prove that under a discrete time problem formulation, it is guaranteed to converge to a solution satisfying first-order optimality conditions. We demonstrate the approach on an uncertain 6 degrees of freedom spacecraft system and show that the solutions satisfy a given set of chance constraints.
Fichier principal
Vignette du fichier
Lew.Bonalli.Pavone.ECC20.pdf (1.29 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03467576 , version 1 (06-12-2021)

Identifiants

Citer

Thomas Lew, Riccardo Bonalli, Marco Pavone. Chance-Constrained Sequential Convex Programming for Robust Trajectory Optimization. 2020 European Control Conference (ECC), May 2020, Saint Petersburg, Russia. pp.1871-1878, ⟨10.23919/ECC51009.2020.9143595⟩. ⟨hal-03467576⟩

Collections

TDS-MACS
36 Consultations
192 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More