Graph marginalization for rapid assignment in wide-area surveillance

Journal article

Decentralizing optimization problems across a network can reduce the time required to achieve a solution. We consider a wide-area surveillance sensor network observing an environment by varying the state of each sensor so as to assign it to one or more moving objects. The aim is to maximize an arbitrary utility function related to object tracking or object identification, using graph marginalization in the form of belief propagation. The algorithm performs well in an example application with six heterogeneous sensors. In larger network simulations, the time savings owing to decentralization quickly exceed 90%, with no reduction in optimality. © 2010 Elsevier B.V. All rights reserved.

Authors: Ebden, M; Roberts, S

• Publication status: Published
• Journal: AD HOC NETWORKS
• Volume: 9
• Issue: 2
• Pages: 180-188
• Publication date: 2011-03-01
• DOI: 10.1016/j.adhoc.2010.06.002
• ISSN: 1570-8705
• Language: English
• Keywords: Sensor networks; Max-sum algorithm; Belief propagation; Agents; Coalition formation