Topology design method and application thereof in consistency of multi-agent system

By designing appropriate coupling matrix, the problem of blank coupling matrix design in multi-agent systems is solved, the consistency and performance of the system are improved, the development of matrix theory is promoted, and the multi-agent system has provided solid areas in intelligent logistics and other fields. Theoretical basis.

CN119030883AActive Publication Date: 2024-11-26TIANJIN POLYTECHNIC UNIV
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202411063970.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-05
Publication Date
2024-11-26
Estimated Expiration
2044-08-05

AI Technical Summary

Technical Problem

The research gap in the prior art on coupling matrix design in the consistency control of multi-agent systems has affected the overall performance of the system and its application in the fields of intelligent logistics, collaborative rescue, etc.

Method used

A topology design method is proposed. By obtaining an undirected graph composed of three nodes, its topology is divided into two types: connected but incompletely connected and fully connected, the corresponding coupling matrix is ​​designed for different topology structures to ensure the second largest feature value The given negative constant is not exceeded, and the sum of non-diagonal elements is minimal, applied to the consistency control of multi-agent systems.

Benefits of technology

In-depth research on the coupled matrix design method has promoted the development of matrix theory, provided a new method for collaborative control of multi-agent systems, and improved the consistency of the system and the theoretical basis for application in multiple fields.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119030883A_ABST
    Figure CN119030883A_ABST
Patent Text Reader

Abstract

The invention provides a topology design method and application of the topology design method in consistency of a multi-agent system. The topology design comprises the following steps that firstly, an undirected graph composed of three nodes is considered, and the topology of the undirected graph is divided into a connected but not fully connected type and a fully connected type; then, for the condition that the nodes are connected but not fully connected, the relation between the nodes is divided into three conditions that the node 1 and the node 2 are not adjacent, the node 1 and the node 3 are not adjacent, and the node 2 and the node 3 are not adjacent; secondly, designing a corresponding coupling matrix for each condition, and ensuring that a second large characteristic value of the coupling matrix does not exceed a given negative constant and the sum of off-diagonal elements of the second large characteristic value is minimum; and finally, the topology design scheme is applied to the consistency of the multi-agent system, and the validity of the topology design scheme is verified through numerical simulation. The coupling matrix design method is deeply researched, development of the matrix theory is promoted, and a new method is provided for cooperative control of a multi-agent system.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of collaborative control of multi-agent systems, and specifically to a topology design method and its application in the consistency of multi-agent systems. Background Art

[0002] The consistency control of multi-agent systems is a core issue in multi-agent collaborative control. The optimization and implementation of the communication topology is crucial to improving the overall performance. The communication topology of a multi-agent system can be mathematically described by the coupling matrix. A large number of existing research results show that the second largest eigenvalue of the coupling weight matrix plays a key role in whether the multi-agent system can achieve consistency.

[0003] Although the coupling matrix has an important influence on the consistency of multi-agent systems, there is still a gap in the existing research on the design of coupling matrices. As an important research direction in the future, in-depth research on the design method of coupling matrices can not only promote the development of matrix theory and provide new methods for its research on the coordinated control of multi-agent systems, but also lay a solid theoretical foundation for multi-agent systems to play a better role in more fields, such as intelligent logistics, coordinated rescue, environmental monitoring, etc. Summary of the invention

[0004] The purpose of the present invention is to provide a topology design method and its application in the consistency of a multi-agent system to solve the problems existing in the above-mentioned background technology.

[0005] The present invention is implemented as follows: a topology design method, wherein the topology design comprises:

[0006] ① Obtain an undirected graph consisting of three nodes and divide its topology into two types: connected but not fully connected and fully connected;

[0007] ② For the case of connected but not fully connected nodes, the relationship between nodes is divided into three cases: node 1 and node 2 are not adjacent, node 1 and node 3 are not adjacent, and node 2 and node 3 are not adjacent;

[0008] ③ Design the corresponding coupling matrix for each case and ensure that the second largest eigenvalue of the coupling matrix does not exceed the given negative constant and the sum of its off-diagonal elements is minimal;

