Sequential parametrized motion planning and its complexity, II

DOI10.1016/J.TOPOL.2023.108490arXiv2212.01091WikidataQ122233372 ScholiaQ122233372MaRDI QIDQ6419320FDOQ6419320

Authors: Michael Farber, Amit Kumar Paul 

Publication date: 2 December 2022

Abstract: 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 $Bbb{R}^d$ of odd dimension as well as the case $d=2$. In the present paper we give the complete answer for an arbitrary $dge2$ even. Moreover, we present an explicit motion planning algorithm for controlling multiple robots in $Bbb{R}^d$ having the minimal possible topological complexity; this algorithm is applicable to any number $n$ of robots and any number $mge2$ of obstacles.

Mathematics Subject Classification ID

Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30)

This page was built for publication: Sequential parametrized motion planning and its complexity, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419320)