Airship multi-mission point route planning method based on genetic algorithm and greedy strategy

Through a route planning method based on genetic algorithms and greedy strategies, the problem of the impact of the turning radius of the heavy-loaded semi-hard airship in multi-task point flight is solved, and the optimal route is generated, which improves flight efficiency and accuracy.

CN114897246BActive Publication Date: 2024-12-06BEIHANG UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210527302.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-05-16
Publication Date
2024-12-06
Estimated Expiration
2042-05-16

AI Technical Summary

Technical Problem

When performing multi-mission point flights, it is difficult to ensure the accurate passage of the airship and improve flight efficiency due to the influence of the large turning radius.

Method used

Using a route planning method based on genetic algorithms and greedy strategies, the airship's minimum turning radius and global optimal flight order are calculated, and the local optimal solution between each adjacent two task points is decomposed to generate the optimal route.

Benefits of technology

Under the conditions of large turning radius, the airship ensures that the accurate passage of multi-mission points is improved, and the computing efficiency is improved, which is suitable for complex flight mission situations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114897246B_ABST
    Figure CN114897246B_ABST
Patent Text Reader

Abstract

The present invention relates to a route planning method for multiple mission points of an airship based on a genetic algorithm and a greedy strategy. The minimum turning radius of the airship is calculated according to the minimum flight speed and the maximum turning slope angle when the airship turns; the optimal flight sequence of the airship from the take-off point through all mission points back to the landing point is obtained according to the global search capability of the genetic algorithm; the route planning method based on the greedy strategy sequentially obtains the optimal route between each two adjacent mission points in the optimal flight sequence, connects the optimal route between each two adjacent mission points, and finally obtains the optimal route of the airship from the take-off point through all mission points back to the landing point. The present invention accurately passes through multiple mission points under the influence of the large turning radius of the airship and quickly and accurately generates the optimal route, thereby improving the flight efficiency; the global search capability of the genetic algorithm and the local optimal characteristics of the greedy strategy are combined to improve the computing efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to the technical field of route planning, and in particular to an airship multi-mission point route planning method based on genetic algorithm and greedy strategy. Background Art

[0002] Heavy-loaded semi-rigid airships are different from ordinary unmanned aerial photography airships. They are large in size, heavy-loaded, and have long flight times, which means they can perform observation, transportation, and other tasks across multiple cities (or regions), such as the German Zeppelin airship, the American ML866 airship, and the Chinese HA380. Heavy-loaded semi-rigid airships are also different from airplanes. They are large in size and have a large frontal area. When performing flight missions, the airships must have a large turning radius when passing through each mission point. Therefore, when heavy-duty semi-rigid airships pass through multiple mission points to perform environmental monitoring or simulation tests, it is difficult to ensure that the airships can accurately pass through multiple mission points and improve flight efficiency due to the influence of the turning radius. Summary of the invention

[0003] The invention solves the problem: overcomes the shortcomings of the prior art and provides a method for planning airship multi-mission points based on genetic algorithm and greedy strategy, which can ensure that the airship can accurately pass through the multi-mission points and improve flight efficiency under the influence of the turning radius.

[0004] The technical solution of the present invention is a method for planning airship multi-mission point routes based on genetic algorithm and greedy strategy, comprising the following steps:

[0005] S1: Obtain the minimum flight speed and maximum turning slope angle parameter information of the airship and the coordinate information of multiple mission points;

[0006] S2: Calculate the minimum turning radius of the airship when it passes each mission point based on the obtained parameter information of the minimum flight speed and maximum turning slope angle of the airship;

[0007] S3: According to the proposed improved genetic algorithm global search method, the global optimal flight sequence of the airship from the take-off point through all the mission points back to the landing point is obtained according to the coordinates of the obtained multi-mission points;

