Topological complexity and motion planning in certain real grassmannians Original Research Article

Let TC(X) be the topological complexity of a path-connected topological space X. We first give a lower bound on TC(Gk(View the MathML sourcem)), the Grassmannian of real k-planes in View the MathML sourcem. We then compute TC(Gk(View the MathML sourcem)) for (k, m) = (2, 4) and relate it to the motion planning problem of topological robotics.