.png){kind=icon}
.png){kind=icon}
Return
Specifying and computing preferred plans
.png){kind=icon}
PRE
AI
DOI：10.1016/j.artint.2010.11.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Knowledge representation
Preferences
Planning with preferences
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W