Topological Complexity

Alexander Dranishnikov
University of Florida
Distinguised Professor of Mathematics

“Topology of the configuration space of a robot or any mechanical system is usually quite complicated. This implies that a   continuous motion planning algorithm of such system is impossible. Thus, any motion planning algorithm of the system has to be split in several pieces. The minimal number of such pieces is called the topological complexity TC(X) of the configuration space X.
We will discuss how TC can be estimated and how it is related to classical invariants in topology like dimension and the LS-category.”.

View Dranishnikov Event Flyer