Specifying and computing preferred plans

  • Authors:
  • Meghyn Bienvenu;Christian Fritz;Sheila A. McIlraith

  • Affiliations:
  • CNRS & Universitéé Paris-Sud, France;Palo Alto Research Center, USA;Department of Computer Science, University of Toronto, Canada

  • Venue:
  • Artificial Intelligence
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we address the problem of specifying and computing preferred plans using rich, qualitative, user preferences. We propose a logical language for specifying preferences over the evolution of states and actions associated with a plan. We provide a semantics for our first-order preference language in the situation calculus, and prove that progression of our preference formulae preserves this semantics. This leads to the development of PPlan, a bounded best-first search planner that computes preferred plans. Our preference language is amenable to integration with many existing planners, and beyond planning, can be used to support a diversity of dynamical reasoning tasks that employ preferences.