Distributed fixed time and predetermined time cooperative optimal consensus control method for multi-agent system

By designing a two-stage distributed optimization consensus algorithm based on exponential functions, the global optimal consensus problem of multi-agent systems under unknown initial state and changes in communication topology is solved, and optimization consensus control is achieved within a fixed or predetermined time. Vibration phenomenon and simplify time estimation.

CN119024693AActive Publication Date: 2024-11-26ARMY ENG UNIV OF PLA

Patent Information

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

AI Technical Summary

Technical Problem

The existing distributed optimal consensus control method for multi-agent systems is difficult to achieve global optimal consensus within a fixed or predetermined time when the initial state is unknown and the communication topology changes, and jitter is prone to occur.

Method used

Design a two-stage distributed fixed time and predetermined time collaborative optimization consensus algorithm based on exponential functions. By constructing a global cost function and Lyapunov function, the agent converges to the local optimality in any initial state, and ensures the global through the second stage control. The best convergence is avoided.

Benefits of technology

It realizes that multi-agent system in any initial state and communication topology changes to achieve global optimal consensus within a fixed or predetermined time, avoids jitter phenomenon, and simplifies the time estimation process.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119024693A_ABST
    Figure CN119024693A_ABST
Patent Text Reader

Abstract

The invention discloses a distributed fixed time and predetermined time cooperative optimal consensus control method for a multi-agent system. The method comprises the following steps: step 1, constructing a dynamic model of each agent; step 2, based on the dynamic model, constructing a global cost function and describing an optimization problem; 3, designing a two-stage distributed collaborative optimization consensus algorithm based on an exponential function, wherein the two-stage distributed collaborative optimization consensus algorithm comprises a fixed time collaborative optimization consensus algorithm and a predetermined time collaborative optimization consensus algorithm; and 4, aiming at the fixed time collaborative optimization consensus algorithm and the predetermined time collaborative optimization consensus algorithm, respectively constructing Lyapunov functions, and respectively carrying out consensus analysis on the two optimization consensus algorithms to realize the optimal consensus. The method ensures that the multi-agent system can realize the consensus at the global optimal point within the estimated or preset time under the conditions that the initial state is unknown and the communication topology network is changed, and avoids the chattering phenomenon at the same time.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of intelligent agent control, and in particular to a distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system. Background Art

[0002] A multi-agent system is a system composed of multiple independent agents and their corresponding organizational rules and information interaction protocols. Compared with a single agent, a multi-agent system can complete more complex specific tasks through collaborative work and show the advantage of "1+1>2". This unique advantage has set off a wave of research on the collaborative control of multi-agent systems with the development of computer network technology. The consensus problem is a basic problem in the collaborative control of multi-agent systems. Its theoretical results can be widely used in the fields of source location, drone formation, intelligent robots, intelligent traffic management, resource exploration, and power grid economic dispatch. In these applications, the control task often requires the multi-agent system to meet some optimization indicators on the basis of achieving consensus, that is, to minimize the sum of its local cost functions while achieving consensus. The core goal of the distributed optimal consensus of the multi-agent system is to design an effective control protocol so that each agent in the system can continuously adjust its behavior according to the information from its neighbors, and finally make the states of all agents consistent at the global optimal point. In addition, in practical applications, factors such as changes in communication distance, signal interference, and failures of agents and networks will lead to the interruption or increase of communication links in the multi-agent system, making the system consistency control difficult.

[0003] Most distributed optimal control schemes can only make the state of the intelligent agent converge to the global optimal point within a limited time. To estimate the optimal consensus time based on this method, the initial state of the system must be known in advance, and different initial states may lead to different optimal consensus times. However, the initial state of the actual system is difficult or impossible to obtain. In addition, considering different environmental and operational factors, the initial state of the system may not be the same in each experiment, and the system communication topology may change due to factors such as communication distance and interference, which undoubtedly increases the difficulty of the system to achieve optimal consensus and the computational burden of estimating the optimal consensus time. Although there are some algorithms that consider achieving optimal consensus control within a fixed / predetermined time, there are disadvantages such as too many parameters, too complex algorithm design and time estimation, and easy to cause jitter. Summary of the invention

[0004] In view of the shortcomings of the prior art, the present invention aims to provide a more flexible and simple distributed fixed-time and scheduled-time optimal consensus control method to ensure that the multi-agent system can achieve a consensus at the global optimal point within an estimated or preset time when the initial state is unknown and the communication topology network changes, while avoiding jitter.

[0005] The technical solution to achieve the purpose of the present invention is: a distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system, comprising the steps of:

