A distributed framework for solving the Multiagent Plan Coordination Problem

Proceedings of the International Conference on Autonomous Agents

Volumn , Issue , 2005, Pages 957-963

  Cox, Jeffrey S ^a   Durfee, Edmund H ^a   Bartold, Thomas ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Coordination of multiple agents; Distributed constraint optimization; Multiagent planning and merging

Indexed keywords

COORDINATION OF MULTIPLE AGENTS; DISTRIBUTED CONSTRAINT OPTIMIZATION; MULTIAGENT PLANNING AND MERGING;

ALGORITHMS; AUTONOMOUS AGENTS; CONSTRAINT THEORY; OPTIMIZATION; PLANNING; PROBLEM SOLVING;

MULTI AGENT SYSTEMS;

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

References (14)

1. BÄCKSTRÖM, C. Computational aspects of reordering plans. Journal of Artificial Intelligence Research 9 (1998), 99-137.
2. BLUM, A., AND FURST, M. Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (1995), pp. 1636-1642.
3. BOUTILIER, C., AND BRAFMAN, R. Partial-order planning with concurrent interacting actions. Journal of Artificial Intelligence Research 14 (2001), 105-136.
4. CLEMENT, B., AND DURFEE, E. Top-down search for coordinating the hierarchical plans of multiple agents. In Proceedings of the Third International Conference on Autonomous Agents (1999), pp. 252-259.
5. COX, J., AND DURFEE, E. Discovering and exploiting synergy between hierarchical planning agents. In The Second International Joint Conference on Autonomous Agents and Multiagent Systems (2003), pp. 281-288.
6. COX, J., AND DURFEE, E. Efficient algorithms for multiagent plan coordination. In The Fourth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS '05) (2005).
7. DO, M. B., AND KAMBHAMPATI, S. Planning as constraint satisfaction: solving the planning graph by compiling it into csp. Artificial Intelligence 132 (2001), 151-182.
8. EPHRATI, E., AND ROSENSCHEIN, J. S. Divide and conquer in multi-agent planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence (1994), pp. 375-380.
9. LOPEZ, A., AND BACCHUS, F. Generalizing graphplan by formulating planning as a csp. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), p. 954.
10. MAILLER, R., AND LESSER, V. Solving distributed constraint optimization problems using cooperative mediation. In. Proceedings of Third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS2004) (2004), pp. 438-445.
11. MODI, P. J., SHEN, W.-M., TAMBE, M., AND YOKOO, M. Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence Journal (2004).
12. TONINO, H., BOS, A., DE WEERDT, M. M., AND WITTEVEEN, C. Plan coordination by revision in collective agent-based systems. Artificial Intelligence 142, 2 (2002), 121-145.
13. WELD, D. S. An introduction to least commitment planning. AI Magazine 15, 4 (1994), 27-61.
14. YANG, Q. Intelligent Planning. Springer-Verlag, Berlin, 1997.