Towards Planning and Control of Hybrid Systems with Limit Cycle using LQR Trees
Ramkumar Natarajan, Siddharthan Rajasekaran, Jonathan D. Taylor

TL;DR
This paper introduces an LQR Tree-based planning and control method for hybrid systems with limit cycles, enabling stabilization and recovery from perturbations without discretizing control actions.
Contribution
It extends LQR Trees to hybrid systems with continuous control sets and limit cycles, facilitating planning and stabilization in complex dynamical systems.
Findings
Successfully stabilizes a hybrid limit cycle in a compass gait model
Demonstrates recovery from initial perturbations and noise
Provides a probabilistic coverage of the state space region
Abstract
We present a multi-query recovery policy for a hybrid system with goal limit cycle. The sample trajectories and the hybrid limit cycle of the dynamical system are stabilized using locally valid Time Varying LQR controller policies which probabilistically cover a bounded region of state space. The original LQR Tree algorithm builds such trees for non-linear static and non-hybrid systems like a pendulum or a cart-pole. We leverage the idea of LQR trees to plan with a continuous control set, unlike methods that rely on discretization like dynamic programming to plan for hybrid dynamical systems where it is hard to capture the exact event of discrete transition. We test the algorithm on a compass gait model by stabilizing a dynamic walking hybrid limit cycle with point foot contact from random initial conditions. We show results from the simulation where the system comes back to a stable…
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.
Taxonomy
TopicsFormal Methods in Verification · Robotic Path Planning Algorithms · Reinforcement Learning in Robotics
