Partial containment control over signed graphs

In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control signals. In this scenario, we study the problem of selecting the nodes where control signals have to be injected to maximize the number of contained nodes. Leveraging graph condensations, we find a suboptimal and computationally efficient solution to this problem, which can be implemented by solving an integer linear problem. The effectiveness of the selection strategy is illustrated through representative simulations.Comment: 6 pages, 3 figures, accepted for presentation at the 2019 European Control Conference (ECC19), Naples, Ital

A Combinatorial Necessary and Sufficient Condition for Cluster Consensus

In this technical note, cluster consensus of discrete-time linear multi-agent systems is investigated. A set of stochastic matrices $\mathcal{P}$ is said to be a cluster consensus set if the system achieves cluster consensus for any initial state and any sequence of matrices taken from $\mathcal{P}$. By introducing a cluster ergodicity coefficient, we present an equivalence relation between a range of characterization of cluster consensus set under some mild conditions including the widely adopted inter-cluster common influence. We obtain a combinatorial necessary and sufficient condition for a compact set $\mathcal{P}$ to be a cluster consensus set. This combinatorial condition is an extension of the avoiding set condition for global consensus, and can be easily checked by an elementary routine. As a byproduct, our result unveils that the cluster-spanning trees condition is not only sufficient but necessary in some sense for cluster consensus problems.Comment: 6 page

Partial containment control over signed graphs

In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control signals. In this scenario, we study the problem of selecting the nodes where control signals have to be injected to maximize the number of contained nodes. Leveraging graph condensations, we find a suboptimal and computationally efficient solution to this problem, which can be implemented by solving an integer linear problem. The effectiveness of the selection strategy is illustrated through representative simulations

Stability and Control in Complex Networks of Dynamical Systems

Stability analysis of networked dynamical systems has been of interest in many disciplines such as biology and physics and chemistry with applications such as LASER cooling and plasma stability. These large networks are often modeled to have a completely random (Erdös-Rényi) or semi-random (Small-World) topologies. The former model is often used due to mathematical tractability while the latter has been shown to be a better model for most real life networks. The recent emergence of cyber physical systems, and in particular the smart grid, has given rise to a number of engineering questions regarding the control and optimization of such networks. Some of the these questions are: How can the stability of a random network be characterized in probabilistic terms? Can the effects of network topology and system dynamics be separated? What does it take to control a large random network? Can decentralized (pinning) control be effective? If not, how large does the control network needs to be? How can decentralized or distributed controllers be designed? How the size of control network would scale with the size of networked system? Motivated by these questions, we began by studying the probability of stability of synchronization in random networks of oscillators. We developed a stability condition separating the effects of topology and node dynamics and evaluated bounds on the probability of stability for both Erdös-Rényi (ER) and Small-World (SW) network topology models. We then turned our attention to the more realistic scenario where the dynamics of the nodes and couplings are mismatched. Utilizing the concept of ε-synchronization, we have studied the probability of synchronization and showed that the synchronization error, ε, can be arbitrarily reduced using linear controllers. We have also considered the decentralized approach of pinning control to ensure stability in such complex networks. In the pinning method, decentralized controllers are used to control a fraction of the nodes in the network. This is different from traditional decentralized approaches where all the nodes have their own controllers. While the problem of selecting the minimum number of pinning nodes is known to be NP-hard and grows exponentially with the number of nodes in the network we have devised a suboptimal algorithm to select the pinning nodes which converges linearly with network size. We have also analyzed the effectiveness of the pinning approach for the synchronization of oscillators in the networks with fast switching, where the network links disconnect and reconnect quickly relative to the node dynamics. To address the scaling problem in the design of distributed control networks, we have employed a random control network to stabilize a random plant network. Our results show that for an ER plant network, the control network needs to grow linearly with the size of the plant network

Data based identification and prediction of nonlinear and complex dynamical systems

We thank Dr. R. Yang (formerly at ASU), Dr. R.-Q. Su (formerly at ASU), and Mr. Zhesi Shen for their contributions to a number of original papers on which this Review is partly based. This work was supported by ARO under Grant No. W911NF-14-1-0504. W.-X. Wang was also supported by NSFC under Grants No. 61573064 and No. 61074116, as well as by the Fundamental Research Funds for the Central Universities, Beijing Nova Programme.Peer reviewedPostprin

Robust Observation and Control of Complex Networks

The problem of understanding when individual actions of interacting agents display to a coordinated collective behavior has receiving a considerable attention in many research fields. Especially in control engineering, distributed applications in cooperative environments are achieving resounding success, due to the large number of relevant applications, such as formation control, attitude synchronization tasks and cooperative applications in large-scale systems. Although those problems have been extensively studied in Literature, themost of classic approaches use to consider the unrealistic scenario in which networks always consist of identical, linear, time-invariant entities. It’s clear that this assumption strongly approximates the effective behavior of a network. In fact agents can be subjected to parameter uncertainties, unmodeled dynamics or simply characterized by proper nonlinear dynamics. Therefore, motivated by those practical problems, the present Thesis proposes various approaches for dealing with the problem of observation and control in both the framework of multi-agents and complex interconnected systems. The main contributions of this Thesis consist on the development of several algorithms based on concepts of discontinuous slidingmode control. This techniques can be employed for solving in finite-time problems of robust state estimation and consensus-based synchronization in network of heterogenous nonlinear systems subjected to unknown but bounded disturbances and sudden topological changes. Both directed and undirected topologies have been taken into account. It is worth to mention also the extension of the consensus problem to networks of agents governed by a class parabolic partial differential equation, for which, for the first time, a boundary-based robust local interaction protocol has been presented

Robust Observation and Control of Complex Networks

The problem of understanding when individual actions of interacting agents display to a coordinated collective behavior has receiving a considerable attention in many research fields. Especially in control engineering, distributed applications in cooperative environments are achieving resounding success, due to the large number of relevant applications, such as formation control, attitude synchronization tasks and cooperative applications in large-scale systems. Although those problems have been extensively studied in Literature, themost of classic approaches use to consider the unrealistic scenario in which networks always consist of identical, linear, time-invariant entities. It’s clear that this assumption strongly approximates the effective behavior of a network. In fact agents can be subjected to parameter uncertainties, unmodeled dynamics or simply characterized by proper nonlinear dynamics. Therefore, motivated by those practical problems, the present Thesis proposes various approaches for dealing with the problem of observation and control in both the framework of multi-agents and complex interconnected systems. The main contributions of this Thesis consist on the development of several algorithms based on concepts of discontinuous slidingmode control. This techniques can be employed for solving in finite-time problems of robust state estimation and consensus-based synchronization in network of heterogenous nonlinear systems subjected to unknown but bounded disturbances and sudden topological changes. Both directed and undirected topologies have been taken into account. It is worth to mention also the extension of the consensus problem to networks of agents governed by a class parabolic partial differential equation, for which, for the first time, a boundary-based robust local interaction protocol has been presented