Log In Sign Up

Dispersion-Minimizing Motion Primitives for Search-Based Motion Planning

by   Laura Jarin-Lipschitz, et al.

Search-based planning with motion primitives is a powerful motion planning technique that can provide dynamic feasibility, optimality, and real-time computation times on size, weight, and power-constrained platforms in unstructured environments. However, optimal design of the motion planning graph, while crucial to the performance of the planner, has not been a main focus of prior work. This paper proposes to address this by introducing a method of choosing vertices and edges in a motion primitive graph that is grounded in sampling theory and leads to theoretical guarantees on planner completeness. By minimizing dispersion of the graph vertices in the metric space induced by trajectory cost, we optimally cover the space of feasible trajectories with our motion primitive graph. In comparison with baseline motion primitives defined by uniform input space sampling, our motion primitive graphs have lower dispersion, find a plan with fewer iterations of the graph search, and have only one parameter to tune.


page 1

page 5

page 6


Sampling-based optimal kinodynamic planning with motion primitives

This paper proposes a novel sampling-based motion planner, which integra...

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

We consider time-optimal motion planning for dynamical systems that are ...

Experiments in Adaptive Replanning for Fast Autonomous Flight in Forests

Fast, autonomous flight in unstructured, cluttered environments such as ...

Robust Locomotion on Legged Robots through Planning on Motion Primitive Graphs

The functional demands of robotic systems often require completing vario...

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

In the field of motion planning the use of pre-computed, feasible, local...

Learning Geometric Constraints in Task and Motion Planning

Searching for bindings of geometric parameters in task and motion planni...

PiP-X: Online feedback motion planning/replanning in dynamic environments using invariant funnels

Computing kinodynamically feasible motion plans and repairing them on-th...