[0008] S4: Based on the global optimal flight sequence, a route planning method based on a greedy strategy is proposed. The greedy strategy is used to decompose the global optimal solution for solving the route planning of multiple mission points of the airship into the local optimal solution for solving the route planning between each two adjacent mission points. The minimum turning radius of the airship is used to obtain the shortest path between each two adjacent mission points in the optimal flight sequence, that is, the optimal route; then the optimal route between each two adjacent mission points is connected, and finally the optimal route for the airship to return to the landing point from the take-off point through all mission points is obtained. For example, the optimal flight sequence obtained by S3 is: take-off-3-1-5-6-2-4-landing, and the S4 step will obtain the shortest path between two mission points, take-off-3, 3-1, 1-5, 5-6, 6-2, 2-4, 4-landing in sequence; when S4 calculates the shortest path, because the influence of the turning radius must be considered, the minimum turning radius of the airship calculated in S2 is used.

[0009] Preferably, in step S3, since the airship route planning problem can be described as a closed loop traversing n mission points from the take-off point, a proposed global search method of an improved genetic algorithm is adopted to solve the shortcomings of the route planning method based on the greedy strategy proposed in S4 that obtains the local optimum and cannot achieve the global optimum, and obtain the global optimal flight sequence passing through all mission points. The improvement of the genetic algorithm includes randomly generating multiple individuals with the starting point as the take-off point when initializing the population, and in the crossover operation, first sorting the population by fitness value, and cross-exchanging partial node sequences of the same length in two adjacent individuals according to single-point crossover, that is, single-point crossover is performed with the larger fitness value, which can improve the convergence accuracy of the algorithm.

[0010] Preferably, in step S4, the route planning method based on the greedy strategy adopts the idea of ​​the greedy strategy on the basis of the optimal flight sequence of multiple mission points, decomposes the global optimal solution for solving the route planning of multiple mission points of the airship into the local optimal solution for solving the route planning between each two adjacent mission points, and decomposes the global optimal solution with a large amount of calculation into the local optimal solution with a small amount of calculation, thereby improving the calculation efficiency, and finally obtaining the optimal route between each two adjacent mission points in the optimal flight sequence in sequence.

[0011] Preferably, step S4 includes the following sub-steps:

[0012] S41: Determine the optimal route from the take-off point to the first mission point. The airship can take off in any direction at the take-off point. The optimal route from the take-off point to the first mission point is a straight line from the take-off point to the first mission point.

[0013] S42: Determine the distance between each two adjacent task points P between the first task point and the nth task point. i and P i+1, the optimal route between i=1,2,3,...,n-1;

[0014] S43: Determine the optimal route from the nth mission point to the landing point. For the convenience of calculation, the calculation process of step S43 is the same as that of step S42.

[0015] Specifically, according to the two adjacent mission points P in the previous section in the optimal flight sequence i-1 Go to mission point P i The mission point P in the optimal route i The center of the arc O i After step S42, the task point P can be obtained. i Go to mission point P i+1 The optimal route, and then get the optimal flight sequence for each adjacent task point P i , P i+1 The optimal route between the two adjacent task points P is connected in sequence. i , P i+1 The optimal route between the two is obtained, and the optimal route for the airship to return to the landing point through all the mission points is obtained.

[0016] Preferably, in step S41, since it is assumed that the airship can take off in any direction at the take-off point, the optimal route from the take-off point to the first mission point is a straight line route from the take-off point to the first mission point.

[0017] Preferably, in step S42, two adjacent task points P i and P i+1 The optimal route between includes the mission point P i The arc route, the straight route in the middle, and the mission point P i+1 The arc route is located, so the two adjacent task points P are determined i and P i+1 The optimal route between the two requires the determination of the center O i ′、Center O i+1 , tangent point T i and tangent point T i+1 Therefore, step S42 includes the following sub-steps:

[0018] S421: Determine the center O i ′, according to the coordinates of the two adjacent mission points P in the previous section in the optimal flight sequence i-1 Go to mission point P i The optimal route is the mission point P. i The center of the arc O i Coordinates, by judging from the center O i 、Mission Point P i and mission point P i+1The ∠O i P i P i+1 The size of the task point P is determined i Go to mission point P i+1 The mission point P in the optimal route i The center of the arc O i 'coordinate;

