The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
Abstract
We describe and implement an algorithm for computing the set of reachable states of a continuous dynamic game. The algorithm is based on a proof that the reachable set is the zero sublevel set of the viscosity solution of a particular time-dependent Hamilton-Jacobi-Isaacs partial differential equation. While alternative techniques for computing the reachable set have been proposed, the differential game formulation allows treatment of nonlinear systems with inputs and uncertain parameters. Because the time-dependent equation's solution is continuous and defined throughout the state space, methods from the level set literature can be used to generate more accurate approximations than are possible for formulations with potentially discontinuous solutions. A numerical implementation of our formulation is described and has been released on the web. Its correctness is verified through a two vehicle, three dimensional collision avoidance example for which an analytic solution is available.
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
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
A Mathematical Introduction to Robotic Manipulation
Murray, R. M., Li, Z., & Sastry, S. S. (2017) · CRC Press eBooks · doi:10.1201/9781315136370 · Cited by 6,694
Level Set Methods and Dynamic Implicit Surfaces
Osher, S., & Fedkiw, R. (2003) · Applied Mathematical Sciences · doi:10.1007/b98879 · Cited by 4,951
Efficient implementation of essentially non-oscillatory shock-capturing schemes
Shu, C.-W., & Osher, S. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90177-5 · Cited by 4,886
Efficient implementation of essentially non-oscillatory shock-capturing schemes, II
Shu, C.-W., & Osher, S. (1989) · Journal of Computational Physics · doi:10.1016/0021-9991(89)90222-2 · Cited by 4,851
Level Set Methods and Fast Marching Methods
Sethian, J. A. (1999) · Medical Entomology and Zoology · Cited by 3,616
Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations
Bardi, M., & Capuzzo-Dolcetta, I. (1997) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4755-1 · Cited by 2,758
A Mathmematical Introduction to Robotic Manipulation
Murray, R. M., Li, Z., & Sastry, S. (1994) · Cited by 2,676
Elementary Differential Equations and Boundary Value Problems.
Trahan, D. H., Boyce, W. E., & DiPrima, R. C. (1979) · The American Mathematical Monthly · doi:10.2307/2320609 · Cited by 2,231
Cited by
Control Barrier Functions: Theory and Applications
Ames, A. D., Coogan, S., Egerstedt, M., Notomista, G., Sreenath, K., & Tabuada, P. (2019) · 2019 18th European Control Conference (ECC) · doi:10.23919/ecc.2019.8796030 · Cited by 1,936
Safe Learning in Robotics: From Learning-Based Control to Safe Reinforcement Learning
Brunke, L., Greeff, M., Hall, A. W., Yuan, Z., Zhou, S., Panerati, J., & Schoellig, A. P. (2022) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-042920-020211 · Cited by 769
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-citationCertified Defenses against Adversarial Examples
Raghunathan, A., Steinhardt, J., & Liang, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.09344 · Cited by 520
Exponential Control Barrier Functions for enforcing high relative-degree safety-critical constraints
Nguyen, Q., & Sreenath, K. (2016) · 2016 American Control Conference (ACC) · doi:10.1109/acc.2016.7524935 · Cited by 519
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-citationA General Safety Framework for Learning-Based Control in Uncertain Robotic Systems
Fisac, J. F., Akametalu, A. K., Zeilinger, M. N., Kaynama, S., Gillula, J., & Tomlin, C. J. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2876389 · Cited by 450
Self-citationOnline Verification of Automated Road Vehicles Using Reachability Analysis
Althoff, M., & Dolan, J. M. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2014.2312453 · Cited by 412
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Tedrake, R., Manchester, I. R., Tobenkin, M., & Roberts, J. W. (2010) · The International Journal of Robotics Research · doi:10.1177/0278364910369189 · Cited by 409
Computational techniques for the verification of hybrid systems
Tomlin, C. J., Mitchell, I., Bayen, A. M., & Oishi, M. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.814621 · Cited by 353
Self-citationFunnel libraries for real-time robust feedback motion planning
Majumdar, A., & Tedrake, R. (2017) · The International Journal of Robotics Research · doi:10.1177/0278364917712421 · Cited by 350
On reachability and minimum cost optimal control
Lygeros, J. (2004) · Automatica · doi:10.1016/j.automatica.2004.01.012 · Cited by 296
Safe reinforcement learning: A control barrier function optimization approach
Marvi, Z., & Kiumarsi, B. (2021) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.5132 · Cited by 254
The Flexible, Extensible and Efficient Toolbox of Level Set Methods
Mitchell, I. M. (2008) · Journal of Scientific Computing · doi:10.1007/s10915-007-9174-4 · Cited by 253
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
“x u " # (see Figure 2) modifies this desired control input signal to produce an input signal ( ) ( ( ), ( )) u t x t t u F des l = that ensures the system respects the safety constraint (2) while minimally modifying the desired input signal, that is, minimizing ( ( ), ( )) ( ) x t t t with the goal…”
BackgroundSelf-citationPenalizing side effects using stepwise relative reachability
Krakovna, V., Orseau, L., Kumar, R., Martic, M., & Legg, S. (2018) · arXiv · doi:10.48550/arxiv.1806.01186 · Cited by 26
Connected and Automated Vehicles
Peng, H. (2016) · Mechanical Engineering · doi:10.1115/1.2016-dec-2 · Cited by 15
Metadata
- Authors
- Mitchell, I. M., Bayen, A. M., & Tomlin, C. J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2005-07
- Volume
- 50
- Issue
- 7
- Pages
- 947-957
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2116364955
- Cited by
- 1,152
- References
- 23
- FWCI
- 33.00
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.