pith. sign in

arxiv: 0901.0877 · v1 · pith:HQK4PAAFnew · submitted 2009-01-07 · 🧮 math.AT · math.GT

Topological complexity of collision-free motion planning on surfaces

classification 🧮 math.AT math.GT
keywords complexitytopologicalconfigurationspaceinvariantmotionplanningsystem
0
0 comments X
read the original abstract

The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with configuration space X, the invariant TC(X) measures the complexity of all possible motion planning algorithms designed for the system. In this paper, we compute the topological complexity of the configuration space of n distinct ordered points on an orientable surface. Our main tool is a theorem of B. Totaro describing the cohomology of configuration spaces of algebraic varieties.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.