Planning with partial preference models

Tuan A. Nguyen, Minh B. Do, Subbarao Kambhampati, Biplav Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact tradeoff between those objectives. When a planner encounters such partial preference models, rather than look for a single optimal plan, it needs to present the pareto set of plans and let the user choose from them. This idea of presenting the full pareto set is fraught with both computational and user-interface challenges. To make it practical, we propose the approach of finding a representative subset of the pareto set. We measure the quality of this representative set using the Integrated Convex Preference (ICP) model, originally developed in the OR community. We implement several heuristic approaches based on the Metric-LPG planner to find a good solution set according to this measure. We present empirical results demonstrating the promise of our approach.

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages1772-1777
Number of pages6
StatePublished - 2009
Event21st International Joint Conference on Artificial Intelligence, IJCAI-09 - Pasadena, CA, United States
Duration: Jul 11 2009Jul 17 2009

Other

Other21st International Joint Conference on Artificial Intelligence, IJCAI-09
CountryUnited States
CityPasadena, CA
Period7/11/097/17/09

Fingerprint

Planning
Liquefied petroleum gas
User interfaces
Costs

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Nguyen, T. A., Do, M. B., Kambhampati, S., & Srivastava, B. (2009). Planning with partial preference models. In IJCAI International Joint Conference on Artificial Intelligence (pp. 1772-1777)

Planning with partial preference models. / Nguyen, Tuan A.; Do, Minh B.; Kambhampati, Subbarao; Srivastava, Biplav.

IJCAI International Joint Conference on Artificial Intelligence. 2009. p. 1772-1777.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nguyen, TA, Do, MB, Kambhampati, S & Srivastava, B 2009, Planning with partial preference models. in IJCAI International Joint Conference on Artificial Intelligence. pp. 1772-1777, 21st International Joint Conference on Artificial Intelligence, IJCAI-09, Pasadena, CA, United States, 7/11/09.
Nguyen TA, Do MB, Kambhampati S, Srivastava B. Planning with partial preference models. In IJCAI International Joint Conference on Artificial Intelligence. 2009. p. 1772-1777
Nguyen, Tuan A. ; Do, Minh B. ; Kambhampati, Subbarao ; Srivastava, Biplav. / Planning with partial preference models. IJCAI International Joint Conference on Artificial Intelligence. 2009. pp. 1772-1777
@inproceedings{89e35eb239c84b3a82041b9d6fac3088,
title = "Planning with partial preference models",
abstract = "In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact tradeoff between those objectives. When a planner encounters such partial preference models, rather than look for a single optimal plan, it needs to present the pareto set of plans and let the user choose from them. This idea of presenting the full pareto set is fraught with both computational and user-interface challenges. To make it practical, we propose the approach of finding a representative subset of the pareto set. We measure the quality of this representative set using the Integrated Convex Preference (ICP) model, originally developed in the OR community. We implement several heuristic approaches based on the Metric-LPG planner to find a good solution set according to this measure. We present empirical results demonstrating the promise of our approach.",
author = "Nguyen, {Tuan A.} and Do, {Minh B.} and Subbarao Kambhampati and Biplav Srivastava",
year = "2009",
language = "English (US)",
isbn = "9781577354260",
pages = "1772--1777",
booktitle = "IJCAI International Joint Conference on Artificial Intelligence",

}

TY - GEN

T1 - Planning with partial preference models

AU - Nguyen, Tuan A.

AU - Do, Minh B.

AU - Kambhampati, Subbarao

AU - Srivastava, Biplav

PY - 2009

Y1 - 2009

N2 - In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact tradeoff between those objectives. When a planner encounters such partial preference models, rather than look for a single optimal plan, it needs to present the pareto set of plans and let the user choose from them. This idea of presenting the full pareto set is fraught with both computational and user-interface challenges. To make it practical, we propose the approach of finding a representative subset of the pareto set. We measure the quality of this representative set using the Integrated Convex Preference (ICP) model, originally developed in the OR community. We implement several heuristic approaches based on the Metric-LPG planner to find a good solution set according to this measure. We present empirical results demonstrating the promise of our approach.

AB - In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact tradeoff between those objectives. When a planner encounters such partial preference models, rather than look for a single optimal plan, it needs to present the pareto set of plans and let the user choose from them. This idea of presenting the full pareto set is fraught with both computational and user-interface challenges. To make it practical, we propose the approach of finding a representative subset of the pareto set. We measure the quality of this representative set using the Integrated Convex Preference (ICP) model, originally developed in the OR community. We implement several heuristic approaches based on the Metric-LPG planner to find a good solution set according to this measure. We present empirical results demonstrating the promise of our approach.

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

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

M3 - Conference contribution

AN - SCOPUS:78751684899

SN - 9781577354260

SP - 1772

EP - 1777

BT - IJCAI International Joint Conference on Artificial Intelligence

ER -