scholarly journals Reaching a Group-Agreement in Finite Time Under Acyclic Interaction Topology

2021 ◽  
Author(s):  
Xinru Ma ◽  
Hengyu Li ◽  
Tiehui Zhang ◽  
Jun Liu ◽  
Shaorong Xie ◽  
...  
Keyword(s):  
Finite Time ◽  
Multiagent System ◽  
Matrix Theory ◽  
Structural Characteristics ◽  
Mathematical Induction ◽  
Time Required ◽  
Interaction Topology ◽  
Theoretical Results ◽  
Group Agreement ◽  
Agreement Problem

Abstract This paper discusses the finite time agreement problem of networks with acyclic partition topology. In view of the structural characteristics of such network topology, mathematical induction is particularly suitable to prove the main conclusions in the paper. In addition, for the consideration of the finite time consensus problem, in addition to using basic matrix theory to verify the solution of the problem, this brief also has a more detailed analysis of the time required to reach consensus. Based on these two points, it is observed that the solution of this problem is due to the features of acyclic partition interactions and the continuity of the related finite time protocol and contributes to the research on the grouping consensus of multiagent system. Furthermore, simulation examples are presented to verify the theoretical results.

scholarly journals Consensus of Heterogeneous Multiagent Systems with Switching Dynamics

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Wenshuai Wang ◽  
Juling Wang ◽  
Huaizhu Wang ◽  
Yuanshi Zheng
Keyword(s):  
Multiagent Systems ◽  
Spanning Tree ◽  
Matrix Theory ◽  
Nonnegative Matrix ◽  
Time Dynamics ◽  
Switching Dynamics ◽  
Directed Spanning Tree ◽  
Interaction Topology ◽  
Theoretical Results ◽  
Double Integrator

Heterogeneity is an important feature of multiagent systems. This paper addresses the consensus problem of heterogeneous multiagent systems composed of first-integrator and double-integrator agents. The dynamics of each agent switches between continuous-time and discrete-time dynamics. By using the graph theory and nonnegative matrix theory, we derive that the system can achieve consensus if and only if the fixed interaction topology has a directed spanning tree. For switching topologies, we get that the system can reach consensus if each interaction topology has a directed spanning tree. Simulation examples are provided to demonstrate the effectiveness of our theoretical results.

scholarly journals Finite-Time Adaptive Fuzzy Control for Nonlinear Systems with Unknown Backlash-Like Hysteresis

2021 ◽  
Author(s):  
Shuzhen Diao ◽  
Wei Sun ◽  
Le Wang ◽  
Jing Wu
Keyword(s):  
Fuzzy Control ◽  
Finite Time ◽  
Fuzzy Systems ◽  
Tracking Error ◽  
Adaptive Fuzzy Control ◽  
Finite Time Stability ◽  
Adaptive Fuzzy ◽  
Intermediate Variable ◽  
Control Scheme ◽  
Theoretical Results

AbstractThis study considers the tracking control problem of the nonstrict-feedback nonlinear system with unknown backlash-like hysteresis, and a finite-time adaptive fuzzy control scheme is developed to address this problem. More precisely, the fuzzy systems are employed to approximate the unknown nonlinearities, and the design difficulties caused by the nonlower triangular structure are also overcome by using the property of fuzzy systems. Besides, the effect of unknown hysteresis input is compensated by approximating an intermediate variable. With the aid of finite-time stability theory, the proposed control algorithm could guarantee that the tracking error converges to a smaller region. Finally, a simulation example is provided to further verify the above theoretical results.

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.

Computation of Madalines' Sensitivity to Input and Weight Perturbations

2006 ◽  
Vol 18 (11) ◽  
pp. 2854-2877 ◽  
Author(s):  
Yingfeng Wang ◽  
Xiaoqin Zeng ◽  
Daniel So Yeung ◽  
Zhihang Peng
Keyword(s):  
Probability Theory ◽  
Computer Simulations ◽  
Structural Characteristics ◽  
Analytical Formula ◽  
Single Neurons ◽  
Important Measure ◽  
Simulation Results ◽  
Theoretical Results ◽  
Good Agreement

The sensitivity of a neural network's output to its input and weight perturbations is an important measure for evaluating the network's performance. In this letter, we propose an approach to quantify the sensitivity of Madalines. The sensitivity is defined as the probability of output deviation due to input and weight perturbations with respect to overall input patterns. Based on the structural characteristics of Madalines, a bottomup strategy is followed, along which the sensitivity of single neurons, that is, Adalines, is considered first and then the sensitivity of the entire Madaline network. Bymeans of probability theory, an analytical formula is derived for the calculation of Adalines' sensitivity, and an algorithm is designed for the computation of Madalines' sensitivity. Computer simulations are run to verify the effectiveness of the formula and algorithm. The simulation results are in good agreement with the theoretical 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.

