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

通过线性规划的Lipschitz常数寻找控制不变集

Finding Control Invariant Sets via Lipschitz Constants of Linear Programs

Matti Vahs, Shaohang Han, Jana Tumova

AI总结:

本文提出一种基于线性规划Lipschitz常数的方法,在输入受限下安全扩展控制不变集,并用于构建最小侵入性的安全滤波器,兼具理论证明与数值验证。

摘要:

控制不变集在安全关键控制中扮演重要角色,并在移动机器人避障等众多领域中得到广泛应用。然而,在输入受限的情况下,寻找动力系统的有效控制不变集是出了名的困难。我们提出了一种方法,在始终保证集合是控制不变的前提下,安全地扩展初始集合。具体来说,我们定义了集合边界的扩展律,并使用线性规划(LPs)来检查控制不变性。为了在连续域上验证控制不变性,我们利用最近提出的线性规划的Lipschitz常数,将连续验证问题转化为有限数量的线性规划。利用可微优化的概念,我们推导出控制不变集的安全扩展律,并展示了它如何被解释为在可能边界空间中的第二个不变性问题。最后,我们展示了如何将所获得的集合用于在控制屏障函数(CBF)框架中获得最小侵入性的安全滤波器。我们的工作得到了理论结果和数值示例的支持。

英文摘要:

Control invariant sets play an important role in safety-critical control and find broad application in numerous fields such as obstacle avoidance for mobile robots. However, finding valid control invariant sets of dynamical systems under input limitations is notoriously difficult. We present an approach to safely expand an initial set while always guaranteeing that the set is control invariant. Specifically, we define an expansion law for the boundary of a set and check for control invariance using Linear Programs (LPs). To verify control invariance on a continuous domain, we leverage recently proposed Lipschitz constants of LPs to transform the problem of continuous verification into a finite number of LPs. Using concepts from differentiable optimization, we derive the safe expansion law of the control invariant set and show how it can be interpreted as a second invariance problem in the space of possible boundaries. Finally, we show how the obtained set can be used to obtain a minimally invasive safety filter in a Control Barrier Function (CBF) framework. Our work is supported by theoretical results as well as numerical examples.

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

↑