Dynamic multiagent probabilistic inference

Citations of this article
Mendeley users who have this article in their library.


Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed uncertain domains. In the static cases, multiply sectioned Bayesian networks (MSBNs) have provided a solution when interactions within each agent are structured and those among agents are limited. However, in the dynamic cases, the agents' inference will not guarantee exact posterior probabilities if each agent evolves separately using a single agent dynamic Bayesian network (DBN). Nevertheless, due to the discount of the past, we may not have to use the whole history of a domain to reason about its current state. In this paper, we propose to reason about the state of a distributed dynamic domain period by period using an MSBN. To reduce the influence of the ignored history on the posterior probabilities to a minimum, we propose to observe as many observable variables as possible in the modeled history. Due to the limitations of the problem domains, it could be very costly to observe all observable variables. We present a distributed algorithm to compute all observable variables that are relevant to our concerns. Experimental results on the relationship between the computational complexity and the length of the represented history, and effectiveness of the approach are presented. © 2007 Elsevier Inc. All rights reserved.




An, X., Xiang, Y., & Cercone, N. (2008). Dynamic multiagent probabilistic inference. International Journal of Approximate Reasoning, 48(1), 185–213. https://doi.org/10.1016/j.ijar.2007.08.010

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free