Abstract
In this paper, we provides a general framework for the analysis of a class of linear discrete-time networked dynamic systems (DNDS). We focus our attention on DNDS where the underlying connection topology couples the agents at their outputs. A distinction is made between DNDS with homogeneous agent dynamics and DNDS with heterogeneous agent dynamics. It is emphasized that developing efficient solution methods for the design of such systems involve connecting and interpreting results from graph theory and convex optimization in a systems-theoretic context
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
