Topological complexity of configuration spaces

Mathematics – Algebraic Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The topological complexity TC(X) is a homotopy invariant which reflects the complexity of the problem of constructing a motion planning algorithm in the space X, viewed as configuration space of a mechanical system. In this paper we complete the computation of the topological complexity of the configuration space of n distinct points in Euclidean m-space for all m>1$ and n>1; the answer was previously known in the cases m=2 and m odd. We also give several useful general results concerning sharpness of upper bounds for the topological complexity.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Topological complexity of configuration spaces 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 configuration spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological complexity of configuration spaces will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-162815

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.