Unmanned vehicle path planning method and system based on unmanned aerial vehicle cooperation, and medium
By improving the Seagull optimization algorithm, combining Longge-Kutta and pollination algorithm, the local optimal problem in unmanned vehicle path planning is solved, and more efficient path planning effect is achieved, enhancing the algorithm's global search ability and stability.
Patent Information
- Application Number
- CN202411240002.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-05
- Publication Date
- 2024-11-12
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The existing Seagull optimization algorithm is prone to falling into local optimization and low convergence accuracy in unmanned vehicle path planning, making it difficult to achieve ideal path planning effects.
Introducing Longge-Kuta optimization algorithm and pollination algorithm to improve the optimal position update mechanism of the seagull optimization algorithm, combining Gaussian mapping to initialize the seagull population position, and perform optimal position update through dimensional bidirectional sine mutations, enhancing the algorithm's global search capability and stability.
It effectively overcomes local optimal problems, improves the effectiveness of unmanned vehicle path planning, improves the accuracy and efficiency of path planning, and obtains better path planning results.
Smart Images

Figure CN118938937A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of path planning, and in particular to a method, system and medium for unmanned vehicle path planning based on unmanned aerial vehicle collaboration. Background Art
[0002] Unmanned vehicle path planning based on UAV collaboration is one of the key technologies of air-ground heterogeneous robot systems. First, a grid map of the ground environment is established based on the perception system and positioning navigation system carried by the UAV; secondly, the unmanned vehicle receives the UAV grid map information in real time, corrects and supplements the grid map based on the environmental information it perceives, and then plans a collision-free optimal moving path from the starting point to the end point. This optimal path can meet the requirements of the shortest moving path, the shortest time consumption, and the lowest energy consumption, etc.
[0003] The path planning problem of unmanned vehicles based on UAV collaboration can actually be regarded as a complex optimization problem with constraints. Therefore, some intelligent optimization algorithms have played a positive role in improving the effect of unmanned vehicle path planning, and many scholars have carried out a lot of research work. According to current research results, intelligent optimization algorithms are an effective path planning method. The seagull optimization algorithm is a new intelligent optimization algorithm that simulates the foraging behavior of seagulls and can also be applied to path planning problems.
[0004] However, the conventional Seagull optimization algorithm still has some defects, which makes the algorithm easy to fall into local optimality and low convergence accuracy. When performing path planning, it often fails to achieve the ideal path planning effect based on the planning goal. Summary of the invention
[0005] To solve the above problems, the present invention provides an unmanned vehicle path planning method based on drone collaboration, which overcomes the problem of local optimality in existing path planning methods and can effectively improve the effect of unmanned vehicle path planning.
[0006] To achieve the above object, the present invention provides the following technical solutions.
[0007] A method for unmanned vehicle path planning based on unmanned aerial vehicle collaboration includes the following steps:
[0008] A grid map of the ground environment is established based on the perception system and positioning navigation system carried by the drone, and the grid map is corrected and supplemented based on the environmental information perceived by the drone.
[0009] According to the corrected and supplemented grid map, an objective function for the path planning of the unmanned vehicle is established with the shortest moving path, the shortest time consumption, or the least energy consumption as constraints;
[0010] According to the objective function, the optimal position is updated by using the improved seagull optimization algorithm to determine the optimal seagull position; wherein the improved seagull optimization algorithm is: the optimal position update mechanism of the seagull optimization algorithm is improved by introducing the Runge-Kutta optimization algorithm and the pollen pollination algorithm, and three optimal seagull positions are generated according to the factors of the optimal position of the seagull and the positions of other seagulls in the population are randomly selected, and the optimal seagull position is selected as the optimal seagull position of the iteration;
[0011] The optimal seagull position is updated in sequence according to the preset maximum number of iterations to determine the optimal path planning result.
[0012] Preferably, the updating of the optimal position by using the improved seagull optimization algorithm to determine the optimal seagull position comprises the following steps:
[0013] Initialize the seagull population position using Gaussian mapping;
[0014] Simulate the migration behavior and global attack behavior of seagulls; introduce the position update method of Runge-Kutta optimization algorithm and pollination algorithm into the global attack behavior of seagulls to search for the optimal seagull position;
[0015] The optimal seagull position is further updated through bidirectional sine mutation in each dimension to determine the updated optimal seagull position.
[0016] Preferably, the initializing the seagull population position using Gaussian mapping comprises the following steps:
[0017] Determine the population size N, the lower boundary LB and the upper boundary UB of the seagull search;
[0018] Generate random number x through Gaussian mapping t :
[0019]
[0020] In the formula, mod(·) is the remainder function, x t+1 is the next random number;
[0021] Use the generated Gaussian random numbers to initialize the seagull position:
[0022] P s (t) = (UB - LB) × x t +LB.
[0023] Preferably, the simulating seagull migration behavior comprises the following steps:
[0024] To avoid collision, the additional variable A is used to calculate the new position of the seagull.
[0025] C s (t) = A × Ps (t)
[0026] A=f c -(t×f c / Miter)
[0027] In the formula, C s (t) is the new position that does not conflict with other seagulls, P s (t) is the current position of the seagull, t is the current iteration number, Miter is the maximum iteration number, A is the movement behavior of the seagull in the given search space, and f c is the control coefficient, and its value decreases from 2 to 0;
[0028] After avoiding overlapping positions with other seagulls, the seagull will move in the direction of the optimal position:
[0029] M s (t) = B × (P bs (t)-P s (t))
[0030] B = 2 × A 2 × d
[0031] Where M s (t) represents the direction of the optimal position, P bs (t) represents the best position of the tth iteration, B is a random number responsible for balancing global and local searches, and r d is a random number in the range [0,1];
[0032] After the seagull moves to a position where it does not collide with other seagulls, it moves in the direction of the best position and reaches a new position:
[0033] D s (t)=|C s (t)+M s (t)|
[0034] Where D s (t) is the distance the seagull moves to its new position.
[0035] Preferably, the method of introducing the position update mode of the Runge-Kutta optimization algorithm and the pollen pollination algorithm into the global attack behavior of the seagulls and searching for the optimal seagull position comprises the following steps:
[0036] Attack behavior: When attacking prey, seagulls constantly change the attack angle and speed through spiral motion. The spiral motion behavior is shown in the following formula:
[0037]
[0038] Where: x, y, z are the coordinates in three directions, r is the radius of each spiral; θ is a random angle value in the range [0, 2π]; u and v are related constants that define the shape of the spiral; e is the base of the natural logarithm;
[0039] The Runge-Kutta optimization algorithm and the pollen pollination algorithm are introduced to update the position. The new solution P is generated by using the following formula snew2 (t):
[0040]
[0041] in:
[0042]
[0043] P avg (t) = η1·P r1 (t)+η2·P r2 (t)+η3·P r3 (t)
[0044] P snew1 (t) = e β ·(D s (t)×x×y×z+P bs (t))+cos(1-e β )·P avg (t)
[0045] φ=round((1+rand)·(1-rand))
[0046] Where rand is a random number between [0,1]; randn is a random number that follows a normal distribution; c is a random number between [0,5]; ρ is a random integer between 1, 0, or -1; w is a random number that decreases as the number of iterations increases; rand(0,2) is a random number between [0,2]; β is a random number between [0,1]; P r1 (t), P r2 (t) and P r3 (t) represents three seagull individuals randomly selected at the tth iteration, r1≠r2≠r3; P avg (t) is P r1 (t), P r2 (t) and P r3 (t); η1, η2 and η3 are random numbers between [0,1], and the sum of the three is 1; P bs (t) represents the best position of the tth iteration; P snew1 (t) is a new solution, which is P bs (t) and P avg(t); φ is a random number; round(·) is the rounding operation;
[0047] Generate another new solution P snew3 (t), is defined as follows:
[0048]
[0049] in:
[0050] P PK (t) = k1 + 2 × k2 + 2 × k3 + k4
[0051]
[0052] in, is a random number between [0,2]; P PK (t) is a position update mechanism based on the 4th-order Runge-Kutta method, k1, k2, k3 and k4 are P PK (t); SF is the adaptive factor, a and b are the control parameters of the adaptive factor; P sbi (t) is P r1 (t), P r2 (t) and P r3 The optimal position in (t);
[0053] In summary, the improved seagull position formula is:
[0054]
[0055] Calculate the fitness value:
[0056] fitness(t)=F f (P s (t+1))
[0057] In the formula, F f (·) is the fitness function when calculating the fitness value;
[0058] Record the best seagull in the iteration.
[0059] Preferably, the further updating of the optimal position of the optimal seagull position by bidirectional sine variation in each dimension comprises the following steps:
[0060] For dimension j, the sine chaos value is calculated according to the current number of iterations, and the positive and negative directions are switched with equal probability:
[0061] sinValue=sin(πx0)
[0062]
[0063] In the formula, rand is a random number between 0 and 1; x0 is the iteration sequence value;
[0064] Perform mutation perturbation on the optimal position:
[0065] P bs(j) (t+1)′=P bs(j) (t+1)+SinValue×P bs(j) (t+1)
[0066] Where: P bs(j) (t+1) represents the optimal position P of the t+1th iteration bs The jth dimension of (t+1);
[0067] Greedy Update:
[0068]
[0069] After each dimension has been mutated, stop mutation.
[0070] A path planning system for an unmanned vehicle based on unmanned aerial vehicle collaboration, the system comprising:
[0071] processor;
[0072] a memory having stored thereon a computer program executable on the processor;
[0073] Among them, when the computer program is executed by the processor, the steps of the unmanned vehicle path planning method based on drone collaboration are implemented.
[0074] A computer-readable storage medium stores a data processing program, and when the data processing program is executed by a processor, the steps of the unmanned vehicle path planning method based on unmanned aerial vehicle collaboration are implemented.
[0075] Beneficial effects of the present invention:
[0076] The present invention proposes a path planning method for unmanned vehicles based on UAV collaboration, adopts an improved seagull optimization algorithm for path planning, improves the position update method of seagulls, introduces the Runge-Kutta optimization algorithm and the pollen pollination algorithm to improve the position update mechanism of the seagull algorithm, comprehensively considers the optimal position of the seagull in this iteration, randomly selects other seagull positions within the population and other factors, and generates new solutions according to different conditions, thereby increasing the search range of the algorithm, enhancing the adaptability of the algorithm, obtaining a better seagull position, that is, obtaining a better path planning point, overcoming the local optimal problem of existing path planning methods, and effectively improving the effect of unmanned vehicle path planning. The method also introduces Gaussian mapping to initialize the position of the seagull population, which can improve the uniformity and diversity of the population position distribution, thereby enhancing the stability of the algorithm; in addition, the method also uses bidirectional sine chaotic mapping mutation for the optimal seagull, realizing the ability of the algorithm to jump out of the local optimal solution in the later stage, and further improving the path optimization effect. BRIEF DESCRIPTION OF THE DRAWINGS
[0077] Figure 1 is a flow chart of a method for unmanned vehicle path planning based on unmanned aerial vehicle collaboration according to an embodiment of the present invention;
[0078] Figure 2 is a path planning result of an unmanned vehicle path planning method based on UAV collaboration in an embodiment of the present invention;
[0079] Figure 3 It is an iterative process curve of an unmanned vehicle path planning method based on UAV collaboration in an embodiment of the present invention. DETAILED DESCRIPTION
[0080] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.
[0081] Example 1
[0082] The present invention provides a method for unmanned vehicle path planning based on UAV collaboration. Aiming at several problems existing in SOA, an improved Seagull optimization algorithm (ISOA) is proposed and used for unmanned vehicle path planning based on air-ground information interaction. The process of the unmanned vehicle path planning method based on UAV collaboration is as follows: Figure 1 As shown, the specific steps are as follows:
[0083] S1: A grid map of the ground environment is established based on the perception system and positioning navigation system carried by the drone. The unmanned vehicle obtains the grid map established by the drone and corrects and supplements the grid map based on the environmental information it perceives.
[0084] S2: Establish the objective function of the unmanned vehicle path planning based on drone vision (set to the shortest moving path, shortest time consumption, least energy consumption, etc. according to actual needs), and set the corresponding constraints and the number of key nodes D of the path.
[0085] S3: Parameter setting, mainly including: the size of the seagull population (i.e. the number of seagull individuals) N; the maximum number of iterations (i.e. the condition for stopping iteration) Miter; the lower boundary LB of the seagull optimization; the upper boundary UB of the seagull optimization.
[0086] S4: Determine the size of the population N, the lower boundary LB and the upper boundary UB of the seagull optimization search; introduce Gaussian mapping to initialize the position of the seagull population, including the following steps:
[0087] Determine the population size N, the lower boundary LB and the upper boundary UB of the seagull search;
[0088] Generate random number x through Gaussian mapping t :
[0089]
[0090] In the formula, mod(·) is the remainder function, x t+1 is the next random number;
[0091] Use the generated Gaussian random numbers to initialize the seagull position:
[0092] P s (t) = (UB - LB) × x t +LB.
[0093] S5: Migration behavior of seagulls:
[0094] During the migration process, the algorithm simulates how a flock of seagulls moves from one location to another. There are three main behaviors in this phase: avoiding collisions, moving in the direction of the best location, and approaching the best location.
[0095] a) To avoid collisions with neighbors (other seagulls), the algorithm uses an additional variable A to calculate the new position of the seagull:
[0096] C s (t) = A × P s (t)
[0097] A=f c -(t×fc / Miter)
[0098] In the formula, C s (t) is the new position that does not conflict with other seagulls, P s (t) is the current position of the seagull, t is the current iteration number, Miter is the maximum iteration number, A is the movement behavior of the seagull in the given search space, and f c is the control coefficient, and its value decreases from 2 to 0;
[0099] b) After avoiding overlapping positions with other seagulls, the seagull will move in the direction of the optimal position:
[0100] M s (t) = B × (P bs (t)-P s (t))
[0101] B = 2 × A 2 × d
[0102] Where M s (t) represents the direction of the optimal position, P bs (t) represents the best position of the tth iteration, B is a random number responsible for balancing global and local searches, and r d is a random number in the range [0,1];
[0103] c) After the seagull moves to a position where it does not collide with other seagulls, it moves in the direction of the best position and reaches a new position:
[0104] D s (t)=|C s (t)+M s (t)|
[0105] Where D s (t) is the distance the seagull moves to its new position.
[0106] Attack behavior: When attacking prey, seagulls constantly change the attack angle and speed through spiral motion. The spiral motion behavior is shown in the following formula:
[0107]
[0108] Where: x, y, z are the coordinates in three directions, r is the radius of each spiral; θ is a random angle value in the range [0, 2π]; u and v are related constants that define the shape of the spiral; e is the base of the natural logarithm;
[0109] In the original seagull algorithm, only the optimal seagull position is used for guidance to update the seagull position. In order to more effectively improve the global search ability of the seagull, the Runge-Kutta optimization algorithm and the pollen pollination algorithm are introduced to improve the position update mechanism of the seagull algorithm. The optimal position of the seagull is comprehensively considered, and the positions of other seagulls in the population are randomly selected. Factors such as the position of the other seagulls in the population are generated, and new solutions P are generated according to different conditions. snew1 (t), P snew2 (t) or P snew3 (t), avoiding the local optimum in each iteration and thus improving the global search capability of the Seagull algorithm.
[0110] The Runge-Kutta optimization algorithm and the pollen pollination algorithm are introduced to update the position. The new solution P is generated by using the following formula snew2 (t):
[0111]
[0112] in:
[0113]
[0114] P avg (t) = η1·P r1 (t)+η2·P r2 (t)+η3·P r3 (t)
[0115] P snew1 (t) = e β ·(D s (t)×x×y×z+P bs (t))+cos(1-e β )·P avg (t)
[0116] φ=round((1+rand)·(1-rand))
[0117] Where rand is a random number between [0,1]; randn is a random number that follows a normal distribution; c is a random number between [0,5]; ρ is a random integer between 1, 0, or -1; w is a random number that decreases as the number of iterations increases; rand(0,2) is a random number between [0,2]; β is a random number between [0,1]; P r1 (t), P r2 (t) and P r3 (t) represents three seagull individuals randomly selected at the tth iteration, r1≠r2≠r3; P avg (t) is P r1 (t), P r2 (t) and P r3(t); η1, η2 and η3 are random numbers between [0,1], and the sum of the three is 1; P bs (t) represents the best position of the tth iteration; P snew1 (t) is a new solution, which is P bs (t) and P avg (t); φ is a random number; round(·) is the rounding operation.
[0118] Generate another new solution P snew3 (t), is defined as follows:
[0119]
[0120] in:
[0121] P PK (t) = k1 + 2 × k2 + 2 × k3 + k4
[0122]
[0123] in, is a random number between [0,2]; P PK (t) is a position update mechanism based on the 4th-order Runge-Kutta method, k1, k2, k3 and k4 are P PK (t); SF is the adaptive factor, a and b are the control parameters of the adaptive factor; P sbi (t) is P r1 (t), P r2 (t) and P r3 The optimal position in (t).
[0124] In summary, the improved seagull position formula is:
[0125]
[0126] S6: Calculate the fitness value.
[0127] fitness(t)=F f (P s (t+1))
[0128] In the formula, F f (·) is the fitness function when calculating the fitness value;
[0129] S7: Record information, record the best seagull in the iteration.
[0130] S8: Perform bidirectional sine mutation on the optimal seagull dimension by dimension. For dimension j, first calculate the sine chaos value according to the current number of iterations, and switch the positive and negative directions with equal probability.
[0131] sin Value = sin(πx0)
[0132]
[0133] In the formula, rand is a random number between 0 and 1; x0 is the iteration sequence value;
[0134] Perform mutation perturbation on the optimal position:
[0135] P bs(j) (t+1)′=P bs(j) (t+1)+SinValue×P bs(j) (t+1)
[0136] Where: P bs(j) (t+1) represents the optimal position P of the t+1th iteration bs The jth dimension of (t+1);
[0137] Greedy Update:
[0138]
[0139] After each dimension has been mutated, stop mutation.
[0140] S9: Record information, record the best seagull in the iteration.
[0141] S10: Repeat steps S5 to S9. When the maximum number of iterations Miter is reached, the algorithm stops and the optimal path result is output.
[0142] In this embodiment:
[0143] Using MATLAB as the simulation platform, assuming that a 20×20 grid map is constructed, with the shortest moving distance as the goal, the SOA method and the ISOA method are analyzed. The parameters in the SOA algorithm are: N=50, Maxiter=200, LB=1, UB=20; the parameters in the ISOA algorithm are: N=50, Maxiter=200, LB=1, UB=20. The simulation environment and the moving paths obtained by the two methods are shown in Figure 2. Figure 2 As shown, Figure 3 is the iterative process curve. Table 1 is the comparison of the data results of the two algorithms.
[0144] Table 1. Comparison of algorithm path results
[0145] algorithm Path length SOA 34.1421 ISOA 31.799
[0146] from Figure 2It can be intuitively found that the moving path obtained by SOA is longer and more circuitous than that of ISOA, while the path obtained by ISOA is more reasonable. Figure 2 and Figure 3 From the results in , we can see that when the SOA algorithm is used, the algorithm converges slowly; when the ISOA algorithm is used, the convergence speed is faster and a better path can be found faster. It can be seen that the ISOA algorithm designed in this paper has a faster convergence speed and convergence accuracy. The simulation results show that under a variety of identical environments, the ISOA algorithm has a stronger search capability and obtains a better mobile path, verifying the effectiveness of the algorithm.
[0147] The above are only preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A method for unmanned vehicle path planning based on UAV collaboration, characterized in that: The following steps are involved: A grid map of the ground environment is established based on the perception system and positioning navigation system carried by the drone, and the grid map is corrected and supplemented based on the environmental information perceived by the drone. According to the corrected and supplemented grid map, an objective function for the path planning of the unmanned vehicle is established with the shortest moving path, the shortest time consumption, or the least energy consumption as constraints; According to the objective function, the optimal position is updated by using the improved seagull optimization algorithm to determine the optimal seagull position; wherein the improved seagull optimization algorithm is: the optimal position update mechanism of the seagull optimization algorithm is improved by introducing the Runge-Kutta optimization algorithm and the pollen pollination algorithm, and three optimal seagull positions are generated according to the factors of the optimal position of the seagull and the positions of other seagulls in the population are randomly selected, and the optimal seagull position is selected as the optimal seagull position of the iteration; The optimal seagull position is updated in sequence according to the preset maximum number of iterations to determine the optimal path planning result.
2. The unmanned vehicle path planning method based on unmanned aerial vehicle collaboration according to claim 1 is characterized in that: The method of updating the optimal position by using the improved seagull optimization algorithm to determine the optimal seagull position includes the following steps: Initialize the seagull population position using Gaussian mapping; Simulate the migratory behavior and global aggressive behavior of seagulls; The position update method of Runge-Kutta optimization algorithm and pollination algorithm is introduced into the global attack behavior of seagulls to search for the optimal seagull position; The optimal seagull position is further updated through bidirectional sine mutation in each dimension to determine the updated optimal seagull position.
3. The unmanned vehicle path planning method based on UAV collaboration according to claim 2 is characterized in that: The method of initializing the position of the seagull population by using Gaussian mapping includes the following steps: Determine the population size N, the lower boundary LB and the upper boundary UB of the seagull search; Generate random number x through Gaussian mapping t : In the formula, mod(·) is the remainder function, x t+1 is the next random number; Use the generated Gaussian random numbers to initialize the seagull position: P s (t)=(UB-LB)×x t +LB。 4. The unmanned vehicle path planning method based on unmanned aerial vehicle collaboration according to claim 2 is characterized in that: The migratory behavior of simulating seagulls comprises the following steps: To avoid collision, the additional variable A is used to calculate the new position of the seagull; C s (t)=A×P s (t) A=f c -(t×f c / Miter) In the formula, C s (t) is the new position that does not conflict with other seagulls, P s (t) is the current position of the seagull, t is the current iteration number, Miter is the maximum iteration number, A is the movement behavior of the seagull in the given search space, and f c is the control coefficient, and its value decreases from 2 to 0; After avoiding overlapping positions with other seagulls, the seagull will move in the direction of the optimal position: M s (t)=B×(P bs (t)-P s (t)) B=2×A 2 ×r d Where M s (t) represents the direction of the optimal position, P bs (t) represents the best position of the tth iteration, B is a random number responsible for balancing global and local searches, and r d is a random number in the range [0,1]; After the seagull moves to a position where it does not collide with other seagulls, it moves in the direction of the best position and reaches a new position: D s (t)=|C s (t)+M s (t)| Where D s (t) is the distance the seagull moves to its new position.
5. The unmanned vehicle path planning method based on unmanned aerial vehicle collaboration according to claim 2 is characterized in that: The method of introducing the position update method of the Runge-Kutta optimization algorithm and the pollination algorithm into the global attack behavior of the seagull and searching for the optimal seagull position includes the following steps: Attack behavior: When attacking prey, seagulls constantly change the attack angle and speed through spiral motion. The spiral motion behavior is shown in the following formula: Where: x, y, z are the coordinates in three directions, r is the radius of each spiral; θ is a random angle value in the range [0, 2π]; u and v are related constants that define the shape of the spiral; e is the base of the natural logarithm; The Runge-Kutta optimization algorithm and the pollen pollination algorithm are introduced to update the position. The new solution P is generated by using the following formula snew2 (t): in: P avg (t)=η1·P r1 (t)+η2·P r2 (t)+η3·P r3 (t) P snew1 (t)=e β ·(D s (t)×x×y×z+P bs (t))+cos(1-e β )·P avg (t) φ=round((1+rand)·(1-rand)) Where rand is a random number between [0,1]; randn is a random number that follows a normal distribution; c is a random number between [0,5]; ρ is a random integer between 1, 0, or -1; w is a random number that decreases as the number of iterations increases; rand(0,2) is a random number between [0,2]; β is a random number between [0,1]; P r1 (t), P r2 (t) and P r3 (t) represents three seagull individuals randomly selected at the tth iteration, r1≠r2≠r3; P avg (t) is P r1 (t), P r2 (t) and P r3 (t); η1, η2 and η3 are random numbers between [0,1], and the sum of the three is 1; P bs (t) represents the best position of the tth iteration; P snew1 (t) is a new solution, which is P bs (t) and P avg (t); φ is a random number; round(·) is the rounding operation; Generate another new solution P snew3 (t), is defined as follows: in: P PK (t)=k1+2×k2+2×k3+k4 in, is a random number between [0,2]; P PK (t) is a position update mechanism based on the 4th-order Runge-Kutta method, k1, k2, k3 and k4 are P PK (t); SF is the adaptive factor, a and b are the control parameters of the adaptive factor; P sbi (t) is P r1 (t), P r2 (t) and P r3 The optimal position in (t); In summary, the improved seagull position formula is: Calculate the fitness value: fitness(t)=F f (P s (t+1)) In the formula, F f (·) is the fitness function when calculating the fitness value; Record the best seagull in the iteration.
6. The unmanned vehicle path planning method based on unmanned aerial vehicle collaboration according to claim 2 is characterized in that: The method of further updating the optimal position of the optimal seagull position by bidirectional sine mutation in each dimension includes the following steps: For dimension j, the sine chaos value is calculated according to the current number of iterations, and the positive and negative directions are switched with equal probability: sin Value = sin(πx0) In the formula, rand is a random number between 0 and 1; x0 is the iteration sequence value; Perform mutation perturbation on the optimal position: P bs(j) (t+1)'=P bs(j) (t+1)+SinValue×P bs(j) (t+1) Where: P bs(j) (t+1) represents the optimal position P of the t+1th iteration bs The jth dimension of (t+1); Greedy Update: After each dimension has been mutated, stop mutation.
7. A path planning system for unmanned vehicles based on UAV collaboration, characterized in that: The system comprises: processor; a memory having stored thereon a computer program executable on the processor; Wherein, when the computer program is executed by the processor, the steps of the unmanned vehicle path planning method based on drone collaboration as described in any one of claims 1 to 6 are implemented.
8. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a data processing program, and when the data processing program is executed by the processor, the steps of the unmanned vehicle path planning method based on unmanned aerial vehicle collaboration as described in any one of claims 1 to 6 are implemented.
