Generating diverse plans to handle unknown and partially known user preferences

Tuan Anh Nguyen, Minh Do, Alfonso Emilio Gerevini, Ivan Serina, Biplav Srivastava, Subbarao Kambhampati

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

Current work in planning with preferences assumes that user preferences are completely specified, and aims to search for a single solution plan to satisfy these. In many real world planning scenarios, however, the user may provide no knowledge or at best partial knowledge of her preferences with respect to a desired plan. In such situations, rather than presenting a single plan as the solution, the planner must instead provide a set of plans containing one or more plans that are similar to the one that the user really prefers. In this paper, we first propose the usage of different measures to capture the quality of such plan sets. These are domain-independent distance measures based on plan elements (such as actions, states, or causal links) if no knowledge of the user preferences is given, or the Integrated Convex Preference (ICP) measure in case incomplete knowledge of such preferences is provided. We then investigate various heuristic approaches to generate sets of plans in accordance with these measures, and present empirical results that demonstrate the promise of our methods.

Original languageEnglish (US)
Pages (from-to)1-31
Number of pages31
JournalArtificial Intelligence
Volume190
DOIs
StatePublished - Oct 2012

Fingerprint

Planning
planning
User Preferences
heuristics
scenario
Scenarios
Causal
Partial Knowledge
Real World
Incomplete
Heuristics
present
knowledge

Keywords

  • Diverse plans
  • Heuristics
  • Partial preferences
  • Planning
  • Search

ASJC Scopus subject areas

  • Artificial Intelligence
  • Language and Linguistics
  • Linguistics and Language

Cite this

Generating diverse plans to handle unknown and partially known user preferences. / Nguyen, Tuan Anh; Do, Minh; Gerevini, Alfonso Emilio; Serina, Ivan; Srivastava, Biplav; Kambhampati, Subbarao.

In: Artificial Intelligence, Vol. 190, 10.2012, p. 1-31.

Research output: Contribution to journalArticle

Nguyen, Tuan Anh ; Do, Minh ; Gerevini, Alfonso Emilio ; Serina, Ivan ; Srivastava, Biplav ; Kambhampati, Subbarao. / Generating diverse plans to handle unknown and partially known user preferences. In: Artificial Intelligence. 2012 ; Vol. 190. pp. 1-31.
@article{7f7bd95a0fa145d9a5d0e065bf0a9369,
title = "Generating diverse plans to handle unknown and partially known user preferences",
abstract = "Current work in planning with preferences assumes that user preferences are completely specified, and aims to search for a single solution plan to satisfy these. In many real world planning scenarios, however, the user may provide no knowledge or at best partial knowledge of her preferences with respect to a desired plan. In such situations, rather than presenting a single plan as the solution, the planner must instead provide a set of plans containing one or more plans that are similar to the one that the user really prefers. In this paper, we first propose the usage of different measures to capture the quality of such plan sets. These are domain-independent distance measures based on plan elements (such as actions, states, or causal links) if no knowledge of the user preferences is given, or the Integrated Convex Preference (ICP) measure in case incomplete knowledge of such preferences is provided. We then investigate various heuristic approaches to generate sets of plans in accordance with these measures, and present empirical results that demonstrate the promise of our methods.",
keywords = "Diverse plans, Heuristics, Partial preferences, Planning, Search",
author = "Nguyen, {Tuan Anh} and Minh Do and Gerevini, {Alfonso Emilio} and Ivan Serina and Biplav Srivastava and Subbarao Kambhampati",
year = "2012",
month = "10",
doi = "10.1016/j.artint.2012.05.005",
language = "English (US)",
volume = "190",
pages = "1--31",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",

}

TY - JOUR

T1 - Generating diverse plans to handle unknown and partially known user preferences

AU - Nguyen, Tuan Anh

AU - Do, Minh

AU - Gerevini, Alfonso Emilio

AU - Serina, Ivan

AU - Srivastava, Biplav

AU - Kambhampati, Subbarao

PY - 2012/10

Y1 - 2012/10

N2 - Current work in planning with preferences assumes that user preferences are completely specified, and aims to search for a single solution plan to satisfy these. In many real world planning scenarios, however, the user may provide no knowledge or at best partial knowledge of her preferences with respect to a desired plan. In such situations, rather than presenting a single plan as the solution, the planner must instead provide a set of plans containing one or more plans that are similar to the one that the user really prefers. In this paper, we first propose the usage of different measures to capture the quality of such plan sets. These are domain-independent distance measures based on plan elements (such as actions, states, or causal links) if no knowledge of the user preferences is given, or the Integrated Convex Preference (ICP) measure in case incomplete knowledge of such preferences is provided. We then investigate various heuristic approaches to generate sets of plans in accordance with these measures, and present empirical results that demonstrate the promise of our methods.

AB - Current work in planning with preferences assumes that user preferences are completely specified, and aims to search for a single solution plan to satisfy these. In many real world planning scenarios, however, the user may provide no knowledge or at best partial knowledge of her preferences with respect to a desired plan. In such situations, rather than presenting a single plan as the solution, the planner must instead provide a set of plans containing one or more plans that are similar to the one that the user really prefers. In this paper, we first propose the usage of different measures to capture the quality of such plan sets. These are domain-independent distance measures based on plan elements (such as actions, states, or causal links) if no knowledge of the user preferences is given, or the Integrated Convex Preference (ICP) measure in case incomplete knowledge of such preferences is provided. We then investigate various heuristic approaches to generate sets of plans in accordance with these measures, and present empirical results that demonstrate the promise of our methods.

KW - Diverse plans

KW - Heuristics

KW - Partial preferences

KW - Planning

KW - Search

UR - http://www.scopus.com/inward/record.url?scp=84863479544&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863479544&partnerID=8YFLogxK

U2 - 10.1016/j.artint.2012.05.005

DO - 10.1016/j.artint.2012.05.005

M3 - Article

AN - SCOPUS:84863479544

VL - 190

SP - 1

EP - 31

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

ER -