Skip to main content

Distributed estimation in multi-agent networks

Author(s): Sankar, Lalitha; Poor, H Vincent

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1kd1qk5r
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSankar, Lalitha-
dc.contributor.authorPoor, H Vincent-
dc.date.accessioned2024-01-11T15:06:29Z-
dc.date.available2024-01-11T15:06:29Z-
dc.date.issued2012-07-09en_US
dc.identifier.citationSankar, Lalitha, Poor, H Vincent. (2012). Distributed estimation in multi-agent networks. 2012 IEEE International Symposium on Information Theory Proceedings, 10.1109/isit.2012.6284202en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1kd1qk5r-
dc.description.abstractA problem of distributed state estimation at multiple agents that are physically connected and have competitive interests is mapped to a distributed source coding problem with additional privacy constraints. The agents interact to estimate their own states to a desired fidelity from their (sensor) measurements which are functions of both the local state and the states at the other agents. For a Gaussian state and measurement model, it is shown that the sum-rate achieved by a distributed protocol in which the agents broadcast to one another is a lower bound on that of a centralized protocol in which the agents broadcast as if to a virtual CEO converging only in the limit of a large number of agents. The sufficiency of encoding using local measurements is also proved for both protocols.en_US
dc.language.isoen_USen_US
dc.relation.ispartof2012 IEEE International Symposium on Information Theory Proceedingsen_US
dc.rightsAuthor's manuscripten_US
dc.titleDistributed estimation in multi-agent networksen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1109/isit.2012.6284202-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
1207.2092v1.pdf123.73 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.