Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/1379
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sahu A. | en |
dc.contributor.author | Jakovetić, Dušan | en |
dc.contributor.author | Kar S. | en |
dc.date.accessioned | 2019-09-23T10:15:19Z | - |
dc.date.available | 2019-09-23T10:15:19Z | - |
dc.date.issued | 2018-08-15 | en |
dc.identifier.isbn | 9781538647806 | en |
dc.identifier.issn | 21578095 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/1379 | - |
dc.description.abstract | © 2018 IEEE. This paper presents Communication efficient REcursive Distributed estimatiOn algorithm, \mathcal{CREDO} for networked multi-agent systems. \mathcal{CREDO} caters to situations in which the agents collaboratively estimate a vector parameter by assimilating their latest sensed information and estimates from their time-varying neighborhood worker nodes over a (possibly sparse) communication graph, while adhering to a frugal communication scheme. The underlying inter-agent communication protocol is randomized and adaptively, making communications increasingly (probabilistically) sparse as time progresses. \mathcal{CREDO} may be designed to achieve at each agent a \Theta(\mathcal{C}-{t}^{-2+\zeta}) decay of the mean square error (\zeta > 0, arbitrarily small) with respect to per-node communication cost \mathcal{C}-{t}, which significantly improves over the existing \Theta(\mathcal{C}-{t}^{-1}) rates. Simulations demonstrate \mathcal{CREDO} 's communication efficiency. | en |
dc.relation.ispartof | IEEE International Symposium on Information Theory - Proceedings | en |
dc.title | CREDO: A Communication-Efficient Distributed Estimation Algorithm | en |
dc.type | Conference Paper | en |
dc.identifier.doi | 10.1109/ISIT.2018.8437640 | en |
dc.identifier.scopus | 2-s2.0-85052475428 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85052475428 | en |
dc.relation.lastpage | 520 | en |
dc.relation.firstpage | 516 | en |
dc.relation.volume | 2018-June | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
2
checked on May 10, 2024
Page view(s)
20
Last Week
3
3
Last month
4
4
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.