arrow
Return

Data-driven abstraction-based control synthesis

delete2024-05-01
delete7
delete
OA
AI
M
Milad Kazemi
R
Rupak Majumdar
M
Mahmoud Salamati
S
Sadegh Soudjani *
B
Ben Wooding
DOI:10.1016/j.nahs.2024.101467delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
This paper studies formal synthesis of controllers for continuous-space systems with unknown dynamics to satisfy requirements expressed as linear temporal logic formulas. Formal abstraction-based synthesis schemes rely on a precise mathematical model of the system to build a finite abstract model, which is then used to design a controller. The abstraction-based schemes are not applicable when the dynamics of the system are unknown. We propose a data-driven approach that computes a growth bound of the system using a finite number of trajectories. The computed growth bound together with the sampled trajectories are then used to construct the abstraction and synthesise a controller. Our approach casts the computation of a growth bound as a robust convex optimisation program (RCP). Since the unknown dynamics appear in the optimisation, we formulate a scenario convex program (SCP) corresponding to the RCP using a finite number of sampled trajectories. We establish a sample complexity result that gives a lower bound for the number of sampled trajectories to guarantee the correctness of the growth bound computed from the SCP with a given confidence. Our sample complexity result requires knowing a possibly conservative bound on the Lipschitz constant of the system. We also provide a sample complexity result for the satisfaction of the specification on the system in closed loop with the designed controller for a given confidence. Our data-driven synthesised controller can provide guarantees on satisfaction of both finite and infinite-horizon specifications. We show that our data-driven approach can be readily used as a model-free abstraction refinement scheme by modifying the formulation of the system's growth bounds and providing similar sample complexity results. The performance of our approach is shown on three case studies.
Keywords:
Abstraction-based methods
Data-driven synthesis
Formal controller synthesis
Sample complexity
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

N
Nonlinear Analysis and Hybrid Systems
IF:
4.1
Papers:
1.4K
Citations:
3.1K

Organization

U
university of london
Scholars:
21.5W
Papers: 19.7W
Citations: 305
M
Max Planck Society
Scholars:
8.2W
Papers: 7.7W
Citations: 3.3W
Cited Papers

Cited Papers

Effects of a superoptimal temperature on aquacultured yellowtail Seriola quinqueradiata
err2018-08-11
err0
PREAI
errYoshinori Sotoyama; Saichiro Yokoyama; Manabu Ishikawa; Shunsuke Koshio; Hiroshi Hashimoto; Hiromi Oku; Tadashi Ando
errShare
errSave
Formal synthesis of closed-form sampled-data controllers for nonlinear continuous-time systems under STL specifications
err2022-05-01
err1
errOAAI
errVerdier, Cees Ferdinand; Kochdumper, Niklas; Althoff, Matthias; Mazo Jr, Manuel
errShare
errSave
errShare
errSave
The scenario approach to robust control design
err2006-05-01
err852
errOAAI
errCalafiore, Giuseppe C.; Campi, Marco C.
errShare
errSave
The Measure of Reality
err
IF0
err2013-10-05
err0
PREAI
errAlfred W. Crosby
errShare
errSave
errShare
errSave
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
err2008-11-01
err327
PREAI
errAbate, Alessandro; Prandini, Maria; Lygeros, John; Sastry, Shankar
errShare
errSave
researcher View more