Domain-independent multi-agent plan repair

Journal of Network and Computer Applications

Volumn 37, Issue 1, 2014, Pages 76-88

  Komenda, Antonín ^a   Novák, Peter ^b   Pěchouček, Michal ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b Department of Microelectronics   (Netherlands)

Author keywords

Communication complexity; Decentralized multi agent planning; Experimental evaluation; Multi agent plan repair

Indexed keywords

COMMUNICATION COMPLEXITY; COMMUNICATION OVERHEADS; DOMAIN-INDEPENDENT PLANNING; DYNAMIC ENVIRONMENTS; EXPERIMENTAL EVALUATION; EXPERIMENTAL VALIDATIONS; MULTI-AGENT PLANNING; MULTIAGENT PLANS;

ALGORITHMS; COMMUNICATION; COOPERATIVE COMMUNICATION; HUMAN RESOURCE MANAGEMENT;

REPAIR;

EID: 84890434378     PISSN: 10848045     EISSN: 10958592     Source Type: Journal    
DOI: 10.1016/j.jnca.2012.12.011     Document Type: Article

References (20)

1. Albore A, Palacios H, Geffner H. A translation-based approach to contingent planning. In: Boutilier C, editor, IJCAI; 2009. p. 1623-8.
2. A. Albore, H. Palacios, and H. Geffner Compiling uncertainty aay in non-deterministic conformant planning H. Coelho, R. Studer, M. ooldridge, ECAI, Frontiers in Artificial Intelligence and Applications vol. 215 2010 IOS Press 465 470
3. T.C. Au, and H. Munoz-Avila On the complexity of plan adaptation by derivational analogy in a universal classical planning frameork Advances in Case-Based Reasoning 2002 13 27
4. Brafman RI, Domshlak C. From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of the ICAPS; 2008. p. 28-35.
5. Cox JS, Durfee EH. An efficient algorithm for multiagent plan coordination. In: Proceedings of the 4th international joint conference on autonomous agents and multiagent systems, AAMAS '05. ACM, Ne York, NY, USA; 2005. p. 828-35.
6. R. Dechter Constraint processing 2003 Elsevier Morgan Kaufmann
7. Fox M, Gerevini A, Long D, Serina I. Plan stability: replanning versus plan repair. In: Proceedings of the ICAPS; 2006. p. 212-21.
8. J. Hoffmann, and B. Nebel The FF planning system fast plan generation through heuristic search Journal of Artificial Intelligence Research 14 2001 253 302
9. A. Jonsson, and M. Rovatsos Scaling up multiagent planning a best-response approach F. Bacchus, C. Domshlak, S. Edelkamp, M. Helmert, Proceedings of the ICAPS 2011 AAAI
10. Komenda A, Novák P. Multi-agent plan repairing. In: Proceedings of Decision Making in Partially Observable, Uncertain orlds: Exploring Insights from Multiple Communities IJCAI-DMPOU orkshop. 2011. p. 1-6.
11. Komenda A, Novák P, Pěchouček M. Decentralized multi-agent plan repair in dynamic environments (Extended Abstract). In: Proceedings of the AAMAS; 2012. p. 1239-40.
12. Krogt Rvd, eerdt Md. Self-interested planning agents using plan repair. In: Proceedings of the ICAPS 2005 orkshop on multiagent planning and scheduling; 2005. p. 36-44.
13. V.I. Levenshtein Binary codes capable of correcting deletions, insertions and reversals Soviet Physics Doklady 10 1966 707
14. Muise C, McIlraith SA, Beck JC. Monitoring the execution of partial-order plans via regression. In: Proceedings of the 22nd international joint conference on artificial intelligence; 2011. p. 1975-82.
15. H. Muñoz-Avila, and M.T. Cox Case-based plan adaptation: an analysis and revie IEEE Intelligent Systems 23 4 2008 75 81
16. B. Nebel, and J. Koehler Plan reuse versus plan generation a theoretical and empirical analysis Artificial Intelligence 76 1-2 1995 427 454
17. Nissim R, Brafman RI, Domshlak C. A general, fully distributed multi-agent planning algorithm. In: Proceedings of the AAMAS; 2010. p. 1323-30.
18. Novák P, Jamroga . Agents, actions and goals in dynamic environments. In: alsh T, editor, IJCAI 2011, Proceedings of the 22nd international joint conference on artificial intelligence, Barcelona, Catalonia, Spain; July 16-22, 2011. IJCAI/AAAI; 2011. p. 313-8.
19. P. Prosser Hybrid algorithms for the constraint satisfaction problem Computational Intelligence 12 3 1993 268 299
20. R. Zivan, and A. Meisels Asynchronous forard-checking for DisCSPs Constraints 12 2007 131 150