2025/03/03 by Yuki Minowa, Minowa, Yuki
Business, Management and Accounting · Computer Science · #55M30 #55P62 #Advanced Algebra and Logic #Advanced Graph Theory Research #Algebraic Topology (math.AT) #FOS: Mathematics #University-Industry-Government Innovation Models
paper · pdf · doi:10.48550/arxiv.2503.01123
openalex publication_date 2025/03/03 · openalex created_date 2025/10/12 · openalex updated_date 2026/07/28
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological complexity in view of rational homotopy theory. We generalize results on topological complexity, and in particular, give an explicit algebraic upper bound for sequential parametrized topological complexity when a fibration admits a certain decomposition, which is a generalization of the result of Hamoun, Rami and Vandembroucq on topological complexity.