Topological complexity of motion planning

From MaRDI portal
Publication:1404499

DOI10.1007/S00454-002-0760-9zbMATH Open1038.68130arXivmath/0111197OpenAlexW2116507931MaRDI QIDQ1404499FDOQ1404499


Authors: Michael Farber Edit this on Wikidata


Publication date: 21 August 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: In this paper we study a notion of topological complexity for the motion planning problem. The topological complexity is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, it is the minimal number k such that there are k different motion planning rules, each defined on an open subset of XxX, so that each rule is continuous in the source and target configurations. We use methods of algebraic topology (the Lusternik - Schnirelman theory) to study the topological complexity . We give an upper bound (in terms of the dimension of the configuration space X) and also a lower bound (in the terms of the structure of the cohomology algebra of X). We explicitly compute the topological complexity of motion planning for a number of configuration spaces: for spheres, two-dimensional surfaces, for products of spheres. In particular, we completely calculate the topological complexity of the problem of motion planning for a robot arm in the absence of obstacles.


Full work available at URL: https://arxiv.org/abs/math/0111197




Recommendations





Cited In (only showing first 100 items - show all)





This page was built for publication: Topological complexity of motion planning

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