arXiv · 2105.07980
Introducci\'on a la teor\'ia de complejidad topol\'ogica
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.
Explore related subjects
Keep this discovery
Cesar A. Ipanaque Zapata, Rodolfo J. Gálvez Pérez. 2021-05-17. Introducci\'on a la teor\'ia de complejidad topol\'ogica. https://doi.org/10.15381/pesquimat.v24i1.20428
Cite the original work for its findings. Save a collection to share your selection of sources.