跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2604.05102 · v2

Finite-Step Invariant Sets for Hybrid Systems with Probabilistic Guarantees

首次提交 2026-04-07 03:05
版本更新 2026-11-17 05:26
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

Poincaré return maps are a fundamental tool for analyzing periodic orbits in hybrid dynamical systems by reducing the stability analysis of a periodic orbit to that of a discrete-time system. While linearization provides local stability information, assessing robustness to disturbances requires identifying invariant sets of the state space under the return dynamics. However, computing such invariant sets is computationally difficult, especially when system dynamics are only available through forward simulation. In this work, we propose an algorithmic framework leveraging sampling-based optimization to compute a finite-step invariant level set around a nominal periodic orbit using sampled evaluations of the return map. The resulting solution is accompanied by probabilistic guarantees on finite-step invariance. We provide theoretic analysis establishing sufficient conditions for which the algorithm terminates and demonstrate the approach on two low-dimensional systems and a Compass-Gait Walking model.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-17 05:26 · 最新观测版本

Finite-Step Invariant Sets for Hybrid Systems with Probabilistic Guarantees

Poincaré return maps are a fundamental tool for analyzing periodic orbits in hybrid dynamical systems by reducing the stability analysis of a periodic orbit to that of a discrete-time system. While linearization provides local stability information, assessing robustness to disturbances requires identifying invariant sets of the state space under the return dynamics. However, computing such invariant sets is computationally difficult, especially when system dynamics are only available through forward simulation. In this work, we propose an algorithmic framework leveraging sampling-based optimization to compute a finite-step invariant level set around a nominal periodic orbit using sampled evaluations of the return map. The resulting solution is accompanied by probabilistic guarantees on finite-step invariance. We provide theoretic analysis establishing sufficient conditions for which the algorithm terminates and demonstrate the approach on two low-dimensional systems and a Compass-Gait Walking model.

查看此版本解读 →查看此版本原文 ↗