Set Propagation Techniques for Reachability Analysis. Althoff, M., Frehse, G., & Girard, A. Annual Review of Control, Robotics, and Autonomous Systems, 4(1):369–395, 2021. _eprint: https://doi.org/10.1146/annurev-control-071420-081941![Set Propagation Techniques for Reachability Analysis [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 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. It is a fundamental problem motivated by many applications in formal verification, controller synthesis, and estimation, to name only a few. This article focuses on a class of methods for computing a guaranteed overapproximation of the reachable set of continuous and hybrid systems, relying predominantly on set propagation; starting from the set of initial states, these techniques iteratively propagate a sequence of sets according to the system dynamics. After a review of set representation and computation, the article presents the state of the art of set propagation techniques for reachability analysis of linear, nonlinear, and hybrid systems. It ends with a discussion of successful applications of reachability analysis to real-world problems.
@article{althoff_set_2021,
title = {Set {Propagation} {Techniques} for {Reachability} {Analysis}},
volume = {4},
url = {https://doi.org/10.1146/annurev-control-071420-081941},
doi = {10.1146/annurev-control-071420-081941},
abstract = {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. It is a fundamental problem motivated by many applications in formal verification, controller synthesis, and estimation, to name only a few. This article focuses on a class of methods for computing a guaranteed overapproximation of the reachable set of continuous and hybrid systems, relying predominantly on set propagation; starting from the set of initial states, these techniques iteratively propagate a sequence of sets according to the system dynamics. After a review of set representation and computation, the article presents the state of the art of set propagation techniques for reachability analysis of linear, nonlinear, and hybrid systems. It ends with a discussion of successful applications of reachability analysis to real-world problems.},
number = {1},
urldate = {2022-12-12},
journal = {Annual Review of Control, Robotics, and Autonomous Systems},
author = {Althoff, Matthias and Frehse, Goran and Girard, Antoine},
year = {2021},
note = {\_eprint: https://doi.org/10.1146/annurev-control-071420-081941},
keywords = {continuous and hybrid systems, reachability analysis, rigorous approximation, set representations},
pages = {369--395},
}
Downloads: 0
{"_id":"2fpFpaWiTg6skNoL7","bibbaseid":"althoff-frehse-girard-setpropagationtechniquesforreachabilityanalysis-2021","author_short":["Althoff, M.","Frehse, G.","Girard, A."],"bibdata":{"bibtype":"article","type":"article","title":"Set Propagation Techniques for Reachability Analysis","volume":"4","url":"https://doi.org/10.1146/annurev-control-071420-081941","doi":"10.1146/annurev-control-071420-081941","abstract":"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. It is a fundamental problem motivated by many applications in formal verification, controller synthesis, and estimation, to name only a few. This article focuses on a class of methods for computing a guaranteed overapproximation of the reachable set of continuous and hybrid systems, relying predominantly on set propagation; starting from the set of initial states, these techniques iteratively propagate a sequence of sets according to the system dynamics. After a review of set representation and computation, the article presents the state of the art of set propagation techniques for reachability analysis of linear, nonlinear, and hybrid systems. It ends with a discussion of successful applications of reachability analysis to real-world problems.","number":"1","urldate":"2022-12-12","journal":"Annual Review of Control, Robotics, and Autonomous Systems","author":[{"propositions":[],"lastnames":["Althoff"],"firstnames":["Matthias"],"suffixes":[]},{"propositions":[],"lastnames":["Frehse"],"firstnames":["Goran"],"suffixes":[]},{"propositions":[],"lastnames":["Girard"],"firstnames":["Antoine"],"suffixes":[]}],"year":"2021","note":"_eprint: https://doi.org/10.1146/annurev-control-071420-081941","keywords":"continuous and hybrid systems, reachability analysis, rigorous approximation, set representations","pages":"369–395","bibtex":"@article{althoff_set_2021,\n\ttitle = {Set {Propagation} {Techniques} for {Reachability} {Analysis}},\n\tvolume = {4},\n\turl = {https://doi.org/10.1146/annurev-control-071420-081941},\n\tdoi = {10.1146/annurev-control-071420-081941},\n\tabstract = {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. It is a fundamental problem motivated by many applications in formal verification, controller synthesis, and estimation, to name only a few. This article focuses on a class of methods for computing a guaranteed overapproximation of the reachable set of continuous and hybrid systems, relying predominantly on set propagation; starting from the set of initial states, these techniques iteratively propagate a sequence of sets according to the system dynamics. After a review of set representation and computation, the article presents the state of the art of set propagation techniques for reachability analysis of linear, nonlinear, and hybrid systems. It ends with a discussion of successful applications of reachability analysis to real-world problems.},\n\tnumber = {1},\n\turldate = {2022-12-12},\n\tjournal = {Annual Review of Control, Robotics, and Autonomous Systems},\n\tauthor = {Althoff, Matthias and Frehse, Goran and Girard, Antoine},\n\tyear = {2021},\n\tnote = {\\_eprint: https://doi.org/10.1146/annurev-control-071420-081941},\n\tkeywords = {continuous and hybrid systems, reachability analysis, rigorous approximation, set representations},\n\tpages = {369--395},\n}\n\n\n\n\n\n\n\n","author_short":["Althoff, M.","Frehse, G.","Girard, A."],"key":"althoff_set_2021","id":"althoff_set_2021","bibbaseid":"althoff-frehse-girard-setpropagationtechniquesforreachabilityanalysis-2021","role":"author","urls":{"Paper":"https://doi.org/10.1146/annurev-control-071420-081941"},"keyword":["continuous and hybrid systems","reachability analysis","rigorous approximation","set representations"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/alukina","dataSources":["Cfgnp5s4HQSBd8tAf"],"keywords":["continuous and hybrid systems","reachability analysis","rigorous approximation","set representations"],"search_terms":["set","propagation","techniques","reachability","analysis","althoff","frehse","girard"],"title":"Set Propagation Techniques for Reachability Analysis","year":2021}