[0019] S422: Determine the center O i+1 The coordinates of the local coordinate system OXY of the multi-task point are obtained and translated to the origin and the task point P i+1 The overlapped position gives the center of the circle O. i+1 The local coordinate system O′X′Y′, then the task point P i+1 The center of the circle O i+1 The coordinates of are expressed using the parametric method, where the parameters θ∈[0,2π);

[0020] S423: Determine the tangent point T i and tangent point T i+1 The coordinates of the task point P i 、Mission Point P i+1 , the center O obtained in step S421 i ' and the center O obtained by S422 i+1 The coordinates of the task point P are determined i The tangent point of the arc route and the straight route is T i and mission point P i+1 The tangent point T between the arc route and the straight route i+1 The coordinates of the task point P are obtained i Go to mission point P i+1 The arc route P included in the optimal route i T i , Straight line T i T i+1 And the arc route T i+1 P i+1 ;

[0021] S424: To prevent the arc route P in step S423 i T i and arc route T i+1 P i+1 is the superior arc, i.e. the arc flight T i+1 P i+1 The arc route is larger than the semicircle, and the arc route is divided into two inferior arc routes, that is, arc routes smaller than the semicircle, to determine the arc route P i T i The midpoint M i and arc route T i+1 P i+1 The midpoint Mi+1 The coordinates of

[0022] S425: Determine the optimal route, the center O obtained by the above steps i ′、Center O i+1 , tangent point T i , tangent point T i+1 , midpoint M i and midpoint M i+1 The coordinates of the task point P i Go to mission point P i+1 Route P i P i+1 The total distance is only from the center O i+1 Coordinate related. Mission point P i Go to mission point P i+1 Route P i P i+1 The total distance will be along the center O i+1 The coordinates change by changing the task point P i+1 The center of the circle O i+1 The coordinates of the task point P are obtained by changing the value of the parameter θ∈[0,2π). i Go to mission point P i+1 Route P i P i+1 The minimum value of the total distance determines the task point P i Go to mission point P i+1 The best route for

[0023] S426: Center O i+1 The local coordinate system of the circle is translated into i+1 The local coordinate system O′X′Y′ is converted back to the local coordinate system OXY of the multi-task point, and the task point P in the local coordinate system OXY is obtained. i Go to mission point P i+1 The optimal route and mission point P i+1 The center of the circle O i+1 The coordinates of

[0024] S427: Repeat steps S421-S426 to determine the task point P1 to the route P in turn. n Every two adjacent task points P i and P i+1 The best route between .

[0025] Furthermore, the optimal route between each two adjacent mission points is connected in sequence, and finally the optimal route of the airship from the take-off point through all the mission points back to the landing point is obtained.

[0026] Compared with the prior art, the advantages of the present invention are as follows: the present invention is a method for planning airship multi-mission point routes based on a genetic algorithm and a greedy strategy, which can accurately pass through the multi-mission points under the influence of the large turning radius of the airship and quickly and accurately generate an optimal route, thereby improving flight efficiency; it combines the global search capability of the genetic algorithm and the local optimal characteristics of the greedy strategy, thereby improving computational efficiency; and it has a wide range of applicability and can be applied to various complex flight mission situations existing between the multi-mission points. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 A schematic diagram of a flow chart of a method for planning airship multi-mission point routes based on a genetic algorithm and a greedy strategy according to the present invention;

[0028] Figure 2 A schematic diagram of a route planning method based on a greedy strategy of the present invention;

[0029] Figure 3 A task point P is determined in the present invention. i Go to mission point P i+1 Flow chart of the optimal route;

[0030] Figure 4 A trajectory schematic diagram of a route is generated for the route planning method of the present invention. DETAILED DESCRIPTION

