Abstract: Topological complexity is a measure of how hard it is for an autonomous robot to navigate between states in its configuration space. Sequential (or higher) topological complexity requires the robot to take intermediate configurations along the way from initial to final configurations. The basic question is: is there something interesting that can be said about the way one goes from one higher topological complexity to the next one (i.e. with one more intermediate configuration)? In this talk, after introducing the necessary background, I will explore this question by presenting various results and examples that hint at just such a relationship.