Parametrized motion planning and topological complexity

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

In this paper we study paramertized motion planning algorithms which provide universal and flexible solutions to diverse motion planning problems. Such algorithms are intended to function under a variety of external conditions which are viewed as parameters and serve as part of the input of the algorithm. Continuing a recent paper, we study further the concept of parametrized topological complexity. We analyse in full detail the problem of controlling a swarm of robots in the presence of multiple obstacles in Euclidean space which served for us a natural motivating example. We present an explicit parametrized motion planning algorithm solving the motion planning problem for any number of robots and obstacles.. This algorithm is optimal, it has minimal possible topological complexity for any d odd. Besides, we describe a modification of this algorithm which is optimal for d even. We also analyse the parametrized topological complexity of sphere bundles using the Stiefel - Whitney characteristic classes.


page 1

page 2

page 3

page 4


Sequential parametrized motion planning and its complexity, II

This is a continuation of our recent paper in which we developed the the...

Parametrised collision-free optimal motion planning algorithms in Euclidean spaces

We present optimal parametrised motion planning algorithms which can be ...

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

Parametrized motion planning algorithms have high degrees of universalit...

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...

Paramater Optimization for Manipulator Motion Planning using a Novel Benchmark Set

Sampling-based motion planning algorithms have been continuously develop...

Robots That Do Not Avoid Obstacles

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

Please sign up or login with your details

Forgot password? Click here to reset