Abstract
This paper introduces several related distributed algorithms, generalised from the celebrated belief propagation algorithm for statistical learning. These algorithms are suitable for a class of computational problems in large-scale networked systems, ranging from average consensus, sensor fusion, distributed estimation, distributed optimisation, distributed control, and distributed learning. By expressing the underlying computational problem as a sparse linear system, each algorithm operates at each node of the network graph and computes iteratively the desired solution. The behaviours of these algorithms are discussed in terms of the network graph topology and parameters of the corresponding computational problem. A number of examples are presented to illustrate their applications. Also introduced is a message-passing algorithm for distributed convex optimisation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