[0006] Step 1, construct the dynamic model of each agent;

[0007] Step 2: Based on the dynamic model, construct a global cost function and describe the optimization problem;

[0008] Step 3, design a two-stage distributed collaborative optimization consensus algorithm based on exponential function, including a fixed-time collaborative optimization consensus algorithm and a scheduled-time collaborative optimization consensus algorithm;

[0009] Step 4: Construct Lyapunov functions for the fixed-time collaborative optimization consensus algorithm and the scheduled-time collaborative optimization consensus algorithm, respectively, and perform consensus analysis on the two optimization consensus algorithms to achieve the optimal consensus.

[0010] Furthermore, the intelligent agent is a Mecanum wheel unmanned vehicle with an undirected communication topology structure.

[0011] Furthermore, the dynamic model of the unmanned vehicle is:

[0012]

[0013] Where x i1 、x i2 、v i1 、v i2 Respectively represent the position and linear velocity of the i-th unmanned vehicle moving on the two-dimensional plane; θ i represents the orientation angle of the i-th unmanned vehicle, that is, the angle with the x-axis; represents the angular velocity of the i-th unmanned vehicle;

[0014] Since θ i = sinθ i =0, cosθ i =1, the dynamic model of the i-th unmanned vehicle is simplified to:

[0015]

[0016] Let x i (t) = [x i1 ,x i2 ] T ,u i (t) = [v i1 ,v i2 ] T , the dynamic equation of the i-th unmanned vehicle is:

[0017]

[0018] Furthermore, step 2 considers that each agent i has a local cost function C i (x i ), the global cost function is the sum of all local cost functions, which is:

[0019]

[0020] The optimization problem is described as:

[0021]

[0022] Where x i (t), x j (t) represents the position status of the i-th and j-th agents respectively,

[0023] Represents the function The minimum point x, x i (t) = x j (t),i=1,2,…,N,i≠j means that the position states of N agents are the same.

[0024] Furthermore, the fixed-time collaborative optimization consensus algorithm designed in step 3 is:

[0025]

[0026] Among them, the control parameters λ1 and λ2 are positive constants; and q are positive constants and satisfy Denotes the global cost function C i (x i (t)) with respect to the gradient of time t, Denotes the global cost function C i (x i (t)) Hessian matrix with respect to time t; a ij (t) represents the adjacency matrix A = (a ij (t)) N×N elements of ij (t)>0 means that at time t, agent i can obtain state information from agent j, otherwise a ij (t) = 0; represents the set of agents that have communication connections with the i-th agent at time t; T1 is the local optimal solution reached by all agents The time estimate, x i (t), x j (t) represent the positions of agent i and agent j moving on the two-dimensional plane respectively.

[0027] Furthermore, the predetermined time collaborative optimization consensus algorithm designed in step 3 is:

[0028]

[0029] In the formula, the control parameter q. and δ are positive constants and satisfy: 0<q<1 / 2, 0<δ<1; Indicates that the base is e The logarithm of is the undirected connected communication topology graph of the multi-agent system The algebraic connectivity of Represents the communication topology of a multi-agent system, which changes over time. Denotes the global cost function C i (x i (t)) with respect to the gradient of time t, Denotes the global cost function C i (x i (t)) Hessian matrix with respect to time t; a ij (t) represents the adjacency matrix A = (a ij (t)) N×N elements of ij (t)>0 means that at time t, agent i can obtain state information from agent j, otherwise a ij (t) = 0; represents the set of agents that have communication connections with the i-th agent at time t; constants M and M i Satisfies the inequality: M≥max{M i}and T p is the time for the pre-set multi-agent system to achieve the global optimal consensus, x i (t), x j (t) represent the positions of agent i and agent j moving on the two-dimensional plane respectively.

[0030] Furthermore, in step 4, a Lyapunov function is constructed to perform consensus analysis on the fixed-time collaborative optimization consensus algorithm, including: according to the two stages of the algorithm, the analysis is divided into two steps, where the time of the first stage is 0<t≤T1, corresponding to the first stage of the algorithm, and the goal is to enable all agents to reach their respective local optimal solutions within a fixed time. The time of the second stage is t>T1, which corresponds to the second stage of the algorithm. The goal is to make all agents solve from their local optimal solutions. Reach the global optimal solution x * .

[0031] Furthermore, a Lyapunov function is constructed to perform consensus analysis on the fixed-time collaborative optimization consensus algorithm, including:

[0032] Step 4.1.1, analyze the fixed-time local optimality of the multi-agent system and give an estimate of the time required, including:

