Multitasking collision-free motion planning algorithms in Euclidean spaces

05/30/2019
by   Cesar A. Ipanaque Zapata, et al.
0

We present optimal motion planning algorithms which can be used in designing practical systems controlling objects moving in Euclidean space without collisions. Our algorithms are motivated by those presented by Mas-Ku and Torres-Giese (as streamlined by Farber), and are developed within the more general context of the multitasking (a.k.a. higher) motion planning problem. In addition, our implementation works more efficiently than previous ones when applied to systems with a large number of moving objects.

READ FULL TEXT
research
03/25/2021

Parametrised collision-free optimal motion planning algorithms in Euclidean spaces

We present optimal parametrised motion planning algorithms which can be ...
research
12/02/2022

Sequential parametrized motion planning and its complexity, II

This is a continuation of our recent paper in which we developed the the...
research
06/05/2021

Motion Planning Transformers: One Model to Plan Them All

Transformers have become the powerhouse of natural language processing a...
research
04/09/2019

Fast multipole networks

Two fundamental prerequisites for robotic multiagent systems are mobilit...
research
09/19/2023

Hierarchical Annotated Skeleton-Guided Tree-based Motion Planning

We present a hierarchical tree-based motion planning strategy, HAS-RRT, ...
research
06/05/2020

Online Motion Planning based on Nonlinear Model Predictive Control with Non-Euclidean Rotation Groups

This paper proposes a novel online motion planning approach to robot nav...
research
07/20/2020

Push, Stop, and Replan: An Application of Pebble Motion on Graphs to Planning in Automated Warehouses

The pebble-motion on graphs is a subcategory of multi-agent pathfinding ...

Please sign up or login with your details

Forgot password? Click here to reset