Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
This lecture explores rational sequential parametrized topological complexity, a numerical homotopy invariant of fibration that has applications in robot motion planning with external constraints. Discover how this concept can be analyzed through rational homotopy theory, including an explicit algebraic upper bound for sequential parametrized topological complexity when a fibration admits certain decompositions. Learn about this generalization of Hamoun, Rami and Vandembroucq's work on topological complexity, and explore a variant of the TC-generating function introduced by Farber and Oprea. The presentation provides valuable insights for researchers and students interested in applied algebraic topology and its practical applications in robotics.