[0033] For the i-th agent, a semi-positive definite, radially unbounded Lyapunov function is constructed as:

[0034]

[0035] The derivative with respect to time is:

[0036]

[0037] Among them, the coefficient

[0038] Based on the fixed-time stability theory, the agents can reach their local optimal solutions from the initial state within a fixed time. The estimated time required is:

[0039]

[0040] Step 4.1.2, analyze the fixed-time global optimality of the multi-agent system and give an estimate of the time required, including:

[0041] Based on the zero gradient and algorithm, the fixed-time global optimality of the multi-agent system under the second stage of the algorithm is proved, and the Lyapunov function is constructed as:

[0042]

[0043] Where x * Represents the global optimal solution of the optimization problem. Since the local cost function C i (x) is m i Strongly convex, that is, for any vector x, y and m i >0Yes Using the constructed Lyapunov function, we can get:

[0044]

[0045] is positive definite, radially unbounded, and If and only if x i (t) = x * ;

[0046] right Taking the derivative we get:

[0047]

[0048] In the formula, represents the Kronecker product, I m Represents an m-dimensional unit matrix. Based on the fixed-time stability theory, the agents can move from their local optimal values ​​within a fixed time. Reach the global optimal solution x * , the estimated time required is:

[0049]

[0050] Combined with step 4.1.1 and step 4.1.2, under the action of the first stage of the algorithm, the agents can first converge from the initial state to their respective local optimal values ​​within a fixed time T1, at which time the local cost function corresponding to each agent is minimized; based on the zero gradient and algorithm, under the action of the second stage of the algorithm, the position states of all agents converge to the global optimal point, at which time the global cost function corresponding to the entire system is minimized, and the entire optimization consensus process is completed within a fixed time T1+T2.

[0051] Furthermore, in step 4, a Lyapunov function is constructed to perform consensus analysis on the predetermined time collaborative optimization consensus algorithm, including: according to the two stages of the algorithm, the analysis is performed in two steps, where the time of the first stage is 0<t≤δT p , corresponding to the first stage of the algorithm, the goal is to make all agents in the pre-set time δT p Reach their respective local optimal solutions The time of the second stage is t>δT p , corresponding to the second stage of the algorithm, the goal is to make all agents able to p From their respective local optimal solutions Reach the global optimal solution x of the optimization problem * .

[0052] Furthermore, a Lyapunov function is constructed to perform consensus analysis on the scheduled time collaborative optimization consensus algorithm, specifically including:

[0053] Step 4.2.1: Analyze the local optimality of the multi-agent system in terms of scheduled time, including:

[0054] For the i-th agent, a semi-positive definite, radially unbounded Lyapunov function is constructed as:

[0055]

[0056] but The derivative with respect to time is;

[0057]

[0058] Based on the theory of scheduled time stability, the agent can p From the initial state to the local optimal solution At this time, the basic requirement of the zero gradient sum algorithm is met, that is, the initial sum of the local gradient is zero;

[0059] Step 4.2.2: Analyze the global optimality of the scheduled time of the multi-agent system, including:

[0060] Based on the zero gradient and algorithm, the positive definite and radially unbounded Lyapunov function is constructed as:

[0061]

[0062] right Taking the derivative we get:

[0063]

[0064] in

[0065] Based on the theory of scheduled time stability, the agent can p From their respective local optimal values Reach the global optimal solution x * ;

[0066] Combined with steps 4.2.1 and 4.2.2, in the first stage of the algorithm, each agent can first p The local cost function of each agent is minimized. Then, based on the zero gradient algorithm, the position states of all agents can be minimized in the second stage of the algorithm within the time (1-δ)T. p The internal convergence reaches the global optimal point, at which point the global cost function of the entire system is the smallest, and the entire optimization consensus process is completed within the preset time T p Completed within.

[0067] Compared with the prior art, the present invention has the following remarkable effects:

[0068] (1) This patent technology designs a two-stage distributed fixed-time optimization consensus algorithm and a scheduled-time optimization consensus algorithm based on an exponential function, in which the control of the first stage can make any initial state of the agent converge to the local optimal point, thereby meeting the basic requirements of zero gradient sum (which is convenient for the subsequent use of the zero gradient sum algorithm to prove that the state of the agent can converge to the only global optimal point under the control of the second stage). Therefore, the proposed algorithm solves the optimization consensus control problem of the multi-agent system under any initial state;

[0069] (2) Under the fixed time optimization algorithm, the time it takes for the intelligent agent to reach consensus at the optimal point does not depend on the initial state, and a fixed upper bound of the time to achieve the optimal consensus can be estimated; under the scheduled time optimization algorithm, the time it takes for the intelligent agent to reach consensus at the optimal point does not depend on the initial state and system parameters, and the preset optimal consensus time can be used as a control parameter, so that the intelligent agent can achieve the optimal consensus within the scheduled time;

[0070] (3) The designed algorithm is suitable for situations where the system communication topology network changes, has strong robustness and anti-interference, and does not use discontinuous sign functions, thus avoiding the chattering phenomenon that may affect the control effect in actual control;

[0071] (4) Compared with the distributed optimization consensus algorithm designed based on the traditional fixed / predetermined time stability theorem containing two items in the judgment condition, the algorithm designed by the present patent technology is based on the fixed / predetermined time stability theorem under exponential function conditions, has fewer parameters, a simpler structure, and easier time estimation. BRIEF DESCRIPTION OF THE DRAWINGS

[0072] Figure 1 is the communication topology diagram of the unmanned vehicle, where (a) is the communication topology diagram (b) is the communication topology diagram (c) is the communication topology diagram

[0073] Figure 2 Schematic diagram of the position state change of the unmanned vehicle under the fixed time optimization algorithm.

[0074] Figure 3 Schematic diagram of the change in the position state of the unmanned vehicle under the scheduled time optimization algorithm.

[0075] Figure 4 The figure is a flow chart of the method of the present invention. DETAILED DESCRIPTION

[0076] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0077] How to design a distributed control method based on the local cost function of the agent to achieve consensus at the global optimal point within a fixed / predetermined time and estimate the upper bound of the time for the controlled target to achieve the optimal consensus in a fixed time under arbitrary initial states and changes in the communication topology network of the multi-agent system is a technical problem that needs to be solved at present. Based on this, this patent fully considers practical applications and proposes a two-stage distributed optimal consensus control method that is effective for arbitrary initial states and switching communication topologies, in which the time to achieve the control target can be estimated or pre-set, and the time estimate is independent of the initial state of the system. The proposed method has the advantages of fast convergence speed, strong anti-interference ability, and the ability to avoid jitter. Combined with Figure 4 , the method specifically comprises the following steps:

[0078] Step 1: Construct a dynamic model of multiple unmanned vehicles.

[0079] Consider a multi-unmanned vehicle system consisting of N Mecanum wheeled unmanned vehicles with an undirected communication topology, where the dynamic model of the i-th unmanned vehicle is as follows:

[0080]

[0081] In the formula, x i1 、x i2 、v i1 、v i2 Respectively represent the position and linear velocity of the i-th unmanned vehicle moving on the two-dimensional plane; θ i represents the orientation angle of the i-th unmanned vehicle, that is, the angle with the x-axis; represents the angular velocity of the i-th unmanned vehicle. Since the Mecanum wheel unmanned vehicle can achieve translational motion at any angle without any rotation, that is, the orientation angle of the unmanned vehicle does not change (i.e., θ i = sinθ i =0, cosθ i =1), then the dynamic model of the i-th unmanned vehicle can be simplified to the following dynamic model

[0082]

[0083] Let x i (t) = [x i1 ,x i2 ] T,u i (t) = [v i1 ,v i2 ] T , the general form of the dynamic equation of the i-th unmanned vehicle is

[0084]

[0085] Step 2: Construct a global cost function and describe the optimization problem.

[0086] Consider that unmanned vehicle i has a local cost function C i (x i ), the global cost function is the sum of all local cost functions, and its expression is:

[0087]

[0088] The goal of all unmanned vehicles is to reach the same position within a fixed time or a pre-set time, while minimizing the global cost function C(x), that is, the position state of all agents converges to the optimal solution of the global cost function. This distributed optimization problem can be described as:

[0089]

[0090] In the formula, x i (t), x j (t) represents the position status of the i-th and j-th unmanned vehicles,

[0091] Represents the function The minimum point x, x i (t) = x j (t), i = 1, 2, ..., N, i ≠ j means that the position states of N unmanned vehicles are the same.

[0092] Step 3: Design a two-stage distributed collaborative optimization consensus algorithm based on exponential function, including a fixed-time collaborative optimization consensus algorithm and a scheduled-time collaborative optimization consensus algorithm.

[0093] An algorithm is designed to solve the above distributed optimization problem within a fixed time or a predetermined time. The two-stage distributed fixed-time collaborative optimization consensus algorithm based on exponential function is as follows:

[0094]

