Abstract
Series-parallel networks are a class of graphs on which many NP-hard problems have tractable solutions. In this paper, we examine performance measures on leader-follower consensus on series-parallel networks. We show that a distributed computation of the $\mathcal{H}_2$ norm can be done efficiently on this system by exploiting a decomposition of the network into atomic elements and composition rules. Lastly, we examine the problem of adaptively re-weighting the network to optimize the $\mathcal{H}_2$ norm, and show that it can be done with similar complexity.
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.
