Abstract. In this paper we study a notion of topological complexity TC(X) for the motion planning problem. TC(X) is a number which measures discontinuity of the process of motion planning in the configuration space X . More precisely, TC(X) is the minimal number k such that there are k different "motion planning rules," each defined on an open subset of X× X , 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 TC(X) . We give an upper bound for TC(X) (in terms of the dimension of the configuration space X ) and also a lower bound (in 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: spheres, two-dimensional surfaces, 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.
[1]
J. Schwartz,et al.
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
,
1983
.
[2]
R. Ho.
Algebraic Topology
,
2022
.
[3]
Michael Farber,et al.
Instabilities of Robot Motion
,
2002,
ArXiv.
[4]
V. A. Vassil’ev.
Cohomology of Braid Groups and Complexity
,
1993
.
[5]
Stephen Smale,et al.
On the topology of algorithms, I
,
1987,
J. Complex..
[6]
Micha Sharir,et al.
Algorithmic motion planning
,
2004,
Handbook of Discrete and Computational Geometry, 2nd Ed..
[7]
I. James.
On category, in the sense of Lusternik-Schnirelmann
,
1978
.