200 likes | 341 Views
This work delves into the topological complexity of rational configuration spaces, focusing on implications in robot motion planning. Key contributions include the definition of topological complexity, foundational properties, and computational methods presented throughout various academic contributions. The synergy between topological robotics and motion planning is highlighted, alongside significant results such as theorems regarding the detection of spaces where topological complexity is minimized. Insights from notable researchers like Michael Farber, Daniel Quillen, and Dennis Sullivan enrich the discourse on rational homotopy theory and its applications in robotics.
E N D
Topological complexity of rational configuration spaces and applications EACAT4 2011
Configuration space Robot motion planning
Jean Claude Latombe, Kluwer 1991 Topological robotics in motion plannings
Topological complexity Remark Michael Farber, 2003
A. Schwarz Firstproperties
Computing thetopologicalcomplexity M. Farber, J. González, S. Tabachnikov, S. Yuzvinsky,… y
Corollary M. Farber, S. Tabachnikov, S. Yuzvinsky, 2003 J. Adem, S. Gitler, I. James, 1972
Problem Michael Farber, 2005
Rationalhomotopytheory: thebasics Dennis Sullivan 1977 Daniel Quillen 1969
Theorem Problem’ Theorem L. Lechuga, A. M.
Theanswer… B. Jessup , A. M., P.E. Parent Theorem
Someapplications… Corollary 1. Topologicalcomplexity of formal spaces
2. Detection of spacesforwhich TC equalscat B. Jessup , A. M., P.E. Parent Theorem
3. Reducedtopologicalcomplexity Theorem
4. A robot withan extra arm Remark Theorem B. Jessup , A. M., P.E. Parent