Beyond the Plan-Length Criterion

  • Authors:
  • Alexander Nareyek

  • Affiliations:
  • -

  • Venue:
  • ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Resources such as food, hit points or magical power are standard features of today's computer games. Computer-guided characters often have goals that are related to these resources and must take this into account in planning their behavior. In the field of artificial intelligence, resource-based action planning systems have recently begun to mushroom. However, these systems still tend to neglect resources. Conventional plan length is the primaryoptimization goal, resources being of onlysecondaryimp ortance. This paper illustrates the problem and gives an overview of the EXCALIBUR agent's planning system, which overcomes these deficiencies byapply ing an extended constraint programming framework to planning. It allows the search space to be explored without the need to focus on plan length, makes it possible to optimize other criteria like resource-related properties and promotes the inclusion of domain-dependent knowledge to guide and accelerate the search for a plan.