Robust online motion planning via contraction theory and convex optimization
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We present a framework for online generation of robust motion plans for robotic systems with nonlinear dynamics subject to bounded disturbances, control constraints, and online state constraints such as obstacles. In an offline phase, one computes the structure of a feedback controller that can be efficiently implemented online to track any feasible nominal trajectory. The offline phase leverages contraction theory and convex optimization to characterize a fixed-size “tube” that the state is guaranteed to remain within while tracking a nominal trajectory (representing the center of the tube). In the online phase, when the robot is faced with obstacles, a motion planner uses such a tube as a robustness margin for collision checking, yielding nominal trajectories that can be safely executed, i.e., tracked without collisions under disturbances. In contrast to recent work on robust online planning using funnel libraries, our approach is not restricted to a fixed library of maneuvers computed offline and is thus particularly well-suited to applications such as UAV flight in densely cluttered environments where complex maneuvers may be required to reach a goal. We demonstrate our approach through simulations of a 6-state planar quadrotor navigating cluttered environments in the presence of a cross-wind. We also discuss applications of our approach to Tube Model Predictive Control (TMPC) and compare the merits of our method with state-of-the-art nonlinear TMPC techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Cited by
Contraction theory for nonlinear stability analysis and learning-based control: A tutorial overview
Tsukamoto, H., Chung, S.-J., & Slotine, J.-J. E. (2021) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2021.10.001 · Cited by 145
Self-citationMulti-Rate Control Design Leveraging Control Barrier Functions and Model Predictive Control Policies
Rosolia, U., & Ames, A. D. (2021) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.3008326 · Cited by 65
A quantitative framework for layered multirate control: Toward a theory of control architecture
Matni, N., Ames, A. D., & Doyle, J. C. (2024) · IEEE Control Systems · doi:10.1109/mcs.2024.3382388 · Cited by 39
ADAPT: Zero-Shot Adaptive Policy Transfer for Stochastic Dynamical Systems
Harrison, J., Garg, A., Ivanovic, B., Zhu, Y., Savarese, S., Fei-Fei, L., & Pavone, M. (2017) · arXiv · doi:10.48550/arxiv.1707.04674 · Cited by 21
Self-citationKohler, J., Soloperto, R., Muller, M. A., & Allgower, F. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2982585 · Cited by 19
“In [12], Vδ(x, z) and κ(x, z, v) = v +Kz(x− z) are determined offline using control contraction metrics (CCM) [22].”
BackgroundMethodInfluential
Metadata
- Authors
- Singh, S., Majumdar, A., Slotine, J.-J., & Pavone, M.
- Venue
- 2017 IEEE International Conference on Robotics and Automation (ICRA)
- Publisher
- IEEE
- Published
- 2017-05
- Pages
- 5883-5890
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2737223130
- Cited by
- 178
- References
- 1
- FWCI
- 33.62
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust online motion planning via contraction theory and convex optimization. https://app.cochat.ai/papers/10.1109/icra.2017.7989693
- The paper
- Singh, S., Majumdar, A., Slotine, J.-J., & Pavone, M. (2017). Robust online motion planning via contraction theory and convex optimization. 2017 IEEE International Conference on Robotics and Automation (ICRA). https://doi.org/10.1109/icra.2017.7989693
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.