Next Article in Journal
Performance Comparison of Selected Filters in Fast Denoising of Oil Palm Hyperspectral Data
Previous Article in Journal
Study on Failure Characteristics and Acoustic Emission Laws of Rock-like Specimens under Uniaxial Compression
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Consensus Control of Leader–Follower Multi-Agent Systems with Unknown Parameters and Its Circuit Implementation

1
School of Business Administration, Jimei University, Xiamen 361021, China
2
School of Mathematics and Statistics, Minnan Normal University, Zhangzhou 363000, China
*
Author to whom correspondence should be addressed.
Appl. Sci. 2024, 14(19), 8894; https://doi.org/10.3390/app14198894
Submission received: 18 August 2024 / Revised: 29 September 2024 / Accepted: 30 September 2024 / Published: 2 October 2024

Abstract

:
With the development and progress of Internet and data technology, the consensus control of multi-agent systems has been an important topic in nonlinear science. How to effectively achieve the consensus of leader–follower multi-agent systems at a low cost is a difficult problem. This paper analyzes the consensus control of complex financial systems. Firstly, the dynamic characteristics of the financial system are analyzed by the equilibrium points, bifurcation diagrams, and Lyapunov exponent spectra. The behavior of the financial system is discussed by different parameter values. Secondly, according to the Lyapunov stability theorem, the consensus of master–slave systems is proposed by linear feedback control, wherein the controllers are simple and low cost. And an adaptive control method for the consensus of master–slave systems is investigated based on financial systems with unknown parameters. In theory, the consensus of the leader–follower multi-agent systems is proved by the parameter identification laws and linear feedback control method. Finally, the effectiveness and reliability of the consensus of leader–follower multi-agent systems are verified through the experimental simulation results and circuit implementation.

1. Introduction

There are many consensus phenomena in nature such as bird and fish clusters, and they are actually related to the consensus control problem of multi-agent systems. In recent years, the consensus problem of intelligent agents is one of important topics in nonlinear science. With the development of the Internet, big data technology, and artificial intelligence science, more possibilities are being provided for consensus control and practical application. How to control the behavior of multi-agent systems to achieve a predetermined or synchronized trajectory is an important topic, such as the consensus of unmanned aerial vehicles, robotic arms, aircraft, etc. Chaos is also one of the interesting phenomena in nonlinear science, and it has attracted much attention due to its high sensitivity to initial values and the complexity of its motion trajectory [1,2,3,4,5,6]. Some potential applications have been studied based on chaotic systems, such as finance model analysis [7,8], circuit implementation [9], chaos-based encryption [10,11,12], and secure communication [13,14]. In order to verify the effectiveness and feasibility of control methods for tracking or synchronizing complex behavior, chaotic systems can usually be used to simulate the motion trajectory of intelligent agents.
Many control methods have been proposed for the consensus or synchronization of complex dynamical systems, such as feedback control [15], active control [16,17], adaptive control [18,19], event-triggered control [20], pulse control [21,22], etc. In reference [23], an introduction to event-triggered coordination for multi-agent average consensus was investigated using the motivations of event-triggered strategies for consensus, methods for algorithm synthesis, technical challenges, and their applications in distributed control. In reference [24], the master–slave synchronization of a type of the complex-valued chaotic Lur’e systems with time delay was addressed with decomposing complex-valued dynamic systems into two real-valued systems. A nonlinear active controller was obtained to synchronize the two identical dissipative fermionic systems in their chaotic states for different initial values [17]. The role of different structures of coupling terms on the synchronization properties of master–slave chaotic system configurations was investigated based on the Lyapunov theory for linear systems with nonlinear vanishing perturbations [25]. Sufficient conditions for master–slave synchronization of Lur’e systems are presented for a known time delay in the master and slave systems [26]. In reference [27], the position control of a master–slave synchronization robotic arm driven by a D.C. motor using a PID (Proportional, Integral, and Derivative) controller with software and hardware design was analyzed. The sufficient conditions for the quasi-consensus of multi-agent systems were studied via event-triggered impulsive control [28]. A robust control protocol was proposed to the formation control of leader–follower multi-agent systems with unknown nonlinear input-constrained dynamics [29]. In reference [30], the adaptive control method with a switching set of the parameter estimate was discussed for the distributed leader–follower control of multi-agent systems. Fault-tolerant cooperative control was investigated by an uncertain leader system and multiple uncertain Euler–Lagrange systems, and a self-adjusting observer was designed to estimate the uncertain leader’s signal [31].
In reference [32], sufficient conditions regarding the existence of a time delay feedback controller were derived for two identical nonautonomous horizontal platform systems. To achieve master–salve synchronization, stochastic scheduling and Round-Robin scheduling protocols were proposed by appropriately designing the observer and controller for the slave system [33]. The stability of the synchronous solution was investigated by using the Lyapunov theory for perturbed systems and the Master–Stability Function approach, and the proposed synchronization scheme was experimentally validated with electronic circuits [34]. In reference [18], a feedback passivity-based controller design for the stabilization of fractional-order unified chaotic systems was proposed, and an adaptive mechanism was also employed such that the controller does not need to know the parameter of the systems. The chaos control and synchronization of fractional financial systems were studied by various control methodologies, such as active control [16], sliding mode control [35], etc. In reference [36], an efficient optimal controller based on Pontryagin’s maximum principle was designed for two identical financial models, and an adaptive controller established by the Lyapunov stability theory was also implemented.
Inspired by the above discussions, this paper investigates the dynamical behavior of financial systems, such as their equilibrium points, stability, bifurcation diagrams, and Lyapunov exponents. The consensus of leader–follower multi-agent systems is discussed based on complex financial systems. The main contributions are given as follows:
(1)
The dynamic characteristics of the financial system are analyzed, and the results show that the system behavior can be effectively controlled through the parameters of the financial system.
(2)
According to Lyapunov stability theorem, linear state feedback controllers are designed to synchronize financial systems. Meanwhile, adaptive control laws are derived for synchronization of master–slave systems with unknown parameters, and numerical simulations are given to verify the theoretical results.
(3)
The consensus theorem of leader–follower multi-agent systems is proved based on complex financial systems. The circuit implementation of master–slave systems consensus is provided through variable synchronization and parameter identification.
In this paper, the dynamic behavior of financial systems is first theoretically analyzed, and it is verified through both numerical simulation and circuit implementation. The circuit implementations effectively verify the behaviors of financial system, such as periodic and chaotic behaviors. Secondly, according to the stability theory of master–slave and leader–follower systems, theoretical methods of linear feedback and adaptive control for the consensus of multi-agent systems are proposed based on financial systems. Meanwhile, the feasibility and correctness of the control methods are verified by simulation experiments, and the circuit implementations validate the theoretical results from the perspective of hardware.
Different to the references mentioned above, this paper not only studies the linear feedback method to achieve the consensus of master–slave systems with less control costs, but it also investigates parameter identification when the parameters of the master or leader system are unknown. Parameter identification is very important in many practical models when there are some equipment failures or device aging in the actual system. In addition, the theoretical results of master–slave system synchronization and multi-agent consensus are verified through software simulation. Few literature sources propose circuit design for master–slave systems from the perspective of circuit implementation, especially for systems with unknown parameters. Circuit implementation provides a new method for the adaptive synchronization of master–slave systems.
The proposed linear feedback control method and parameter adaptive laws can be applied to consensus control for multi-agent systems, and they are useful for practical agents, such as the synchronization and consensus of unmanned systems, smart grids, and mobile robots. In addition, the circuit design for the proposed master–slave systems has important practical value in chaotic secure communication, chaotic cryptography, circuit design and modeling, etc.
The rest of the manuscript is organized as follows: In Section 2, a financial system is considered, and its dynamic characteristics are studied by the equilibrium point, bifurcation analysis, and Lyapunov exponents. In Section 3, the consensus of master–slave financial systems is presented by the linear feedback control method, and the consensus of master–slave financial systems with known and unknown parameters is given, respectively. In Section 4, the consensus of leader–follower multi-agent systems is shown based on complex financial systems with unknown parameters. In Section 5, the circuit implementation of financial systems and the consensus of master–slave financial systems are shown based on the use of Multisim 14.0, and the effectiveness of consensus is verified by numerical simulation and circuit implementation. Finally, a conclusion is presented.