An Improved Method for Calculating Free Vibrations in Systems of Several Degrees of Freedom

1938 ◽  
Vol 5 (2) ◽  
pp. A61-A66
Author(s):  
Winston M. Dudley
Keyword(s):  
Degrees Of Freedom ◽  
Numerical Solutions ◽  
Matrix Theory ◽  
Free Vibrations ◽  
Initial Disturbance ◽  
Improved Method ◽  
Matrix Methods ◽  
Computing Machine ◽  
The Matrix ◽  
Time Required

Abstract In 1934 two English investigators (1) published a method for calculating the various modes and frequencies of vibration of a system having several degrees of freedom. Their method, which is based on matrices, greatly shortens the time spent in obtaining numerical solutions in many important problems, notably those with immovable foundations. In this paper is presented a new theorem which (a) makes possible a further reduction of nearly one half in the time required, so that solutions up to 20 deg or more of freedom are now practical and (b) makes it then possible to determine the motion of the system after any initial disturbance in a few minutes, instead of several hours as required by older methods. It is useful in the latter respect whether the modes have been determined by matrix methods, or not. Although the paper gives simpler proofs than any previously published, knowledge of the matrix theory is not required in using the method. Problems are analyzed by a tabular process, in which an ordinary computing machine helps greatly. Comments based on computing experience are given. A simple numerical example has been given elsewhere (1).

Synchronization of time-varying time delayed neutral-type neural networks for finite-time in complex field

2021 ◽  
Vol 8 (3) ◽  
pp. 486-498
Author(s):  
N. Jayanthi ◽  
◽  
R. Santhakumari ◽  
Keyword(s):  
Neural Networks ◽  
Finite Time ◽  
State Feedback ◽  
Neutral Type ◽  
State Feedback Control ◽  
Projective Synchronization ◽  
Time Varying ◽  
Master System ◽  
Complex Valued ◽  
Theoretical Results

This paper deals with the problem of finite-time projective synchronization for a class of neutral-type complex-valued neural networks (CVNNs) with time-varying delays. A simple state feedback control protocol is developed such that slave CVNNs can be projective synchronized with the master system in finite time. By employing inequalities technique and designing new Lyapunov--Krasovskii functionals, various novel and easily verifiable conditions are obtained to ensure the finite-time projective synchronization. It is found that the settling time can be explicitly calculated for the neutral-type CVNNs. Finally, two numerical simulation results are demonstrated to validate the theoretical results of this paper.

scholarly journals Distributed Prescribed Finite Time Consensus Scheme for Economic Dispatch of Smart Grids with the Valve Point Effect

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Yingjiang Zhou ◽  
Shigao Zhu ◽  
Qian Chen
Keyword(s):  
Finite Time ◽  
Smart Grids ◽  
Optimization Problem ◽  
Multiagent System ◽  
Economic Dispatch ◽  
Time Result ◽  
Valve Point Effect

The distributed prescribed finite time consensus schemes for economic dispatch (ED) of smart grids with and without the valve point effect are researched in this paper. First, the optimization problem is transformed into a consensus of multiagent system problem, where both with and without the valve point effect are considered. Second, for the directed balance network, a prescribed finite time method has been arranged to solve the ED problem with and without the valve point effect. Third, with considering the constraints of generation units, the prescribed finite time result is also achieved. Finally, from the simulations, the efficiency of the proposed algorithms is validated.

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.

scholarly journals New Methods of Finite-Time Synchronization for a Class of Fractional-Order Delayed Neural Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Weiwei Zhang ◽  
Jinde Cao ◽  
Ahmed Alsaedi ◽  
Fuad E. Alsaadi
Keyword(s):  
Neural Networks ◽  
Fractional Order ◽  
Finite Time ◽  
Time Synchronization ◽  
Sufficient Conditions ◽  
Time Interval ◽  
Finite Time Interval ◽  
Delayed Neural Networks ◽  
New Methods ◽  
Theoretical Results

Finite-time synchronization for a class of fractional-order delayed neural networks with fractional order α, 0<α≤1/2 and 1/2<α<1, is investigated in this paper. Through the use of Hölder inequality, generalized Bernoulli inequality, and inequality skills, two sufficient conditions are considered to ensure synchronization of fractional-order delayed neural networks in a finite-time interval. Numerical example is given to verify the feasibility of the theoretical results.

Sign in / Sign up

Export Citation Format

Share Document