Many applications require that a group of agents share a coherent distributed picture of the world given communication constraints. This paper describes an analysis and design methodology for coordination algorithms for extremely large groups of agents maintaining a distributed belief. This design methodology creates a probability distribution which relates global properties of the system to agent interaction dynamics using the tools of statistical mechanics. Using this probability distribution we show that this system undergoes a rapid phase transition between low divergence and high divergence in the distributed belief at a critical value of system temperature. We also show empirically that at the critical system temperature the number of messages passed and belief divergence between agents is optimal. Finally, we use this fact to develop an algorithm using system temperature as a local decision parameter for an agent.

This paper presents a method for inferring threat in a military campaign through matching of battle field entities to a doctrinal template. In this work the set of random variables denoting the possible template matches for the scenario entities is a realization of a Markov random field. This approach does not separate low level fusion from high level fusion but optimizes both simultaneously. The result of the added high level context is a method that is robust to false positive and false negative, or missed, sensor readings. Furthermore, the high level context helps to direct the search for the best template match. Empirical results illustrate the efficacy of the method both at identifying threats in the face of false negatives, and at negating false positives, as well as illustrating the reduced computational effort resulting from the incorporation of additional high-level context