2. Dynamic Analysis of the Financial System

According to references [7,8,36], a 3D financial system is established based on four sub-blocks: labor force, stock, money, and production. And the mathematical expression of a financial system is given as follows:
x ˙ = z + ( y a ) x , y ˙ = 1 b y x 2 , z ˙ = x c z ,
where the variables x , y , z represent the interest rate, investment demand, and price indices, respectively. And the parameters a , b , c ( a , b , c 0 ) are the saving, investment cost, and demand elasticity of the commodity, respectively. Hence, the Jacobian matrix of the system (1) is given by
J ( x , y ) = y a x 1 2 x b 0 1 0 c ,
and the Lyapunov exponents of the system (1) can be obtained when a = 0.9 , b = 0.1 , and c = 1 [7,8,36], i.e.,
LE 1 = 0.1401 , LE 2 = 0.0000 , LE 3 = 0.5302 .
The Lyapunov exponent is used to characterize the degree of convergence and dispersion of trajectories in a dynamical system. According to chaos theory, if there is a positive Lyapunov exponent, a zero exponent, and a negative exponent in a dynamical system, then the system is in a chaotic state. Obviously, in the system (1) exists a positive Lyapunov exponent LE 1 , so it is in a chaotic state.
The chaotic attractors of the system (1) are shown in Figure 1 when the initial values are ( x ( 0 ) , y ( 0 ) , z ( 0 ) ) = ( 0.1 , 0.2 , 0.1 ) . Obviously, the variables x ,   y and z are globally bounded and stable but locally unstable, and it has a high sensitivity to initial values.

2.1. Equilibrium Point of Financial System (1)

The equilibrium points of the financial system (1) are given by
z + ( y a ) x = 0 , 1 b y x 2 = 0 , x c z = 0 ,
so the equilibrium points are obtained by ( x ( e ) , y ( e ) , z ( e ) ) = ( 0 , 1 / b , 0 ) , and
( x ( e ) , y ( e ) , z ( e ) ) = ± ( ( a c + 1 ) b / c 1 ) , ( a c + 1 ) b / c , ± [ 1 ( a c + 1 ) b / c ] / c .
Therefore, the Jacobian matrix at the equilibrium point ( 0 , 1 / b , 0 ) is given by
J 1 = 1 / b a 0 1 0 b 0 1 0 c ,
so the corresponding eigenvalues are equal to λ 1 = 9 , λ 2 = 0.9 , λ 3 = 0.1 . As there is a positive eigenvalue, the system (1) is unstable at this equilibrium point. Similarly, the Jacobian matrices J 2 and J 3 at the equilibrium points in Equation (2) are given by
J 2 , 3 = ( a c + 1 ) b / c a ± ( ( a c + 1 ) b / c 1 ) 1 ± 2 ( ( a c + 1 ) b / c 1 ) b 0 1 0 c ,
and the eigenvalues of J 2 and J 3 are given by [37]
λ 1 J 2 = 0.5820 , λ 2 , 3 J 2 = 1.1960 ± 0.7293 i ; λ 1 J 3 = 0.5820 , λ 2 , 3 J 3 = 1.1960 ± 0.7284 i .
Obviously, the system (1) at these equilibrium points in Equation (2) is also unstable.

2.2. Bifurcation Analysis of Financial System (1)

There are three parameters a , b , and c in the financial system (1), and they exhibit chaotic behavior when a = 0.9 , b = 0.1 , and c = 1 . If one wants to control the system through its parameters, which parameter will be more effective? Therefore, a further discussion of this problem is given by the bifurcation with respect to the parameters, and the bifurcation of system (1) is shown in Figure 2a according to the bifurcation algorithm of a dynamical system in Algorithm 1. Meanwhile, the Lyapunov exponent spectrum is also shown in Figure 2b.
Algorithm 1: Algorithm of Bifurcation with Respect to Parameter c
Input:
Parameters a , b , initial values x ( 0 ) , y ( 0 ) , z ( 0 ) , c [ c l , c r ] , step of parameter c: h c = 0.01 ; t [ 0 , T ] , step of time t: h = 0.001 , allowable error δ 0
Output:
Poincaré cross-section points P when x = y
1
Calculate N c = round ( ( c r c l ) / h c ) , N = T / h , i = 1 , j = 1
2
Generate variables x , y and z based on system (1):
3
for  i N  do
4
       x ( i ) = x ( i 1 ) + x ˙ ( i 1 ) h
5
       y ( i ) = y ( i 1 ) + y ˙ ( i 1 ) h
6
       z ( i ) = z ( i 1 ) + z ˙ ( i 1 ) h
7
       i = i + 1
