Introduction to the topological complexity theory
DOI:
https://doi.org/10.15381/pesquimat.v24i1.20428Keywords:
Topological complexity, Motion planning problem, AlgoritmsAbstract
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 optimal algorithms.
Downloads
Published
Issue
Section
License
Copyright (c) 2021 Cesar Augusto Ipanaque Zapata, Rodolfo José Gálvez Pérez
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
THE AUTHORS RETAIN THEIR RIGHTS:
a) The authors retain their trademark and patent rights, and also on any process or procedure described in the article.
b) The authors retain the right to share, copy, distribute, execute and publicly communicate the article published in Pesquimat magazine (for example, place it in an institutional repository or publish it in a book), with recognition of its initial publication in the Pesquimat magazine.
c) The authors retain the right to make a later publication of their work, to use the article or any part of it (for example: a compilation of their works, notes for conferences, thesis, or for a book), provided that they indicate the source of publication (authors of the work, magazine, volume, number and date).