Sequential motion planning in connected sums of real projective spaces

2019/03/06 by Jorge Aguilar-Guzmán, Aguilar-Guzmán, Jorge, Jesús González +1
Computer Science · Engineering · #55M30 #55S40 #70Q05 #Algebraic Topology (math.AT) #Computational Geometry and Mesh Generation #FOS: Mathematics #Robotic Mechanisms and Dynamics #Robotic Path Planning Algorithms

paper · pdf · doi:10.48550/arxiv.1903.02128

openalex publication_date 2019/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this short note we observe that the higher topological complexity of an iterated connected sum of real projective spaces is maximal possible. Unlike the case of regular TC, the result is accessible through easy mod 2 zero-divisor cup-length considerations.

Related

• Projective product coverings and sequential motion planning algorithms in real projective spaces
• Lusternik-Schnirelmann category and based topological complexities of motion planning
• Topological robotics: motion planning in projective spaces
• On the complexity of parametrized motion planning algorithms
• Bidirectional Sequential Motion Planning