[0009] As a further technical solution of the present invention, an undirected graph consisting of three nodes is considered, and its topology is divided into two types: connected but not fully connected and fully connected. For the case of connected but not fully connected, the relationship between the nodes is divided into three cases: ① Node 1 and Node 2 are not adjacent; ② Node 1 and Node 3 are not adjacent; ③ Node 2 and Node 3 are not adjacent.

[0010] For the case where nodes 1 and 2 are not adjacent, the corresponding coupling matrix is ​​defined as:

[0011]

[0012] In the formula, γ 13 and γ 23 is a positive constant, and

[0013] For any negative constant σ, the following coupling matrix can be designed:

[0014]

[0015] Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimal, where λ n (Γ), n=1,2,3 represent the eigenvalues ​​of the matrix Γ and 0=λ1(Γ)>λ2(Γ)≥λ3(Γ).

[0016] For the case where nodes 1 and 3 are not adjacent, the corresponding coupling matrix is ​​defined as:

[0017]

[0018] In the formula, γ 12 and γ 23 is a positive constant, and

[0019] For any negative constant σ, the following coupling matrix can be designed:

[0020]

[0021] Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimal, where λ n (Γ), n=1,2,3 represent the eigenvalues ​​of the matrix Γ and 0=λ1(Γ)>λ2(Γ)≥λ3(Γ).

[0022] For the case where nodes 2 and 3 are not adjacent, the corresponding coupling matrix is ​​defined as:

[0023]

[0024] In the formula, γ 12 and γ 13 is a positive constant, and

[0025] For any negative constant σ, the following coupling matrix can be designed:

[0026]

[0027] Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimal, where λn (Γ), n=1,2,3 represent the eigenvalues ​​of the matrix Γ and 0=λ1(Γ)>λ2(Γ)≥λ3(Γ).

[0028] As a further technical solution of the present invention, for the fully connected case, the corresponding coupling matrix is ​​defined as:

[0029]

[0030] In the formula, γ 12 ,γ 13 and γ 23 is a positive constant, and

[0031] For any negative constant σ, the following coupling matrix can be designed:

[0032]

[0033] Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimal, where λ n (Γ), n=1,2,3 represent the eigenvalues ​​of the matrix Γ and 0=λ1(Γ)>λ2(Γ)≥λ3(Γ).

[0034] Another object of the present invention is to provide an application of a topology design method in the consistency of a multi-agent system, apply the topology design scheme to the consistency control of the multi-agent system, and verify its effectiveness through numerical simulation.

[0035] The mathematical model of the multi-agent system is:

[0036]

[0037] In the above formula, represents the state vector of the agent; is a continuous vector function and satisfies the following inequality:

[0038] ||f(x1)-f(x2)||≤ζ||x1-x2||;

[0039] The mean is defined as:

[0040]

[0041] Defining Error i=1,2,…,S, then the error model can be obtained as:

[0042]

[0043] The design control protocol is:

[0044]

[0045] In the above formula, The following conditions must be met:

[0046]

[0047] Where V = {1, 2, 3}} and denote node sets and undirected edge sets respectively.

[0048] The sufficient condition for a multi-agent system to achieve consistency is:

[0049]

[0050] Compared with the prior art, the present invention has the following beneficial effects:

[0051] The present invention proposes a topological design scheme and its application in the consistency of multi-agent systems, and deeply studies the coupling matrix design method, which not only promotes the development of matrix theory, but also provides a new method for the collaborative control of multi-agent systems. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1 Flowchart of a topology design method and its application in the consensus of multi-agent systems.

[0053] Figure 2 This is a topological structure diagram where node 1 and node 2 are not adjacent.

[0054] Figure 3 This is a topological structure diagram in which node 1 and node 3 are not adjacent.

[0055] Figure 4 This is a topological structure diagram in which node 2 and node 3 are not adjacent.

[0056] Figure 5 It is a topological structure diagram of three fully connected nodes.

[0057] Figure 6 This is a first simulation result analysis diagram of the present invention.

[0058] Figure 7 This is a second simulation result analysis diagram of the present invention.

[0059] Figure 8 This is a third simulation result analysis diagram of the present invention.

[0060] Fig. 9 This is a fourth simulation result analysis diagram of the present invention. DETAILED DESCRIPTION

[0061] In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0062] The specific implementation of the present invention is described in detail below in conjunction with specific embodiments.

