scholarly journals Controllability of Weighted and Directed Networks with Nonidentical Node Dynamics

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Linying Xiang ◽  
Jonathan J. H. Zhu ◽  
Fei Chen ◽  
Guanrong Chen
Keyword(s):  
Graph Theory ◽  
Control Theory ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Directed Path ◽  
Directed Networks ◽  
Leaders And Followers ◽  
Heterogenous Network

The concept of controllability from control theory is applied to weighted and directed networks with heterogenous linear or linearized node dynamics subject to exogenous inputs, where the nodes are grouped into leaders and followers. Under this framework, the controllability of the controlled network can be decomposed into two independent problems: the controllability of the isolated leader subsystem and the controllability of the extended follower subsystem. Some necessary and/or sufficient conditions for the controllability of the leader-follower network are derived based on matrix theory and graph theory. In particular, it is shown that a single-leader network is controllable if it is a directed path or cycle, but it is uncontrollable for a complete digraph or a star digraph in general. Furthermore, some approaches to improving the controllability of a heterogenous network are presented. Some simulation examples are given for illustration and verification.

scholarly journals A perspective on graph theory-based stability analysis of impulsive stochastic recurrent neural networks with time-varying delays

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
M. Iswarya ◽  
R. Raja ◽  
G. Rajchakit ◽  
J. Cao ◽  
J. Alzabut ◽  
...  
Keyword(s):  
Neural Networks ◽  
Graph Theory ◽  
Exponential Stability ◽  
Recurrent Neural Networks ◽  
Lyapunov Functional ◽  
Large Scale ◽  
Sufficient Conditions ◽  
Distributed Delay ◽  
Theoretic Approach ◽  
Discrete Time Delay

AbstractIn this work, the exponential stability problem of impulsive recurrent neural networks is investigated; discrete time delay, continuously distributed delay and stochastic noise are simultaneously taken into consideration. In order to guarantee the exponential stability of our considered recurrent neural networks, two distinct types of sufficient conditions are derived on the basis of the Lyapunov functional and coefficient of our given system and also to construct a Lyapunov function for a large scale system a novel graph-theoretic approach is considered, which is derived by utilizing the Lyapunov functional as well as graph theory. In this approach a global Lyapunov functional is constructed which is more related to the topological structure of the given system. We present a numerical example and simulation figures to show the effectiveness of our proposed work.

scholarly journals Asymptotic Stability of Caputo Type Fractional Neutral Dynamical Systems with Multiple Discrete Delays

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Hai Zhang ◽  
Daiyong Wu ◽  
Jinde Cao
Keyword(s):  
Asymptotic Stability ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Algebraic Approach ◽  
Stability Criteria ◽  
Differential Systems ◽  
Discrete Delays ◽  
Transcendental Equations ◽  
The Stability ◽  
Theoretical Results

We discuss the delay-independent asymptotic stability of Caputo type fractional-order neutral differential systems with multiple discrete delays. Based on the algebraic approach and matrix theory, the sufficient conditions are derived to ensure the asymptotic stability for all time-delay parameters. By applying the stability criteria, one can avoid solving the roots of transcendental equations. The results obtained are computationally flexible and convenient. Moreover, an example is provided to illustrate the effectiveness and applicability of the proposed theoretical results.

scholarly journals p-box: a new graph model

2015 ◽  
Vol Vol. 17 no. 1 (Graph Theory) ◽  
Author(s):  
Mauricio Soto ◽  
Christopher Thraves-Caro
Keyword(s):  
Graph Theory ◽  
Graph Model ◽  
Directed Path ◽  
Outerplanar Graphs ◽  
New Model ◽  
Model Based ◽  
Representative Element ◽  
International Audience ◽  
Graph Families

Graph Theory International audience In this document, we study the scope of the following graph model: each vertex is assigned to a box in ℝd and to a representative element that belongs to that box. Two vertices are connected by an edge if and only if its respective boxes contain the opposite representative element. We focus our study on the case where boxes (and therefore representative elements) associated to vertices are spread in ℝ. We give both, a combinatorial and an intersection characterization of the model. Based on these characterizations, we determine graph families that contain the model (e. g., boxicity 2 graphs) and others that the new model contains (e. g., rooted directed path). We also study the particular case where each representative element is the center of its respective box. In this particular case, we provide constructive representations for interval, block and outerplanar graphs. Finally, we show that the general and the particular model are not equivalent by constructing a graph family that separates the two cases.

scholarly journals On the General Consensus Protocol in Multiagent Networks with Double-Integrator Dynamics and Coupling Time Delay

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Tao Dong ◽  
Xiaofeng Liao
Keyword(s):  
Time Delay ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Consensus Algorithm ◽  
Directed Network ◽  
Consensus Protocol ◽  
Special Cases ◽  
Coupling Time ◽  
Almost All ◽  
Double Integrator

This paper considers the problem of the convergence of the consensus algorithm for multiple agents in a directed network where each agent is governed by double-integrator dynamics and coupling time delay. The advantage of this protocol is that almost all the existing linear local interaction consensus protocols can be considered as special cases of the present paper. By combining algebraic graph theory and matrix theory and studying the distribution of the eigenvalues of the associated characteristic equation, some necessary and sufficient conditions are derived for reaching the second-order consensus. Finally, an illustrative example is also given to support the theoretical results.

