On the Complexity of Parametrized Motion Planning Algorithms
SIAM Journal on Applied Algebra and Geometry · 31.12.2026 · 10 (4) · 767-796
DOI: 10.1137/25m1793535 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Applied Algebra and Geometry, online erschienen am 02.11.2026. Verfasst von Navnath Daundkar und 1 weiteren Autor:innen. Die Arbeit nennt 43 Literaturangaben. Gefördert von: DST-INSPIRE.
Abstract (Originalsprache)
We study a probabilistic variant of the [Formula: see text]th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On the one hand, we use cohomology to show that this new invariant behaves similarly to the classical invariant on Fadell–Neuwirth fibrations and oriented sphere bundles; on the other hand, we use equivariant homotopy theory to prove that its behavior is wildly different on bundles whose fibers are real projective spaces and whose structure groups are special orthogonal groups. We also explore several other features of our invariant and its relationships with various other invariants motivated by topological robotics.
Förderung
- DST-INSPIRE
Zitieren
APA
Daundkar, N., & Jauhari, E. (2026). On the Complexity of Parametrized Motion Planning Algorithms. SIAM Journal on Applied Algebra and Geometry, 10(4), 767-796. https://doi.org/10.1137/25m1793535
Vancouver
Daundkar N, Jauhari E. On the Complexity of Parametrized Motion Planning Algorithms. SIAM Journal on Applied Algebra and Geometry. 2026;10(4):767-796. doi:10.1137/25m1793535
BibTeX
@article{Daundkar2026,
author = {Daundkar, Navnath and Jauhari, Ekansh},
title = {On the Complexity of Parametrized Motion Planning Algorithms},
journal = {SIAM Journal on Applied Algebra and Geometry},
year = {2026},
volume = {10},
number = {4},
pages = {767--796},
doi = {10.1137/25m1793535}
}
EUVIMED