arXiv · 1607.00703
Topological complexity and efficiency of motion planning algorithms
Abstract
We introduce a variant of Farber's topological complexity, defined for smooth compact orientable 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".
Explore related subjects
Keep this discovery
Zbigniew Błaszczyk, José Carrasquel. 2016-07-04. Topological complexity and efficiency of motion planning algorithms. https://doi.org/10.4171/rmi%2F1039
Cite the original work for its findings. Save a collection to share your selection of sources.