Topological complexity and efficiency of motion planning algorithms

• Zbigniew Błaszczyk ^[1] ; José Gabriel Carrasquel-Vera ^[1]
  1. [1] Adam Mickiewicz University in Poznań

     Adam Mickiewicz University in Poznań

     Poznań, Polonia

     
• Localización: Revista matemática iberoamericana, ISSN 0213-2230, Vol. 34, Nº 4, 2018, págs. 1679-1684
• Idioma: inglés
• DOI: 10.4171/rmi/1039
• Texto completo no disponible (Saber más ...)
• Resumen

  • We introduce a variant of Farber’s topological complexity, defined for smooth compact Riemannian manifolds, which takes into account only motion planners with the lowest possible “average length” of the output paths. We prove that it never differs from topological complexity by more than 1, thus showing that the latter invariant addresses the problem of the existence of motion planners which are “efficient”.