Parametrised collision-free optimal motion planning algorithms in Euclidean spaces

03/25/2021
by   Cesar A. Ipanaque Zapata, et al.
0

We present optimal parametrised motion planning algorithms which can be used in designing practical systems controlling objects that move in Euclidean d-space, with d≥ 2 even, without collisions and in the presence of two obstacles with unknown a priori positions. Our algorithms are optimal in a very concrete sense, namely, they have the minimal possible number of local planners.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2019

Multitasking collision-free motion planning algorithms in Euclidean spaces

We present optimal motion planning algorithms which can be used in desig...
research
10/19/2020

Parametrized topological complexity of collision-free motion planning in the plane

Parametrized motion planning algorithms have high degrees of universalit...
research
08/06/2021

Sampling-based multi-agent choreography planning: a metric space approach

We present a metric space approach for high-dimensional sample-based tra...
research
02/11/2022

Parametrized motion planning and topological complexity

In this paper we study paramertized motion planning algorithms which pro...
research
04/16/2018

Safe Motion Planning in Unknown Environments: Optimality Benchmarks and Tractable Policies

This paper addresses the problem of planning a safe (i.e., collision-fre...
research
05/10/2023

Non-Euclidean Motion Planning with Graphs of Geodesically-Convex Sets

Computing optimal, collision-free trajectories for high-dimensional syst...
research
03/06/2019

FIESTA: Fast Incremental Euclidean Distance Fields for Online Motion Planning of Aerial Robots

Euclidean Signed Distance Field (ESDF) is useful for online motion plann...

Please sign up or login with your details

Forgot password? Click here to reset