In this talk, We will define the notion of topological complexity TC(X) for the motion planning problem. We give an upper bound and lower bound for TC(X) and completely calculate the topological complexity of the problem of motion planning for a robot arm in the absence of obstacles. This seminar is based on the work of M. Farber on topological complexity.
