Set Propagation Techniques for Reachability Analysis¶
Althoff, M., Frehse, G., & Girard, A. (2021). Set Propagation Techniques for Reachability Analysis. Annual Review of Control, Robotics, and Autonomous Systems, 4, 369-395.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Realized vs Possible Outcomes
- Dynamical systems (reachability) — the reachable set is the possibility set; the trajectory traced is the realized set; safety verification operates on the gap.
This sourceThe reachable set as the constructed possibility set computed by set-propagation (zonotopes, ellipsoids, level sets); safety verification operates on it rather than on sampled trajectories.
Supported in partVerified against the publisher's abstract
The abstract defines reachability analysis as computing the set of states reachable from all initial states and admissible inputs, i.e. the possible set; it says nothing about traced trajectories or a verification 'gap'.
“Reachability analysis consists in computing the set of states that are reachable by a dynamical system from all initial states and for all admissible inputs and parameters.”
- Dynamical systems (reachability) — the reachable set is the possibility set; the trajectory traced is the realized set; safety verification operates on the gap.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:cd3cc163b614 · see in the full table