Parametrized topological complexity of spherical fibrations over spheres
Yuki Minowa

TL;DR
This paper studies the parametrized topological complexity of spherical fibrations over spheres, providing explicit bounds and calculations to understand the complexity of motion planning with external constraints.
Contribution
It introduces explicit bounds and computes the parametrized topological complexity for certain spherical fibrations, advancing understanding of motion planning complexity.
Findings
Lower bounds in terms of weak category are established.
Parametrized topological complexity is explicitly computed for some fibrations.
Results enhance understanding of motion planning under external constraints.
Abstract
Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of spherical fibrations over spheres. We explicitly compute a lower bound in terms of weak category and determine the parametrized topological complexity of some spherical fibrations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Computational Geometry and Mesh Generation · Topological and Geometric Data Analysis
