Motion planning algorithms for configuration spaces (Q496855)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Motion planning algorithms for configuration spaces
scientific article

    Statements

    Motion planning algorithms for configuration spaces (English)
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    Let \(F(k,n)\) be the topological space of configurations of \(k\) labelled points in \(\mathbb R^n\). The topological complexity and the Lusternik--Schnirelmann category of \(F(k,n)\) were calculated, respectively, in [\textit{M. Farber} and \textit{M. Grant}, Proc. Am. Math. Soc. 137, No. 5, 1841--1847 (2009; Zbl 1172.55006)] and [\textit{F. Roth}, Geom. Topol. Monogr. 13, 447--461 (2008; Zbl 1145.55003)]. The authors give more simple and direct calculations of the above-mentioned invariants.
    0 references
    configuration spaces
    0 references
    Lusternik-Schnirelmann category
    0 references
    motion planning
    0 references
    topological complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references