[0063] like Figure 1 As shown, an embodiment of the present invention provides a topology design method, and the topology design includes:

[0064] ① Consider an undirected graph consisting of three nodes, and divide its topology into two types: connected but not fully connected and fully connected;

[0065] ② For the case of connected but not fully connected nodes, the relationship between nodes is divided into three cases: node 1 and node 2 are not adjacent, node 1 and node 3 are not adjacent, and node 2 and node 3 are not adjacent;

[0066] ③ Design the corresponding coupling matrix for each case and ensure that the second largest eigenvalue of the coupling matrix does not exceed the given negative constant and the sum of its off-diagonal elements is minimal;

[0067] Lemma 1. Assumption is a symmetric and irreducible matrix, where

[0068]

[0069] Then we can get:

[0070]

[0071] In the formula, and

[0072] Lemma 2. For a Hermitian matrix H∈£ n×n , the following inequality holds

[0073]

[0074] Among them, H j ∈£ (n-1)×(n-1) represents the matrix after H removes the jth row and jth column, b i =(b i1 ,L,b ij ,L,b in ) T ∈£ n Denotes the eigenvalue λ i (H) The corresponding unit eigenvector.

[0075] As a preferred embodiment of the present invention, consider a 3rd order coupling matrix Γ=(γ ij ) 3×3 ,in

[0076]

[0077] The main purpose of this invention is to design a suitable ij (i, j = 1, 2, 3, i ≠ j), so that λ2(Γ) is not greater than any given negative constant σ, and the sum of the non-diagonal elements of Γ is minimal. Considering that when studying the consistency of a multi-agent system, a non-connected multi-agent system can be transformed into several connected multi-agent systems for study, this invention only discusses the case where three nodes are connected. In view of this, the topological structure between the three nodes is divided into two categories: connected but not fully connected and fully connected.

