Modelling, Analysis, and Control of Networked Dynamical Systems


Book Description

This monograph provides a comprehensive exploration of new tools for modelling, analysis, and control of networked dynamical systems. Expanding on the authors’ previous work, this volume highlights how local exchange of information and cooperation among neighboring agents can lead to emergent global behaviors in a given networked dynamical system. Divided into four sections, the first part of the book begins with some preliminaries and the general networked dynamical model that is used throughout the rest of the book. The second part focuses on synchronization of networked dynamical systems, synchronization with non-expansive dynamics, periodic solutions of networked dynamical systems, and modulus consensus of cooperative-antagonistic networks. In the third section, the authors solve control problems with input constraint, large delays, and heterogeneous dynamics. The final section of the book is devoted to applications, studying control problems of spacecraft formation flying, multi-robot rendezvous, and energy resource coordination of power networks. Modelling, Analysis, and Control of Networked Dynamical Systems will appeal to researchers and graduate students interested in control theory and its applications, particularly those working in networked control systems, multi-agent systems, and cyber-physical systems. This volume can also be used in advanced undergraduate and graduate courses on networked control systems and multi-agent systems.




Control Theory of Digitally Networked Dynamic Systems


Book Description

The book gives an introduction to networked control systems and describes new modeling paradigms, analysis methods for event-driven, digitally networked systems, and design methods for distributed estimation and control. Networked model predictive control is developed as a means to tolerate time delays and packet loss brought about by the communication network. In event-based control the traditional periodic sampling is replaced by state-dependent triggering schemes. Novel methods for multi-agent systems ensure complete or clustered synchrony of agents with identical or with individual dynamics. The book includes numerous references to the most recent literature. Many methods are illustrated by numerical examples or experimental results.




Model-Based Control of Networked Systems


Book Description

This monograph introduces a class of networked control systems (NCS) called model-based networked control systems (MB-NCS) and presents various architectures and control strategies designed to improve the performance of NCS. The overall performance of NCS considers the appropriate use of network resources, particularly network bandwidth, in conjunction with the desired response of the system being controlled. The book begins with a detailed description of the basic MB-NCS architecture that provides stability conditions in terms of state feedback updates. It also covers typical problems in NCS such as network delays, network scheduling, and data quantization, as well as more general control problems such as output feedback control, nonlinear systems stabilization, and tracking control. Key features and topics include: Time-triggered and event-triggered feedback updates Stabilization of uncertain systems subject to time delays, quantization, and extended absence of feedback Optimal control analysis and design of model-based networked systems Parameter identification and adaptive stabilization of systems controlled over networks The MB-NCS approach to decentralized control of distributed systems Model-Based Control of Networked Systems will appeal to researchers, practitioners, and graduate students interested in the control of networked systems, distributed systems, and systems with limited feedback.




Data-Driven Science and Engineering


Book Description

A textbook covering data-science and machine learning methods for modelling and control in engineering and science, with Python and MATLAB®.







Discrete Networked Dynamic Systems


Book Description

Discrete Networked Dynamic Systems: Analysis and Performance provides a high-level treatment of a general class of linear discrete-time dynamic systems interconnected over an information network, exchanging relative state measurements or output measurements. It presents a systematic analysis of the material and provides an account to the math development in a unified way. The topics in this book are structured along four dimensions: Agent, Environment, Interaction, and Organization, while keeping global (system-centered) and local (agent-centered) viewpoints. The focus is on the wide-sense consensus problem in discrete networked dynamic systems. The authors rely heavily on algebraic graph theory and topology to derive their results. It is known that graphs play an important role in the analysis of interactions between multiagent/distributed systems. Graph-theoretic analysis provides insight into how topological interactions play a role in achieving coordination among agents. Numerous types of graphs exist in the literature, depending on the edge set of G. A simple graph has no self-loop or edges. Complete graphs are simple graphs with an edge connecting any pair of vertices. The vertex set in a bipartite graph can be partitioned into disjoint non-empty vertex sets, whereby there is an edge connecting every vertex in one set to every vertex in the other set. Random graphs have fixed vertex sets, but the edge set exhibits stochastic behavior modeled by probability functions. Much of the studies in coordination control are based on deterministic/fixed graphs, switching graphs, and random graphs. This book addresses advanced analytical tools for characterization control, estimation and design of networked dynamic systems over fixed, probabilistic and time-varying graphs Provides coherent results on adopting a set-theoretic framework for critically examining problems of the analysis, performance and design of discrete distributed systems over graphs Deals with both homogeneous and heterogeneous systems to guarantee the generality of design results




