Temporal Plan and Resource Management

In previous work we have investigated a framework for distributed temporal plan repair. Using temporal constraints for activities to be executed, we developed a distributed algorithm capable of dealing with temporal changes (disruptions) in these constraints to perform fast plan repair. This framework, however, did not include resource management issues. In this paper, first of all, we extend our framework to incorporate resource allocation issues. Second, we present a decision mechanism for resource re-allocation using the notion of temporal flexibility. Based on this notion we discuss a flexibility heuristic in plan repair. Finally, we address the issue of plan quality measures, taking into account both individual agent preferences and global properties as plan robustness.

[1]  Martha E. Pollack,et al.  Low-cost Addition of Preferences to DTPs and TCSPs , 2004, AAAI.

[2]  Edmund H. Durfee,et al.  A Survey of Research in Distributed, Continual Planning , 1999, AI Mag..

[3]  Berthe Y. Choueiry,et al.  A new effcient algorithm for solving the simple temporal problem , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[4]  Cees Witteveen,et al.  Distributed (Re)Planning With Preference Information , 2005 .

[5]  Stephen F. Smith,et al.  Profile-Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems , 1998, AIPS.

[6]  Francesca Rossi,et al.  Temporal Constraint Reasoning With Preferences , 2001, IJCAI.

[7]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..