[0078] 1) For the case of connected but not fully connected nodes, the relationship between nodes is divided into three cases: ① Node 1 and Node 2 are not adjacent (such as Figure 2 ②Node 1 and node 3 are not adjacent (as shown in Figure 3 ③Node 2 and node 3 are not adjacent (as shown in Figure 4 shown).

[0079] Case ①: Node 1 and Node 2 are not adjacent.

[0080] Figure 2 The topological structure between three nodes is shown. For this case, the corresponding coupling matrix should be defined as:

[0081]

[0082] In the formula, γ 13 and γ 23 is a positive constant, and

[0083] Formula (1):

[0084] Based on Lemma 1, it can be deduced that 0 = λ1(Γ) > λ2(Γ) ≥ λ3(Γ). Based on matrix theory and Eq.

[0085] (1), we can get:

[0086] Formula (2):

[0087] Furthermore, since the matrix Γ is dissipative, or is the unit eigenvector corresponding to the eigenvalue λ1(Γ). Obviously,

[0088] The eigenvalue of Γ3 is -γ13 and -γ 23 According to Lemma 2, we can get:

[0089] Formula (3): λ2(Γ)λ3(Γ)=3γ 13 γ 23

[0090] According to formula (2) and formula (3), we can get:

[0091] Formula (4):

[0092] According to formula (4), the following equation can be obtained:

[0093] Formula (5):

[0094] To ensure that equation (5) has a feasible solution, the following inequality needs to be satisfied:

[0095] Formula (6):

[0096] because According to formula (6), we can get λ3(Γ)≤3λ2(Γ). Taking λ2(Γ)=σ, λ3(Γ)=3λ2(Γ), according to formula (2), we can deduce that for any negative constant σ, the sum of the off-diagonal elements of Γ is the smallest. In this case, formula (4) can be rewritten as:

[0097] Formula (7)

[0098] According to formula (7), we can get:

[0099] Formula (8):

[0100] In summary, for any negative constant σ, the following coupling matrix can be designed:

[0101]

[0102] Make λ2(Γ)≤σ and the sum of the off-diagonal elements of the matrix is ​​minimized.

[0103] Case ②: Node 1 and node 3 are not adjacent.

[0104] Figure 3 The topological structure between three nodes is shown. For this case, the corresponding coupling matrix should be defined as:

[0105]

[0106] In the formula, γ 12 and γ 23 is a positive constant, and

[0107] Formula (9):

[0108] Based on Lemma 1, we can deduce that 0 = λ1(Γ) > λ2(Γ) ≥ λ3(Γ). Based on matrix theory and equation (9), we can obtain

[0109] Formula (10):

[0110] Furthermore, since the matrix Γ is dissipative, or is the unit eigenvector corresponding to the eigenvalue λ1(Γ). Obviously,

[0111] The eigenvalue of Γ2 is -γ 13 and -γ 23 According to Lemma 2, we can get:

[0112] Formula (11): λ2(Γ)λ3(Γ)=3a 12 a 23 ;

[0113] According to formula (10) and formula (11), we can get:

[0114] Formula (12):

[0115] According to formula (12), the following equation can be obtained:

[0116] Formula (13):

[0117] To ensure that equation (13) has a feasible solution, the following inequality needs to be satisfied:

[0118] Formula (14):

[0119] because According to formula (14), we can get λ3(Γ)≤3λ2(Γ). Taking λ2(Γ)=σ, λ3(Γ)=3λ2(Γ), according to formula (10), we can deduce that for any negative constant σ, the sum of the off-diagonal elements of Γ is the smallest. In this case, formula (12) can be rewritten as:

[0120] Formula (15):

[0121] According to formula (15), we can get:

[0122] Formula (16):

[0123] In summary, for any negative constant σ, the following coupling matrix can be designed:

[0124]

[0125] Make λ2(Γ)≤σ and the sum of the off-diagonal elements of Γ is minimized.

[0126] Case ③: Node 2 and Node 3 are not adjacent.

[0127] Figure 4 The topological structure between three nodes is shown. For this case, the corresponding coupling matrix should be defined as:

[0128]

[0129] In the formula, γ 12 and γ 23 is a positive constant, and

[0130] Formula (17):

[0131] Based on Lemma 1, we can deduce that 0 = λ1(Γ) > λ2(Γ) ≥ λ3(Γ). Based on matrix theory and equation (17), we can obtain:

[0132] Formula (18):

[0133] Similarly, since the matrix Γ is dissipative, or is the unit eigenvector corresponding to the eigenvalue λ1(Γ). Obviously,

[0134] The eigenvalue of Γ1 is -γ 12 and -γ 13 According to Lemma 2, we can get:

[0135] Formula (19): λ2(Γ)λ3(Γ)=3a 12 a 13 ;

[0136] According to formula (18) and formula (19), we can get:

[0137] Formula (20):

[0138] According to formula (20), the following equation can be obtained:

[0139] Formula (21):

[0140] To ensure that equation (21) has a feasible solution, the following inequality needs to be satisfied:

[0141] Formula (22):

[0142] because According to formula (22), we can get λ3(Γ)≤3λ2(Γ). Taking λ2(Γ)=σ, λ3(Γ)=3λ2(Γ), according to formula (18), we can deduce that for any negative constant σ, the sum of the off-diagonal elements of Γ is the smallest. In this case, formula (20) can be rewritten as:

[0143] Formula (23):

[0144] According to formula (23), we can get:

[0145] Formula (24):

[0146] Therefore, for any negative constant ρ, the following coupling matrix can be designed:

[0147]

[0148] Make λ2(Γ)≤σ and the sum of the off-diagonal elements of Γ is minimized.

[0149] 2) In the case of full connectivity, Figure 5 The topological structure of the three nodes is described, and the coupling matrix is ​​given as follows:

[0150]

[0151] In the formula, γ 12 , γ 13 and γ 23 is a positive constant, and

[0152] Formula (25):

[0153] Based on Lemma 1, we can deduce that 0 = λ1(Γ) > λ2(Γ) ≥ λ3(Γ). Based on matrix theory and equation (25), we can obtain:

[0154] Formula (26): λ2(Γ)+λ3(Γ)=-2(γ 12 +γ 13 +γ 23 );

[0155] Similarly, since the matrix Γ is dissipative, or is the unit eigenvector corresponding to the eigenvalue λ1(Γ). Obviously, and

[0156] According to Lemma 2, we can get:

[0157] Formula (27): λ2(Γ)λ3(Γ)=3(a 12 a 13 +a 12 a 23 +a 13 a 23 );

[0158] According to formula (27), we can get:

[0159]

[0160] Since λ3(Γ)≤λ2(Γ) and λ2(Γ) is required to be no greater than a non-negative constant σ, we can obtain:

[0161] λ2(Γ)+λ3(Γ)≤2σ;

[0162] That is γ 12 +γ 13 +γ 23 ≥-σ;

[0163] Obviously, if equation (26) and equation (27) have feasible solutions γ 12 ,γ 13 ,γ 23 , when λ2(Γ)=σ, λ3(Γ)=λ2(Γ), then γ 12 +γ 13 +γ 23 is the smallest. In this case, equations (26) and (27) can be rewritten as:

[0164] Formula (28): Based on formula (28), we can get:

[0165] Formula (29): Based on formula (29), we can get:

[0166] Formula (30): In order to ensure that equation (30) has a feasible solution, the following inequality should be satisfied:

[0167] Formula (31): According to formula (31), formula (30) is valid if and only if There is a feasible solution. In formula (29) Then we can get:

[0168] Formula (32): According to formula (32), we can get:

[0169] Formula (33): Therefore, for any negative real number σ, the following coupling matrix can be designed:

[0170]

[0171] Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimized.

[0172] Another object of the present invention is to provide an application of a topology design method in the consistency of a multi-agent system, apply the topology design scheme to the consistency control of the multi-agent system, and verify its effectiveness through numerical simulation. Consider the following multi-agent system:

[0173] Formula (34): In the above formula, represents the state vector of the agent; is a continuous vector function; Represents the control input of the agent.

[0174] f(x i (t)) satisfies the following inequality:

[0175] Formula (35): ||f(x1)-f(x2)||≤ζ||x1-x2||;

[0176] Multi-agent consensus can be achieved if:

[0177]

[0178] The mean is defined as:

[0179]

[0180] Defining Error Then the error model can be obtained as:

[0181] Formula (36):

[0182] The consistency control protocol is designed as follows:

[0183] Formula (37):

[0184] In the above formula, The following conditions must be met:

[0185]

[0186] The system of formula (34) can achieve consistency if λ2(Γ) satisfies:

[0187] Formula (38): Proof: Choose the following Lyapunov functional:

[0188] Formula (39): By taking the derivative of the Lyapunov functional of formula (39), we can obtain:

[0189] Formula (40) According to formula (35), we can get:

[0190] Formula (41):

[0191] Furthermore, due to

[0192]

[0193] We can get formula (42): On the other hand, based on Lemma 1, we can get:

[0194] Formula (43): According to equation (40) and equation (43), it can be deduced that:

[0195] Formula (44):

[0196] Where ξ=1+δ 2 +2kλ2(Γ)λ n (Q).

[0197] According to formula (44), we can get:

[0198] Formula (45): W(t)≤e ξt W(0);

[0199] According to formula (39) and formula (45), we can get:

[0200]

[0201] Therefore, the system of formula (34) can achieve consistency under the action of the controller of formula (37).

[0202] As an extended embodiment of the present invention, an example is selected for simulation verification;

[0203] Select the number of agents k=2,f(x i (t))=diag(2,3,4)x i (t),Q=2I3,

[0204]

[0205] Obviously, for any ψ1 and f(·) satisfies:

[0206] ||f(ψ1)-f(ψ2)||4|ψ1-ψ2||;

[0207] Therefore, it can be easily concluded that the system of formula (34) with the above parameters can achieve consistency when

[0208]

[0209] Since the system of formula (34) is connected, the topological structures can be divided into two categories: connected but not fully connected and fully connected. The coupling weight matrix Γ is designed so that λ2(Γ)≤-2.125 and the sum of the non-diagonal elements of Γ is minimized.

[0210] 1) Connected but not fully connected

