Topological complexity of motion planning

Details Topological complexity of motion planning Topological complexity of motion planning

2001-11-18

arxiv.org/abs/math/0111197v1

Mathematics

Algebraic Topology

11 pages. 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Topological complexity of motion planning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Topological complexity of motion planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological complexity of motion planning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-231220