[0031] The present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0032] like Figure 1 As shown, a method for planning airship multi-mission point routes based on a genetic algorithm and a greedy strategy of the present invention comprises the following steps:

[0033] S1: Obtain the minimum flight speed and maximum turning slope angle parameter information of the airship and the coordinate information of multiple mission points;

[0034] S2: Calculate the minimum turning radius of the airship when it passes each mission point based on the obtained parameter information of the minimum flight speed and maximum turning slope angle of the airship;

[0035] S3: According to the proposed improved genetic algorithm global search method, the global optimal flight sequence of the airship from the take-off point through all the mission points back to the landing point is obtained according to the coordinates of the obtained multi-mission points;

[0036] In step S3, since the airship route planning problem can be described as a closed loop traversing n mission points starting from the take-off point, a global search method of an improved genetic algorithm is proposed to solve the shortcomings of the greedy strategy-based route planning method proposed in S4 that only obtains local optimality but cannot achieve global optimality, and obtain the global optimal flight sequence passing through all mission points.

[0037] Step S3 includes the following sub-steps:

[0038] S31: Set the maximum number of evolutionary generations, crossover probability, and mutation probability; calculate the distance between any two task points;

[0039] Specifically, the maximum evolutionary generation represents the number of genetic iterations of the genetic algorithm, the crossover probability represents the probability of crossover mutation between every two adjacent individuals in the population, and the mutation probability represents the probability of mutation of each individual in the population;

[0040] S32: Initialize the population and randomly generate multiple individuals with the starting point as the take-off point;

[0041] S33: Selection operation, passing excellent individuals to the next generation, calculating the distance between any two task points in S31, obtaining the total path length of each individual, the fitness value of each individual in the population is the inverse of the total path length, sorting the individuals in the population from large to small according to the fitness value, dividing them into three parts, replicating the individual with the largest fitness value in the front twice, replicating the individual in the middle once, and not replicating the individual with the smallest fitness value in the back, forming a new population to replace the original population;

[0042] S34: Crossover operation. Every two adjacent individuals in the population have a certain crossover probability. The excellent individuals selected in S33 are paired and crossed to generate new excellent individuals. First, the population is sorted by fitness value, and the partial node sequences of the same length in two adjacent individuals are cross-exchanged according to single-point crossover, that is, the ones with larger fitness values ​​are cross-exchanged with each other at a single point, so as to improve the convergence accuracy of the algorithm and generate new individuals to replace the source individuals;

[0043] S35: mutation operation. Each individual in the population has a certain mutation probability. The new individuals generated by the crossover in S34 are mutated to generate new excellent individuals. First, the average fitness value of the population is calculated. The mutation probability of individuals with fitness values ​​greater than the average fitness value will be multiplied by a randomly generated [0,1] operator to reduce the mutation probability of individuals with larger fitness values. Individuals with fitness values ​​less than the average fitness value will mutate according to the mutation probability set in S31. Then, the individuals are partially mutated, that is, two task points in the individual sequence are randomly selected, and the positions of the two task points in the individual sequence are exchanged to obtain new excellent individuals through mutation.

[0044] S36: Repeat steps S33-S35 until the genetic generation reaches the maximum evolution generation, and output the individual with the maximum fitness in the evolution process, that is, output the optimal flight order of the multiple mission points;

[0045] S4: According to the route planning method based on greedy strategy, on the basis of the optimal flight sequence, the route planning problem of the airship's multiple mission points is decomposed into the route planning problem between each two adjacent mission points by adopting the greedy strategy idea. The minimum turning radius of the airship is used to obtain the optimal route between each two adjacent mission points in the optimal flight sequence.

[0046] In step S4, the route planning method based on the greedy strategy adopts the idea of ​​the greedy strategy on the basis of the optimal flight sequence of multiple mission points, decomposes the route planning problem of the airship into the route planning problem between every two adjacent mission points, and decomposes the global optimal solution with large computational complexity into the local optimal solution with small computational complexity, thereby improving the computational efficiency, and finally obtaining the optimal route between every two adjacent mission points in the optimal flight sequence in sequence.

