On the complexity of parametrized motion planning algorithms
Abstract
We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On 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.
Cite
@article{arxiv.2508.17629,
title = {On the complexity of parametrized motion planning algorithms},
author = {Navnath Daundkar and Ekansh Jauhari},
journal= {arXiv preprint arXiv:2508.17629},
year = {2026}
}
Comments
Minor changes made based on the referee report. To appear in the SIAM Journal on Applied Algebra and Geometry. May differ slightly from the published version