Consensusability of discrete-time multi-agent systems

The study of multi-agent systems (MAS) focuses on systems in which many intelligent agents interact within an environment. The agents are considered to be autonomous entities. MAS can be used to solve problems that are difficult or impossible for an individual agent to solve. The main feature which is achieved when developing MAS, if they work, is flexibility, since MAS can be added to, modified and reconstructed, without the need for detailed rewriting of the application. MAS can manifest self-organization as well as self-steering related complex behaviors even when the individual strategies of all their agents are simple. The goal of MAS research is to find methods that allow us to build complex systems composed of autonomous agents who, while operating on local knowledge and possessing only limited abilities, are nonetheless capable of enacting the desired global behaviors. We want to know how to take a description of what a system of agents should do and break it down into individual agent behaviors. This thesis investigates the problem when discrete-time MAS are consensusable under undirected graph. A discussion is provided to show how the problem differs from continuous time system. Then a consensusability condition is derived in terms of the Mahler measure of the agent system for single input single out systems (SISO) and result shows that there is an improved consensusability by a power of two. An algorithm is proposed for distributed consensus feedback control law when the consensusability holds. Also the case of output feedback is considered in which the consensusability problem becomes more complicated. To solve this we decompose the problem into two parts i.e. state feedback and state estimation. Simulation results demonstrate the effectiveness of the established results

Time-and event-driven communication process for networked control systems: A survey

Copyright © 2014 Lei Zou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In recent years, theoretical and practical research topics on networked control systems (NCSs) have gained an increasing interest from many researchers in a variety of disciplines owing to the extensive applications of NCSs in practice. In particular, an urgent need has arisen to understand the effects of communication processes on system performances. Sampling and protocol are two fundamental aspects of a communication process which have attracted a great deal of research attention. Most research focus has been on the analysis and control of dynamical behaviors under certain sampling procedures and communication protocols. In this paper, we aim to survey some recent advances on the analysis and synthesis issues of NCSs with different sampling procedures (time-and event-driven sampling) and protocols (static and dynamic protocols). First, these sampling procedures and protocols are introduced in detail according to their engineering backgrounds as well as dynamic natures. Then, the developments of the stabilization, control, and filtering problems are systematically reviewed and discussed in great detail. Finally, we conclude the paper by outlining future research challenges for analysis and synthesis problems of NCSs with different communication processes.This work was supported in part by the National Natural Science Foundation of China under Grants 61329301, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Mean-Field-Type Games in Engineering

A mean-field-type game is a game in which the instantaneous payoffs and/or the state dynamics functions involve not only the state and the action profile but also the joint distributions of state-action pairs. This article presents some engineering applications of mean-field-type games including road traffic networks, multi-level building evacuation, millimeter wave wireless communications, distributed power networks, virus spread over networks, virtual machine resource management in cloud networks, synchronization of oscillators, energy-efficient buildings, online meeting and mobile crowdsensing.Comment: 84 pages, 24 figures, 183 references. to appear in AIMS 201

Communication-constrained feedback stability and Multi-agent System consensusability in Networked Control Systems

With the advances in wireless communication, the topic of Networked Control Systems (NCSs) has become an interesting research subject. Moreover, the advantages they offer convinced companies to implement and use data networks for remote industrial control and process automation. Data networks prove to be very efficient for controlling distributed systems, which would otherwise require complex wiring connections on large or inaccessible areas. In addition, they are easier to maintain and more cost efficient. Unfortunately, stability and performance control is always going to be affected by network and communication issues, such as band-limited channels, quantization errors, sampling, delays, packet dropouts or system architecture. The first part of this research aims to study the effects of both input and output quantization on an NCS. Both input and output quantization errors are going to be modeled as sector bounded multiplicative uncertainties, the main goal being the minimization of the quantization density, while maintaining feedback stability. Modeling quantization errors as uncertainties allows for robust optimal control strategies to be applied in order to study the accepted uncertainty levels, which are directly related to the quantization levels. A new feedback law is proposed that will improve closed-loop system stability by increasing the upper bound of allowed uncertainty, and thus allowing the use of a coarser quantizer. Another aspect of NCS deals with coordination of the independent agents within a Multi-agent System (MAS). This research addresses the consensus problem for a set of discrete-time agents communicating through a network with directed information flow. It examines the combined effect of agent dynamics and network topology on agents\u27 consensusability. Given a particular consensus protocol, a sufficient condition is given for agents to be consensusable. This condition requires the eigenvalues of the digraph modeling the network topology to be outer bounded by a fan-shaped area determined by the Mahler measure of the agents\u27 dynamics matrix