State-Space Search: Summary

• A very abstract characterization of problem solving

  • non-deterministic graph search

• An interesting split between domain-dependent and domain-independent aspects of the process

  • the domain-independent part can be a library

• Extensions to optimizing, adversarial search, continuous spaces

• Disadvantages

  • the “direction” of the search may be wrong (progression versus regression)
  • the domain-independent components are “black boxes”
    • perhaps state generation, goal recognition could be further automated

Previous slide

Next slide

Back to first slide

View graphic version