[0047] In order to simplify the problem and facilitate calculation, the present invention does not consider the direction of the airship at the take-off and landing point, and proposes the following assumptions:

[0048] (1) The airship may take off from the take-off point in any direction;

[0049] (2) The airship can return to the landing point from any direction;

[0050] (3) The airship’s take-off point and landing point coincide with the same point.

[0051] like Figure 2 As shown, the route planning method based on the greedy strategy proposed in step S4 includes the following sub-steps:

[0052] S41: Determine the optimal route from the take-off point to the first mission point;

[0053] Specifically, according to the assumption (1) that the airship can take off in any direction at the take-off point, the optimal route from the take-off point to the first mission point is the straight line from the take-off point to the first mission point;

[0054] S42: Determine the distance between each two adjacent task points P between the first task point and the nth task point. i and P i+1 , the optimal route between i=1,2,3,...,n-1;

[0055] S43: Determine the optimal route from the nth mission point to the landing point. Based on assumption (2), for the convenience of calculation, the calculation process of step S43 is the same as that of step S42.

[0056] Specifically, according to the two adjacent mission points P in the previous section in the optimal flight sequence i-1 Go to mission point P i The mission point P in the optimal route i The center of the arc O i After step S42, the task point P can be obtained. i Go to mission point P i+1 The optimal route, and then get the optimal flight sequence for each adjacent task point P i , P i+1 The optimal route between the two adjacent task points P is connected in sequence. i , P i+1 The optimal route between the two is obtained, and the optimal route for the airship to return to the landing point through all the mission points is obtained.

[0057] like Figure 3 As shown, preferably, in step S42, two adjacent task points P i and P i+1 The optimal route between includes the mission point P i The arc route, the straight route in the middle, and the mission point P i+1 The arc route is located, so the two adjacent task points P are determined i and P i+1 The optimal route between the two requires the determination of the center O i ′、Center O i+1 , tangent point T i and tangent point T i+1 Therefore, step S42 includes the following sub-steps:

[0058] S421: Determine the center O i ′, according to the coordinates of the two adjacent mission points P in the previous section in the optimal flight sequence i-1 Go to mission point P i The optimal route is the mission point P. i The center of the arc O i Coordinates, by judging from the center O i 、Mission Point P i and mission point P i+1 The ∠O i P i P i+1 The size of the task point P is determined i Go to mission point P i+1 The mission point P in the optimal route i The center of the arc O i 'coordinate;

[0059] When ∠O i P i P i+1Less than 90°, indicating that the task point P i is the convex point, i.e. the center of the circle O i ′Coordinates and center O i Coordinates coincide; when ∠O i P i P i+1 Greater than 90°, indicating that the task point P i is the concave point, i.e. the center of the circle O i ′Coordinates and center O i Coordinates about the task point P i symmetry;

[0060] S422: Determine the center O i+1 The coordinates of the local coordinate system OXY of the multi-task point are obtained and translated to the origin and the task point P i+1 The overlapped position gives the center of the circle O. i+1 The local coordinate system O′X′Y′, then the task point P i+1 The center of the circle O i+1 The coordinates of are expressed using the parametric method, where the parameters θ∈[0,2π);

[0061] The task point P in the coordinate system O′X′Y′ i+1 The center of the circle O i+1 The coordinates of are expressed parametrically as

[0062] S423: Determine the tangent point T i and tangent point T i+1 The coordinates of the task point P i 、Mission Point P i+1 、The center O obtained by S421 i ' and the center O obtained by S422 i+1 The coordinates of the task point P can be determined i The tangent point of the arc route and the straight route is T i and mission point P i+1 The tangent point T between the arc route and the straight route i+1 The coordinates of the task point P are obtained i Go to mission point P i+1 The arc route P included in the optimal route i T i , Straight line T i T i+1 And the arc route T i+1 P i+1 ;

