Sequential parametrized topological complexity and related invariants

arXiv2209.01990MaRDI QIDQ6409766FDOQ6409766

Authors: Michael Farber, John Oprea 

Publication date: 5 September 2022

Abstract: Parametrized motion planning algorithms cite{CFW} have a high degree of universality and flexibility; they generate the motion of a robotic system under a variety of external conditions. The latter are viewed as parameters and constitute part of the input of the algorithm. The concept of sequential parametrized topological complexity ${sfTC}_r[p:EoB]$ is a measure of the complexity of such algorithms. It was studied in cite{CFW, CFW2} for $r=2$ and in cite{FP} for $rge2$. In this paper we analyse the dependence of the complexity ${sfTC}_r[p:EoB]$ on an initial bundle with structure group $G$ and on its fibre $X$ viewed as a $G$-space. Our main results estimate ${sfTC}_r[p:EoB]$ in terms of certain invariants of the bundle and the action on the fibre. Moreover, we also obtain estimates depending on the base and the fibre. Finally, we develop a calculus of sectional categories featuring a new invariant ${sfsecat}_f[p:EoB]$ which plays an important role in the study of sectional category of towers of fibrations.

Mathematics Subject Classification ID

Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30)

This page was built for publication: Sequential parametrized topological complexity and related invariants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409766)