Kundu, A and Prabhakar, P (2022) Learning event-driven switched linear systems. In: 2021 7th Indian Control Conference, ICC 2021 - Proceedings, 20 - 22 December 2021, Virtual, Online, pp. 442-447.
|
PDF
ICC_2021.pdf - Published Version Download (283kB) | Preview |
Abstract
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\ast-Algorithm to determine the FA that accepts the language of the given FA. We demonstrate our learning algorithm on a numerical example.
| Item Type: | Conference Paper |
|---|---|
| Publication: | 2021 7th Indian Control Conference, ICC 2021 - Proceedings |
| Publisher: | Institute of Electrical and Electronics Engineers Inc. |
| Additional Information: | The copyright for this article belongs to the Authors. |
| Keywords: | Linear systems; Matrix algebra, Black boxes; Counter examples; Deterministic finite automata; Event-driven; Input sequence; matrix; Set of events; Switched linear system; Switched system; Switching logic, Learning algorithms |
| Department/Centre: | Division of Electrical Sciences > Electrical Engineering |
| Date Deposited: | 23 May 2023 03:38 |
| Last Modified: | 23 May 2023 03:38 |
| URI: | https://eprints.iisc.ac.in/id/eprint/81716 |
Actions (login required)
 |
View Item |
