Alexander Dranishnikov: On topological complexity of robot motion planning

Serdecznie zapraszamy pracowników oraz studentów na seminarium wydziałowe, które odbędzie się we wtorek 24 września o godz. 14.15 (Instytut Informatyki, sala 119). Prelegentem będzie prof. Alexander Dranishnikov (University of Florida), który wygłosi wykład On topological complexity of robot motion planning

Przed wykładem od 13.45 zaprasza tradycyjne ciastka i kawę.

Streszczenie: The topological complexity TC(X) was introduced by Farber as a numerical invariant of the robot’s space of states X. Since TC is a homotopy invariant, it can be extended to discrete groups. Though it was well-studied for the last 25 years, there are only a few classes of groups where it was computed. In the talk we will compare TC with its new cousin dTC, a probabilistic version of TC, and discuss the problem of computation of both invariants for discrete groups and some classic manifolds.