2020 European Control Conference (ECC) 2020
DOI: 10.23919/ecc51009.2020.9143595
|View full text |Cite
|
Sign up to set email alerts
|

Chance-Constrained Sequential Convex Programming for Robust Trajectory Optimization

Abstract: 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 satisfy… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
4
1

Relationship

2
8

Authors

Journals

citations
Cited by 41 publications
(50 citation statements)
references
References 81 publications
0
50
0
Order By: Relevance
“…Future work may consider extending this analysis to tackle more general problem formulations, e.g., risk measures as costs, and state (chance) constraints. In this context, some preliminary results using SCP only exist for discrete time problem formulations [24]. However, tackling continuous time formulations will require more sophisticated necessary conditions for optimality.…”
Section: Discussionmentioning
confidence: 99%
“…Future work may consider extending this analysis to tackle more general problem formulations, e.g., risk measures as costs, and state (chance) constraints. In this context, some preliminary results using SCP only exist for discrete time problem formulations [24]. However, tackling continuous time formulations will require more sophisticated necessary conditions for optimality.…”
Section: Discussionmentioning
confidence: 99%
“…In particular, we take an MPC approach known as Sequential Quadratic Programming (SQP), which iteratively solves locally quadratic sub-problems to converge to a globally (more) optimal solution [7]. Particularly in the robotics domain, this approach is well-suited due to its reduced computational costs and flexibility for handling a wide variety of costs and constraints [35,25]. A common criticism of SQP-based MPC (and nonlinear MPC methods in general) is that they can suffer from being susceptible to local minima.…”
Section: Related Workmentioning
confidence: 99%
“…Providing safety guarantees for learning-based control techniques has received significant attention recently [39]- [46]. In particular, optimization-based control synthesis with CLF and CBF constraints has been considered for systems subject to additive stochastic disturbances [47]- [49].…”
Section: Related Workmentioning
confidence: 99%