Information Theory and Cooperative Control in Networked Multi-Agent Systems with Applications to Smart Grid

This dissertation focuses on information theoretic aspects of and cooperative control techniques in networked multi-agent systems (NMAS) with communication constraints. In the first part of the dissertation, information theoretic limitations of tracking problems in networked control systems, especially leader-follower systems with communication constraints, are studied. Necessary conditions on the data rate of each communication link for tracking of the leader-follower systems are provided. By considering the forward and feedback channels as one cascade channel, we also provide a lower bound for the data rate of the cascade channel for the system to track a reference signal such that the tracking error has finite second moment. Finally, the aforementioned results are extended to the case in which the leader system and follower system have different system models. In the second part, we propose an easily scalable hierarchical decision-making and control architecture for smart grid with communication constraints in which distributed customers equipped with renewable distributed generation (RDG) interact and trade energy in the grid. We introduce the key components and their interactions in the proposed control architecture and discuss the design of distributed controllers which deal with short-term and long-term grid stability, power load balancing and energy routing. At microgrid level, under the assumption of user cooperation and inter-user communications, we propose a distributed networked control strategy to solve the demand-side management problem in microgrids. Moreover, by considering communication delays between users and microgrid central controller, we propose a distributed networked control strategy with prediction to solve the demand-side management problem with communication delays. In the third part, we consider the disturbance attenuation and stabilization problem in networked control systems. To be specific, we consider the string stability in a large group of interconnected systems over a communication network. Its potential applications could be found in formation tracking control in groups of robots, as well as uncertainty reduction and disturbance attenuation in smart grid. We propose a leader-following consensus protocol for such interconnected systems and derive the sufficient conditions, in terms of communication topology and control parameters, for string stability. Simulation results and performance in terms of disturbance propagation are also given. In the fourth part, we consider distributed tracking and consensus in networked multi-agent systems with noisy time-varying graphs and incomplete data. In particular, a distributed tracking with consensus algorithm is developed for the space-object tracking with a satellite surveillance network. We also intend to investigate the possible application of such methods in smart grid networks. Later, conditions for achieving distributed consensus are discussed and the rate of convergence is quantified for noisy time-varying graphs with incomplete data. We also provide detailed simulation results and performance comparison of the proposed distributed tracking with consensus algorithm in the case of space-object tracking problem and that of distributed local Kalman filtering with centralized fusion and centralized Kalman filter. The information theoretic limitations developed in the first part of this dissertation provide guildlines for design and analysis of tracking problems in networked control systems. The results reveal the mutual interaction and joint application of information theory and control theory in networked control systems. Second, the proposed architectures and approaches enable scalability in smart grid design and allow resource pooling among distributed energy resources (DER) so that the grid stability and optimality is maintained. The proposed distributed networked control strategy with prediction provides an approach for cooperative control at RDG-equipped customers within a self-contained microgrid with different feedback delays. Our string stability analysis in the third part of this dissertation allows a single networked control system to be extended to a large group of interconnected subsystems while system stability is still maintained. It also reveals the disturbance propagation through the network and the effect of disturbance in one subsystem on other subsystems. The proposed leader-following consensus protocol in the constrained communication among users reveals the effect of communication in stabilization of networked control systems and the interaction between communication and control over a network. Finally, the distributed tracking and consensus in networked multi-agent systems problem shows that information sharing among users improves the quality of local estimates and helps avoid conflicting and inefficient distributed decisions. It also reveals the effect of the graph topologies and incomplete node measurements on the speed of achieving distributed decision and final consensus accuracy

On the genericity properties in networked estimation: Topology design and sensor placement

In this paper, we consider networked estimation of linear, discrete-time dynamical systems monitored by a network of agents. In order to minimize the power requirement at the (possibly, battery-operated) agents, we require that the agents can exchange information with their neighbors only \emph{once per dynamical system time-step}; in contrast to consensus-based estimation where the agents exchange information until they reach a consensus. It can be verified that with this restriction on information exchange, measurement fusion alone results in an unbounded estimation error at every such agent that does not have an observable set of measurements in its neighborhood. To over come this challenge, state-estimate fusion has been proposed to recover the system observability. However, we show that adding state-estimate fusion may not recover observability when the system matrix is structured-rank ($S$-rank) deficient. In this context, we characterize the state-estimate fusion and measurement fusion under both full $S$-rank and $S$-rank deficient system matrices.Comment: submitted for IEEE journal publicatio

Communication Theoretic Data Analytics

Widespread use of the Internet and social networks invokes the generation of big data, which is proving to be useful in a number of applications. To deal with explosively growing amounts of data, data analytics has emerged as a critical technology related to computing, signal processing, and information networking. In this paper, a formalism is considered in which data is modeled as a generalized social network and communication theory and information theory are thereby extended to data analytics. First, the creation of an equalizer to optimize information transfer between two data variables is considered, and financial data is used to demonstrate the advantages. Then, an information coupling approach based on information geometry is applied for dimensionality reduction, with a pattern recognition example to illustrate the effectiveness. These initial trials suggest the potential of communication theoretic data analytics for a wide range of applications.Comment: Published in IEEE Journal on Selected Areas in Communications, Jan. 201

Gossip Algorithms for Distributed Signal Processing

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This article presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page

Connected Coordination: Network Structure and Group Coordination

Networks can affect a group’s ability to solve a coordination problem. We utilize laboratory experiments to study the conditions under which groups of subjects can solve coordination games. We investigate a variety of different network structures, and we also investigate coordination games with symmetric and asymmetric payoffs. Our results show that network connections facilitate coordination in both symmetric and asymmetric games. Most significantly, we find that increases in the number of network connections encourage coordination even when payoffs are highly asymmetric. These results shed light on the conditions that may facilitate coordination in real-world networks