A computational framework for package planning

Authors:
Y. Xiang;M. Janzen
Affiliations:
Department of Computing and Information Science, University of Guelph, Canada;Department of Computing and Information Science, University of Guelph, Canada
Venue:
International Journal of Knowledge-based and Intelligent Engineering Systems
Year:
2006

Citing 11
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Integrating model construction and evaluation

UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Intelligent scheduling

Intelligent scheduling
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Probabilistic reasoning for meal planning in intelligent fridges

AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Structured solution methods for non-Markovian decision processes

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
The decision-theoretic interactive video advisor

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Constructing situation specific belief networks

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Graphical models for preference and utility

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's preference. We refer to the decision process that leads to such a plan as package planning. The problem differs from a number of well-studied AI problems including standard AI planning and decision-theoretic planning. We present a computational framework using a combination of activity grammar, heuristic search, decision theoretic graphical models, and dynamic preference aggregation. We show that the computation is tractable when the problem parameters are reasonably bounded.