|Date: Tuesday, April 21, 2015
Title: Topology of robot motion planning
Michael Farber defined the topological complexity TC(X) of a topological space
X as a number that measures the complexity of the navigation problem in X viewed as
the configuration space of a system. We will discuss the problem of computation of TC(X)
and the relation of TC to the classical Lusternik-Schnirelmann category.
Speaker: Alexander Dranishnikov
Institution: University of Florida