Planning with Goal Preferences and Constraints

Ronen I. Brafman, Yuri Chernyavsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

53 Scopus citations

Abstract

In classical planning, the planner is given a concrete goal; it returns a plan for it or a failure message. In the latter case, the user can either quit or modify the goal. For many applications, it is more convenient to let the user provide a more elaborate specification consisting of constraints and preferences over possible goal states. Then, let the system discover a plan for the most desirable among the feasible goal states. To materialize such an approach we require a formalism for specifying preferences and constraints over goals and an algorithm for solving the resulting constrained optimiza-tion problem. In this work we motivate the need for planning with preferences and constraints, suggest a rich, yet intuitive formalism for representing goal preferences in the context of a deterministic action model, discuss some of its properties, propose an efficient algorithm for planning with preferences and constraints based on this formalism, and provide extensive experimental analysis in an interesting new domain of configuration planning.

Original languageEnglish
Title of host publicationICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling
Pages182-191
Number of pages10
StatePublished - 2005
Event15th International Conference on Automated Planning and Scheduling, ICAPS 2005 - Monterey, CA, United States
Duration: 5 Jun 200510 Jun 2005

Conference

Conference15th International Conference on Automated Planning and Scheduling, ICAPS 2005
Country/TerritoryUnited States
CityMonterey, CA
Period5/06/0510/06/05

ASJC Scopus subject areas

  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Planning with Goal Preferences and Constraints'. Together they form a unique fingerprint.

Cite this