8
end
9
for  j N c  do (
10
      if  | x ( j ) y ( j ) | δ 0  then
11
           P ( j , : ) = z ( j )
12
      end
13
       j = j + 1 ;
14
end
Based on the Lyapunov exponent spectrum and the bifurcation diagram with respect to parameter c, the system (1) exhibits chaotic behavior when c ( 0.6 , 1.1 ) , but it exhibits periodic behavior when c ( 0.1 , 0.6 ) ( 1.1 , 2 ) . So, the dynamic behavior of the system (1) can be controlled by the demand elasticity of the commodity c. For example, the attractor of the financial system is shown in Figure 3 when c = 2 . Obviously, it can be in a periodic state when the parameter c changed from 1 to 2.
Remark 1.
Similarly, the bifurcation algorithm can also be used to calculate the bifurcation diagrams with respect to parameters a and b. According to the results of bifurcation, the system (1) keeps at a state of chaos when the parameters a and b belong to the interval [ 0 , 3 ] . Therefore, if one wants to control the behavior of the financial system (1) to be periodic, then the parameter c may be better than parameters a and b.

3. Consensus Control of Master–Slave Systems

3.1. Consensus Control of Master–Slave Financial Systems

The master system is given by financial system (1), and the slave system with linear controllers u x , u y can be obtained as follows:
x ˙ 1 = z 1 + ( y 1 a ) x 1 + u x , y ˙ 1 = 1 b y 1 x 1 2 + u y , z ˙ 1 = x 1 c z 1 ,
where a = 0.9 , b = 0.1 , c = 1 , u x , and u y are linear controllers. If one defines the errors e x = x x 1 , e y = y y 1 , e z = z z 1 , then the error system is obtained by
e ˙ x = e z a e x + y e x + x 1 e y u x , e ˙ y = b e y ( x + x 1 ) e x u y , e ˙ z = e x c e z ,
where u x = k x e x , u y = k y e y .
Definition 1.
If the errors e x , e y , and e z of Equation (4) tend to zero as time t + , then the master–slave systems (1) and (3) have achieved synchronization or consensus.
Theorem 1.
If the suitable gain coefficients k x and k y are chosen such that
k x > a + y + 1 , k y > b + x 2 / 4 ,
then the master–slave systems (1) and (3) are globally synchronized.
Proof of Theorem 1.
According to the error system (4), if the Lyapunov function is
V = ( e x 2 + e y 2 + e z 2 ) / 2 ,
then its derivative is
V ˙ = e x e ˙ x + e y e ˙ y + e z e ˙ z = e x ( e z a e x + y e x + x 1 e y u x ) + e y ( b e y ( x + x 1 ) e x u y ) + e z ( e x c e z ) = ( a + y k x ) e x 2 + ( b k y ) e y 2 c e z 2 x e x e y = ( a + y + 1 k x ) e x 2 + ( b + x 2 / 4 k y ) e y 2 c e z 2 ( e x + x e y / 2 ) 2 .
According the condition in Equation (5), one has V ˙ < 0 . According to the Lyapunov stability theory [38,39], the system (4) is globally exponentially stable about the origin if k x > a + y + 1 , k y > b + x 2 / 4 , i.e., the master–slave systems (1) and (3) are globally synchronized. □
Example 1.
According to the attractor of system (1), the variables x , y satisfy | x | < 3 , y < 4 , so the gain coefficients of the controllers u x and u y can be given by k x = 4.1 , k y = 2.2 based on Theorem 1. And the initial values of master–slave systems are ( x ( 0 ) , y ( 0 ) , z ( 0 ) ) = ( 0.1 , 0.2 , 0.1 ) , and ( x 1 ( 0 ) , y 1 ( 0 ) , z 1 ( 0 ) ) = ( 0.2 , 0.1 , 0.3 ) , respectively.
The synchronization errors e x , e y , and e z are shown in Figure 4 by Matlab R2020b. Obviously, the master–slave systems have reached consensus as t + .
Remark 2.
Consensus control usually refers to the consensus problem among multiple systems. In this paper, only the synchronization control method for master–slave systems is proposed, because the topological network structure between multiple systems is not provided. However, this control method can be extended to multiple slave systems to synchronize with the master system (1), and then the consensus control among multiple systems is easily obtained. Furthermore, the new slave systems can also be designed to synchronize with the slave system (3), so the consensus control for multiple systems is also achieved in the end.

3.2. Consensus of Master–Slave Systems with Unknown Parameters

If the parameters a , b , c of master system (1) are unknown, then the slave system with estimated parameters a ^ , b ^ , c ^ and linear controllers can be given as follows:
x ˙ 1 = z 1 + ( y 1 a ^ ) x 1 + u x , y ˙ 1 = 1 b ^ y 1 x 1 2 + u y , z ˙ 1 = x 1 c ^ z 1
where a ^ , b ^ , c ^ are the estimations of parameters a , b , c , respectively. And u x , u y are linear controllers. If the errors are e x = x x 1 , e y = y y 1 , e z = z z 1 , e a = a a ^ , e b = b b ^ , and e c = c c ^ , then the error system is obtained by
e ˙ x = e z a e x x 1 e a + y e x + x 1 e y u x , e ˙ y = b e y y 1 e b ( x + x 1 ) e x u y , e ˙ z = e x c e z z 1 e c ,
where u x = k x e x , u y = k y e y .
Theorem 2.
If the suitable gain coefficients k x and k y are chosen such that
k x > a + y + 1 , k y > b + x 2 / 4 ,
and the adaptive laws for estimated parameters a ^ , b ^ , c ^ are given by
a ^ ˙ = x 1 ( x x 1 ) , b ^ ˙ = y 1 ( y y 1 ) , c ^ ˙ = z 1 ( z z 1 ) ,
then the master–slave systems (1) and (6) are globally synchronized.
Proof Theorem 2.
According to the system (7), if the Lyapunov function is given by
V = ( e x 2 + e y 2 + e z 2 + e a 2 + e b 2 + e c 2 ) / 2
then its derivative is
V ˙ = e x e ˙ x + e y e ˙ y + e z e ˙ z + e a e ˙ a + e b e ˙ b + e c e ˙ c = e x ( e z a e x x 1 e a + y e x + x 1 e y u x ) + e y ( b e y y 1 e b ( x + x 1 ) e x u y ) + e z ( e x c e z z 1 e c ) + e a e ˙ a + e b e ˙ b + e c e ˙ c = e x 2 ( 1 a + y k x ) + e y 2 ( b + x 2 / 4 k y ) c e z 2 x 1 e x e a + e a e ˙ a y 1 e y e b + e b e ˙ b z 1 e z e c + e c e ˙ c .
If the following conditions are satisfied, i.e., x 1 e x e a + e a e ˙ a = 0 , y 1 e y e b + e b e ˙ b = 0 , z 1 e z e c + e c e ˙ c = 0 , then one has e a = 0 , e b = 0 , e c = 0 , or a ^ ˙ = x 1 ( x x 1 ) , b ^ ˙ = y 1 ( y y 1 ) , c ^ ˙ = z 1 ( z z 1 ) .
Therefore, one has V ˙ < 0 by the condition in Equation (8). According to the Lyapunov stability theory, the system (7) is globally exponentially stable about the origin if k x > a + y + 1 , k y > b + x 2 / 4 , i.e., the master–slave systems (1) and (6) are globally synchronized. □
Example 2.
The gain coefficients k x = 4.1 , k y = 2.2 according to Theorem 2, and the initial values of master–slave systems are given by ( x ( 0 ) , y ( 0 ) , z ( 0 ) ) = ( 0.1 , 0.2 , 0.1 ) , ( x 1 ( 0 ) , y 1 ( 0 ) , z 1 ( 0 ) ) = ( 0.2 , 0.1 , 0.3 ) , and ( a ^ ( 0 ) , b ^ ( 0 ) , c ^ ( 0 ) ) = ( 0.8 , 0.2 , 0.7 ) , respectively.
The synchronization errors e x , e y , and e z are shown in Figure 5a. The master–slave systems have reached consensus as t + . In Figure 5b, the parameters a ^ , b ^ , c ^ of slave system (6) can track to the a , b , c of master system (1) as t + .

4. Consensus of Leader–Follower Multi-Agent Systems with Unknown Parameters

In this section, the consensus of leader–follower multi-agent systems with unknown parameters is discussed in terms of the Lyapunov stability theorem. The definition of the consensus of leader–follower multi-agent systems is given as follows.
Definition 2.
The leader–follower multi-agent systems are consistent if the following conditions are satisfied: lim t + e 0 i = 0 , i = 1 , 2 , , where e 0 i denotes the error between the leader and ith follower.

4.1. Consensus of Leader–Follower Multi-Agent Systems

As the financial system (1) behaves with a complex motion trajectory when it is at a state of chaos, so it is chosen as the leader system, i.e.,
x ˙ 0 = z 0 + ( y 0 a ) x 0 , y ˙ 0 = 1 b y 0 x 0 2 , z ˙ 0 = x 0 c z 0 .
The ith ( i = 1 , 2 , ) follower system with estimated parameters a ^ i , b ^ i , c ^ i and two linear controllers u 0 i ( x ) , u 0 i ( y ) is given as follows:
x ˙ i = z i + ( y i a ^ i ) x i + u 0 i ( x ) , y ˙ i = 1 b ^ i y i x i 2 + u 0 i ( y ) , z ˙ i = x i c ^ i z i ,
where a ^ i , b ^ i , c ^ i are the estimations of parameters a , b , c , respectively. And u 0 i ( x ) , u 0 i ( y ) are the linear feedback controllers of ith follower. If the errors of the leader and ith follower are given by
e 0 i ( x ) = x 0 x i , e 0 i ( y ) = y 0 y i , e 0 i ( z ) = z 0 z i , e 0 i ( a ) = a a ^ i , e 0 i ( b ) = b b ^ i , e 0 i ( c ) = c c ^ i ,
then the error system between the leader and ith follower is obtained by
e ˙ 0 i ( x ) = e 0 i ( z ) a e 0 i ( x ) x i e 0 i ( a ) + y 0 e 0 i ( x ) + x i e 0 i ( y ) u 0 i ( x ) , e ˙ 0 i ( y ) = b e 0 i ( y ) y i e 0 i ( b ) ( x 0 + x i ) e 0 i ( x ) u 0 i ( y ) , e ˙ 0 i ( z ) = e 0 i ( x ) c e 0 i ( z ) z i e 0 i ( c ) ,
where u 0 i ( x ) = a 0 i k 0 i ( x ) e 0 i ( x ) + j = 1 N a i j k i j ( x ) ( x i x j ) , u 0 i ( y ) = a 0 i k 0 i ( y ) e 0 i ( y ) + j = 1 N a i j k i j ( y ) ( y i y j ) , ( i = 1 , 2 , ) .
The a i j denotes the connection between ith and jth agents. If there is an edge between followers i and j, then a i j = 1 . And a i j = 0 if there is not any edge between the ith and jth followers. k i j ( x ) and k i j ( y ) are the feedback gains, and the k i j ( x ) = k i j ( y ) = 0 in the case of a 0 i = 1 . Obviously, it is easy to obtain the following Theorem 3 based on Theorem 2.
Theorem 3.
If the suitable gain coefficients k 0 i ( x ) and k 0 i ( y ) ( i = 0 , 1 , ) are chosen such that
k 0 i ( x ) > a + y 0 + 1 , k 0 i ( y ) > b + x 0 2 / 4 ,
and the adaptive laws for estimated parameters a ^ i , b ^ i , c ^ i are given by
a ^ ˙ i = a 0 i x i ( x 0 x i ) , b ^ ˙ i = a 0 i y i ( y 0 y i ) , c ^ ˙ i = a 0 i z i ( z 0 z i ) ,
then the leader–follower systems (10) and (11) are globally synchronized.
Similarly, the jth ( j = 2 , ) follower system with estimated parameters a ^ j , b ^ j , c ^ j and linear feedback controllers u i j ( x ) , u i j ( y ) is given as follows:
x ˙ j = z j + ( y j a ^ j ) x j + u i j ( x ) y ˙ j = 1 b ^ j y j x j 2 + u i j ( y ) z ˙ j = x j c ^ j z j
If the jth follower is connected with the ith follower, and the errors between the ith and jth followers are defined as
e i j ( x ) = x i x j , e i j ( y ) = y i y j , e i j ( z ) = z i z j , e i j ( a ) = a i a ^ j , e i j ( b ) = b i b ^ j , e i j ( c ) = c i c ^ j ,
then the error system between the ith and jth followers is obtained as follows
e ˙ i j ( x ) = e i j ( z ) a ^ i e i j ( x ) x j e i j ( a ) + y i e i j ( x ) + x j e i j ( y ) + u 0 i ( x ) u i j ( x ) , e ˙ i j ( y ) = b ^ i e i j ( y ) y j e i j ( b ) ( x i + x j ) e i j ( x ) + u 0 i ( y ) u i j ( y ) , e ˙ i j ( z ) = e i j ( x ) c ^ i e i j ( z ) z j e i j ( c ) ,
where u i j ( x ) = j = 1 N a i j k i j ( x ) ( x i x j ) , u i j ( y ) = j = 1 N a i j k i j ( y ) ( y i y j ) ( i = 1 , 2 , ).
Theorem 4.
If the suitable gain coefficients k i j ( x ) and k i j ( y ) ( i , j = 0 , 1 , ) are chosen such that
k i j ( x ) > 1 a ^ i + y i , k i j ( y ) > b ^ + x i 2 / 4 ,
and the adaptive laws for estimated parameters a ^ j , b ^ j , c ^ j are given by
a ^ ˙ j = x j e i j ( x ) , b ^ ˙ j = y j e i j ( y ) , c ^ ˙ j = z j e i j ( z ) ,
then the ith follower in system (11) and jth follower in Equation (15) are globally synchronized.
Proof of Theorem 4.
According to the error system (16), the synchronization of ith follower and jth follower is proved by the Lyapunov stability theorem, and the Lyapunov function of the ith follower and the jth follower is given by
V i j = ( ( e i j ( x ) ) 2 + ( e i j ( y ) ) 2 + ( e i j ( z ) ) 2 + ( e i j ( a ) ) 2 + ( e i j ( b ) ) 2 + ( e i j ( c ) ) 2 ) / 2 ,
and the a 0 i = 0 , k i j ( x ) , k i j ( y ) > 0 ; then, its derivative is
V ˙ i j = e i j ( x ) e ˙ i j ( x ) + e i j ( y ) e ˙ i j ( y ) + e i j ( z ) e ˙ i j ( z ) + e i j ( a ) e ˙ i j ( a ) + e i j ( b ) e ˙ i j ( b ) + e i j ( c ) e ˙ i j ( c ) = e i j ( x ) ( e i j ( z ) a ^ i e i j ( x ) x j e i j ( a ) + y i e i j ( x ) + x j e i j ( y ) u i j ( x ) ) + e i j ( y ) ( b ^ i e i j ( y ) y j e i j ( b ) ( x i + x j ) e i j ( x ) u i j ( y ) ) + e i j ( z ) ( e i j ( x ) c ^ i e i j ( z ) z j e i j ( c ) ) + e i j ( a ) e ˙ i j ( a ) + e i j ( b ) e ˙ i j ( b ) + e i j ( c ) e ˙ i j ( c ) = ( e i j ( x ) ) 2 ( 1 a ^ i + y i k i j ( x ) a i j ) + ( e i j ( y ) ) 2 ( b ^ i + x i 2 / 4 a i j k i j ( y ) ) c ^ i ( e i j ( z ) ) 2 e i j ( x ) l = 1 , l j N a i l k i l ( x ) ( x i x l ) e i j ( y ) l = 1 , l j N a i l k i l ( y ) ( y i y l ) x j e i j ( x ) e i j ( a ) + e i j ( a ) e ˙ i j ( a ) y j e i j ( y ) e i j ( b ) + e i j ( b ) e ˙ i j ( b ) z j e i j ( z ) e i j ( c ) + e i j ( c ) e ˙ i j ( c ) .
If the following conditions are satisfied, i.e.,
x j e i j ( x ) e i j ( a ) + e i j ( a ) e ˙ i j ( a ) = 0 , y j e i j ( y ) e i j ( b ) + e i j ( b ) e ˙ i j ( b ) = 0 , z j e i j ( z ) e i j ( c ) + e i j ( c ) e ˙ i j ( c ) = 0 ,
then one has e i j ( a ) = 0 , e i j ( b ) = 0 , e i j ( c ) = 0 , or a ^ ˙ j = x j e i j ( x ) , b ^ ˙ j = y j e i j ( y ) , c ^ ˙ j = z j e i j ( z ) .
The ith follower is synchronized with the leader as t + , so the ith follower will synchronize with the lth follower as t + , i.e.,
lim t + ( x i x l ) = 0 , lim t + ( y i y l ) = 0 , lim t + ( z i z l ) = 0 , lim t + ( a ^ i a l ) = 0 , lim t + ( b ^ i b l ) = 0 , lim t + ( c ^ i c l ) = 0 . ( l j )
As the a i l , k i l ( x ) , k i l ( y ) , k i l ( z ) are bounded, one has
lim t + l = 1 , l j N a i l k i l ( x ) ( x i x l ) = 0 , lim t + l = 1 , l j N a i l k i l ( y ) ( y i y l ) = 0 .
Therefore, one has V ˙ i j < 0 by the condition in Equation (17). According to the Lyapunov stability theory, the error system (16) is globally exponentially stable about the origin if k i j ( x ) > 1 a ^ i + y i , k i j ( y ) > b ^ i + x i 2 / 4 , i.e., the ith follower and jth follower in Equation (11) are globally synchronized. □

4.2. Numerical Simulations

Therefore, two examples of leader–follower multi-agent systems are given to show the proposed control method, and they are given as follows:
Example 3.
The leader–follower network among five agents is given in Figure 6a, where “0” denotes the leader, “1,2,3,4” denote the followers, the 1th and 2th followers are connected with leader, and the 3th and 4th followers are only connected with 2th follower.
The initial values ( x i ( 0 ) , y i ( 0 ) , z i ( 0 ) ) and the parameters ( a ^ i ( 0 ) , b ^ i ( 0 ) , c ^ i ( 0 ) ) of leader and followers are given by
( x 0 ( 0 ) , y 0 ( 0 ) , z 0 ( 0 ) ) = ( 0.1 , 0.2 , 0.1 ) , ( x 1 ( 0 ) , y 1 ( 0 ) , z 1 ( 0 ) ) = ( 0.2 , 0.1 , 0.3 ) , ( x 2 ( 0 ) , y 2 ( 0 ) , z 2 ( 0 ) ) = ( 0.1 , 1.1 , 1.3 ) , ( x 3 ( 0 ) , y 3 ( 0 ) , z 3 ( 0 ) ) = ( 1.2 , 0.5 , 0.1 ) , ( x 4 ( 0 ) , y 4 ( 0 ) , z 4 ( 0 ) ) = ( 0.6 , 0.7 , 0.2 ) , k i j ( x ) = 4.1 , k i j ( y ) = 2.2 , ( a 0 ( 0 ) , b 0 ( 0 ) , c 0 ( 0 ) ) = ( 0.9 , 0.1 , 1 ) , ( a ^ 1 ( 0 ) , b ^ 1 ( 0 ) , c ^ 1 ( 0 ) ) = ( 0.8 , 0.2 , 0.7 ) , ( a ^ 2 ( 0 ) , b ^ 2 ( 0 ) , c ^ 2 ( 0 ) ) = ( 0.7 , 0.4 , 0.6 ) , ( a ^ 3 ( 0 ) , b ^ 3 ( 0 ) , c ^ 3 ( 0 ) ) = ( 0.71 , 0.35 , 0.64 ) , ( a ^ 4 ( 0 ) , b ^ 4 ( 0 ) , c ^ 4 ( 0 ) ) = ( 0.68 , 0.5 , 0.6 ) .
The numerical simulation results based on Matlab R2020a are shown in Figure 7. All agents have reached consensus, and followers have also achieved accurate identification of the parameters of the leader system.
Example 4.
The leader–follower network among six agents is given in Figure 6b, where “0” denotes the leader and “1,2,3,4,5” denote the followers. Two followers are connected with leader, the 3th follower is connected with 1th and 2th follows, and 5th follower is connected with 4th, 3th, and 2th followers.
Similarly, the initial values ( x i ( 0 ) , y i ( 0 ) , z i ( 0 ) ) of leader and followers are given in Equation (19), and the initials of the 5th follower are given by ( x 5 ( 0 ) , y 5 ( 0 ) , z 5 ( 0 ) ) = ( 0.5 , 0.4 , 0.3 ) ; the initial estimated parameters are given by ( a ^ 5 ( 0 ) , b ^ 5 ( 0 ) , c ^ 5 ( 0 ) ) = ( 0.58 , 0.4 , 0.7 ) . The numerical simulation results based on Matlab R2020a are shown in Figure 8. All agents have reached consensus, and the followers have also achieved accurate identification of the parameters a , b , and c of the leader system.
Remark 3.
In the network of the agents in Figure 6b, the 3th agent communicates with 1th and 2th agents. Therefore, the parameters identification can choose the parameters of 1th or 2th agents to track and identify. Similarly, the 5th agent communicates with the 2th, 3th, and 4th agents, and then one of these agents can be selected for the parameters tracking and identification.
Remark 4.
Although there are only two simple leader–follower multi-agent systems are provided to verify the feasibility of linear feedback and adaptive method, the proposed method can be also extended to other complex leader–follower multi-agent systems, and the multi-agent systems can complete consensus as t + .

4.3. Discussions of the Consensus for Multi-Agent Systems

In order to demonstrate the advantages of the proposed control method, the analysis of control costs and parameters adaptive laws are discussed with the initial errors:
| e 01 ( x ) ( 0 ) | = 0.1 , | e 01 ( y ) ( 0 ) | = 0.1 , | e 01 ( z ) ( 0 ) | = 0.2 ; | e 02 ( x ) ( 0 ) | = 0.0 , | e 02 ( y ) ( 0 ) | = 0.9 , | e 02 ( z ) ( 0 ) | = 1.2 ; | e 23 ( x ) ( 0 ) | = 1.1 , | e 23 ( y ) ( 0 ) | = 0.6 , | e 23 ( z ) ( 0 ) | = 1.2 ; | e 24 ( x ) ( 0 ) | = 0.5 , | e 24 ( y ) ( 0 ) | = 0.4 , | e 24 ( z ) ( 0 ) | = 1.1 ,
and the initial parameters errors
| e 01 ( a ) ( 0 ) | = 0.1 , | e 01 ( b ) ( 0 ) | = 0.1 , | e 01 ( c ) ( 0 ) | = 0.3 ; | e 02 ( a ) ( 0 ) | = 0.2 , | e 02 ( b ) ( 0 ) | = 0.3 , | e 02 ( c ) ( 0 ) | = 0.4 ; | e 23 ( a ) ( 0 ) | = 0.19 , | e 23 ( b ) ( 0 ) | = 0.25 , | e 23 ( c ) ( 0 ) | = 0.36 ; | e 24 ( a ) ( 0 ) | = 0.22 , | e 24 ( b ) ( 0 ) | = 0.4 , | e 24 ( c ) ( 0 ) | = 0.4 .
The costs of different leader–follower multi-agent systems are shown in Figure 9, where all the costs of controllers and the update rate of parameters | a ^ ˙ j | , | b ^ ˙ j | and | c ^ ˙ j | also tend to zero as t .
In addition, some comparison results of the controllers and adaptive laws of parameters are given in Table 1 and Table 2, respectively. For the consensus control of multi-agent systems with unknown parameters, the control costs are limited, which are not only related to the controller but also to the initial errors of the parameters. The larger the initial errors among the leader–follower multi-agent systems, the higher the costs of the controllers, and the larger the parameters errors, the higher the costs of the adaptive controllers. The costs of the controllers and the parameters adaptive laws will also approach zero as t .
Similarly, the cost consumption of the network model of Example 4 has been analyzed through the cost analysis of the controllers and parameters adaptive laws. In Example 4, the network topology of followers 1, 2, and 3 is the same as Example 3, and the corresponding initial conditions are the same as Example 3, so their cost results are the same, as shown in Table 1 and Table 2.
In Figure 10, the controllers and adaptive update laws tend to zero as the synchronization of the intelligent agent is completed, and parameters identification and system errors can both be completed as t . The followers 3, 4, and 5 have no communication with the leader 0, but follower 3 can establish communication with followers 1 and 2, while follower 5 can communicate with followers 2, 3, and 4. Follower 3 synchronizes with follower 1 when follower 1 and the leader are synchronized, so followers 3 and 5 can also synchronize and identify the leader’s parameters a , b , c , respectively. Therefore, the consensus control between the leader and followers has been achieved.
In Table 3 and Table 4, the control costs for followers 3 and 5 to synchronize with the leader through other followers are relatively expensive, because their linear controllers are given by u i j ( x ) = i = 1 N a i j k i j ( x ) ( x i x j ) , u i j ( y ) = i = 1 N a i j k i j ( y ) ( y i y j ) . Moreover, the parameters of the followers have not been synchronized in time by the adaptive parameter laws. Therefore, it is better to consider or select a follower to synchronize with the leader when the agent can communicate with multiple followers, which can reduce control costs to some extent.
Remark 5.
In Example 4, follower 3 can establish communication with followers 1 and 2, and follower 5 can establish communication with followers 2, 3, and 4. Therefore, the parameter adaptive laws a ^ ˙ 13 , b ^ ˙ 13 , c ^ ˙ 13 are given based on follower 1, i.e., the parameters of follower 3 are synchronized with the parameters a , b , c of follower 1. Meanwhile, the parameters of follower 3 can synchronized with follower 2 by the adaptive laws a ^ ˙ 23 , b ^ ˙ 23 , c ^ ˙ 23 . Similarly, follower 5 can also choose one of followers 2, 3, and 4 to synchronize the parameters a , b , c by the adaptive laws in Equation (9).
Many methods have proposed for the synchronization of master–slave systems or consensus of multi-agent systems. Compared with other methods, the main advantages of the proposed linear feedback control are given as follows:
(1)
The controller with only a linear term and a gain coefficient is simple and easy to implement;
(2)
The number of controllers is fewer, and only the first and second equations of slave financial system are added controllers;
(3)
The control cost is relatively low, and the linear feedback controller is easy to implement in hardware, such as the circuit implementation of master–slave synchronization.
In addition, the parameter adaptive control method also provides sufficient theoretical guidance for a system model with unknown parameters, and the circuit implementation of the master–slave systems of financial model also has certain practical value for practical applications, such as chaos-secure communication and the consensus of unmanned aerial vehicle systems.

5. Circuit Implementation

In this section, the circuit implementation of the financial system and the synchronization of the master–slave systems with known and unknown parameters are designed and achieved through the software of Multisim 14.0. The specific circuit designs are given as follows.

5.1. Circuit Implementation of the Financial System

Based on the circuit implementation of Multisim 14.0, the circuit of system (1) is given in Figure 11. The circuit consists of resistors, capacitors, power supplies, operational amplifiers, and multipliers. Generally, it is not easy to directly design a circuit to implement the behavior of a complex system, as the circuit implementation needs to be designed based on the specific system characteristics and the allowable range of circuit components. Due to the fact that the maximum value of the trajectory variables x , y , and z of the financial system (1) are all less than 5, and the voltage of the power supply is 15 volts, there is no need to make scale changes for the variables x , y , and z, i.e., the circuits of system (1) can be directly designed based on the system equations.
In Figure 11, the TL082CP denotes the dual input general-purpose operational amplifier, which is produced by IPC-2221A/2222, and it is used to solve the differential equations. For example, in order to implement the first differential equation x ˙ = z + ( y 0.9 ) x in system (1) using the circuit, three operational amplifiers of the TL082CP in Figure 11 are used to simulate the operations of the model, i.e., the differential variable x ˙ = 100 x / 111.111 + 100 x y / 100 + 100 z / 100 . Similarly, the circuits of other systems are designed based on this principle.
According to the circuit implementation of financial system (1) in Figure 11, the waveform diagram of the variables x , y , and z in the oscilloscope of the circuit implementation is given in Figure 12a, and the attractor of system (1) based on the oscilloscope of the circuit implementation is shown in Figure 13 when c = 1 . Obviously, the financial system (1) is in a state of chaos. Furthermore, the attractor of system (1) based on the oscilloscope of the circuit implementation is given in Figure 14 when c = 2 , and it is in a state of period. Therefore, one can easily control the behavior of system (1) using the demand elasticity of the commodity c, and the results of the circuit implementation have once again verified the simulation results in Figure 1 and Figure 3.

5.2. Circuit Implementation of Master–Slave Systems

Meanwhile, the circuit of slave system (3) is given in Figure 15, and only variables x , y of the master system are transmitted and used to synchronize the slave system. In Figure 12b, the consensus results of the master–slave systems are shown based on Multisim 14.0. Obviously, the variable x 1 of slave system (3) is synchronized with the variable x of master system (1).

5.3. Circuit Implementation of Master–Slave Systems with Unknown Parameters

Meanwhile, in order to obtain the consensus of master–slave systems with unknown parameters, the circuit implementation of slave system (6) and the adaptive laws of parameters a ^ , b ^ , c ^ are given in Figure 16a and Figure 16b, respectively. Obviously, only variables x , y of master system (1) are used to synchronize the slave system (6). The variables x vs. x 1 of the master–slave systems are shown in Figure 17, and the variable x 1 of slave system (6) is synchronized with the variable x of master system (1).
Remark 6.
The circuit implementations for the consensus of two master–slave systems are shown, as the circuit design for the consensus of multi-agent systems is similar to that of two master–slave systems, so it is not added due to space limitation.

6. Conclusions

The state of financial system can be changed from chaos to period via the parameter c, i.e., it is in a periodic state when c = 2 , and the bifurcation results show the control effectiveness is better than parameters a and b. Based on the Lyapunov stability theory, a method of master–slave systems consensus based on linear feedback control has been proposed to achieve the synchronization of financial systems with known parameters. Meanwhile, an adaptive control method has also been proposed for the consensus of master–slave systems when the parameters of the master system are unknown. Furthermore, the consensus of leader–follower multi-agent systems is also shown based on the chaotic financial systems with known parameters, and two examples of leader–follower networks are given to verify the proposed control method. The simulation results show that not only do the multi-agent systems achieve consensus, but also the unknown parameters of the master or leader systems are accurately identified. In application, the actual systems or hardware usually experience aging or deviation over time, so the adaptive control method can effectively solve the inconsistent problem caused by these unknown or uncertain parameters. Finally, the circuit implementations of the financial system, the master–slave systems, and the adaptive control laws have been designed to shown the consensus based on Multisim 14.0. The numerical experimental results and circuit implementation verify the effectiveness and feasibility of the proposed method.

Author Contributions

Writing—original draft preparation, Y.Y. and J.H.; writing—review and editing, Y.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Natural Science Foundation of Fujian Province (No. 2022J01895).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Matsumoto, T.; Chua, L.; Komuro, M. The double scroll. IEEE Trans. Circuits Syst. 1985, 32, 797–818. [Google Scholar] [CrossRef]
  2. Chen, G.; Ueta, T. Yet another chaotic attractor. Int. J. Bifurc. Chaos 1999, 9, 1465–1466. [Google Scholar] [CrossRef]
  3. Ben Slimane, N.; Bouallegue, K.; Machhout, M. Designing a multi-scroll chaotic system by operating Logistic map with fractal process. Nonlinear Dyn. 2017, 88, 1655–1675. [Google Scholar] [CrossRef]
  4. He, J.; Yu, S. Construction of higher-dimensional hyperchaotic systems with a maximum number of positive Lyapunov exponents under average eigenvalue criteria. J. Circuits Syst. Comput. 2019, 28, 1950151. [Google Scholar] [CrossRef]
  5. Kuate, P.D.K.; Tchendjeu, A.E.T.; Fotsin, H. A modified rössler prototype-4 system based on Chua’s diode nonlinearity: Dynamics, multistability, multiscroll generation and FPGA implementation. Chaos Solitons Fractals 2020, 140, 110213. [Google Scholar] [CrossRef]
  6. Sugandha, K.; Singh, P. Generation of a multi-scroll chaotic system via smooth state transformation. J. Comput. Electron. 2022, 21, 781–791. [Google Scholar] [CrossRef]
  7. Huang, D.; Li, H. Theory and Method of the Nonlinear Economics; Sichuan University Press: Chengdu, China, 1993. [Google Scholar]
  8. Xin, B.; Zhang, J. Finite-time stabilizing a fractional-order chaotic financial system with market confidence. Nonlinear Dyn. 2015, 79, 1399–1409. [Google Scholar] [CrossRef]
  9. Tlelo-Cuautle, E.; Rangel-Magdaleno, J.; Pano-Azucena, A.D.; Obeso-Rodelo, P.; Nuñez-Perez, J.C. FPGA realization of multi-scroll chaotic oscillators. Commun. Nonlinear Sci. Numer. Simul. 2015, 27, 66–80. [Google Scholar] [CrossRef]
  10. Yildirim, M. Optical color image encryption scheme with a novel DNA encoding algorithm based on a chaotic circuit. Chaos Solitons Fractals 2022, 155, 111631. [Google Scholar] [CrossRef]
  11. Kaur, G.; Agarwal, R.; Patidar, V. Color image encryption scheme based on fractional Hartley transform and chaotic substitution–permutation. Vis. Comput. 2022, 38, 1027–1050. [Google Scholar] [CrossRef]
  12. Zhao, K.; He, J. Design of higher-dimensional hyperchaotic system based on combined control and its encryption application. Int. J. Adv. Comput. Sci. Appl. 2022, 13, 869–879. [Google Scholar] [CrossRef]
  13. Gámez-Guzmán, L.; Cruz-Hernández, C.; López-Gutiérrez, R.; García-Guerrero, E. Synchronization of Chua’s circuits with multi-scroll attractors: Application to communication. Commun. Nonlinear Sci. Numer. Simul. 2009, 14, 2765–2775. [Google Scholar] [CrossRef]
  14. Cheng, G.; Wang, L.; Chen, Q.; Chen, G. Design and performance analysis of generalised carrier index M-ary differential chaos shift keying modulation. IET Commun. 2018, 12, 1324–1331. [Google Scholar] [CrossRef]
  15. Jiang, G.P.; Tang, W.K.S.; Chen, G. A simple global synchronization criterion for coupled chaotic systems. Chaos Solitons Fractals 2003, 15, 925–935. [Google Scholar] [CrossRef]
  16. Huang, C.; Cao, J. Active control strategy for synchronization and anti-synchronization of a fractional chaotic financial system. Phys. A: Stat. Mech. Its Appl. 2017, 473, 262–275. [Google Scholar] [CrossRef]
  17. Aydogmus, F.; Tosyali, E. Master-slave synchronization in a 4D dissipative nonlinear fermionic system. Int. J. Control 2022, 95, 620–625. [Google Scholar] [CrossRef]
  18. Kuntanapreeda, S. Adaptive control of fractional-order unified chaotic systems using a passivity-based control approach. Nonlinear Dyn. 2016, 84, 2505–2515. [Google Scholar] [CrossRef]
  19. Mohadeszadeh, M.; Pariz, N. An application of adaptive synchronization of uncertain chaotic system in secure communication systems. Int. J. Model. Simul. 2022, 42, 143–152. [Google Scholar] [CrossRef]
  20. Zhou, J.; Tong, D.; Chen, Q.; Zhou, W. Master-slave synchronization of neural networks with time-varying delays via the event-triggered control. Math. Comput. Model. Dyn. Syst. 2020, 26, 357–373. [Google Scholar] [CrossRef]
  21. Wang, Y.; Lu, J.; Liang, J.; Cao, J.; Perc, M. Pinning synchronization of nonlinear coupled Lur’e networks under hybrid impulses. IEEE Trans. Circuits Syst. II Express Briefs 2018, 66, 432–436. [Google Scholar] [CrossRef]
  22. Tang, Z.; Park, J.H.; Zheng, W.X. Distributed impulsive synchronization of Lur’e dynamical networks via parameter variation methods. Int. J. Robust Nonlinear Control 2018, 28, 1001–1015. [Google Scholar] [CrossRef]
  23. Nowzari, C.; Garcia, E.; Cortés, J. Event-triggered communication and control of networked systems for multi-agent consensus. Automatica 2019, 105, 1–27. [Google Scholar] [CrossRef]
  24. Huang, Y.; Bao, H. Master-slave synchronization of complex-valued delayed chaotic Lur’e systems with sampled-data control. Appl. Math. Comput. 2020, 379, 125261. [Google Scholar] [CrossRef]
  25. Arena, P.; Buscarino, A.; Fortuna, L.; Patanè, L. Lyapunov approach to synchronization of chaotic systems with vanishing nonlinear perturbations: From static to dynamic couplings. Phys. Rev. E 2020, 102, 012211. [Google Scholar] [CrossRef] [PubMed]
  26. Yalçin, M.E.; Suykens, J.A.; Vandewalle, J. Master-slave synchronization of Lur’e systems with time-delay. Int. J. Bifurc. Chaos 2001, 11, 1707–1722. [Google Scholar] [CrossRef]
  27. Htun, Y.H.T.; Hlaing, M.S.; Hla, T.T. Master-slave synchronization of robotic arm using PID controller. Indones. J. Electr. Eng. Informatics 2023, 11, 77–87. [Google Scholar] [CrossRef]
  28. Gu, Z.; Peng, S.; Huang, Y. Quasi-consensus of disturbed nonlinear multiagent systems with event-triggered impulsive control. Appl. Sci. 2022, 12, 7580. [Google Scholar] [CrossRef]
  29. Trakas, P.S.; Tantoulas, A.; Bechlioulis, C.P. Formation control of nonlinear multi-agent systems with nested input saturation. Appl. Sci. 2024, 14, 213. [Google Scholar] [CrossRef]
  30. Yang, J.; Lee, B.G. Distributed adaptive tracking control of hidden leader-follower multi-agent systems with unknown parameters. Mathematics 2024, 12, 1013. [Google Scholar] [CrossRef]
  31. Gu, R.; Sun, X. Fault-tolerant cooperative control of multiple uncertain Euler-Lagrange systems with an uncertain leader. Electronics 2024, 13, 2068. [Google Scholar] [CrossRef]
  32. Ding, K.; Han, Q.L. Master-slave synchronization criteria for horizontal platform systems using time delay feedback control. J. Sound Vib. 2011, 330, 2419–2436. [Google Scholar] [CrossRef]
  33. Wen, G.; Wan, Y.; Cao, J.; Huang, T.; Yu, W. Master-slave synchronization of heterogeneous systems under scheduling communication. IEEE Trans. Syst. Man Cybern. Syst. 2016, 48, 473–484. [Google Scholar] [CrossRef]
  34. Ramirez, J.P.; Garcia, E.; Alvarez, J. Master-slave synchronization via dynamic control. Commun. Nonlinear Sci. Numer. Simul. 2020, 80, 104977. [Google Scholar] [CrossRef]
  35. Dadras, S.; Momeni, H.R. Control of a fractional-order economical system via sliding mode. Phys. A Stat. Mech. Its Appl. 2010, 389, 2434–2442. [Google Scholar] [CrossRef]
  36. Jajarmi, A.; Hajipour, M.; Baleanu, D. New aspects of the adaptive synchronization and hyperchaos suppression of a financial model. Chaos Solitons Fractals 2017, 99, 285–296. [Google Scholar] [CrossRef]
  37. Jäntschi, L. Eigenproblem basics and algorithms. Symmetry 2023, 15, 2046. [Google Scholar] [CrossRef]
  38. Parks, P.C. AM Lyapunov’s stability theory–100 years on. IMA J. Math. Control Inf. 1992, 9, 275–303. [Google Scholar] [CrossRef]
  39. Sastry, S.; Sastry, S. Lyapunov stability theory. In Nonlinear Systems: Analysis, Stability, and Control; Springer: Berlin/Heidelberg, Germany, 1999; pp. 182–234. [Google Scholar]
Figure 1. Attractor of financial system (1). (a) Phase diagram of x vs. y. (b) Phase diagram of y vs. z.
Figure 1. Attractor of financial system (1). (a) Phase diagram of x vs. y. (b) Phase diagram of y vs. z.
Applsci 14 08894 g001
Figure 2. Bifurcation diagram and Lyapunov exponent spectrum of financial system (1) with c. (a) Bifurcation diagram. (b) Lyapunov exponent spectrum.
Figure 2. Bifurcation diagram and Lyapunov exponent spectrum of financial system (1) with c. (a) Bifurcation diagram. (b) Lyapunov exponent spectrum.
Applsci 14 08894 g002
Figure 3. Attractor of financial system (1) with c = 2 . (a) Phase diagram of x vs. y. (b) Phase diagram of y vs. z.
Figure 3. Attractor of financial system (1) with c = 2 . (a) Phase diagram of x vs. y. (b) Phase diagram of y vs. z.
Applsci 14 08894 g003
Figure 4. Errors e x , e y , e z of master–slave systems (1) and (3).
Figure 4. Errors e x , e y , e z of master–slave systems (1) and (3).
Applsci 14 08894 g004
Figure 5. Numerical simulation results of the consensus of master–slave systems (1) and (6) with unknown parameters. (a) Errors e x , e y , e z of master–slave systems (1) and (6). (b) The adaptive tracking results of parameters a ^ , b ^ , c ^ in slave system (6).
Figure 5. Numerical simulation results of the consensus of master–slave systems (1) and (6) with unknown parameters. (a) Errors e x , e y , e z of master–slave systems (1) and (6). (b) The adaptive tracking results of parameters a ^ , b ^ , c ^ in slave system (6).
Applsci 14 08894 g005
Figure 6. The network structure of leader–follower multi-agent. (a) Five agents in Example 3. (b) Six agents in Example 4.
Figure 6. The network structure of leader–follower multi-agent. (a) Five agents in Example 3. (b) Six agents in Example 4.
Applsci 14 08894 g006
Figure 7. The numerical simulation results of leader-follower systems in Example 3. (a) The errors of multi-agent systems. (b) The parameters estimation of multi-agent systems.
Figure 7. The numerical simulation results of leader-follower systems in Example 3. (a) The errors of multi-agent systems. (b) The parameters estimation of multi-agent systems.
Applsci 14 08894 g007
Figure 8. The numerical simulation results of leader–follower systems in Example 4. (a) The errors of multi-agent systems. (b) The parameters estimation of multi-agent systems.
Figure 8. The numerical simulation results of leader–follower systems in Example 4. (a) The errors of multi-agent systems. (b) The parameters estimation of multi-agent systems.
Applsci 14 08894 g008
Figure 9. Costs of all agents in Example 3. (a) The control costs of | k i j ( x ) ( x i x j ) | + | k i j ( y ) ( y i y j ) | + | k i j ( z ) ( z i z j ) | . (b) The costs of parameter adaptive laws | a ^ ˙ j | , | b ^ ˙ j | , | c ^ ˙ j | in Equation (18).
Figure 9. Costs of all agents in Example 3. (a) The control costs of | k i j ( x ) ( x i x j ) | + | k i j ( y ) ( y i y j ) | + | k i j ( z ) ( z i z j ) | . (b) The costs of parameter adaptive laws | a ^ ˙ j | , | b ^ ˙ j | , | c ^ ˙ j | in Equation (18).
Applsci 14 08894 g009
Figure 10. Control costs of leader–follower agents 3 and 5 in Example 4. (a) The control costs of | k i j ( x ) ( x i x j ) | + | k i j ( y ) ( y i y j ) | + | k i j ( z ) ( z i z j ) | . (b) The costs of parameter adaptive laws | a ^ ˙ j | , | b ^ ˙ j | , | c ^ ˙ j | in Equation (18).
Figure 10. Control costs of leader–follower agents 3 and 5 in Example 4. (a) The control costs of | k i j ( x ) ( x i x j ) | + | k i j ( y ) ( y i y j ) | + | k i j ( z ) ( z i z j ) | . (b) The costs of parameter adaptive laws | a ^ ˙ j | , | b ^ ˙ j | , | c ^ ˙ j | in Equation (18).
Applsci 14 08894 g010
Figure 11. Circuit implementation of financial system (1) based on Multisim 14.0.
Figure 11. Circuit implementation of financial system (1) based on Multisim 14.0.
Applsci 14 08894 g011
Figure 12. The results of circuit implementation of the consensus of master–slave systems (1) and (3). (a) The waveform diagrams of variables x , y , and z displayed on the oscilloscope. (b) The corresponding waveform diagrams of variables x and x 1 of the master and slave systems displayed on the oscilloscope.
Figure 12. The results of circuit implementation of the consensus of master–slave systems (1) and (3). (a) The waveform diagrams of variables x , y , and z displayed on the oscilloscope. (b) The corresponding waveform diagrams of variables x and x 1 of the master and slave systems displayed on the oscilloscope.
Applsci 14 08894 g012
Figure 13. Attractor of financial system (1) by the circuit in Figure 11 when c = 1 . (a) Phase diagram x vs. y. (b) Phase diagram x vs. z.
Figure 13. Attractor of financial system (1) by the circuit in Figure 11 when c = 1 . (a) Phase diagram x vs. y. (b) Phase diagram x vs. z.
Applsci 14 08894 g013
Figure 14. Attractor of financial system (1) by the circuit in Figure 11 when c = 2 . (a) Phase diagram x vs. y. (b) Phase diagram y vs. z.
Figure 14. Attractor of financial system (1) by the circuit in Figure 11 when c = 2 . (a) Phase diagram x vs. y. (b) Phase diagram y vs. z.
Applsci 14 08894 g014
Figure 15. Circuit implementation of slave system (3) based on Multisim 14.0.
Figure 15. Circuit implementation of slave system (3) based on Multisim 14.0.
Applsci 14 08894 g015
Figure 16. Circuit implementation of the consensus of master–slave systems with unknown parameters. (a) Circuit implementation of slave system (6). (b) The adaptive laws of parameters a ^ , b ^ , c ^ in system (6).
Figure 16. Circuit implementation of the consensus of master–slave systems with unknown parameters. (a) Circuit implementation of slave system (6). (b) The adaptive laws of parameters a ^ , b ^ , c ^ in system (6).
Applsci 14 08894 g016
Figure 17. The waveform diagrams of variables x and x 1 displayed on the oscilloscope of the master–slave systems (1) and (6), respectively.
Figure 17. The waveform diagrams of variables x and x 1 displayed on the oscilloscope of the master–slave systems (1) and (6), respectively.
Applsci 14 08894 g017
Table 1. The results of control costs for all agents in Example 3.
Table 1. The results of control costs for all agents in Example 3.
AgentInitial Errors
| e ij ( x ) ( 0 ) | , | e ij ( y ) ( 0 ) | ,
| e ij ( z ) ( 0 ) | in Equation (20)
Control Time t
When | u ij ( x ) | 0.01 ,
| u ij ( y ) | 0.01
Control Costs of
{ u ij ( x ) , u ij ( y ) } , and Total Cost
10.1, 0.1, 0.214.19, 12.00{812.92, 311.68}, 1124.60
20.0, 0.9, 1.212.29, 8.49{1640.54, 1600.14}, 3240.68
31.1, 0.6, 1.221.98, 18.21{1814.09, 1145.51}, 2959.60
40.5, 0.4, 1.122.01, 20.24{1806.64, 1418.36}, 3225.00
Table 2. The costs of parameters identification for all agents in Example 3.
Table 2. The costs of parameters identification for all agents in Example 3.
AgentInitial Errors
e ij ( a ) , e ij ( b ) , e ij ( c )
in Equation (21)
Control Time t
When | a ^ ˙ ij | 0.01 ,
| b ^ ˙ ij | 0.01 , | c ^ ˙ ij | 0.01
The Costs of { | a ^ ˙ ij | ,
| b ^ ˙ ij | , | c ^ ˙ ij | } and Total Cost
10.1, 0.1, 0.310.79, 12.02, 11.57{116.36,173.33,429.40}, 719.09
20.2, 0.3, 0.45.55, 8.43, 10.94{215.86,990.61,922.13}, 2128.60
30.19, 0.25, 0.3617.88, 12.72, 15.14{348.54,796.55,790.29}, 1935.38
40.22, 0.4, 0.417.90, 12.76, 15.40{348.38,1042.67,1013.86}, 2404.91
Table 3. The results of control costs for leader–follower agents 3 and 5 in Example 4.
Table 3. The results of control costs for leader–follower agents 3 and 5 in Example 4.
AgentInitial Errors in
Equation (20) of | x i x j | ,
| y i y j | , | z i z j |
Control Time t
When | u ij ( x ) | 0.01 ,
| u ij ( y ) | 0.01
Control Costs of
{ u ij ( x ) , u ij ( y ) } , and Total Cost
31.1, 0.6, 1.221.98, 17.00{2228.17, 848.90}, 3077.07
50.4, 0.2, 0.214.24, 7.74{4149.07, 2747.63}, 6896.70
Table 4. The costs of parameters identification for leader–follower agents 3 and 5 in Example 4.
Table 4. The costs of parameters identification for leader–follower agents 3 and 5 in Example 4.
AgentInitial Errors
e ij ( a ) , e ij ( b ) , e ij ( c )
in Equation (21)
Control Time t
When | a ^ ˙ ij | 0.01 ,
| b ^ ˙ ij | 0.01 , | c ^ ˙ ij | 0.01
The Costs of { | a ^ ˙ ij | ,
| b ^ ˙ ij | , | c ^ ˙ ij | } and Total Cost
30.19, 0.25, 0.3614.15, 8.11, 15.29{198.92,704.98,466.67}, 1370.57
50.32, 0.3, 0.314.50, 16.54, 15.39{355.26,673.66,967.35}, 1996.27
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ye, Y.; He, J. Consensus Control of Leader–Follower Multi-Agent Systems with Unknown Parameters and Its Circuit Implementation. Appl. Sci. 2024, 14, 8894. https://doi.org/10.3390/app14198894

AMA Style

Ye Y, He J. Consensus Control of Leader–Follower Multi-Agent Systems with Unknown Parameters and Its Circuit Implementation. Applied Sciences. 2024; 14(19):8894. https://doi.org/10.3390/app14198894

Chicago/Turabian Style

Ye, Yinfang, and Jianbin He. 2024. "Consensus Control of Leader–Follower Multi-Agent Systems with Unknown Parameters and Its Circuit Implementation" Applied Sciences 14, no. 19: 8894. https://doi.org/10.3390/app14198894

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop