2017 IEEE International Conference on Robotics and Automation (ICRA) 2017
DOI: 10.1109/icra.2017.7989693
|View full text |Cite
|
Sign up to set email alerts
|

Robust online motion planning via contraction theory and convex optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
323
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
6
4

Relationship

2
8

Authors

Journals

citations
Cited by 178 publications
(328 citation statements)
references
References 27 publications
0
323
0
Order By: Relevance
“…However, similar to the Lipschitz based approach, unless the considered tube parametrization X contains a robust positive invariant (RPI) set, the tube is growing unbounded along the prediction horizon and thus only short horizons and/or small uncertainty can be considered. In [22], [32] additive disturbances are considered and a fixed RPI set X is computed offline as an incremental Lyapunov function or using control contraction metrics.…”
Section: Setup and General Theorymentioning
confidence: 99%
“…However, similar to the Lipschitz based approach, unless the considered tube parametrization X contains a robust positive invariant (RPI) set, the tube is growing unbounded along the prediction horizon and thus only short horizons and/or small uncertainty can be considered. In [22], [32] additive disturbances are considered and a fixed RPI set X is computed offline as an incremental Lyapunov function or using control contraction metrics.…”
Section: Setup and General Theorymentioning
confidence: 99%
“…Second, as a consequence of this iterative procedure, the dual metric and contraction rate pair {W (x), λ} do not possess any sort of "control-theoretic" optimality. For instance, in [32], for a known stabilizable dynamics model, both these quantities are optimized for robust control performance. In this work, these quantities are used solely as regularizers to promote stabilizability of the learned model.…”
Section: : End Whilementioning
confidence: 99%
“…and c ∈ [c, c]. In order to compute the FaSTrack tracking error bound E, we must solve a Hamilton Jacobi (HJ) reachability problem for the relative dynamics defined by (1) and (2). In this case, the relative dynamics are given by:…”
Section: A Setupmentioning
confidence: 99%