Topology of parametrised motion planning algorithms

Abstract

In this paper we introduce and study a new concept of parametrised topological complexity, a topological invariant motivated by the motion planning problem of robotics. In the parametrised setting, a motion planning algorithm has high degree of universality and flexibility, it can function under a variety of external conditions (such as positions of the obstacles etc). We explicitly compute the parameterised topological complexity of obstacle-avoiding collision-free motion of many particles (robots) in 3-dimensional space. Our results show that the parameterised topological complexity can be significantly higher than the standard (nonparametrised) invariant.

To appear in SIAM Journal of Applied Algebra and Geometry

Cited by in corpus (4)

• On sequential versions of distributional topological complexity
• Equivariant parametrized topological complexity
• Sequential parametrized topological complexity and related invariants
• LS-category and sequential topological complexity of symmetric products