Sequential parametrized motion planning and its complexity
Let \(p:E\to B\) be a Hurewicz fibration and \(E^I_B\) is a subspace of \(E^I\) consisting of all paths \(\alpha: I\to E\) such that \(p\alpha:I\to B\) is constant. Fix an integer \(r \geq 2\) and put \[ E_B^r=\{(e_1,\dots,e_r)\in E^r; p(e_1)=\dots =p(e_r)\}. \] Take \(r\) points \(0\leq t_1<\dots<t_r\leq 1\) in \(I\). Consider the fibration \[ \Pi_r: E_B^I\to E_B^r,\quad \Pi_r(\alpha)=(\alpha(t_1, \dots, \alpha(t_r)). \] The \(r\)-th sequential parametrized topological complexity of the fibration \(p : E\to B\), denoted \(\operatorname{TC}_r[p]:=\operatorname{TC}_r[p : E\to B]\), is defined as the sectional category of the fibration \(\Pi_r\). If \(B\) is the one-point space then \(\operatorname{TC}_r[p]\) is equal to the sequential topological complexity \(\operatorname{TC}_r(E)\) described in [\textit{I. Basabe} et al., Algebr. Geom. Topol. 14, No. 4, 2103--2124 (2014; Zbl 1348.55005); \textit{Y. B. Rudyak}, Topology Appl. 157, No. 5, 916--920 (2010; Zbl 1187.55001)]. So, in general situation, the space \(B\) turns out to be a space of parameters. This justified the name ``parametrizes in the definition. The authors settles some properties of \(\operatorname{TC}_r[p]\) (fiber homotopy invariance, behaviour with respect to products, an inequality \(\operatorname{TC}_{r+1}[p]\geq \operatorname{TC}_r[p]\), upper and lover bounds, cup-lengths estimations).Then they treat in details the sequential parametrized topological complexity of the Fadell-Neuwirth bundle. In the last section the authors consider the \(\operatorname{TC}\)-generation \(\mathscr T(t)_{[p]}=\sum_r\operatorname{TC}_r[p]\cdot t^r\) associated with the fibration \(p:E \to B\). The authors give some examples and pose the following interesting question: When the generating \(\operatorname{TC}_{[p]}\) is a rational function or, more specifically, when the sequence \(\{\operatorname{TC}r[p]\}\) is eventually constant. For example, this holds for Fadell-Neuwirth bundles.
- Sequential parametrized motion planning and its complexity. II
- Topology of parametrized motion planning algorithms
- Parametrized topological complexity of sphere bundles
- Parametrized topological complexity of collision-free motion planning in the plane
- Topological complexity is a fibrewise L-S category
- A note on covers defining relative and sectional categories
- Configuration Spaces.
- Generating functions and topological complexity
- Higher topological complexity and its symmetrization
- Higher topological complexity of aspherical spaces
- scientific article; zbMATH DE number 1544063 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3246961 (Why is no real title available?)
- On higher analogs of topological complexity
- On topological complexity of hyperbolic groups
- Parametrized topological complexity of collision-free motion planning in the plane
- Planning Algorithms
- Sequential motion planning of non-colliding particles in Euclidean spaces
- The genus of a fiber space
- Topological Complexity and Related Topics
- Topological complexity of motion planning
- Topology of parametrized motion planning algorithms
- Topology of robot motion planning
- A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
- Bidirectional sequential motion planning
- Parametrized topological complexity of collision-free motion planning in the plane
- Parametrized topological complexity of poset-stratified spaces
- On soft predicates in subdivision motion planning
- Sequential parametrized motion planning and its complexity. II
- Sequential motion planning of non-colliding particles in Euclidean spaces
- Topology of parametrized motion planning algorithms
- Parametrized topological complexity of sphere bundles
- Sequential Parametrized Motion Planning and its Complexity
- Sequential parametrized topological complexity and related invariants
- Sequential parametrized topological complexity of sphere bundles
- Autonomous robots, motion algorithms and topology
- Sequential parametrized topological complexity of group epimorphisms
- LS-category and sequential topological complexity of symmetric products
- Parametrized topological complexity of spherical fibrations over spheres
- On sequential versions of distributional topological complexity
- The complexity of planar compliant motion planning under uncertainty
This page was built for publication: Sequential parametrized motion planning and its complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2087777)
