An Examination of Criticality-Sensitive Approaches to Coordination
暂无分享,去创建一个
Gabor Karsai | Rajiv T. Maheswaran | Craig Milo Rogers | Romeo Sanchez | Pedro A. Szekely | Marcel Becker | Stephen Fitzpatrick | Robert Neches | Dávid Hanák | Christopher P. van Buskirk | Gergely Gati
[1] John L. Bresina,et al. Just-In-Case Scheduling , 1994, AAAI.
[2] Michael L. Littman,et al. The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..
[3] Edmund H. Durfee,et al. A distributed framework for solving the Multiagent Plan Coordination Problem , 2005, AAMAS '05.
[4] Abdel-Illah Mouaddib,et al. A polynomial algorithm for decentralized Markov decision processes with temporal constraints , 2005, AAMAS '05.
[5] Victor R. Lesser,et al. Agent interaction in distributed POMDPs and its implications on complexity , 2006, AAMAS '06.
[6] Martha E. Pollack,et al. Conditional, Probabilistic Planning: A Unifying Algorithm and Effective Search Control Mechanisms , 1999, AAAI/IAAI.
[7] Claudia V. Goldman,et al. Optimizing information exchange in cooperative multi-agent systems , 2003, AAMAS '03.
[8] Victor R. Lesser,et al. Quantitative Modeling of Complex Computational Task Environments , 1993, AAAI.
[9] David E. Smith,et al. Planning Under Continuous Time and Resource Uncertainty: A Challenge for AI , 2002, AIPS Workshop on Planning for Temporal Domains.
[10] Makoto Yokoo,et al. Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs , 2005, IJCAI.