The DOI matches its Crossref record.
Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems
Open accessAbstract
Reachability analysis provides formal guarantees for performance and safety properties of nonlinear control systems. Here, one aims to compute the backward reachable set (BRS) or tube (BRT)-the set of states from which the system can be driven into a target set at a particular time or within a time interval, respectively. The computational complexity of current approaches scales poorly, making application to high-dimensional systems intractable. We propose a technique that decomposes the dynamics of a general class of nonlinear systems into subsystems which may be coupled through common states, controls, and disturbances. Despite this coupling, BRSs and BRTs can be computed efficiently using our technique without incurring additional approximation errors and without the need for linearizing dynamics or approximating sets as polytopes. Computations of BRSs and BRTs now become orders of magnitude faster, and for the first time BRSs and BRTs for many high-dimensional nonlinear control systems can be computed using the Hamilton-Jacobi formulation. In situations involving bounded adversarial disturbances, our proposed method can obtain slightly conservative results. We demonstrate our theory by numerically computing BRSs and BRTs for several systems, including the six-dimensional Acrobatic Quadrotor using the HJ formulation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Hamilton-Jacobi reachability: A brief overview and recent advances
Bansal, S., Chen, M., Herbert, S., & Tomlin, C. J. (2017) · 2017 IEEE 56th Annual Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263977 · Cited by 471
Self-citationWabersich, K. P., Taylor, A. J., Choi, J. J., Sreenath, K., Tomlin, C. J., Ames, A. D., & Zeilinger, M. N. (2023) · IEEE Control Systems · doi:10.1109/mcs.2023.3291885 · Cited by 132
Self-citation
Metadata
- Authors
- Chen, M., Herbert, S. L., Vashishtha, M. S., Bansal, S., & Tomlin, C. J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2018-11
- Volume
- 63
- Issue
- 11
- Pages
- 3675-3688
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2963606896
- Cited by
- 186
- References
- 0
- FWCI
- 13.67
- Type
- journal article
- 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: Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems. https://app.cochat.ai/papers/10.1109/tac.2018.2797194
- The paper
- Chen, M., Herbert, S. L., Vashishtha, M. S., Bansal, S., & Tomlin, C. J. (2018). Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2018.2797194
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.