Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/1379
Nаziv: | CREDO: A Communication-Efficient Distributed Estimation Algorithm | Аutоri: | Sahu A. Jakovetić, Dušan Kar S. |
Dаtum izdаvаnjа: | 15-авг-2018 | Čаsоpis: | IEEE International Symposium on Information Theory - Proceedings | Sažetak: | © 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. | URI: | https://open.uns.ac.rs/handle/123456789/1379 | ISBN: | 9781538647806 | ISSN: | 21578095 | DOI: | 10.1109/ISIT.2018.8437640 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
2
prоvеrеnо 10.05.2024.
Prеglеd/i stаnicа
20
Prоtеklа nеdеljа
3
3
Prоtеkli mеsеc
4
4
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.