scholarly journals Leader-Following Bounded Consensus and Multiconsensus of Multiagent Systems

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Chao Long ◽  
Chunxi Yang ◽  
Guangsong Han ◽  
Yingbo Huang ◽  
Shichang Han

This paper investigates the problem of leader-following consensus and multiconsensus of multiagent systems. A leader-following and bounded consensus protocol via impulsive control for multiagent systems is proposed by using sampled position and velocity data. Consensus and multiconsensus commutative evolution stimulated by varying intelligence degrees of each agent can be achieved to avoid obstacles. Especially, the multiconsensus leader-following can be obtained without grouping the multiagent networks in advance. The necessary and sufficient condition is given to the leader-following bounded consensus tracking of the system by using the Hurwitz criterion and properties of the Laplacian matrix. A simulation is provided to verify the availability of the proposed impulsive control protocol. Furthermore, the result can be applied in obstacle avoidance and round up of target by regulating the intelligence degrees.

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Zhiyong Ye ◽  
Yungen Chen ◽  
Hua Zhang

The leader-following consensus problem for delayed multiagent systems is investigated over stochastic switching topologies via impulsive control method. A distributed consensus protocol is proposed based on sample data information. The convergence analysis for such algorithm over undirected and directed networks is provided, and some sufficient conditions to guarantee the consensus are also established. It is shown that delayed networks can achieve consensus even information is exchanged among followers just at some discrete moments. At last, some numerical examples are given to illustrate the effectiveness of the proposed protocols.


2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi-Wei Liu ◽  
Zhi-Hong Guan ◽  
Hong Zhou

This paper studied the consensus problem of the leader-following multiagent system. It is assumed that the state information of the leader is only available to a subset of followers, while the communication among agents occurs at sampling instant. To achieve leader-following consensus, a class of distributed impulsive control based on sampling information is proposed. By using the stability theory of impulsive systems, algebraic graph theory, and stochastic matrices theory, a necessary and sufficient condition for fixed topology and sufficient condition for switching topology are obtained to guarantee the leader-following consensus of the multiagent system. It is found that leader-following consensus is critically dependent on the sampling period, control gains, and interaction graph. Finally, two numerical examples are given to illustrate the effectiveness of the proposed approach and the correctness of theoretical analysis.


2019 ◽  
Vol 2019 ◽  
pp. 1-10
Author(s):  
Xiongfeng Deng ◽  
Xiuxia Sun ◽  
Shuguang Liu

In this paper, the consensus tracking problem of leader-following nonlinear control time-delay multiagent systems with directed communication topology is addressed. An improved high-order iterative learning control scheme with time-delay is proposed, where the local information between agents is considered. The uniformly global Lipschitz condition is applied to deal with the nonlinear dynamics. Then, a sufficient condition is driven, which guarantees that all the following agents track the trajectory of leader. Also, the convergence of proposed control protocol is analyzed by the norm theory. Finally, two cases are provided to illustrate the validity of theoretical results.


2016 ◽  
Vol 38 (12) ◽  
pp. 1434-1441 ◽  
Author(s):  
Hongjun Chu ◽  
Weidong Zhang

This paper addresses the consensus protocol design problem for linear multi-agent systems with input saturation. Existing consensus protocols usually contain certain global information, such as network size or the spectrum of the Laplacian matrix, and this global knowledge is often unavailable to all agents. In this paper, based on only the agent dynamics and the relative states of neighbouring agents, a novel adaptive consensus protocol is designed by assigning a time-varying coupling weight to each node. This protocol has two advantages: it is independent of any global information, and hence is fully distributed; and it is implemented by actuators with input saturation constraints. By combining the low-gain feedback method and appropriate Lyapunov techniques, it is shown that our protocol can achieve the semi-global consensus tracking in a fully distributed fashion, under the mild assumptions on agent dynamics and the topology graph. The results are illustrated by numerical simulations


2016 ◽  
Vol 2016 ◽  
pp. 1-5 ◽  
Author(s):  
Yanfen Cao ◽  
Yuangong Sun

We consider consensus of a class of third-order continuous-time multiagent systems with time delay in undirected networks. By using matrix analysis and a frequency domain approach, a necessary and sufficient condition for consensus is established. A simulation result is also given to illustrate the main theoretical result.


2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Ali Mustafa ◽  
Muhammad Najam ul Islam ◽  
Salman Ahmed ◽  
Muhammad Ahsan Tufail

Nearly all applications in multiagent systems demand precision, robustness, consistency, and rapid convergence in designing of distributed consensus algorithms. Keeping this thing in our sight, this research suggests a robust consensus protocol for distributed multiagent networks, continuing asynchronous communications, where agent’s states values are updated at diverse interval of time. This paper presents an asynchronous communication for both reliable and unreliable network topologies. The primary goal is to delineate local control inputs to attain time synchronization by processing the update information received by the agents associated in a communication topology. Additionally in order to accomplish the robust convergence, modelling of convergence analysis is conceded by commissioning the basic principles of graph and matrix theory alongside the suitable lemmas. Moreover, statistical examples presenting four diverse scenarios are provided in the end; produced results are the recognisable indicator to authenticate the robust effectiveness of the proposed algorithm. Likewise, a simulation comparison of the projected algorithm with the other existing approaches is conducted, considering different performance parameters are being carried out to support our claim.


2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Yanfen Cao ◽  
Yuangong Sun

We investigate consensus problem for third-order multiagent dynamical systems in directed graph. Necessary and sufficient conditions to consensus of third-order multiagent systems have been established under three different protocols. Compared with existing results, we focus on the relationship between the scaling strengths and the eigenvalues of the involved Laplacian matrix, which guarantees consensus of third-order multiagent systems. Finally, some simulation examples are given to illustrate the theoretical results.


2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Wei Zhu

The consensus problem for discrete time second-order multiagent systems with time delay is studied. Some effective methods are presented to deal with consensus problems in discrete time multiagent systems. A necessary and sufficient condition is established to ensure consensus. The convergence rate for reaching consensus is also estimated. It is shown that arbitrary bounded time delay can safely be tolerated. An example is presented to illustrate the theoretical result.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Ming Chi ◽  
Xu-Long Wang ◽  
Ding-Xin He ◽  
Zhi-Wei Liu

This paper studies the multiconsensus problem of multiagent networks based on sampled data information via the pulse-modulated intermittent control (PMIC) which is a general control framework unifying impulsive control, intermittent control, and sampling control. Two kinds of multiconsensus, including stationary multiconsensus and dynamic multiconsensus of multiagent networks, are taken into consideration in such control framework. Based on the eigenvalue analysis and algebraic graph theory, some necessary and sufficient conditions on the feedback gains and the control period are established to ensure the multiconsensus. Finally, several simulation results are included to show the theoretical results.


Sign in / Sign up

Export Citation Format

Share Document