[0211] For the case where agents 1 and 2 are not adjacent, the following coupling matrix is ​​designed:

[0212]

[0213] Among them, λ2(Γ)=-2.125, and the sum of the non-diagonal elements of Γ is the smallest. The change process of Figure 6 shown.

[0214] For the case where agents 1 and 3 are not adjacent, the following coupling matrix is ​​designed:

[0215]

[0216] Among them, λ2(Γ)=-2.125, and the sum of the non-diagonal elements of Γ is the smallest. The change process of Figure 7 shown.

[0217] For the case where agents 2 and 3 are not adjacent, the following coupling matrix is ​​designed:

[0218]

[0219] Among them, λ2(Γ)=-2.125, and the sum of the non-diagonal elements of Γ is the smallest. The change process of Figure 8 shown.

[0220] 2) Fully connected

[0221] For the case where all three agents can communicate with each other, the following coupling matrix is ​​designed:

[0222]

[0223] Among them, λ2(A)=-2.125 and the sum of the off-diagonal elements A is the smallest. The change process of Fig. 9 shown.

[0224] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method or article including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method or article. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0225] The above are only preferred embodiments of the present invention, and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A topology design method, characterized in that: The topology design includes: 1) Obtain an undirected graph consisting of three nodes and divide its topology into two types: connected but not fully connected and fully connected; 2) For the case of connected but not fully connected nodes, the relationship between nodes is divided into three cases: node 1 and node 2 are not adjacent, node 1 and node 3 are not adjacent, and node 2 and node 3 are not adjacent; 3) Design the corresponding coupling matrix for each case and ensure that the second largest eigenvalue of the coupling matrix does not exceed a given negative constant and the sum of its off-diagonal elements is minimal.

