Learning event-driven switched linear systems
We propose an automata theoretic learning algorithm for the identification of black-box switched linear systems whose switching logics are event-driven. A switched system is expressed by a deterministic finite automaton (FA) whose node labels are the subsystem matrices. With information about the dimensions of the matrices and the set of events, and with access to two oracles, that can simulate the system on a given input, and provide counter-examples when given an incorrect hypothesis automaton, we provide an algorithm that outputs the unknown FA. Our algorithm first uses the oracle to obtain the node labels of the system run on a given input sequence of events, and then extends Angluin's \(L^*\)-algorithm to determine the FA that accepts the language of the given FA. We demonstrate the performance of our learning algorithm on a set of benchmark examples.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Data-driven switching logic design for switched linear systems
This paper deals with stabilization of discrete-time switched linear systems when explicit knowledge of the state-space models of their subsystems is not available. Given the set of admissible switches between the subsys…
State Space ModelsNonlinear Negative Imaginary Systems with Switching
In this paper, we extend nonlinear negative imaginary (NI) systems theory to switched systems. Switched nonlinear NI systems and switched nonlinear output strictly negative imaginary (OSNI) systems are defined. We show t…
LMI relaxations and its application to data-driven control design for switched affine systems
The problem of data-driven control is addressed here in the context of switched affine systems. This class of nonlinear systems is of particular importance when controlling many types of applications in electronic, biolo…
LEMMAStrategy Synthesis for Partially-known Switched Stochastic Systems
We present a data-driven framework for strategy synthesis for partially-known switched stochastic systems. The properties of the system are specified using linear temporal logic (LTL) over finite traces (LTLf), which is …
Fixed-Relative-Switched Threshold Strategies for Consensus Tracking Control of Nonlinear Multiagent Systems
This paper investigates event-triggered consensus tracking in nonlinear semi-strict-feedback multi-agent systems involving one leader and multiple followers. We first employ radial basis function neural networks and back…