[0095] Among them, the control parameters λ1 and λ2 are positive constants; and q are positive constants and satisfy Representation function C i (xi (t)) with respect to the gradient of time t, Representation function C i (x i (t)) Hessian matrix with respect to time t; a ij (t) represents the adjacency matrix A = (a ij (t)) N×N elements of ij (t)>0 means that at time t, unmanned vehicle i can obtain state information from unmanned vehicle j, otherwise a ij (t) = 0;

[0096] represents the set of unmanned vehicles that have communication connections with the i-th unmanned vehicle at time t; T1 is the local optimal solution reached by all agents time estimate.

[0097] The two-stage distributed scheduled time collaborative optimization consensus algorithm based on exponential function is as follows:

[0098]

[0099] In the formula, the control parameter q, and δ are positive constants and satisfy 0<q<1 / 2, 0<δ<1; Indicates that the base is e The logarithm of Undirected connected communication topology diagram for multiple unmanned vehicle systems The algebraic connectivity of The communication topology diagram representing the multi-AV system changes over time. Representation function C i (x i (t)) with respect to the gradient of time t, Representation function C i (x i (t)) Hessian matrix with respect to time t; a ij (t) represents the adjacency matrix A = (a ij (t)) N×N elements of ij (t)>0 means that at time t, unmanned vehicle i can obtain state information from unmanned vehicle j, otherwise a ij (t) = 0; represents the set of unmanned vehicles that have communication connections with the i-th unmanned vehicle at time t; constants M and M i Satisfies the inequality M≥max{M i}and T pThe time it takes for a pre-set multi-unmanned vehicle system to achieve a global optimal consensus.

[0100] Step 4: Determine the optimal consensus of the system under the designed algorithm.

[0101] Lyapunov functions are constructed respectively, and the two-stage distributed fixed-time collaborative optimization consensus algorithm and the scheduled-time collaborative optimization consensus algorithm based on exponential function are analyzed respectively;

[0102] Step 4.1: Consensus analysis of the two-stage distributed fixed-time collaborative optimization consensus algorithm

[0103] According to the two stages of the algorithm, the analysis is divided into two steps. The time of the first stage is 0<t≤T1, which corresponds to the first stage of the algorithm. The goal is to make all unmanned vehicles reach their respective local optimal solutions within a fixed time. The time of the second stage is t>T1, which corresponds to the second stage of the algorithm. The goal is to make all unmanned vehicles from their respective local optimal solutions Reach the global optimal solution x * .

[0104] Step 4.1.1: Analyze the fixed-time local optimality of the multi-unmanned vehicle system and give an estimate of the required time

[0105] For the i-th unmanned vehicle, a semi-positive definite and radially unbounded Lyapunov function is constructed as:

[0106]

[0107] The derivative with respect to time is:

[0108]

[0109] in,

[0110] Based on the fixed time stability theory, it can be seen that the unmanned vehicle can reach its local optimal solution from the initial state within a fixed time. (At this time, the basic requirement of the zero gradient and algorithm is met, that is, the initial sum of the local gradient is zero), and the estimated time required is:

[0111]

[0112] Step 4.1.2: Analyze the fixed-time global optimality of the multi-unmanned vehicle system and give an estimate of the required time

[0113] Since the basic requirements of the zero gradient and algorithm have been met in the previous step, the Lyapunov function is constructed next. Based on the zero gradient and algorithm, the fixed-time global optimality of the multi-unmanned vehicle system under the second stage of the algorithm is proved, and the following Lyapunov function is constructed:

[0114]

[0115] Where x * represents the global optimal solution of the optimization problem. Since the local cost function C i (x) is m i Strongly convex, that is, for any vector x, y and m i >0Yes Using the constructed Lyapunov function, we can get:

[0116] therefore is positive definite, radially unbounded, and If and only if x i (t) = x * (The states of all unmanned vehicles converge to the global optimal value).

[0117] right Taking the derivative we get:

[0118]

[0119] In the formula, represents the Kronecker product, I m represents an m-dimensional unit matrix. Based on the fixed-time stability theory, it can be seen that the unmanned vehicle can move from its local optimal value within a fixed time. Reach the global optimal solution x * , the estimated time required is:

[0120]

[0121] Combining steps 4.1.1 and 4.1.2, it can be seen that under the action of the first stage of the algorithm, the unmanned vehicles can first converge from the initial state to their respective local optimal values ​​within a fixed time T1. At this time, the local cost function corresponding to each unmanned vehicle is the smallest, so further optimization is required. Next, based on the zero gradient algorithm, under the action of the second stage of the algorithm, the position state of all unmanned vehicles can converge to the global optimal point, and the global cost function corresponding to the entire system is the smallest. The entire optimization consensus process can be completed within a fixed time T1+T2.

