Data-Driven Controller Synthesis via Finite Abstractions With Formal Guarantees

被引:5
作者
Ajeleye, Daniel [1 ]
Lavaei, Abolfazl [2 ]
Zamani, Majid [1 ]
机构
[1] Univ Colorado, Dept Comp Sci, Boulder, CO 80309 USA
[2] Newcastle Univ, Sch Comp, Newcastle Upon Tyne NE4 5TG, England
来源
IEEE CONTROL SYSTEMS LETTERS | 2023年 / 7卷
关键词
Trajectory; Control systems; Vehicle dynamics; Computational efficiency; Complexity theory; Symbols; Systematics; Data driven control; optimal control; sampled-data control; SYSTEMS;
D O I
10.1109/LCSYS.2023.3331385
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Construction of finite-state abstractions (a.k.a. symbolic abstractions) is a promising approach for formal verification and controller synthesis of complex systems. Finite-state abstractions provide simpler models that can replicate the behaviors of original complex systems. These abstractions are usually constructed by leveraging precise knowledge of systems' dynamics, which is often unknown in real-life applications. In this letter, we develop a data-driven technique for constructing finite abstractions for continuous-time control systems with unknown dynamics. In our data-driven context, we collect samples from trajectories of unknown systems to construct finite abstractions with a guarantee of correctness. We propose a data-based gridding method to efficiently determine state-set discretization parameters while minimizing the expected number of transitions in the abstraction construction, thus reducing computational efforts. By establishing a feedback refinement relationship between an unknown system and its data-driven finite abstraction, one can design a controller over the data-driven finite abstraction. The controller can then be refined back to the original unknown system to meet a desired property of interest. We illustrate our proposed data-driven approach using a vehicle motion planning benchmark.
引用
收藏
页码:3453 / 3458
页数:6
相关论文
共 16 条
[1]   Symbolic Abstractions From Data: A PAC Learning Approach [J].
Devonport, Alex ;
Saoud, Adnane ;
Arcak, Murat .
2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, :599-604
[2]   Hierarchical control system design using approximate simulation [J].
Girard, Antoine ;
Pappas, George J. .
AUTOMATICA, 2009, 45 (02) :566-571
[3]   From model-based control to data-driven control: Survey, classification and perspective [J].
Hou, Zhong-Sheng ;
Wang, Zhuo .
INFORMATION SCIENCES, 2013, 235 :3-35
[4]  
Kazemi M, 2022, Arxiv, DOI arXiv:2206.08069
[5]   Data-Driven Synthesis of Symbolic Abstractions With Guaranteed Confidence [J].
Lavaei, Abolfazl ;
Frazzoli, Emilio .
IEEE CONTROL SYSTEMS LETTERS, 2022, 7 :253-258
[6]   Efficient Data-Driven Abstraction of Monotone Systems with Disturbances [J].
Makdesi, Anas ;
Girard, Antoine ;
Fribourg, Laurent .
IFAC PAPERSONLINE, 2021, 54 (05) :49-54
[7]   Compositional Synthesis of Finite-State Abstractions [J].
Mallik, Kaushik ;
Schmuck, Anne-Kathrin ;
Soudjani, Sadegh ;
Majumdar, Rupak .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (06) :2629-2636
[8]   Formal Verification of Unknown Discrete- and Continuous-Time Systems: A Data-Driven Approach [J].
Nejati, Ameneh ;
Lavaei, Abolfazl ;
Jagtap, Pushpak ;
Soudjani, Sadegh ;
Zamani, Majid .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (05) :3011-3024
[9]   Symbolic Models for Networks of Control Systems [J].
Pola, Giordano ;
Pepe, Pierdomenico ;
Di Benedetto, Maria Domenica .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (11) :3663-3668
[10]   Feedback Refinement Relations for the Synthesis of Symbolic Controllers [J].
Reissig, Gunther ;
Weber, Alexander ;
Rungger, Matthias .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2017, 62 (04) :1781-1796