Abstract
Recently researchers in multiagent systems have begun to focus on formal POMDP (Partially Observable Markov Decision Process) models for analysis of multiagent coordination. However, prior work has mostly focused on analysis of communication, such as via the COM-MTDP (Communicative Markov Team Decision Problem) model. This paper provides two extensions to this prior work that goes beyond communication and analyzes other aspects of multiagent coordination. In particular, we first present a formal model called R-COM-MTDP that extends COM-MTDP to analyze team formation and reorganization algorithms. R-COM-MTDP enables a rigorous and systematic analysis of complexity-optimality tradeoffs in team (re)formation approaches in different domain types. It provides the worst-case complexity analysis of the team (re)formation under varying conditions, and illustrates under which conditions role decomposition can provide significant reductions in computational complexity. Next, we propose COM-MTDP as a formal framework to analyze DCSP (Distributed Constraint Satisfaction Problem) strategies for conflict resolution. Different DCSP strategies are mapped onto policies in the COM-MTDP model, and agents compare strategies by evaluating their mapped policies. Thus, the two COM-MTDP based methods could open the door to a range of novel analyses of multiagent team (re)formation, and facilitate automated selection of the most efficient strategy for a given situation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jung, H., Tambe, M., Kulkarni, S.: Argumentation as Distributed Constraint Satisfaction: Applications and Results. In: Proceedings of International Conference on Autonomous Agents (2001)
Kitano, H., Tambe, M., Stone, P., Veloso, M., Coradeschi, S., Osawa, E., Matsubara, H., Noda, I., Asada, M.: The Robocup Synthetic Agent Challenge 1997. In: Proceedings of International Joint Conference on Artificial Intelligence (1997)
Kitano, H., Tadokoro, S., Noda, I., Matsubara, H., Takahashi, T., Shinjoh, A., Shimada, S.: Robocup Rescue: Search and rescue for large scale disasters as a domain for multi-agent research. In: Proceedings of IEEE International Conference on Systems, Man and Cybernetics (1999)
Modi, P., Jung, H., Tambe, M., Shen, W., Kulkarni, S.: A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation. In: Proceedings of International Conference on Principles and Practice of Constraint Programming (2001)
Nair, R., Tambe, M., Marsella, S.: Team formation for reformation in multiagent domains like RoboCupRescue. In: Kaminka, G.A., Lima, P.U., Rojas, R. (eds.) RoboCup 2002. LNCS (LNAI), vol. 2752, pp. 150–161. Springer, Heidelberg (2003)
McDermott, D.: The 1998 AI Planning Systems Competition. AI Magazine 21(2) (2000)
Minton, S., Johnston, M.D., Philips, A., Laird, P.: Solving Large-scale Constraint Satisfaction and Scheduling Problems Using a Heuristic Repair Method. In: Proceedings of National Conference on Artificial Intelligence (1990)
Peshkin, L., Meuleau, N., Kim, K., Kaelbling, L.: Learning to cooperate via policy search. In: Proceedings of International Conference on Uncertainty in Artificial Intelligence (2000)
Pynadath, D., Tambe, M.: Multiagent teamwork: analyzing the optimality complexity of key theories and models. In: Proceedings of International Conference on Autonomous Agents and Multi Agent Systems (2002)
Tambe, M.: Towards flexible teamwork. Journal of Artificial Intelligence Research 7, 83–124 (1997)
Wellman, M., Greenwald, A., Stone, P., Wurman, P.: The 2001 Trading Agent Competition. In: Proceedings of Innovative Applications of Artificial Intelligence Conference (2002)
Yokoo, M.: Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems. In: Proceedings of International Conference on Principles and Practice of Constraint Programming (1995)
Yokoo, M., Hirayama, K.: Distributed constraint satisfaction algorithm for complex local problems. In: Proceedings of International Conference on Multi Agent Systems (1998)
Yoshikawa, T.: Decomposition of dynamic team decision problems. Proceedings of IEEE Transactions on Automatic Control (1978)
Xuan, P., Lesser, V., Zilberstein, S.: Communication decisions in multiagent cooperation. In: Proceedings of Autonomous Agents (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, H., Nair, R., Tambe, M., Marsella, S. (2003). Computational Models for Multiagent Coordination Analysis: Extending Distributed POMDP Models. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C., Gordon-Spears, D. (eds) Formal Approaches to Agent-Based Systems. FAABS 2002. Lecture Notes in Computer Science(), vol 2699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45133-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-45133-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40665-5
Online ISBN: 978-3-540-45133-4
eBook Packages: Springer Book Archive