[0122] Step 4.2: Consensus analysis of the two-stage distributed scheduled time collaborative optimization consensus algorithm

[0123] According to the two stages of the algorithm, the analysis is divided into two steps. The time of the first stage is 0<t≤δT p , corresponding to the first stage of the algorithm, the goal is to make all unmanned vehicles in the preset time δT p Reach their respective local optimal solutions The time of the second stage is t>δT p , corresponding to the second stage of the algorithm, the goal is to make all unmanned vehicles in the preset time (1-δ)T p From their respective local optimal solutions Reach the global optimal solution x of the optimization problem * .

[0124] Step 4.2.1: Analyze the local optimality of the scheduled time of the multi-unmanned vehicle system

[0125] For the i-th unmanned vehicle, construct a semi-positive definite, radially unbounded Lyapunov function as The derivative with respect to time is

[0126]

[0127] Based on the scheduled time stability theory, it can be seen that the unmanned vehicle can p From the initial state to the local optimal solution It can be seen that the basic requirement of the zero gradient sum algorithm is met at this time, that is, the initial sum of the local gradient is zero.

[0128] Step 4.2.2: Analyze the global optimality of the scheduled time of the multi-unmanned vehicle system

[0129] Based on the zero gradient algorithm, the global optimality of the scheduled time of the multi-unmanned vehicle system under the second stage of the algorithm is proved. The positive definite and radially unbounded Lyapunov function is selected as

[0130]

[0131] right Taking the derivative we get

[0132]

[0133] in,

[0134] Based on the scheduled time stability theory, it can be seen that the unmanned vehicle can be p From their respective local optimal values Reach the global optimal solution x * .

[0135] Combining steps 4.2.1 and 4.2.2, we can see that in the first stage of the algorithm, each unmanned vehicle can first p The local cost function of each unmanned vehicle is the minimum, so further optimization is required. Next, based on the zero gradient algorithm, the position state of all unmanned vehicles can be optimized in the second stage of the algorithm within the time (1-δ)T. p The whole optimization consensus process can be completed in a preset time T p Completed within.

[0136] Step 5: Conduct simulation experiments on the proposed method.

[0137] Taking the problem of finding unknown sound sources in a multi-unmanned vehicle system as an example, the two-stage distributed fixed and scheduled time optimization method based on exponential function is explained. Assume that the multi-unmanned vehicle system consists of four identical Mecanum wheel unmanned vehicles (UGVs) with the communication topology as follows: Figure 1 As shown, the communication topology switching signal ω(t) is defined as

[0138]

[0139] Where s=0,1,…, when s≤t<s+0.1, the communication topology of the unmanned vehicle is like Figure 1 (a) shows; when s+0.1≤t<s+0.2, the communication topology diagram like Figure 1 (b) When s+0.2≤t<s+1, the communication topology diagram like Figure 1 As shown in (c), the topological diagram Available but

[0140] The goal of this example is to use the designed algorithm and the location information of the four reference anchor points around the unknown sound source to enable the unmanned vehicle to collaboratively locate the position of the unknown sound source within a fixed time or a predetermined time.

[0141] Define the matrix B = [b ij ](i,j=1,2,3,4), if the i-th unmanned vehicle can obtain the location information of anchor point j, then b ij =1; otherwise b ij = 0, the local cost function corresponding to the i-th unmanned vehicle is It shows that each unmanned vehicle tries to get closer to its own reference anchor point. The corresponding global cost function is The essence of the source localization problem is to find an intersection point as an estimate of the unknown source location by minimizing the sum of the squares of the distances to the reference anchor points;

[0142] Set the initial position of the unmanned vehicle to x1(0)=(3,5) T , x2(0)=(2,1.8) T , x3(0)=(-2,1) T , x4(0)=(1,4) T , the positions of the four anchor points around the sound source are R1 = (3.2, 4.2) T , R2=(1,2) T , R3=(-1,2.4) T , R4=(-0.5,5) T , after calculation, the position of the unknown sound source is x * =(0.675,3.4) T ;

[0143] Set the parameters λ=2, q=0.4, The position of each unmanned vehicle changes over time Figure 2 As shown, each unmanned vehicle can first reach its own local optimal position within time T1 = 0.625 That is, the reference anchor point R i position, and then from R within a fixed time T2 = 1.25 i Reach the global optimal intersection point x * , that is, within a fixed time T = 1.875, each unmanned vehicle can locate the position of the unknown sound source.

