arXiv · 2009.06023
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.
Explore related subjects
Keep this discovery
Daniel C. Cohen, Michael Farber, Shmuel Weinberger. 2020-09-13. Topology of parametrised motion planning algorithms. https://doi.org/10.1137/20m1358505
Cite the original work for its findings. Save a collection to share your selection of sources.