Introducci\'on a la teor\'ia de complejidad topol\'ogica
Algebraic Topology
2022-12-08 v1
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.
Cite
@article{arxiv.2105.07980,
title = {Introducci\'on a la teor\'ia de complejidad topol\'ogica},
author = {Cesar A. Ipanaque Zapata and Rodolfo J. Gálvez Pérez},
journal= {arXiv preprint arXiv:2105.07980},
year = {2022}
}
Comments
In spanish. Keywords: Topological complexity, Motion planning problem, Algoritms