Jeffrey S. Cox
ABSTRACT
The multiagent plan coordination problem arises whenever multiple agents plan to achieve their individual goals independently, but might mutually benefit by coordinating their plans to avoid working at cross purposes or duplicating effort. Although variations of this problem have been studied in the literature, there is as yet no agreement over a general characterization of the problem. In this paper, we describe a general framework that extends the partial-order, causal-link plan representation to the multiagent case, and that treats coordination as a form of iterative repair of plan flaws that cross agents. We show, analytically and empirically, that this algorithmic formulation can scale to the multiagent case better than can a straightforward application of the most advanced single-agent plan coordination technique, highlighting fundamental differences between single-agent and multiagent planning.
- Bäckström, C. Computational aspects of reordering plans. Journal of Artificial Intelligence Research 9 (1998), 99--137. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- Boutilier, C., and Brafman, R. Partial-order planning with concurrent interacting actions. Journal of Artificial Intelligence Research 14 (2001), 105--136. Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Cormen, T. H., Leiserson, C. E., and Rivest, R. L. Introduction to algorithms, 6th ed. MIT Press and McGraw-Hill Book Company, 1992. Google ScholarDigital Library
- Cox, J., Bartold, T., and Durfee, E. A distributed framework for solving the multiagent plan coordination problem. In The Fourth International Joint Conference on Autonomous Agents and Multiagent Systems (2005). Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Durfee, E. H., and Lesser, V. R. Partial global planning: A coordination framework for distributed hypothesis formation. IEEE Transactions on Systems, Man, and Cybernetics 21, 5 (1991), 1167--1183.Google ScholarCross Ref
- El Fallah Seghrouchni, A., and Haddad, S. A coordination algorithm for multi-agent planning. Lecture Notes in Computer Science 1038 (1996), 86--94.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- Hadad, M., and Kraus, S. Combining temporal information by collaborative planning agents. In AAAI Workshop on Planning with and for Multiagent Systems (2002), pp. 23--30.Google Scholar
- Horty, J. F., and Pollack, M. E. Evaluating new options in the context of existing plans. Artificial Intelligence 127, 2 (2001), 199--220. Google ScholarDigital Library
- Kambhampati, S., Tenenbaum, M., and Lee, S. Combining specialized reasoners and general purpose planners: A case study. In Proceedings of the 9th National Conference on Artificial Intelligence (1991).Google Scholar
- Kautz, H., and Selman, B. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (1996), pp. 1194--1201. Google ScholarDigital Library
- Pecora, F., Rasconi, R., and Cesta, A. Assessing the bias of classical planning strategies on makespan-optimizing scheduling. In Proceedings of the 16th European Conference on Artificial Intelligence (2004), pp. 677--681.Google ScholarDigital Library
- Pynadath, D., and Tambe, M. An automated teamwork infrastructure for heterogeneous software agents and humans. Journal of Autonomous Agents and Multiagent Systems 7 (2003), 71--100. Google ScholarDigital Library
- Thangarajah, J., Padgham, L., and Winikoff, M. Detecting & exploiting positive goal interaction in intelligent agents. In Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (2003), pp. 401--408. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Von Martial, F. Interactions among autonomous planning agents. In Decentralized AI, Y. Demazeau and J.-P. Muller, Eds. North Holland, 1990, pp. 105--119.Google Scholar
- Weld, D. S. An introduction to least commitment planning. AI Magazine 15, 4 (1994), 27--61.Google Scholar
- Wilkins, D. E., and Myers, K. L. A multiagent planning architecture. In Artificial Intelligence Planning Systems (1998), pp. 154--163.Google Scholar
- Yang, Q. Intelligent Planning. Springer-Verlag, Berlin, 1997.Google Scholar
Index Terms
- An efficient algorithm for multiagent plan coordination
Recommendations
A distributed framework for solving the Multiagent Plan Coordination Problem
AAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systemsWe examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Constraint Optimization Problem (DCOP). We use ADOPT, a state-of-the-art DCOP ...
Efficient and distributable methods for solving the multiagent plan coordination problem
Planning in multiagent systemsCoordination can be required whenever multiple agents plan to achieve their individual goals independently, but might mutually benefit by coordinating their plans to avoid working at cross purposes or duplicating effort. Although variations of such ...
Comments