A distributed approach to summarizing spaces of multiagent schedules

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2012, Pages 1742-1748

  Boerkoel, James C ^a   Durfee, Edmund H ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL OVERHEADS; DECOMPOSABILITY; DISTRIBUTED APPROACHES; DYNAMIC ENVIRONMENTS; MINIMALITY; MULTI AGENT; PROBLEM REPRESENTATION; PROPERTY; SOLUTION SPACE; STRATEGIC INTEREST;

MULTI AGENT SYSTEMS;

EID: 84868300030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Boerkoel, J., and Durfee, E. 2010. A Comparison of Algorithms for Solving the Multiagent Simple Temporal Problem. In Proc. of ICAPS-10, 26-33.
2. Boerkoel, J., and Durfee, E. 2011. Distributed Algorithms for Solving the Multiagent Temporal Decoupling Problem. In Proc. of AAMAS 2011, 141-148.
3. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. In Knowledge representation, volume 49, 61-95.
4. Dutertre, B., and Moura, L. D. 2006. The YICES SMTsolver. Technical report.
5. Floyd, R. 1962. Shortest path. Comm. of the ACM 5(6):345.
6. Hunsberger, L. 2002. Algorithms for a temporal decoupling problem in multi-agent planning. In Proc of AAAI-02, 468-475.
7. Planken, L.; de Weerdt, M.; and van der Krogt, R. 2008. P3C: A new algorithm for the simple temporal problem. In Proc. of ICAPS-08, 256-263.
8. Shah, J., and Williams, B. 2008. Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation. In Proc. of ICAPS-08, 322-329.
9. Shah, J.; Conrad, P.; and Williams, B. 2009. Fast distributed multi-agent plan execution with dynamic task assignment and scheduling. In Proc. of ICAPS 2009, 289-296.
10. Stergiou, K., and Koubarakis, M. 2000. Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence 120(1):81-117.
11. Tsamardinos, I., and Pollack, M. 2003. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence 151(1-2):43-89.
12. Tsamardinos, I.; Pollack, M.; and Ganchev, P. 2001. Flexible Dispatch of Disjunctive Plans. In Proc. of ECP-06 471-422.
13. Witwicki, S., and Durfee, E. 2010. Influence-based policy abstraction for weakly-coupled Dec-POMDPs. In Proc. of ICAPS-10, 185-192.
14. Xu, L., and Choueiry, B. 2003. A new effcient algorithm for solving the simple temporal problem. In Proc. of TIME-ICTL-03, 210-220.