Abstract
This paper investigates an identification problem of sparse topology among nodes for consensus networked control systems. We suppose the system is modeled by a discrete-time first-order consensus network stochastically disturbed by white gaussian process noise. Our proposed method employs a sparsity-penalized maximum likelihood approach, where edge weights are penalized by the ℓ1 norm to address the sparsity of network topology. The optimization problem is shown to be expressed as a DC (Difference of Convex functions) optimization problem. A numerical example illustrates that the proposed method is useful to locate edges and to estimate their weights.
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.
