arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.2363eess.SYcs.ROcs.SYmath.OC
收藏

基于采样的可扩展约束满足方法在线性采样数据系统中的应用---第一部分:计算

A sampling-based approach to scalable constraint satisfaction in linear sampled-data systems---Part I: Computation

University of California at Berkeley(加州大学伯克利分校)

Shahab Kaynama, Jeremy H. Gillula, Claire J. Tomlin

AI总结:

本文提出一种新的基于采样的算法,用于高维线性采样数据系统中精确逼近可行性核,解决约束满足问题,并在十二维飞行包线保护问题中验证了方法的有效性。

摘要:

采样数据(SD)系统由离散和连续时间组件组成,是实际中最常见的混合物理系统之一;大多数现代控制器是在数字平台上实现的,而被控制的植物动力学在时间上是连续变化的。与所有混合物理系统一样,确保硬约束满足是SD系统安全运行的关键。一种强大的分析工具用于保证此类约束满足是可行性核:所有初始条件的集合,对于存在安全保持控制律(即满足所有输入和状态约束的控制律)而言。在本文中,我们提出了一种新的基于采样的算法,该算法紧密逼近高维线性采样数据时间不变(LTI)系统的可行性核。与该领域先前的工作不同,我们的算法正式处理了SD系统的离散和连续特性。我们证明了我们近似技术的正确性和收敛性,提供了关于如何通过启发式方法优化采样过程的讨论,并在十二维飞行包线保护问题中展示了结果。

英文摘要:

Sampled-data (SD) systems, which are composed of both discrete- and continuous-time components, are arguably one of the most common classes of cyberphysical systems in practice; most modern controllers are implemented on digital platforms while the plant dynamics that are being controlled evolve continuously in time. As with all cyberphysical systems, ensuring hard constraint satisfaction is key in the safe operation of SD systems. A powerful analytical tool for guaranteeing such constraint satisfaction is the viability kernel: the set of all initial conditions for which a safety-preserving control law (that is, a control law that satisfies all input and state constraints) exists. In this paper we present a novel sampling-based algorithm that tightly approximates the viability kernel for high-dimensional sampled-data linear time-invariant (LTI) systems. Unlike prior work in this area, our algorithm formally handles both the discrete and continuous characteristics of SD systems. We prove the correctness and convergence of our approximation technique, provide discussions on heuristic methods to optimally bias the sampling process, and demonstrate the results on a twelve-dimensional flight envelope protection problem.

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

↑