scholarly journals Exponential Stability and Periodicity of Fuzzy Delayed Reaction-Diffusion Cellular Neural Networks with Impulsive Effect

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Guowei Yang ◽  
Yonggui Kao ◽  
Changhong Wang
Keyword(s):  
Neural Networks ◽  
Exponential Stability ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Neumann Boundary ◽  
Reaction Diffusion ◽  
Cellular Neural Networks ◽  
Impulsive Effect ◽  
Time Varying ◽  
Delayed Reaction

This paper considers dynamical behaviors of a class of fuzzy impulsive reaction-diffusion delayed cellular neural networks (FIRDDCNNs) with time-varying periodic self-inhibitions, interconnection weights, and inputs. By using delay differential inequality,M-matrix theory, and analytic methods, some new sufficient conditions ensuring global exponential stability of the periodic FIRDDCNN model with Neumann boundary conditions are established, and the exponential convergence rate index is estimated. The differentiability of the time-varying delays is not needed. An example is presented to demonstrate the efficiency and effectiveness of the obtained results.

Formation-containment control of sampled-data second-order multi-agent systems with sampling delay

2018 ◽  
Vol 40 (16) ◽  
pp. 4369-4381 ◽  
Author(s):  
Baojie Zheng ◽  
Xiaowu Mu
Keyword(s):  
Matrix Theory ◽  
Sufficient Conditions ◽  
Second Order ◽  
Control Problems ◽  
Sampled Data ◽  
Multi Agent Systems ◽  
Containment Control ◽  
Agent Systems ◽  
Multi Agent ◽  
Theoretical Results

The formation-containment control problems of sampled-data second-order multi-agent systems with sampling delay are studied. In this paper, we assume that there exist interactions among leaders and that the leader’s neighbours are only leaders. Firstly, two different control protocols with sampling delay are presented for followers and leaders, respectively. Then, by utilizing the algebraic graph theory and matrix theory, several sufficient conditions are obtained to ensure that the leaders achieve a desired formation and that the states of the followers converge to the convex hull formed by the states of the leaders, i.e. the multi-agent systems achieve formation containment. Furthermore, an explicit expression of the formation position function is derived for each leader. An algorithm is provided to design the gain parameters in the protocols. Finally, a numerical example is given to illustrate the effectiveness of the obtained theoretical results.

scholarly journals Exponential Stability of Stochastic Nonlinear Dynamical Price System with Delay

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Wenli Zhu ◽  
Xinfeng Ruan ◽  
Ye Qin ◽  
Jie Zhuang
Keyword(s):  
Time Delay ◽  
Exponential Stability ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Lyapunov Stability Theory ◽  
Price System ◽  
Nonlinear Dynamical ◽  
System With Delay ◽  
Exponentially Stable ◽  
Theoretical Results

Based on Lyapunov stability theory, Itô formula, stochastic analysis, and matrix theory, we study the exponential stability of the stochastic nonlinear dynamical price system. Using Taylor's theorem, the stochastic nonlinear system with delay is reduced to ann-dimensional semilinear stochastic differential equation with delay. Some sufficient conditions of exponential stability and corollaries for such price system are established by virtue of Lyapunov function. The time delay upper limit is solved by using our theoretical results when the system is exponentially stable. Our theoretical results show that if the classical price Rayleigh equation is exponentially stable, so is its perturbed system with delay provided that both the time delay and the intensity of perturbations are small enough. Two examples are presented to illustrate our results.

Multiconsensus of first-order multiagent systems with directed topologies

2020 ◽  
Vol 34 (23) ◽  
pp. 2050240
Author(s):  
Xiao-Wen Zhao ◽  
Guangsong Han ◽  
Qiang Lai ◽  
Dandan Yue
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Consensus Problem ◽  
Multiple Agents ◽  
First Order ◽  
The Matrix ◽  
Directed Topologies ◽  
Necessary And Sufficient ◽  
Theoretical Results

The multiconsensus problem of first-order multiagent systems with directed topologies is studied. A novel consensus problem is introduced in multiagent systems — multiconsensus. The states of multiple agents in each subnetwork asymptotically converge to an individual consistent value in the presence of information exchanges among subnetworks. Linear multiconsensus protocols are proposed to solve the multiconsensus problem, and the matrix corresponding to the protocol is designed. Necessary and sufficient conditions are derived based on matrix theory, under which the stationary multiconsensus and dynamic multiconsensus can be reached. Simulations are provided to demonstrate the effectiveness of the theoretical results.

scholarly journals Distributed Consensus Tracking for Second-Order Nonlinear Multiagent Systems with a Specified Reference State

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Guoguang Wen ◽  
Yongguang Yu ◽  
Zhaoxia Peng ◽  
Ahmed Rahmani
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Second Order ◽  
Lyapunov Theory ◽  
Reference Trajectory ◽  
Distributed Consensus ◽  
Consensus Tracking ◽  
Velocity Information ◽  
Virtual Leader

This paper mainly addresses the distributed consensus tracking problem for second-order nonlinear multiagent systems with a specified reference trajectory. The dynamics of each follower consists of two terms: nonlinear inherent dynamics and a simple communication protocol relying only on the position and velocity information of its neighbors. The consensus reference is taken as a virtual leader, whose output is only its position and velocity information that is available to only a subset of a group of followers. To achieve consensus tracking, a class of nonsmooth control protocols is proposed which reply on the relative information among the neighboring agents. Then some corresponding sufficient conditions are derived. It is shown that if the communication graph associated with the virtual leader and followers is connected at each time instant, the consensus can be achieved at least globally exponentially with the proposed protocol. Rigorous proofs are given by using graph theory, matrix theory, and Lyapunov theory. Finally, numerical examples are presented to illustrate the theoretical analysis.

Sign in / Sign up

Export Citation Format

Share Document