Sequential parametrized topological complexity and related invariants

Abstract

Parametrized motion planning algorithms 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 TCr[p:E B] is a measure of the complexity of such algorithms. It was studied in CFW, CFW2 for r=2 and in FP for r 2. In this paper we analyse the dependence of the complexity TCr[p:E B] on an initial bundle with structure group G and on its fibre X viewed as a G-space. Our main results estimate TCr[p:E B] 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 secatf[p:E B] which plays an important role in the study of sectional category of towers of fibrations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…