Abstract
Some of the essential tasks of a multiagent system (MAS) include distributed probabilistic reasoning, constraint reasoning, and decision making. Junction tree (JT) based agent organizations have been adopted by some MAS frameworks for their advantages of efficient communication and sound inference. In addition, JT organizations have the potential capacity to support a high degree of agent privacy. This potential, however, has not been fully realized. We present two necessary and sufficient conditions on the existence of JT organization given a MAS. Following these conditions, we propose a new algorithm suite, based on elimination in the so called boundary set of a MAS, that recognizes JT organization existence and constructs one if exists, while guaranteeing agent privacy on private variables, shared variables and agent identities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brito, I., Meseguer, P.: Cluster tree elimination for distributed constraint optimization with quality guarantees. Fundamenta Informaticae 102(3-4), 263–286 (2010)
Gmytrasiewicz, P., Durfee, E.: Rational communication in multi-agent environments. Auto. Agents and Multi-Agent Systems 4(3), 233–272 (2001)
Koller, D., Milch, B.: Multi-agent influence diagrams for representing and solving games. In: Proc. 17th Inter. Joint Conf. on Artificial Intelligence, pp. 1027–1034 (2001)
Maestre, A., Bessiere, C.: Improving asynchronous backtracking for dealing with complex local problems. In: Proc. 16th European Conf. on Artificial Intelligence, pp. 206–210 (2004)
Modi, P., Shen, W., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligences 161(1-2), 149–180 (2005)
Paskin, M., Guestrin, C., McFadden, J.: A robust architecture for distributed inference in sensor networks. In: Proc. Information Processing in Sensor Networks, pp. 55–62 (2005)
Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: Proc. 19th Inter. Joint Conf. on Artificial Intelligence, pp. 266–271 (2005)
Valtorta, M., Kim, Y., Vomlel, J.: Soft evidential update for probabilistic multiagent systems. Int. J. Approximate Reasoning 29(1), 71–106 (2002)
Vinyals, M., Rodriguez-Aguilar, J., Cerquides, J.: Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive law. J. Autonomous Agents and Multi-Agent Systems 22(3), 439–464 (2010)
Xiang, Y.: Probabilistic Reasoning in Multiagent Systems: A Graphical Models Approach. Cambridge University Press, Cambridge (2002)
Xiang, Y., Hanshar, F.: Multiagent expedition with graphical models. Inter. J. Uncertainty, Fuzziness and Knowledge-Based Systems 19(6), 939–976 (2011)
Xiang, Y., Mohamed, Y., Zhang, W.: Distributed constraint satisfaction with multiply sectioned constraint networks. accepted to appear in International J. Information and Decision Sciences (2013)
Xiang, Y., Srinivasan, K.: Construction of privacy preserving hypertree agent organization as distributed maximum spanning tree. In: ZaÏane, O., Zilles, S. (eds.) Canadian AI 2013. LNCS (LNAI), vol. 7884, pp. 199–210. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiang, Y., Srinivasan, K. (2013). Boundary Set Based Existence Recognition and Construction of Hypertree Agent Organization. In: Zaïane, O.R., Zilles, S. (eds) Advances in Artificial Intelligence. Canadian AI 2013. Lecture Notes in Computer Science(), vol 7884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38457-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-38457-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38456-1
Online ISBN: 978-3-642-38457-8
eBook Packages: Computer ScienceComputer Science (R0)