Introducción a la teoría de complejidad topológica
arXiv:2105.07980 · doi:10.15381/pesquimat.v24i1.20428
Abstract
In this work we will review the notion of topological complexity, introduced by Michael Farber in 2003. We will use this theory of topological complexity to solve the motion planning problem of a mobile robot that navigates in the Euclidean plane avoiding colliding with an obstacle. Specifically, we calculate topological complexity and design explicit algorithms.
arXiv commentIn spanish. Keywords: Topological complexity, Motion planning problem, Algoritms