Home ›
Entities
› academia
› Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets
Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets
Research article (IEEE Control Systems Letters, 2023) · cited 12× · AI/ML
Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets
Summary
Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets is a scholarly article[1].
Key Facts
Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets. Retrieved May 24, 2026, from https://4ort.xyz/entity/efficient-and-guaranteed-hamiltonjacobi-reachability-via-self-contained-subsystem-decomposition-and-admissible-control-s
MLA“Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/efficient-and-guaranteed-hamiltonjacobi-reachability-via-self-contained-subsystem-decomposition-and-admissible-control-s.
BibTeX@misc{4ortxyz_efficient-and-guaranteed-hamiltonjacobi-reachability-via-self-contained-subsystem-decomposition-and-admissible-control-s_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets}}, year = {2026}, url = {https://4ort.xyz/entity/efficient-and-guaranteed-hamiltonjacobi-reachability-via-self-contained-subsystem-decomposition-and-admissible-control-s}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets — https://4ort.xyz/entity/efficient-and-guaranteed-hamiltonjacobi-reachability-via-self-contained-subsystem-decomposition-and-admissible-control-s (retrieved 2026-05-24)