[0144] Assume that the expected time to complete source localization is T p =1, set the parameters δ=0.5, q=0.4, Calculation can be obtained The position state change curves of each unmanned vehicle are as follows: Figure 3 As shown, it can be seen that each unmanned vehicle can first p =R within 0.5 to reach the reference anchor point i , then at a predetermined time (1-δ)T p = 0.5 from R i Arriving at the global optimal intersection point x * .

[0145] Through simulation experiments, it is shown that the present invention provides a more flexible and simple distributed fixed-time and scheduled-time optimal consensus control method, which can ensure that the multi-agent system can achieve consensus at the global optimal point within an estimated or preset time when the initial state is unknown and the communication topology network changes, while avoiding jitter.

[0146] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device 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, article or device.

[0147] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system, characterized in that: Includes steps: Step 1, construct the dynamic model of each agent; Step 2: Based on the dynamic model, construct a global cost function and describe the optimization problem; Step 3, design a two-stage distributed collaborative optimization consensus algorithm based on exponential function, including a fixed-time collaborative optimization consensus algorithm and a scheduled-time collaborative optimization consensus algorithm; Step 4: Construct Lyapunov functions for the fixed-time collaborative optimization consensus algorithm and the scheduled-time collaborative optimization consensus algorithm, respectively, and perform consensus analysis on the two optimization consensus algorithms to achieve the optimal consensus.

2. According to claim 1, a distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system is characterized in that: The intelligent agent is a Mecanum wheel unmanned vehicle with an undirected communication topology structure.

3. According to claim 2, a distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system is characterized in that: The dynamic model of the unmanned vehicle is: In the formula, x i1 、x i2 、v i1 、v i2 Respectively represent the position and linear velocity of the i-th unmanned vehicle moving on the two-dimensional plane; θ i represents the orientation angle of the i-th unmanned vehicle, that is, the angle with the x-axis; represents the angular velocity of the i-th unmanned vehicle; Since θ i = sinθ i =0, cosθ i =1, the dynamic model of the i-th unmanned vehicle is simplified to: Let x i (t) = [x i1 ,x i2 ] T ,u i (t) = [v i1 ,v i2 ] T , the dynamic equation of the i-th unmanned vehicle is:

4. According to claim 1, a distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system is characterized in that: Step 2 considers that each agent i has a local cost function C i (x i ), the global cost function is the sum of all local cost functions, which is: The optimization problem is described as: Where x i (t), x j (t) represents the position status of the i-th and j-th agents respectively, Represents the function The minimum point x, x i (t) = x j (t),i=1,2,…,N,i≠j means that the position states of N agents are the same.

5. According to claim 1, a distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system is characterized in that: The fixed-time collaborative optimization consensus algorithm designed in step 3 is: Among them, the control parameters λ1 and λ2 are positive constants; and q are positive constants and satisfy Denotes the global cost function C i (x i (t)) with respect to the gradient of time t, Denotes the global cost function C i (x i (t)) Hessian matrix with respect to time t; a ij (t) represents the adjacency matrix A = (a ij (t)) N×N elements of ij (t)>0 means that at time t, agent i can obtain state information from agent j, otherwise a ij (t) = 0; represents the set of agents that have communication connections with the i-th agent at time t; T1 is the local optimal solution reached by all agents The time estimate, x i (t), x j (t) represent the positions of agent i and agent j moving on the two-dimensional plane respectively.

6. According to claim 1, a distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system is characterized in that: The scheduled time collaborative optimization consensus algorithm designed in step 3 is: In the formula, the control parameter and δ are positive constants and satisfy: 0<q<1 / 2, 0<δ<1; Indicates that the base is e The logarithm of is the undirected connected communication topology graph of the multi-agent system The algebraic connectivity of Represents the communication topology of a multi-agent system, which changes over time. Denotes the global cost function C i (x i (t)) with respect to the gradient of time t, Denotes the global cost function C i (x i (t)) Hessian matrix with respect to time t; a ij (t) represents the adjacency matrix A = (a ij (t)) N×N elements of ij (t)>0 means that at time t, agent i can obtain state information from agent j, otherwise a ij (t) = 0; represents the set of agents that have communication connections with the i-th agent at time t; constants M and M i Satisfies the inequality: M≥max{M i }and T p is the time for the pre-set multi-agent system to achieve the global optimal consensus, x i (t), x j (t) represent the positions of agent i and agent j moving on the two-dimensional plane respectively.

