Preference-based planning: Difference between revisions

Revision as of 21:32, 6 March 2020

Revision as of 12:49, 29 July 2020

Line 1:

{{short description|Form of automated planning and scheduling}}

In [[artificial intelligence]], '''preference-based planning''' is a form of [[automated planning and scheduling]] which focuses on producing plans that additionally satisfy as many user-specified [[preference]]s as possible. In many [[problem ___domain]]sdomains, a task can be accomplished by various sequences of actions (also known as plans). These plans can vary in quality: there can be many ways to solve a problem but one generally prefers a way that is, e.g., cost-effective, quick and safe.

Preference-based planners take these preferences into account when producing a plan for a given problem. Examples of preference-based planning software include ''PPLAN''<ref name="pplan">[http://www.cs.toronto.edu/~sheila/PPLAN/ PPLAN], Bienvenu et al.</ref> and ''HTNPlan-P''<ref name="htnplanp">[http://www.cs.toronto.edu/kr/publications/1242050782_Sohrabi-IJCAI09.pdf HTN Planning with Preferences], Sohrabi et al.</ref> (preference-based [[Hierarchical task network|HTN planning]]).