scholarly journals Eigenvalue Based Approach for Global Consensus in Multiagent Systems with Nonlinear Dynamics

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Wei Qian ◽  
Lei Wang
Keyword(s):  
Nonlinear Dynamics ◽  
Multiagent Systems ◽  
Multiagent System ◽  
Symmetric Matrix ◽  
Algebraic Connectivity ◽  
Communication Graph ◽  
Consensus Protocol ◽  
Global Consensus ◽  
The Common ◽  
Analytical Result

This paper addresses the global consensus of nonlinear multiagent systems with asymmetrically coupled identical agents. By employing a Lyapunov function and graph theory, a sufficient condition is presented for the global exponential consensus of the multiagent system. The analytical result shows that, for a weakly connected communication graph, the algebraic connectivity of a redefined symmetric matrix associated with the directed graph is used to evaluate the global consensus of the multiagent system with nonlinear dynamics under the common linear consensus protocol. The presented condition is quite simple and easily verified, which can be effectively used to design consensus protocols of various weighted and directed communications. A numerical simulation is also given to show the effectiveness of the analytical result.

scholarly journals Distributed Node-to-Node Consensus of Multiagent Systems with Delayed Nonlinear Dynamics and Intermittent Communications

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Kexin Jia ◽  
Hongjie Li ◽  
Wenqiang Zheng ◽  
Qinyou Mou ◽  
Jiajun Shao
Keyword(s):  
Nonlinear Dynamics ◽  
Multiagent Systems ◽  
Matrix Theory ◽  
Lyapunov Stability Theory ◽  
Threshold Value ◽  
Consensus Protocol ◽  
Time Duration ◽  
Communication Time ◽  
Intermittent Measurements ◽  
Intermittent Communications

The paper is concerned with the problem of distributed node-to-node consensus of multiagent systems with delayed nonlinear dynamics and communication constraints. A new kind of consensus protocol based only on the intermittent measurements of neighboring agents is proposed to make each follower track the corresponding leader asymptotically. Based on the Lyapunov stability theory andM-matrix theory, some novel and simple criteria are derived for node-to-node consensus of multiagent systems. It is shown that consensus can be reached if the communication time duration is larger than the corresponding threshold value. Finally, a numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.

scholarly journals Consensus for Multiagent Systems with Nonlinear Dynamics and Time Delays Using a Two-Hop Relay Adaptive Method

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Qian Cao ◽  
Y. D. Song ◽  
Lei Wang ◽  
Feng Yang
Keyword(s):  
Nonlinear Dynamics ◽  
Multiagent Systems ◽  
Adaptive Algorithm ◽  
Time Delays ◽  
Closed Loop ◽  
Adaptive Method ◽  
Closed Loop System ◽  
Consensus Protocol ◽  
The Stability ◽  
Delay Margin

This paper investigates the consensus problem for multiagent systems with nonlinear dynamics and time delays. A distributed adaptive consensus protocol is proposed in which the time delays are explicitly included in the adaptive algorithm. It is shown that the resultant closed loop system involves doubly larger time delays, making the stability analysis nontrivial. Stability condition on maximum tolerable time delay is established and controlled by the proposed two-hop adaptive algorithm. The explicit expression of the delay margin is derived and analyzed in the frequency domain. Both the agent state errors and the estimation parameter errors converge to zero. A simulation example is illustrated to verify the theory results.

scholarly journals Event-Triggered-Based External Consensus Protocol of RBF-ARX-Model-Based Networked Multiagent Systems with Nonlinear Dynamics and Communication Delays

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Qi Lei ◽  
Ying Luo
Keyword(s):  
Nonlinear Dynamics ◽  
Multiagent Systems ◽  
Delay Compensation ◽  
Consensus Protocol ◽  
Consensus Control ◽  
Arx Model ◽  
Control Protocol ◽  
The Times ◽  
Networked Multiagent Systems ◽  
Event Triggered

An event-triggered-based external consensus control protocol with delay compensation for networked multiagent systems (NMASs) with nonlinear dynamics and network-induced delays is discussed in this paper. An RBF-ARX modelling method is adopted to approximate a nonlinear system. By utilizing the RBF-ARX model, the locally linearized time series model can be obtained to describe the behaviour of agents with nonlinear characteristics. An event-triggered control protocol with communication delay compensation is proposed to reduce the effects of network-induced delays and the times of the agent’s control update and communication between others by applying the idea of a prediction strategy. The event-triggered mechanism for each agent only depends on the deviation between its own output and the delay-compensated output of neighboring agents. Then, a distributed event-triggered-based and delay-compensated external consensus control protocol is given. Under this proposed control protocol, both the consensus and stability of the system can be proved. Finally, a numerical simulation is performed to verify the availability of our results.