7. According to claim 5, a distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system is characterized in that: In step 4, the Lyapunov function is constructed to perform consensus analysis on the fixed-time collaborative optimization consensus algorithm, including: according to the two stages of the algorithm, the analysis is divided into two steps, where the time of the first stage is 0<t≤T1, corresponding to the first stage of the algorithm, and the goal is to enable all agents to reach their respective local optimal solutions within a fixed time. The time of the second stage is t>T1, which corresponds to the second stage of the algorithm. The goal is to make all agents solve from their local optimal solutions. Reach the global optimal solution x * .

8. A distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system according to claim 7, characterized in that: Construct Lyapunov function and conduct consensus analysis on the fixed-time collaborative optimization consensus algorithm, including: Step 4.1.1, analyze the fixed-time local optimality of the multi-agent system and give an estimate of the time required, including: For the i-th agent, a semi-positive definite, radially unbounded Lyapunov function is constructed as: The derivative with respect to time is: Among them, the coefficient Based on the fixed-time stability theory, the agents can reach their local optimal solutions from the initial state within a fixed time. The estimated time required is: Step 4.1.2, analyze the fixed-time global optimality of the multi-agent system and give an estimate of the time required, including: Based on the zero gradient and algorithm, the fixed-time global optimality of the multi-agent system under the second stage of the algorithm is proved, and the Lyapunov function is constructed as: Where x * Represents the global optimal solution of the optimization problem. Since the local cost function C i (x) is m i Strongly convex, that is, for any vector x, y and m i >0Yes Using the constructed Lyapunov function, we get: but is positive definite and radially unbounded, and If and only if x i (t) = x * ; right Taking the derivative we get: In the formula, represents the Kronecker product, I m Represents an m-dimensional unit matrix. Based on the fixed-time stability theory, the agents can move from their local optimal values ​​within a fixed time. Reach the global optimal solution x * , the estimated time required is: Combined with step 4.1.1 and step 4.1.2, under the action of the first stage of the algorithm, the agents can first converge from the initial state to their respective local optimal values ​​within a fixed time T1, at which point the local cost function corresponding to each agent is minimized; based on the zero gradient and algorithm, under the action of the second stage of the algorithm, the position states of all agents converge to the global optimal point, at which point the global cost function corresponding to the entire system is minimized, and the entire optimization consensus process is completed within a fixed time T1+T2.

9. A distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system according to claim 6, characterized in that: In step 4, a Lyapunov function is constructed to perform consensus analysis on the scheduled time collaborative optimization consensus algorithm, including: according to the two stages of the algorithm, the analysis is carried out in two steps, where the time of the first stage is 0<t≤δT p , corresponding to the first stage of the algorithm, the goal is to make all agents in the pre-set time δT p Reach their respective local optimal solutions The time of the second stage is t>δT p , corresponding to the second stage of the algorithm, the goal is to make all agents able to p From their respective local optimal solutions Reach the global optimal solution x of the optimization problem * .

10. A distributed fixed-time and scheduled-time collaborative optimal consensus control method for a multi-agent system according to claim 9, characterized in that: Construct Lyapunov function and conduct consensus analysis on the scheduled time collaborative optimization consensus algorithm, including: Step 4.2.1: Analyze the local optimality of the multi-agent system in terms of scheduled time, including: For the i-th agent, a semi-positive definite, radially unbounded Lyapunov function is constructed as: but The derivative with respect to time is; Based on the theory of scheduled time stability, the agent can p From the initial state to the local optimal solution At this time, the basic requirement of the zero gradient sum algorithm is met, that is, the initial sum of the local gradient is zero; Step 4.2.2: Analyze the global optimality of the scheduled time of the multi-agent system, including: Based on the zero gradient and algorithm, the positive definite and radially unbounded Lyapunov function is constructed as: right Taking the derivative we get: in Based on the theory of scheduled time stability, the agent can p From their respective local optimal values Reach the global optimal solution x * ; Combined with steps 4.2.1 and 4.2.2, in the first stage of the algorithm, each agent can first p The local cost function of each agent is minimized. Then, based on the zero gradient algorithm, the position states of all agents can be minimized in the second stage of the algorithm within the time (1-δ)T. p The internal convergence reaches the global optimal point, at which point the global cost function of the entire system is the smallest, and the entire optimization consensus process is completed within the preset time T p Completed within.

Citation Information

Patent Citations

  • Distributed arbitrary time optimization method based on multi-agent system

    CN115619004A

  • Unmanned platform formation maneuvering and obstacle avoidance method based on distributed time-varying optimization method

    CN118034334A

  • Distributed fixed time optimization method based on multi-agent system

    CN118131621A

  • Method and device for multi-agent path planning

    US20170176994A1

Cited By

  • Distributed optimization method and system for fixed time and predetermined time of multiple unmanned vehicles

    CN119987197A