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

用凸优化界定到不安全集合的距离

Bounding the Distance to Unsafe Sets with Convex Optimization

Jared Miller, Mario Sznaier

AI总结:

本研究提出一种基于凸优化的算法,通过将距离估计问题松弛为Monge-Kantorovich型最优传输问题,界定动力系统轨迹到不安全集合的最小距离,可适配多类距离与运动场景。

摘要:

本研究提出一种算法,用于界定动力系统轨迹上的点与不安全集合上的点之间的最小距离。此前关于轨迹安全性验证的研究包括屏障法和密度法,这些方法无法从距离角度给出与不安全集合的接近裕度。基于现有的峰值估计占用度量方法,该距离估计问题被松弛为一个Monge-Kantorovich型最优传输问题。针对多面体范数距离(例如L1和L无穷范数)以及形状沿轨迹运动的场景(例如刚体运动),可开发专门的规划程序。当距离目标可分离时,该距离估计问题将具有相关稀疏性。

英文摘要:

This work proposes an algorithm to bound the minimum distance between points on trajectories of a dynamical system and points on an unsafe set. Prior work on certifying safety of trajectories includes barrier and density methods, which do not provide a margin of proximity to the unsafe set in terms of distance. The distance estimation problem is relaxed to a Monge-Kantorovich type optimal transport problem based on existing occupation-measure methods of peak estimation. Specialized programs may be developed for polyhedral norm distances (e.g. L1 and Linfinity) and for scenarios where a shape is traveling along trajectories (e.g. rigid body motion). The distance estimation problem will be correlatively sparse when the distance objective is separable.

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

↑