[0063] In step S423, according to the task point P i+1 and mission point P i The center of the circle O i 'The distance between The geometric relationship with the minimum turning radius R is divided into three cases:

[0064] Specifically, when Now we know the mission point P i 、Mission Point P i Center O i ′、Task point P i+1 、Mission Point P i+1 Center O i+1 The coordinates of the tangent point T can be obtained i There are two unequal roots T i 1,T i 2. One of the roots is the tangent point T i ; Another useless root is T i ′;

[0065] In order to determine the tangent point T i The special solution of i , through two roots T i 1,T i 2. Do parallel and P i P i+1 The control point C can be obtained i Visited two roots T i 1,T i The distances of the straight line equation of 2 are d1 and d2 respectively, and the maximum value d among d1 and d2 is taken max , whose corresponding root is the tangent point T i Coordinates; Similarly, the tangent point T i+1 coordinate;

[0066] when Center O i 'Unable to find the task point P i Go to mission point P i+1 Route P i P i+1 , we need to change the center O i ′About the task point P i To determine the tangent point T i The special solution of i , solve for the tangent point T i Coordinates, tangent point T i+1 Coordinate method and The method is the same as in;

[0067] when Mission Point P i and mission point P i+1 At the same time, it is located at the center O i ′, that is, the center O i ′ and the center O i+1Coincident, at this time the task point P i Go to mission point P i+1 Route P i P i+1 Only circular routes P i P i+1 , there is no tangent point;

[0068] S424: To prevent the arc route P in step S423 i T i and arc route T i+1 P i+1 is the superior arc, i.e. the arc flight T i+1 P i+1 The arc route is larger than the semicircle, and the arc route is divided into two inferior arc routes, that is, arc routes smaller than the semicircle, to determine the arc route P i T i The midpoint M i and arc route T i+1 P i+1 The midpoint M i+1 The coordinates of

[0069] when At this time, the task point P i Go to mission point P i+1 Route P i P i+1 Only circular routes P i P i+1 , we only need to determine the arc P i T i The midpoint M i ;

[0070] S425: Determine the optimal route, the center O obtained by the above steps i ′、Center O i+1 , tangent point T i , tangent point T i+1 , midpoint M i and midpoint M i+1 The coordinates of the task point P i Go to mission point P i+1 Route P i P i+1 The total distance is only from the center O i+1 Coordinate related. Mission point P i Go to mission point P i+1 Route P i P i+1 The total distance will be along the center O i+1 The coordinates change by changing the task point P i+1 The center of the circle O i+1 The coordinates of the task point P are obtained by changing the value of the parameter θ∈[0,2π).i Go to mission point P i+1 Route P i P i+1 The minimum value of the total distance determines the task point P i Go to mission point P i+1 The best route for

[0071] S426: Center O i+1 The local coordinate system of the circle is translated into i+1 The local coordinate system O′X′Y′ is converted back to the local coordinate system OXY of the multi-task point, and the task point P in the local coordinate system OXY is obtained. i Go to mission point P i+1 The optimal route and mission point P i+1 The center of the circle O i+1 The coordinates of

[0072] S427: Repeat steps S421-S426 to determine the task point P1 to the route P in turn. n Every two adjacent task points P i and P i+1 The best route between .

[0073] Furthermore, the optimal route between every two adjacent mission points is connected, and finally the optimal route of the airship from the take-off point through all mission points back to the landing point is obtained. Figure 4 As shown, the multi-task points obtained by step S1 are P1, P2, P3, and P4, and the optimal flight sequence obtained by step S3 is: P0→P1→P4→P3→P2→P0. Then, the optimal route between two task points P0→P1, P1→P4, P4→P3, P3→P2, and P2→P0 is obtained in sequence by step S4. Figure 4 In the figure, P0 is the take-off point and return landing point of the airship; P1, P2, P3, and P4 are the points of the selected multi-tasks; O0, O1, O2, O3, and O4 are the centers of the arcs where points P0, P1, P2, P3, and P4 are located. Taking the optimal route P1P4 between the two mission points P1→P4 as an example, T1 is the tangent point of the arc route P1T1 and the straight route T1T4; T4 is the tangent point of the arc route T4P4 and the straight route T1T4; M1 is the midpoint of the arc route P1T1; and M4 is the midpoint of the arc route T4P4.

