Sequential parametrized motion planning and its complexity, II

by   Michael Färber, et al.
Queen Mary University of London

This is a continuation of our recent paper in which we developed the theory of sequential parametrized motion planning. A sequential parametrized motion planning algorithm produced a motion of the system which is required to visit a prescribed sequence of states, in a certain order, at specified moments of time. In the previous publication we analysed the sequential parametrized topological complexity of the Fadell - Neuwirth fibration which in relevant to the problem of moving multiple robots avoiding collisions with other robots and with obstacles in the Euclidean space. Besides, in the preceeding paper we found the sequential parametrised topological complexity of the Fadell - Neuwirth bundle for the case of the Euclidean space R^d of odd dimension as well as the case d=2. In the present paper we give the complete answer for an arbitrary d≥ 2 even. Moreover, we present an explicit motion planning algorithm for controlling multiple robots in R^d having the minimal possible topological complexity; this algorithm is applicable to any number n of robots and any number m≥ 2 of obstacles.


page 1

page 2

page 3

page 4


Parametrized motion planning and topological complexity

In this paper we study paramertized motion planning algorithms which pro...

Collision free motion planning on a wedge of circles

We exhibit an algorithm with continuous instructions for two robots movi...

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

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

Multitasking collision-free motion planning algorithms in Euclidean spaces

We present optimal motion planning algorithms which can be used in desig...

ST-RRT*: Asymptotically-Optimal Bidirectional Motion Planning through Space-Time

We present a motion planner for planning through space-time with dynamic...

Robots That Do Not Avoid Obstacles

The motion planning problem is a fundamental problem in robotics, so tha...

Motion Planning for Multiple Unit-Ball Robots in R^d

We present a decoupled algorithm for motion planning for a collection of...

Please sign up or login with your details

Forgot password? Click here to reset