Abstract
For distributed estimation arising in the nonlinear least squares (NLLSs) problems over adaptive networks, where every node has the abilities of data processing and learning, only the incomplete local data are exploited by the traditional noncooperative method, thereby resulting in the degradation on estimation performance. In this article, a cooperative diffusion strategy is proposed by using a Gauss-Newton (GN) method in order to fully utilize the diversity of temporal-spatial data on local updates. The proposed algorithm includes two steps, i.e., aggregate then update (ATU), where the aggregating step collects in real time the global information instead of local information due to the diffusion strategy, and the updating step implements the local GN iteration. The resulting ATU diffusion algorithm is a distributed and cooperative system without any increase on communication cost, as compared with the noncooperative version. Based on the detailed convergence analysis for ATU, which is fundamental to the promotion of this algorithm, the sufficient conditions for convergence are derived and the evidences of faster convergence than the noncooperative version are provided. The simulation results confirm the obtained theoretical derivations by applying the ATU algorithm to an NLLS-based target localization problem and show the cooperation gains in many aspects, such as the convergence rate, steady-state accuracy, and robustness to noisy range, step size, node, and link failures.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Systems, Man, and Cybernetics: Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.