Sampling-based optimal kinodynamic planning with motion primitives

09/07/2018
by   Basak Sakcak, et al.
0

This paper proposes a novel sampling-based motion planner, which integrates in RRT* (Rapidly exploring Random Tree star) a database of pre-computed motion primitives to alleviate its computational load and allow for motion planning in a dynamic or partially known environment. The database is built by considering a set of initial and final state pairs in some grid space, and determining for each pair an optimal trajectory that is compatible with the system dynamics and constraints, while minimizing a cost. Nodes are progressively added to the tree of feasible trajectories in the RRT* by extracting at random a sample in the gridded state space and selecting the best obstacle-free motion primitive in the database that joins it to an existing node. The tree is rewired if some nodes can be reached from the new sampled state through an obstacle-free motion primitive with lower cost. The computationally more intensive part of motion planning is thus moved to the preliminary offline phase of the database construction at the price of some performance degradation due to gridding. Grid resolution can be tuned so as to compromise between (sub)optimality and size of the database. The planner is shown to be asymptotically optimal as the grid resolution goes to zero and the number of sampled states grows to infinity.

READ FULL TEXT
research
03/26/2021

Dispersion-Minimizing Motion Primitives for Search-Based Motion Planning

Search-based planning with motion primitives is a powerful motion planni...
research
03/02/2022

L4KDE: Learning for KinoDynamic Tree Expansion

We present the Learning for KinoDynamic Tree Expansion (L4KDE) method fo...
research
07/18/2019

Towards Learning Efficient Maneuver Sets for Kinodynamic Motion Planning

Planning for systems with dynamics is challenging as often there is no l...
research
09/12/2019

RRT2.0 for Fast and Optimal Kinodynamic Sampling-Based Motion Planning

We present RRT2.0: a simple yet efficient tree-based planner for asympto...
research
08/29/2020

T^⋆-Lite: A Fast Time-Risk Optimal Motion Planning Algorithm for Multi-Speed Autonomous Vehicles

In this paper, we develop a new algorithm, called T^⋆-Lite, that enables...
research
07/23/2021

Multi-Start n-Dimensional Lattice Planning with Optimal Motion Primitives

In the field of motion planning the use of pre-computed, feasible, local...
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)...

Please sign up or login with your details

Forgot password? Click here to reset