Sciweavers

KES
2006
Springer

A computational framework for package planning

13 years 3 months ago
A computational framework for package planning
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.
Yang Xiang, Michael Janzen
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where KES
Authors Yang Xiang, Michael Janzen
Comments (0)