Y. Xiang and M. Janzen
We consider a novel class of applications where a set of activities conducted by a group of people over a time periodneeds to be planned, taking into account each member’s preference. We refer to the decision process that leads to such aplan 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,search, and graphical models. We show that the computation istractable when the problem parameters are reasonably bounded.