English

Data-Driven Approximate Abstraction for Black-Box Piecewise Affine Systems

Systems and Control 2018-02-01 v2 Formal Languages and Automata Theory

Abstract

How to effectively and reliably guarantee the correct functioning of safety-critical cyber-physical systems in uncertain conditions is a challenging problem. This paper presents a data-driven algorithm to derive approximate abstractions for piecewise affine systems with unknown dynamics. It advocates a significant shift from the current paradigm of abstraction, which starts from a model with known dynamics. Given a black-box system with unknown dynamics and a linear temporal logic specification, the proposed algorithm is able to obtain an abstraction of the system with an arbitrarily small error and a bounded probability. The algorithm consists of three components, system identification, system abstraction, and active sampling. The effectiveness of the algorithm is demonstrated by a case study with a soft robot.

Keywords

Cite

@article{arxiv.1801.09289,
  title  = {Data-Driven Approximate Abstraction for Black-Box Piecewise Affine Systems},
  author = {Gang Chen and Zhaodan Kong},
  journal= {arXiv preprint arXiv:1801.09289},
  year   = {2018}
}
R2 v1 2026-06-22T23:59:59.959Z