Advancing topological robotics: Topological complexities of robot motion planning.

摘要

In the early 2000s Michael Farber introduced the topological complexity of robot motion planning, to solve the problem of finding the minimum number of instructions for robot motion. We hereby introduce work on the topological complexity of planning M-motions. This concept generalizes Farber's TC and is not completely determined by TC. We also explore symmetric topological complexities, in which instructions yield symmetric motions.