Skip to main content

Distributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptotics

Author(s): Sahu, Anit Kumar; Kar, Soummya; Moura, Jose MF; Poor, H Vincent

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr15n2g
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSahu, Anit Kumar-
dc.contributor.authorKar, Soummya-
dc.contributor.authorMoura, Jose MF-
dc.contributor.authorPoor, H Vincent-
dc.date.accessioned2020-02-19T22:00:07Z-
dc.date.available2020-02-19T22:00:07Z-
dc.date.issued2016-12en_US
dc.identifier.citationSahu, Anit Kumar, Soummya Kar, José MF Moura, and H. Vincent Poor. "Distributed constrained recursive nonlinear least-squares estimation: Algorithms and asymptotics." IEEE Transactions on Signal and Information Processing over Networks 2, no. 4 (2016): 426-441. doi:10.1109/TSIPN.2016.2618318en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr15n2g-
dc.description.abstractThis paper focuses on recursive nonlinear least-squares parameter estimation in multiagent networks, where the individual agents observe sequentially over time an independent and identically distributed time-series consisting of a nonlinear function of the true but unknown parameter corrupted by noise. A distributed recursive estimator of the consensus + innovations type, namely CIWNLS, is proposed, in which the agents update their parameter estimates at each observation sampling epoch in a collaborative way by simultaneously processing the latest locally sensed information (innovations) and the parameter estimates from other agents (consensus) in the local neighborhood conforming to a prespecified interagent communication topology. Under rather weak conditions on the connectivity of the interagent communication and a global observability criterion, it is shown that, at every network agent, CIWNLS leads to consistent parameter estimates. Furthermore, under standard smoothness assumptions on the local observation functions, the distributed estimator is shown to yield order-optimal convergence rates, i.e., as far as the order of pathwise convergence is concerned, the local parameter estimates at each agent are as good as the optimal centralized nonlinear least-squares estimator that requires access to all the observations across all the agents at all times. To benchmark the performance of the CIWNLS estimator with that of the centralized nonlinear least-squares estimator, the asymptotic normality of the estimate sequence is established, and the asymptotic covariance of the distributed estimator is evaluated. Finally, simulation results are presented that illustrate and verify the analytical findings.en_US
dc.format.extent426 - 441en_US
dc.language.isoen_USen_US
dc.relation.ispartofIEEE Transactions on Signal and Information Processing over Networksen_US
dc.rightsAuthor's manuscripten_US
dc.titleDistributed Constrained Recursive Nonlinear Least-Squares Estimation: Algorithms and Asymptoticsen_US
dc.typeJournal Articleen_US
dc.identifier.doi10.1109/TSIPN.2016.2618318-
dc.identifier.eissn2373-776X-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
OA_DistributedConstrainedRecursiveNonlinearLeastSquaresEstimationAlgorithmsAsymptotics.pdf3.44 MBAdobe PDFView/Download


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