On the Topology of Discrete Strategies

  • Authors:
  • Michael Erdmann

  • Affiliations:
  • School of Computer Science, Carnegie Mellon University,5000 Forbes Avenue, Pittsburgh, PA 15213-3891, USA

  • Venue:
  • International Journal of Robotics Research
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we explore a topological perspective of planning in the presence of uncertainty, focusing on tasks specified by goal states in discrete spaces. We introduce strategy complexes. A strategy complex is the collection of all plans for attaining all goals in a given space. Plans are like jigsaw pieces. Understanding how the pieces fit together in a strategy complex reveals structure. That structure characterizes the inherent capabilities of an uncertain system. By adjusting the jigsaw pieces in a design loop, one can build systems with desired competencies. The paper draws on representations from combinatorial topology, Markov chains, and polyhedral cones. Triangulating between these three perspectives produces a topological language for describing concisely the capabilities of uncertain systems, analogous to the concepts of reachability and controllability in other disciplines. The major nouns in this language are topological spaces. Three key theorems illustrate the sentences in this language. (a) Goal attain-ability: There exists a strategy for attaining a particular goal from anywhere in a system if and only if the strategy complex of a slightly modified system is homotopic to a sphere. (b) Full controllability : A system can move between any two states despite control uncertainty precisely when its strategy complex is homotopic to a sphere of dimension two less than the number of states. (c) General structure: Any systemâ聙聶s strategy complex is homotopic to the product of a spherical part, modeling full controllability on subspaces, and a general part, modeling adversarial capabilities. This paper contains a number of additional results required as stepping stones, along with many examples. We provide algorithms for computing the key structures described. Finally, we show that some interesting questions are hard. For instance, it is NP-complete to determine the most precisely attainable goal of a system with perfect sensing, but uncertain control.