turkmath.org

A motion planning program is a rule assigning a continuous path to given two configurations - initial point and desired final point of a robot. In the talk, we will introduce the mathematics which is used in modelling such a problem and talk about "topological complexity" which measures the discontinuity of any motion planner in a configuration space. Then we will focus on higher topological complexities. That is a notion related to motion planning problem which assigns a continuous path to given n configurations.