Formal Safety Net Control Using Backward Reachability Analysis

被引:13
|
作者
Schuermann, Bastian [1 ]
Klischat, Moritz [1 ]
Kochdumper, Niklas [1 ]
Althoff, Matthias [1 ]
机构
[1] Tech Univ Munich, Dept Informat, D-85748 Garching, Germany
关键词
Safety; Trajectory; Nonlinear systems; Reachability analysis; Linear systems; Automata; Energy consumption; Optimization; backward reachable sets; constrained systems; disturbed systems; nonlinear systems; reachability analysis; safety controller; safety net; set-based control; LINEAR-SYSTEMS; SETS; FRAMEWORK; CONSTRAINTS; MPC;
D O I
10.1109/TAC.2021.3124188
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Ensuring safety is crucial for the successful deployment of autonomous systems, such as self-driving vehicles, unmanned aerial vehicles, and robots acting close to humans. While there exist many controllers that optimize certain criteria, such as energy consumption, comfort, or low wear, they are usually not able to guarantee safety at all times for constrained nonlinear systems affected by disturbances. Many controllers providing safety guarantees, however, have no optimal performance. The idea of this article is, therefore, to synthesize a formally correct controller that serves as a safety net for an unverified, optimal controller. This way, most of the time, the optimal controller is in charge and leads to a desired, optimal control performance. The safety controller constantly monitors the actions of the optimal controller and takes over if the system would become unsafe. The safety controller utilizes a novel concept of backward reachable set computation, where we avoid the need of computing underapproximations of reachable sets. We have further developed a new approach that analytically describes reachable sets, making it possible to efficiently maximize the size of the backward reachable set. We demonstrate our approach by a numerical example from autonomous driving.
引用
收藏
页码:5698 / 5713
页数:16
相关论文
共 50 条
  • [1] Comparing forward and backward reachability as tools for safety analysis
    Mitchell, Ian M.
    Hybrid Systems: Computation and Control, Proceedings, 2007, 4416 : 428 - 443
  • [2] Intertwined Forward-Backward Reachability Analysis Using Interpolants
    Vizel, Yakir
    Grumberg, Orna
    Shoham, Sharon
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2013, 2013, 7795 : 308 - 323
  • [3] Trajectory Planning with Safety Guaranty for a Multirotor based on the Forward and Backward Reachability Analysis
    Seo, Hoseong
    Son, Clark Youngdong
    Lee, Dongjae
    Kim, H. Jin
    2020 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2020, : 7142 - 7148
  • [4] Backward Reachability Analysis of Neural Feedback Systems Using Hybrid Zonotopes
    Zhang, Yuhao
    Zhang, Hang
    Xu, Xiangru
    IEEE CONTROL SYSTEMS LETTERS, 2023, 7 : 2779 - 2784
  • [5] Reachability analysis for formal verification of SystemC
    Drechsler, R
    Grosse, D
    EUROMICRO SYMPOSIUM ON DIGITAL SYSTEM DESIGN, PROCEEDINGS: ARCHITECTURES, METHODS AND TOOLS, 2002, : 337 - 340
  • [6] Finite Horizon Backward Reachability Analysis and Control Synthesis for Uncertain Nonlinear Systems
    Yin, He
    Packard, Andrew
    Arcak, Murat
    Seiler, Peter
    2019 AMERICAN CONTROL CONFERENCE (ACC), 2019, : 5020 - 5026
  • [7] A Combination of Forward and Backward Reachability Analysis Methods
    Ogata, Kazuhiro
    Futatsugi, Kokichi
    FORMAL METHODS AND SOFTWARE ENGINEERING, 2010, 6447 : 501 - 517
  • [8] Synthesizing Traffic Scenarios from Formal Specifications Using Reachability Analysis
    Finkeldei, Florian
    Althoff, Matthias
    2023 IEEE 26TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, ITSC, 2023, : 1285 - 1291
  • [9] Backward Reachability Analysis for Neural Feedback Loops
    Rober, Nicholas
    Everett, Michael
    How, Jonathan P.
    2022 IEEE 61ST CONFERENCE ON DECISION AND CONTROL (CDC), 2022, : 2897 - 2904
  • [10] Checking safety properties using compositional reachability analysis
    Cheung, SC
    Kramer, J
    ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 1999, 8 (01) : 49 - 78