The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Hamilton-Jacobi reachability: A brief overview and recent advances
Open accessAbstract
Hamilton-Jacobi (HJ) reachability analysis is an important formal verification method for guaranteeing performance and safety properties of dynamical systems; it has been applied to many small-scale systems in the past decade. Its advantages include compatibility with general nonlinear system dynamics, formal treatment of bounded disturbances, and the availability of well-developed numerical tools. The main challenge is addressing its exponential computational complexity with respect to the number of state variables. In this tutorial, we present an overview of basic HJ reachability theory and provide instructions for using the most recent numerical tools, including an efficient GPU-parallelized implementation of a Level Set Toolbox for computing reachable sets. In addition, we review some of the current work in high-dimensional HJ reachability to show how the dimensionality challenge can be alleviated via various general theoretical and application-specific insights.
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
Cites
Partial Differential Equations
(1988) · Lecture Notes in Mathematics · doi:10.1007/bfb0082920 · Cited by 23,383
Theory of Ordinary Differential Equations
Coddington, E. A., Levinson, N., & Teichmann, T. (1956) · Physics Today · doi:10.1063/1.3059875 · Cited by 6,124
Level Set Methods and Dynamic Implicit Surfaces
Osher, S., & Fedkiw, R. (2003) · Applied Mathematical Sciences · doi:10.1007/b98879 · Cited by 4,951
(2008) · Cited by 4,811
Partial Differential Equations
Evans, L. (2010) · Graduate Studies in Mathematics · doi:10.1090/gsm/019 · Cited by 3,648
A fast marching level set method for monotonically advancing fronts.
Sethian, J. A. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.4.1591 · Cited by 3,221
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
Parrilo, P. A. (2000) · doi:10.7907/2k6y-ch43 · Cited by 1,802
A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
Mitchell, I. M., Bayen, A. M., & Tomlin, C. J. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.851439 · Cited by 1,152
Self-citationSpaceEx: Scalable Verification of Hybrid Systems
Frehse, G., Guernic, C. L., Donzé, A., Cotton, S., Ray, R., Lebeltel, O., Ripado, R., Antoine Girard, A., Dang, T., & Maler, O. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22110-1_30 · Cited by 849
Provably safe and robust learning-based model predictive control
Aswani, A., Gonzalez, H., Sastry, S. S., & Tomlin, C. (2013) · Automatica · doi:10.1016/j.automatica.2013.02.003 · Cited by 539
Self-citation
Cited by
Dawson, C., Gao, S., & Fan, C. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3232542 · Cited by 269
Wabersich, 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-citationZhou, Z., Oguz, O. S., Leibold, M., & Buss, M. (2020) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.2992981 · Cited by 18
Conformal Decision Theory: Safe Autonomous Decisions from Imperfect Predictions
Lekeufack, J., Angelopoulos, A. N., Bajcsy, A., Jordan, M. I., & Malik, J. (2024) · 2024 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra57147.2024.10610041 · Cited by 18
Robust Safety-Critical Control for Input-Delayed System with Delay Estimation
Kim, Y., Kim, J., Ames, A. D., & Sloth, C. (2024) · 2024 European Control Conference (ECC) · doi:10.23919/ecc64448.2024.10591073 · Cited by 5
Metadata
- Authors
- Bansal, S., Chen, M., Herbert, S., & Tomlin, C. J.
- Venue
- 2017 IEEE 56th Annual Conference on Decision and Control (CDC)
- Publisher
- IEEE
- Published
- 2017-12
- Pages
- 2242-2253
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2760003929
- Cited by
- 471
- References
- 31
- FWCI
- 21.63
- 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: Hamilton-Jacobi reachability: A brief overview and recent advances. https://app.cochat.ai/papers/10.1109/cdc.2017.8263977
- The paper
- Bansal, S., Chen, M., Herbert, S., & Tomlin, C. J. (2017). Hamilton-Jacobi reachability: A brief overview and recent advances. 2017 IEEE 56th Annual Conference on Decision and Control (CDC). https://doi.org/10.1109/cdc.2017.8263977
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.