Topological Robotics: Subspace Arrangements and Collision Free Motion Planning

Details Topological Robotics: Subspace Arrangements and Collision Free Motion Planning Topological Robotics: Subspace Arrangements and Collision Free Motion Planning

2002-10-08

arxiv.org/abs/math/0210115v1

Mathematics

Algebraic Topology

11 pages

Scientific paper

We study an elementary problem of the topological robotics: collective motion of a set of $n$ distinct particles which one has to move from an initial configuration to a final configuration, with the requirement that no collisions occur in the process of motion. The ultimate goal is to construct an algorithm which will perform this task once the initial and the final configurations are given. This reduces to a topological problem of finding the topological complexity TC(C_n(\R^m)) of the configutation space C_n(\R^m) of $n$ distinct ordered particles in \R^m. We solve this problem for m=2 (the planar case) and for all odd m, including the case m=3 (particles in the three-dimensional space). We also study a more general motion planning problem in Euclidean space with a hyperplane arrangement as obstacle.

Affiliated with

Also associated with

No associations

Rating

Topological Robotics: Subspace Arrangements and Collision Free 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 Robotics: Subspace Arrangements and Collision Free Motion Planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological Robotics: Subspace Arrangements and Collision Free Motion Planning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549008