Consensus Analysis and Formation Control of Second-Order Multiagent Systems Via Nonlinear Protocol

2013 ◽  
Vol 8 (3) ◽  
Author(s):  
Huan Pan ◽  
Xiaohong Nian ◽  
Ling Guo
Keyword(s):  
Multiagent Systems ◽  
Invariance Principle ◽  
Control Strategy ◽  
Formation Control ◽  
Multiagent System ◽  
Sufficient Conditions ◽  
Second Order ◽  
General Linear ◽  
Communication Graph ◽  
Consensus Analysis

This paper mainly investigates consensus and formation control of second-order multiagent system with undirected communication graph. A nonlinear protocol is proposed as an extension of general linear protocols that have been widely studied. In order to achieve formation control, a formation control strategy corresponding to the nonlinear protocol is designed too. The sufficient conditions of consensus and formation are derived based on LaSalle's invariance principle. Simulation examples are provided to illustrate that the second-order multiagent with the nonlinear protocol can achieve consensus and formation.

scholarly journals Weighted Couple-Group Consensus Analysis of Heterogeneous Multiagent Systems with Cooperative-Competitive Interactions and Time Delays

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Xingcheng Pu ◽  
Chaowen Xiong ◽  
Lianghao Ji ◽  
Longlong Zhao
Keyword(s):  
Time Delay ◽  
Multiagent Systems ◽  
Time Delays ◽  
Multiagent System ◽  
Experimental Simulation ◽  
Group Consensus ◽  
Consensus Protocol ◽  
Consensus Analysis ◽  
Communication Time ◽  
Nyquist Criterion

In this paper, the weighted couple-group consensus of continuous-time heterogeneous multiagent systems with input and communication time delay is investigated. A novel weighted couple-group consensus protocol based on cooperation and competition interaction is designed, which can relax the in-degree balance condition. By using graph theory, general Nyquist criterion and Gerschgorin disc theorem, the time delay upper limit that the system may allow is obtained. The conclusions indicate that there is no relationship between weighted couple-group consensus and communication time delay. When the agents input time delay, the coupling weight between the agents, and the systems control parameters are satisfied, the multiagent system can converge to any given weighted coupling group consistent state. The experimental simulation results verify the correctness of the conclusion.

scholarly journals Overlapping Community Discovery Method Based on Two Expansions of Seeds

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 18
Author(s):  
Yan Li ◽  
Jing He ◽  
Youxi Wu ◽  
Rongjie Lv
Keyword(s):  
Symmetric Matrix ◽  
Fitness Function ◽  
Local Maximum ◽  
Community Discovery ◽  
Network Nodes ◽  
Overlapping Community ◽  
The Common ◽  
New Research ◽  
Discovery Method ◽  
Discovery Algorithms

The real world can be characterized as a complex network sto in symmetric matrix. Community discovery (or community detection) can effectively reveal the common features of network groups. The communities are overlapping since, in fact, one thing often belongs to multiple categories. Hence, overlapping community discovery has become a new research hotspot. Since the results of the existing community discovery algorithms are not robust enough, this paper proposes an effective algorithm, named Two Expansions of Seeds (TES). TES adopts the topological feature of network nodes to find the local maximum nodes as the seeds which are based on the gravitational degree, which makes the community discovery robust. Then, the seeds are expanded by the greedy strategy based on the fitness function, and the community cleaning strategy is employed to avoid the nodes with negative fitness so as to improve the accuracy of community discovery. After that, the gravitational degree is used to expand the communities for the second time. Thus, all nodes in the network belong to at least one community. Finally, we calculate the distance between the communities and merge similar communities to obtain a less- undant community structure. Experimental results demonstrate that our algorithm outperforms other state-of-the-art algorithms.

scholarly journals MULTIAGENT SYSTEM OF FORECASTING OF CHAOTIC PROCESSES ON THE BASIS OF STATISTICAL EXTRAPOLATORS

2021 ◽  
Vol 56 ◽  
pp. 65-71
Author(s):  
Alexander A. Musaev ◽  
◽  
Andrey V. Gaikov ◽  
Keyword(s):  
Multiagent Systems ◽  
Chaotic System ◽  
Multiagent System ◽  
Intelligent Agent ◽  
System Component ◽  
Stationary Processes ◽  
Retrospective Data ◽  
System State ◽  
Generation Algorithm

The problem of the of a non-stationary system state predicting is considered. The decision based on the joint processing of the results obtained by a group of independent statistical extrapolators. In the terminology of multiagent systems, each extrapolator is an intelligent agent. The quality of the agent solutions is evaluated on retrospective data and is used as weight characteristic in the problem of a terminal solution estimation. The specificity of non-stationary processes with a chaotic system component leads to the empiricca version of the forecast generation algorithm

Sign in / Sign up

Export Citation Format

Share Document