arXiv · 2401.11015
Topological complexity of Milnor fibration
Abstract
In this paper we discover a connection between the Milnor fibration theory and current research trends in topological robotics. The configuration space and workspace are often described as subspaces of some Euclidean spaces. The work map is a continuous map which assigns to each state of the configuration space the position of the end-effector at that state. The tasking planning problem consists in study the complexity and design of algorithms controlling the task performed by the robot manipulator. We study the tasking planning problem for the Milnor fibration of analytic map germs. We see that the tasking planning algorithms strongly depend of the Milnor fibration theorem. We conjecture that the topological complexity of Milnor fibration coincides with the topological complexity of its base.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Cesar A. Ipanaque Zapata, Taciana O. Souza. 2024-01-19. Topological complexity of Milnor fibration. https://arxiv.org/abs/2401.11015
Cite the original work for its findings. Save a collection to share your selection of sources.