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

基于Koopman谱的动力系统可达性验证的时间到达界

Time-to-reach Bounds for Verification of Dynamical Systems Using the Koopman Spectrum

Department of Electrical Engineering, Aalto University, Finland(芬兰阿尔托大学电气工程系)

Jianqiang Ding, Shankar A. Deka

AI总结:

本文提出基于Koopman谱的可达性验证方法,通过时间到达界估计实现非线性系统的可达性验证,适用于复杂和高维系统。

摘要:

在本文中,我们提出了一种基于Koopman谱的新颖可达性验证方法,用于非线性系统。与传统方法关注在预设时间跨度内描述动力系统所有可能状态不同,我们的方法通过评估估计的时间到达区间是否非空来验证可达性,而无需显式计算可达集。基于Koopman算子的谱分析,我们将验证可达轨迹存在的问题转化为确定系统可达性所需可行的时间到达界问题。通过求解线性规划(LP)问题,我们的算法可以有效估计动力系统在无界时间跨度内从给定初始集进入(和退出)目标集的所有可能时间区间。最后,我们在具有挑战性的设置中展示了我们的方法,例如验证非凸甚至不连通集之间的可达性,以及反向可达性和多次进入目标集。此外,我们通过验证cart-pole和多智能体共识系统的可达性案例研究,验证了其在解决现实挑战和扩展到高维系统中的适用性。

英文摘要:

In this work, we present a novel Koopman spectrum-based reachability verification method for nonlinear systems. Contrary to conventional methods that focus on characterizing all potential states of a dynamical system over a presupposed time span, our approach seeks to verify the reachability by assessing the non-emptiness of estimated time-to-reach intervals without engaging in the explicit computation of reachable set. Based on the spectral analysis of the Koopman operator, we reformulate the problem of verifying existence of reachable trajectories into the problem of determining feasible time-to-reach bounds required for system reachability. By solving linear programming (LP) problems, our algorithm can effectively estimate all potential time intervals during which a dynamical system can enter (and exit) target sets from given initial sets over an unbounded time horizon. Finally, we demonstrate our method in challenging settings, such as verifying the reachability between non-convex or even disconnected sets, as well as backward reachability and multiple entries into target sets. Additionally, we validate its applicability in addressing real-world challenges and scalability to high-dimensional systems through case studies in verifying the reachability of the cart-pole and multi-agent consensus systems.

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

↑