Dynamical Systems on Networks


Book Description

This volume is a tutorial for the study of dynamical systems on networks. It discusses both methodology and models, including spreading models for social and biological contagions. The authors focus especially on “simple” situations that are analytically tractable, because they are insightful and provide useful springboards for the study of more complicated scenarios. This tutorial, which also includes key pointers to the literature, should be helpful for junior and senior undergraduate students, graduate students, and researchers from mathematics, physics, and engineering who seek to study dynamical systems on networks but who may not have prior experience with graph theory or networks. Mason A. Porter is Professor of Nonlinear and Complex Systems at the Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, UK. He is also a member of the CABDyN Complexity Centre and a Tutorial Fellow of Somerville College. James P. Gleeson is Professor of Industrial and Applied Mathematics, and co-Director of MACSI, at the University of Limerick, Ireland.




Discrete Networked Dynamic Systems


Book Description

Discrete Networked Dynamic Systems: Analysis and Performance provides a high-level treatment of a general class of linear discrete-time dynamic systems interconnected over an information network, exchanging relative state measurements or output measurements. It presents a systematic analysis of the material and provides an account to the math development in a unified way. The topics in this book are structured along four dimensions: Agent, Environment, Interaction, and Organization, while keeping global (system-centered) and local (agent-centered) viewpoints. The focus is on the wide-sense consensus problem in discrete networked dynamic systems. The authors rely heavily on algebraic graph theory and topology to derive their results. It is known that graphs play an important role in the analysis of interactions between multiagent/distributed systems. Graph-theoretic analysis provides insight into how topological interactions play a role in achieving coordination among agents. Numerous types of graphs exist in the literature, depending on the edge set of G. A simple graph has no self-loop or edges. Complete graphs are simple graphs with an edge connecting any pair of vertices. The vertex set in a bipartite graph can be partitioned into disjoint non-empty vertex sets, whereby there is an edge connecting every vertex in one set to every vertex in the other set. Random graphs have fixed vertex sets, but the edge set exhibits stochastic behavior modeled by probability functions. Much of the studies in coordination control are based on deterministic/fixed graphs, switching graphs, and random graphs. - This book addresses advanced analytical tools for characterization control, estimation and design of networked dynamic systems over fixed, probabilistic and time-varying graphs - Provides coherent results on adopting a set-theoretic framework for critically examining problems of the analysis, performance and design of discrete distributed systems over graphs - Deals with both homogeneous and heterogeneous systems to guarantee the generality of design results




Higher Order Networks: An Introduction to Simplicial Complexes


Book Description

This Element presents one of the most recent developments in network science in a highly accessible style. This Element will be of interest to interdisciplinary scientists working in network science, in addition to mathematicians working in discrete topology and geometry and physicists working in quantum gravity.




Nonlinear Pinning Control of Complex Dynamical Networks


Book Description

This book presents two nonlinear control strategies for complex dynamical networks. First, sliding-mode control is used, and then the inverse optimal control approach is employed. For both cases, model-based is considered in Chapter 3 and Chapter 5; then, Chapter 4 and Chapter 6 are based on determining a model for the unknow system using a recurrent neural network, using on-line extended Kalman filtering for learning. The book is organized in four sections. The first one covers mathematical preliminaries, with a brief review for complex networks, and the pinning methodology. Additionally, sliding-mode control and inverse optimal control are introduced. Neural network structures are also discussed along with a description of the high-order ones. The second section presents the analysis and simulation results for sliding-mode control for identical as well as non-identical nodes. The third section describes analysis and simulation results for inverse optimal control considering identical or non-identical nodes. Finally, the last section presents applications of these schemes, using gene regulatory networks and microgrids as examples.