Planning with generic types

  • Authors:

  • Derek Long;Maria Fox

  • Affiliations:

  • Department of Computer Science, University of Durham, United Kingdom;Department of Computer Science, University of Durham, United Kingdom

  • Venue:
  • Exploring artificial intelligence in the new millennium
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Domain-independent, or knowledge-sparse, planning has limited practical application because of the failure of brute-force search to scale to address real problems. However, requiring a domain engineer to take responsibility for directing the search behavior of a planner entails a heavy burden of representation and leads to systems that have no general application. An interesting compromise is to use domain analysis techniques to extract features from a domain description that can exploited to good effect by a planner. In this chapter we discuss the process by which generic patterns of behavior can be recognized in a domain, by automatic techniques, and appropriate specialized technologies recruited to assist a planner in efficient problem solving in that domain. We describe the integrated architecture of STAN5 and present results to demonstrate its potential on a variety of planning domains, including two that are currently beyond the problem-solving power of existing knowledge-sparse approaches.