To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This comprehensive text provides an excellent introduction to the state of the art in the identification of network-connected systems. It covers models and methods in detail, includes a case study showing how many of these methods are applied in adaptive optics and addresses open research questions. Specific models covered include generic modelling for MIMO LTI systems, signal flow models of dynamic networks and models of networks of local LTI systems. A variety of different identification methods are discussed, including identification of signal flow dynamics networks, subspace-like identification of multi-dimensional systems and subspace identification of local systems in an NDS. Researchers working in system identification and/or networked systems will appreciate the comprehensive overview provided, and the emphasis on algorithm design will interest those wishing to test the theory on real-life applications. This is the ideal text for researchers and graduate students interested in system identification for networked systems.
This chapter analyzes linear and nonlinear discrete-time systems described by a discrete-time state-space model whose inputs are uncertain but known to belong to an ellipsoid. For the linear case, even if the input set is an ellipsoid, the set containing all possible values that the state can take is not an ellipsoid in general, but it can be upper bounded by an ellipsoid. We develop techniques for recursively computing a family of such upper-bounding ellipsoids. Within this family, we then show how to choose ellipsoids that are optimal in some sense, e.g., they have minimum volume. For the nonlinear case, we will again resort to linearization techniques to approximately characterize the set containing all possible values that the state can take. The application of the techniques presented is illustrated using the same inertia-less AC microgrid model used in Chapter 5.