LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Distributed Algorithm That Finds Almost Best Possible Estimate Under Non-Vanishing and Time-Varying Measurement Noise

Photo by jontyson from unsplash

In this letter, we review an existing distributed least-squares solver and share some new insights on it. Then, by the observation that an estimation of a constant vector under output… Click to show full abstract

In this letter, we review an existing distributed least-squares solver and share some new insights on it. Then, by the observation that an estimation of a constant vector under output noise can be translated into finding the least-squares solution, we present an algorithm for distributed estimation of the state of linear time-invariant systems under measurement noise. The proposed algorithm consists of a network of local observers, where each of them utilizes local measurements and information transmitted from the neighbors. It is proven that even under non-vanishing and time-varying measurement noise, we could obtain an almost best possible estimate with arbitrary precision. Some discussions regarding the plug-and-play operation are also given.

Keywords: time; varying measurement; measurement noise; non vanishing; time varying; vanishing time

Journal Title: IEEE Control Systems Letters
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.