arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1012.5113eess.SYcs.SY
收藏

控制系统的定时博弈抽象

Timed Game Abstraction of Control Systems

Aalborg University(奥尔堡大学)

Christoffer Sloth, Rafael Wisniewski

AI总结:

本文提出一种基于定时博弈自动机的控制系统抽象方法,通过Lyapunov函数生成的正负不变集划分状态空间,实现自动控制器综合。

摘要:

本文提出了一种通过定时博弈自动机抽象控制系统的方法,旨在实现自动控制器综合。所提出的抽象基于使用Lyapunov函数生成的正负不变集对控制系统的状态空间进行划分。这种划分确保控制系统的向量场与单元的边界横截,从而引出了抽象的一些理想性质。为了允许抽象更丰富的控制系统类别,扩展了定时博弈自动机的更新映射。建立了状态空间和控制划分的条件以获得合理的抽象。最后,通过一个与导航相关的控制问题示例展示了该方法的应用。

英文摘要:

This paper proposes a method for abstracting control systems by timed game automata, and is aimed at obtaining automatic controller synthesis. The proposed abstraction is based on partitioning the state space of a control system using positive and negative invariant sets, generated by Lyapunov functions. This partitioning ensures that the vector field of the control system is transversal to the facets of the cells, which induces some desirable properties of the abstraction. To allow a rich class of control systems to be abstracted, the update maps of the timed game automaton are extended. Conditions on the partitioning of the state space and the control are set up to obtain sound abstractions. Finally, an example is provided to demonstrate the method applied to a control problem related to navigation.

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

↑