[0074] Although the above describes the illustrative specific embodiments of the present invention to facilitate those skilled in the art to understand the present invention, it should be clear that the present invention is not limited to the scope of the specific embodiments. For those of ordinary skill in the art, as long as various changes are within the spirit and scope of the present invention as defined and determined by the attached claims, these changes are obvious, and all inventions and creations using the concept of the present invention are protected.

Claims

1. A method for airship multi-mission point route planning based on genetic algorithm and greedy strategy, characterized in that: include: S1: Obtain the minimum flight speed and maximum turning slope angle parameter information of the airship and the coordinate information of multiple mission points; S2: Calculate the minimum turning radius of the airship when it passes each mission point based on the obtained parameter information of the minimum flight speed and maximum turning slope angle of the airship; S3: Based on the coordinate information of the multi-mission points, a global search method of an improved genetic algorithm is proposed to obtain the global optimal flight sequence of the airship from the take-off point through all mission points back to the landing point; S4: Based on the global optimal flight sequence, a route planning method based on a greedy strategy is proposed. The greedy strategy is used to decompose the global optimal solution for solving the route planning of the airship with multiple mission points into the local optimal solution for solving the route planning between each two adjacent mission points. The minimum turning radius of the airship is used to obtain the shortest path between each two adjacent mission points in the optimal flight sequence as the optimal route. Then, the optimal route between each two adjacent mission points is connected, and finally the optimal route of the airship from the take-off point through all mission points back to the landing point is obtained. In step S4, a route planning method based on a greedy strategy is proposed, which uses a greedy strategy to decompose the global optimal solution for solving the route planning of multiple mission points of an airship into a local optimal solution for solving the route planning between each two adjacent mission points, which greatly reduces the amount of calculation and improves the calculation efficiency, and includes the following sub-steps: S41: determining the optimal route from the take-off point to the first mission point. The airship takes off from the take-off point in any direction. The optimal route from the take-off point to the first mission point is a straight line from the take-off point to the first mission point. S42: Determine every two adjacent task points between the first task point and the nth task point and The best route between ; S43: Determine the optimal route from the nth mission point to the landing point. For the convenience of calculation, the calculation process of step S43 is the same as that of step S42, which is: according to the optimal flight sequence, the optimal route from the previous two adjacent mission points is determined. To the mission point The optimal route mission point The center of the arc Coordinates, after step S42, get the task point To the mission point The optimal route, and then get the optimal flight sequence for each two adjacent mission points , The optimal route between the two adjacent mission points is connected in sequence. , The optimal route between the take-off point and the landing point is obtained; In step S42, two adjacent task points and The optimal route between the mission points The arc route, the straight route in the middle and the mission point The arc route is located, so the two adjacent mission points are determined and The optimal route between , Center , Tangent and tangent point The step S42 comprises the following sub-steps: S421: Determine the center of the circle The coordinates of the two adjacent mission points in the previous section of the optimal flight sequence To the mission point The optimal route for The center of the arc Coordinates, by judging by the center of the circle , Mission Point and mission points Composed of The size of the task point To the mission point The optimal route mission point The center of the arc coordinate; when Less than 90°, it means the task point is a convex point, at which point the center Coordinates and center Coordinates coincide; when If it is greater than 90°, it means the task point is a concave point, at which point the center Coordinates and center Coordinates about the mission point symmetry; S422: Determine the center of the circle The coordinates of the multi-task point will be obtained in the local coordinate system Translate to the origin and task point The overlapped position gives the center of the circle The local coordinate system , then the task point The center of the circle The coordinates of are expressed using the parametric method, where the parameters ; S423: Determine the cut point and tangent point The coordinates of the task point , Mission Point , the center of the circle obtained in step S421 And the center of the circle obtained by S422 The coordinates of the task point The tangent point of the arc route and the straight route is and mission points The point of tangency between the arc route and the straight route The coordinates of the task point To the mission point The arc route included in the optimal route , Straight line and circular routes ; S424: To prevent the circular route in step S423 and circular routes is the major arc, the major arc is a circular arc The arc route is larger than the semicircle, and the arc route is divided into two inferior arc routes. The inferior arc route is an arc route smaller than the semicircle. midpoint and circular routes midpoint The coordinates of S425: Determine the optimal route, the center of the circle obtained by the above steps , Center , Tangent , Tangent ,midpoint and midpoint The coordinates of the task point To the mission point Route Total distance only to the center of the circle Coordinate related, mission point To the mission point Route The total distance will be along the center of the circle The coordinates change by changing the task point The center of the circle Coordinates, change parameters The value of To the mission point Route The minimum value of the total distance is used to determine the task point To the mission point The best route for S426: Center of circle The local coordinate system of the circle is translated into The local coordinate system Convert back to the local coordinate system to obtain the multi-task point , get the local coordinate system Mission points in To the mission point The best route and mission point The center of the circle The coordinates of S427: Repeat steps S421-S426 to determine the task points in sequence To the line Every two adjacent task points and The best route between .

