arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.12831eess.SYcs.LGcs.SY
收藏

学习事件驱动的切换线性系统

Learning event-driven switched linear systems

Indian Institute of Science Bangalore(班加罗尔印度科学院);Kansas State University(堪萨斯州立大学)

Atreyee Kundu, Pavithra Prabhakar

摘要:

提出了一种自动机理论学习算法,用于识别开关逻辑为事件驱动的黑箱开关线性系统。切换系统用一个确定性有限自动机(FA)表示,其节点标号是子系统矩阵。有了关于矩阵和事件集的维度的信息,并且可以访问两个预言机,该预言机可以在给定的输入上模拟系统,并且在给定不正确的假设自动机时提供反例,我们提供了一种输出未知FA的算法。我们的算法首先使用的oracle获得的节点标签的系统运行在一个给定的输入序列的事件,然后扩展Angluin的\(L^*\) -算法,以确定FA,接受给定的FA的语言。我们证明了我们的学习算法的性能在一组基准的例子。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