Differentiable Invariant Sets for Hybrid Limit Cycles with Application to Legged Robots
Varun Madabushi, Akash Harapanahalli, Samuel Coogan, Maegan Tucker

TL;DR
This paper introduces a method to compute and verify invariant sets around hybrid limit cycles in legged robots, enhancing robustness analysis and controller design for contact-rich systems.
Contribution
It extends parametric reachable set methods to hybrid systems, enabling formal verification of invariant sets and improved control strategies for legged robots.
Findings
Successfully verified invariant sets for a bipedal robot model
Maximized invariant set size through bi-level optimization
Implemented the approach using a JAX-based library for efficient computation
Abstract
For hybrid systems exhibiting periodic behavior, analyzing the invariant set containing the limit cycle is a natural way to study the robustness of the closed-loop system. However, computing these sets can be computationally expensive, especially when applied to contact-rich cyber-physical systems such as legged robots. In this work, we extend existing methods for overapproximating reachable sets of continuous systems using parametric embeddings to compute a forward-invariant set around the nominal trajectory of a simplified model of a bipedal robot. Our three-step approach (i) computes an overapproximating reachable set around the nominal continuous flow, (ii) catalogs intersections with the guard surface, and (iii) passes these intersections through the reset map. If the overapproximated reachable set after one step is a strict subset of the initial set, we formally verify a forward…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