2. The method for planning airship multi-mission point routes based on genetic algorithm and greedy strategy according to claim 1, characterized in that: In step S3, an improved global search method of genetic algorithm includes the following sub-steps: S31: Set the maximum number of evolutionary generations, crossover probability, and mutation probability; calculate the distance between any two task points; The maximum evolutionary generation represents the number of genetic iterations of the genetic algorithm, the crossover probability represents the probability of crossover mutation between every two adjacent individuals in the population, and the mutation probability represents the probability of mutation of each individual in the population; S32: Initialize the population and randomly generate multiple individuals with the starting point as the take-off point; S33: Selection operation, passing excellent individuals to the next generation, calculating the distance between any two task points in S31, obtaining the total path length of each individual, the fitness value of each individual in the population is the inverse of the total path length, sorting the individuals in the population from large to small according to the fitness value, dividing them into three parts, replicating the individual with the largest fitness value in the front twice, replicating the individual in the middle once, and not replicating the individual with the smallest fitness value in the back, forming a new population to replace the original population; S34: Crossover operation. Every two adjacent individuals in the population have a certain crossover probability. The excellent individuals selected in S33 are paired and crossed to generate new excellent individuals. First, the population is sorted by fitness value. According to single-point crossover, the node sequences of the same length in two adjacent individuals are cross-exchanged. The ones with larger fitness values ​​are cross-exchanged with each other at a single point to improve the convergence accuracy of the algorithm and generate new individuals to replace the source individuals. S35: mutation operation. Each individual in the population has a certain mutation probability. The new individuals generated by the crossover in S34 are mutated to generate new excellent individuals. Specifically, the average fitness value of the population is calculated first. The mutation probability of individuals with fitness values ​​greater than the average fitness value will be multiplied by a randomly generated [0,1] operator to reduce the mutation probability of individuals with larger fitness values. Individuals with fitness values ​​less than the average fitness value will mutate according to the mutation probability set in S31. Then, the individuals are partially mutated. Two task points in the individual sequence are randomly selected, and the positions of the two task points in the individual sequence are exchanged to obtain new excellent individuals through mutation. S36: Repeat steps S33-S35 until the genetic algebra reaches the maximum evolutionary algebra, and output the individual with the maximum fitness in the evolutionary process, that is, output the optimal flight sequence of multiple mission points.