Topology of Parametrized Motion Planning Algorithms
SIAM Journal on Applied Algebra and Geometry · 2021-01 · 5 (2) · 229-249
DOI: 10.1137/20m1358505 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Applied Algebra and Geometry, online erschienen am 16.06.2021. Verfasst von Daniel C. Cohen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 19-mal zitiert (Crossref) und nennt 21 Literaturangaben. Gefördert von: Leverhulme Trust, Louisiana State University, Engineering and Physical Sciences Research Council.
Abstract (Originalsprache)
We introduce and study a new concept of parametrized topological complexity: a topological invariant motivated by the motion planning problem of robotics. In the parametrized setting, a motion planning algorithm has a high degree of universality and flexibility and can function under a variety of external conditions (such as positions of obstacles). We explicitly compute the parametrized topological complexity of obstacle-avoiding collision-free motion of many particles (robots) in 3-dimensional space. Our results show that the parametrized topological complexity can be significantly higher than the standard (nonparametrized) invariant.
Förderung
- Leverhulme Trust
- Louisiana State University
- Engineering and Physical Sciences Research Council
Zitieren
APA
Cohen, D. C., Farber, M., & Weinberger, S. (2021). Topology of Parametrized Motion Planning Algorithms. SIAM Journal on Applied Algebra and Geometry, 5(2), 229-249. https://doi.org/10.1137/20m1358505
Vancouver
Cohen DC, Farber M, Weinberger S. Topology of Parametrized Motion Planning Algorithms. SIAM Journal on Applied Algebra and Geometry. 2021;5(2):229-249. doi:10.1137/20m1358505
BibTeX
@article{Cohen2021,
author = {Cohen, Daniel C. and Farber, Michael and Weinberger, Shmuel},
title = {Topology of Parametrized Motion Planning Algorithms},
journal = {SIAM Journal on Applied Algebra and Geometry},
year = {2021},
volume = {5},
number = {2},
pages = {229--249},
doi = {10.1137/20m1358505}
}
EUVIMED