Over-subscription planning with numeric goals

  • Authors:

  • J. Benton;Minh B. Do;Subbarao Kambhampati

  • Affiliations:

  • Computer Sci. & Eng. Dept., Arizona State University, Tempe, AZ;Embedded Reasoning Area, Palo Alto Research Center, Palo Alto, CA;Computer Sci. & Eng. Dept., Arizona State University, Tempe, AZ

  • Venue:
  • IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

By relaxing the hard-goal constraints from classical planning and associating them with reward values, over-subscription planning allows users to concentrate on presenting what they want and leaves the task of deciding the best goals to achieve to the planner. In this paper, we extend the over-subscription planning problem and its limited goal specification to allow numeric goals with continuous utility values and goals with mixed hard and soft constraints. Together they considerably extend the modeling power of goal specification and allow the user to express goal constraints that were not possible before. To handle these new goal constraints, we extend the Sapaps planner's planning graph based techniques to help it choose the best beneficial subset of goals that can include both hard or soft logical and numeric goals. We also provide empirical results in several benchmark domains to demonstrate that our technique helps return quality plans.