2. A topology design method according to claim 1, characterized in that: In step 2), for the case where node 1 and node 2 are not adjacent, the corresponding coupling matrix is ​​defined as: In the formula, γ 13 and γ 23 is a positive constant, and For any negative constant σ, the following coupling matrix is ​​designed: Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimal, where λ n (Γ), n=1,2,3 represents the eigenvalues ​​of the matrix Γ and 0=λ1(Γ)>λ2(Γ)≥λ3(Γ); For the case where nodes 1 and 3 are not adjacent, the corresponding coupling matrix is ​​defined as: In the formula, γ 12 and γ 23 is a positive constant, and For any negative constant σ, the following coupling matrix is ​​designed: Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimal, where λ n (Γ), n=1,2,3 represents the eigenvalues ​​of the matrix Γ and 0=λ1(Γ)>λ2(Γ)≥λ3(Γ); For the case where nodes 2 and 3 are not adjacent, the corresponding coupling matrix is ​​defined as: In the formula, γ 12 and γ 13 is a positive constant, and For any negative constant σ, the following coupling matrix is ​​designed: Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimal, where λ n (Γ), n=1,2,3 represent the eigenvalues ​​of the matrix Γ and 0=λ1(Γ)>λ2(Γ)≥λ3(Γ).

3. A topology design method according to claim 1, characterized in that: For the fully connected case, the corresponding coupling matrix is ​​defined as: In the formula, γ 12 ,γ 13 and γ 23 is a positive constant, and For any negative constant σ, the following coupling matrix is ​​designed: Make λ2(Γ)≤σ and the sum of off-diagonal elements is minimal, where λ n (Γ), n=1,2,3 represent the eigenvalues ​​of the matrix Γ and 0=λ1(Γ)>λ2(Γ)≥λ3(Γ).

4. An application of a topology design method as claimed in claim 1 in the consistency of a multi-agent system, characterized in that: The topological design scheme is applied to the consistency control of multi-agent systems, and its effectiveness is verified through numerical simulation.

5. The application of a topology design method according to claim 4 in the consistency of a multi-agent system is characterized in that: The mathematical model of the multi-agent system is: In the above formula, represents the state vector of the agent; is a continuous vector function and satisfies the following inequality: ||f(x1)-f(x2)||≤ζ||x1-x2||; The mean is defined as: Defining Error i=1,2,…,S, then the error model is: The design control protocol is: In the above formula, The following conditions must be met: Where V = {1, 2, 3}} and denote the node set and undirected edge set respectively; The sufficient condition for a multi-agent system to achieve consistency is:

Citation Information

Patent Citations

  • Design method of random multi-agent system control protocol under switching topology

    CN114609909A

  • Consistency tracking control method and device for multi-agent system, equipment and medium

    CN116047984A

  • Hypergraph multi-agent grouping system synchronization enhancement method based on random switching topology

    CN118282561A

  • Methods and systems for implementing a high radix network topology

    US11765041B1