Log In Sign Up

Piecewise-Linear Motion Planning amidst Static, Moving, or Morphing Obstacles

by   Bachir El Khadir, et al.

We propose a novel method for planning shortest length piecewise-linear motions through complex environments punctured with static, moving, or even morphing obstacles. Using a moment optimization approach, we formulate a hierarchy of semidefinite programs that yield increasingly refined lower bounds converging monotonically to the optimal path length. For computational tractability, our global moment optimization approach motivates an iterative motion planner that outperforms competing sampling-based and nonlinear optimization baselines. Our method natively handles continuous time constraints without any need for time discretization, and has the potential to scale better with dimensions compared to popular sampling-based methods.


page 1

page 2

page 3

page 4


A Lower Bounding Framework for Motion Planning amid Dynamic Obstacles in 2D

This work considers a Motion Planning Problem with Dynamic Obstacles (MP...

Motion Planning around Obstacles with Convex Optimization

Trajectory optimization offers mature tools for motion planning in high-...

Spatio-temporal Motion Planning for Autonomous Vehicles with Trapezoidal Prism Corridors and Bézier Curves

Safety-guaranteed motion planning is critical for self-driving cars to g...

Convex Risk Bounded Continuous-Time Trajectory Planning in Uncertain Nonconvex Environments

In this paper, we address the trajectory planning problem in uncertain n...

A Homotopy Method for Motion Planning

We propose a novel method for motion planning and illustrate its impleme...

Joint Sampling and Trajectory Optimization over Graphs for Online Motion Planning

Among the most prevailing motion planning techniques, sampling and traje...

Collision Probabilities for Continuous-Time Systems Without Sampling [with Appendices]

Demand for high-performance, robust, and safe autonomous systems has gro...