Topological complexity and motion planni
β
K.J Pearson; Tan Zhang
π
Article
π
2004
π
Elsevier Science
π
English
β 230 KB
Let TC(X) be the topological complexity of a path-connected topological space X. We first give a lower bound on TC(Gk(]~m)), the Grassmannian of real /z-planes in Jt~ m. We then compute TC(Gk (~m)) for (k, m) = (2, 4) and relate it to the motion planning problem of topological robotics. (~) 2004 El