Library

Topological complexity of collision-free multi-tasking motion planning on orientable surfaces

We compute the higher topological complexity of ordered configuration spaces of orientable surfaces, thus extending Cohen-Farber's description of the ordinary topological complexity of those spaces.

MathematicsComputer Science
Source

Paper

Similar papers

Topological complexity and efficiency of motion planning algorithmsZbigniew Błaszczyk, J. Carrasquel2016 · Revista matemática iberoamericana · 10 citations In Library
Parametrized topological complexity of collision-free motion planning in the planeDaniel C. Cohen, Michael Färber, Shmuel Weinberger2022 · Annals of Mathematics and Artificial Intelligence In Library
Parametrized topological complexity of collision-free motion planning in the planeDaniel C. Cohen, Michael Färber, Shmuel Weinberger2020 · arXiv (Cornell University) · 24 citations In Library
Lusternik-Schnirelmann category and based topological complexities of motion planningYongheng Zhang2015 · arXiv: Algebraic Topology · 0 citations In Library
Topology of Parametrized Motion Planning AlgorithmsDaniel C. Cohen, Michael Farber, Shmuel Weinberger2021 · SIAM Journal on Applied Algebra and Geometry In Library
Topology of Parametrized Motion Planning AlgorithmsDaniel C. Cohen, M. Farber, S. Weinberger2020 · SIAM Journal on applied algebra and geometry · 34 citations In Library
Sequential motion planning assisted by group actionsEmmett Balzer, Enrique Torres-Giese2021 · 2 citations In Library
Bidirectional sequential motion planningEnrique Torres-Giese2019 · Boletín de la Sociedad Matematica Mexicana · 1 citation In Library
Configuration Spaces and Robot Motion Planning AlgorithmsM. Farber2017 · arXiv: Algebraic Topology · 30 citations In Library
Parametrized motion planning and topological complexityMichael Färber, Shmuel Weinberger2022 · arXiv (Cornell University) · 10 citations In Library
© 2026 NYSGPT2525 LLC