Towards Planning and Control of Hybrid Systems with Limit Cycle using LQR Trees

11/11/2017
by   Ramkumar Natarajan, et al.
0

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 behavior with initial position or velocity perturbation and noise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/03/2021

Continuous-Time Behavior Trees as Discontinuous Dynamical Systems

Behavior trees represent a hierarchical and modular way of combining sev...
research
09/19/2023

Hamilton-Jacobi Reachability Analysis for Hybrid Systems with Controlled and Forced Transitions

Hybrid dynamical systems with non-linear dynamics are one of the most ge...
research
11/01/2019

Hybrid Differential Dynamic Programming for Planar Manipulation Primitive

We present a hybrid differential dynamic programming algorithm for close...
research
11/01/2019

Hybrid Differential Dynamic Programming for Planar Manipulation Primitives

We present a hybrid differential dynamic programming algorithm for close...
research
10/26/2022

A Rapidly-Exploring Random Trees Motion Planning Algorithm for Hybrid Dynamical Systems

This paper proposes a rapidly-exploring random trees (RRT) algorithm to ...
research
05/29/2023

HySST: A Stable Sparse Rapidly-Exploring Random Trees Optimal Motion Planning Algorithm for Hybrid Dynamical Systems

This paper proposes a stable sparse rapidly-exploring random trees (SST)...
research
10/12/2021

Cycle-Tree Guided Attack of Random K-Core

The K-core of a graph is the maximal subgraph within which each vertex i...

Please sign up or login with your details

Forgot password? Click here to reset