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

05/29/2023
by   Nan Wang, et al.
0

This paper proposes a stable sparse rapidly-exploring random trees (SST) algorithm to solve the optimal motion planning problem for hybrid systems. At each iteration, the proposed algorithm, called HySST, selects a vertex with the lowest cost among all the vertices within the neighborhood of a randomly selected sample and then extends the search tree by flow or jump, which is also chosen randomly when both regimes are possible. In addition, HySST maintains a static set of witness points such that all the vertices within the neighborhood of each witness are pruned except the vertex with the lowest cost. Through a definition of concatenation of functions defined on hybrid time domains, we show that HySST is asymptotically near optimal, namely, the probability of failing to find a motion plan such that its cost is close to the optimal cost approaches zero as the number of iterations of the algorithm increases to infinity. This property is guaranteed under mild conditions on the data defining the motion plan, which include a relaxation of the usual positive clearance assumption imposed in the literature of classical systems. The proposed algorithm is applied to an actuated bouncing ball system and a collision-resilient tensegrity multicopter system so as to highlight its generality and computational features.

READ FULL TEXT
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
01/07/2021

qRRT: Quality-Biased Incremental RRT for Optimal Motion Planning in Non-Holonomic Systems

This paper presents a sampling-based method for optimal motion planning ...
research
05/16/2022

Robust-RRT: Probabilistically-Complete Motion Planning for Uncertain Nonlinear Systems

Robust motion planning entails computing a global motion plan that is sa...
research
09/12/2022

Sampling-Based Trajectory (re)planning for Differentially Flat Systems: Application to a 3D Gantry Crane

In this paper, a sampling-based trajectory planning algorithm for a labo...
research
03/21/2022

db-A*: Discontinuity-bounded Search for Kinodynamic Mobile Robot Motion Planning

We consider time-optimal motion planning for dynamical systems that are ...
research
09/07/2018

Sampling-based optimal kinodynamic planning with motion primitives

This paper proposes a novel sampling-based motion planner, which integra...
research
11/11/2017

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

We present a multi-query recovery policy for a hybrid system with goal l...

Please sign up or login with your details

Forgot password? Click here to reset