✦ LIBER ✦

Topological complexity and motion planning in certain real grassmannians

✍ Scribed by K.J Pearson; Tan Zhang

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 230 KB
Volume: 17
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(04)90117-6

No coin nor oath required. For personal study only.

✦ Synopsis

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 Elsevier Ltd. All rights reserved.