Answers are grounded in this paper and cite their sources.
Parametrized motion planning algorithms [3] 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 [3,4] for r = 2 and in [10] 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 secat f [p : E → B] which plays an important role in the study of sectional category of towers of fibrations.
No takes yet. Share an insight, caveat, or question.
Färber et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: