Optimization design method of stealth trajectory of UAV swarm based on A* algorithm

Through the UAV cluster stealth track optimization design method based on the A* algorithm, a multi-threat environment model is built and the track point selection is optimized, which solves the problem of insufficient stealth performance of UAV clusters in the existing technology in the multi-threat environment. It achieves optimal track planning and stealth performance improvement in complex battlefield environments.

CN118500401BActive Publication Date: 2024-11-22NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202410560010.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-05-08
Publication Date
2024-11-22
Estimated Expiration
2044-05-08

AI Technical Summary

Technical Problem

The existing technology has failed to effectively plan the stealth track of the drone cluster in a multi-threatening environment, and has not taken into account the radar scattering cross-section characteristics of the drone itself, resulting in insufficient stealth performance in complex battlefield environments.

Method used

Using the A* algorithm based on the stealth track optimization design method of drone clusters, we build a multivariate threat environment model, and by minimizing the comprehensive cost function of drone clusters as the optimization goal, combining track feasibility judgment and dynamic limitations, we use improvements The A* algorithm solves the optimized model of stealth track planning of the drone cluster, considers the threat of radar, anti-aircraft guns and fixed obstacles, and optimizes the track point selection to improve stealth performance.

Benefits of technology

The optimal stealth track planning of the drone cluster is realized under a multi-threatening environment, which improves the stealth performance of the drone cluster, and the applicable scenarios are more complex, meeting the track feasibility and dynamics limitations, and improving the stealth performance of the cluster. .

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118500401B_ABST
    Figure CN118500401B_ABST
Patent Text Reader

Abstract

The present invention discloses a method for optimizing the stealth trajectory of a drone cluster based on an A* algorithm, including: constructing a multi-threat environment model; taking minimizing the comprehensive cost function of the drone cluster as the optimization goal, and satisfying the trajectory feasibility judgment and the dynamics limit of the drone cluster as the constraint condition, constructing an optimization model for the stealth trajectory planning of the drone cluster; using an improved A* algorithm to solve the optimization model for the stealth trajectory planning of the drone cluster, including: combining the drone RCS, designing a comprehensive cost function for cluster stealth trajectory planning that takes into account the drone range, the probability of networked radar detection, and the probability of anti-aircraft gun threat; and completing the first drone trajectory planning by comparing the comprehensive cost of each possible trajectory point; and then completing the trajectory planning of the entire drone cluster. The method of the present invention is applicable to more complex scenarios, realizes the optimal drone cluster stealth trajectory planning under a multi-threat environment, and effectively improves the stealth performance of the drone cluster.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to radar signal processing technology, and in particular to an optimization design method for the stealth track of a cluster of unmanned aerial vehicles based on an A* algorithm. Background Art

[0002] Compared with traditional single drones, drone swarms composed of multiple drones have stronger penetration and collaborative capabilities, and can perform more complex tasks such as collaborative search, target tracking, encirclement control, cluster confrontation, and coordinated strikes. Drone swarm trajectory planning refers to planning a trajectory that meets certain indicators from the starting point to the end point for the drone swarm under the constraints of drone swarm performance, penetration safety, and threat environment. Drone swarm trajectory planning is the basis for drone swarms to perform various complex tasks, and can effectively improve the performance of drone swarms in performing complex tasks.

[0003] At present, there are many research results on UAV trajectory planning. However, most of the UAV trajectory planning research does not consider the radar cross section (RCS) characteristics of the UAV itself. In addition, most of these studies focus on the trajectory planning of a single UAV, and the environment considered is relatively single, which cannot be fully applied to the actual battlefield environment and has certain limitations. In summary, there is no UAV cluster stealth trajectory planning method in a multi-threat environment in the existing technology. Summary of the invention

[0004] Purpose of the invention: The purpose of the present invention is to provide a method for optimizing the stealth trajectory of a UAV cluster based on the A* algorithm, which is applicable to more complex scenarios, realizes the optimal stealth trajectory planning of a UAV cluster under a multi-threat environment, and effectively improves the stealth performance of the UAV cluster.

[0005] Technical solution: The UAV cluster stealth track optimization design method based on the A* algorithm of the present invention comprises the following steps:

[0006] First, a multi-dimensional threat environment model is constructed;

[0007] Then, the optimization goal is to minimize the comprehensive cost function of the UAV cluster, and the constraints are to meet the trajectory feasibility judgment and the dynamics limit of the UAV cluster, and the unmanned cluster stealth trajectory planning optimization model is constructed.

[0008] Finally, the improved A* algorithm is used to solve the unmanned cluster stealth trajectory planning optimization model, including: the UAV starts from the starting point, first calculates the position of all the next expandable trajectory points of the current trajectory point, calculates the incident angle of the radar transmission wave to the UAV according to the position of the next possible trajectory point, and then obtains the corresponding RCS according to the UAV RCS distribution map; then calculates the network radar detection probability and anti-aircraft gun threat probability when the UAV is located at the next possible trajectory point; finally, calculates the range from the current trajectory point to the next possible trajectory point, and calculates the actual cost of the next possible trajectory point; determines whether the next possible trajectory point is expandable according to the radar detection threshold, anti-aircraft gun threat probability threshold and other constraints, and if it is expandable, calculates the estimation function, and then calculates the comprehensive cost of the next possible trajectory point; and by comparing the comprehensive costs of each possible trajectory point, selects the optimal next trajectory point until reaching the end point, completing the first UAV trajectory planning; continues to plan the trajectory of other UAVs on the premise of satisfying the UAV collision avoidance constraints, and then completes the trajectory planning of the entire UAV cluster.

[0009] Furthermore, multiple threats include radar, anti-aircraft guns, and fixed obstacles.

[0010] Furthermore, the unmanned swarm stealth trajectory planning optimization model is constructed as follows:

[0011]

[0012]

[0013] Among them, U is the number of drones contained in the drone cluster; represents the flight cost of the u-th UAV track, which is evaluated by the UAV flight range; l u,m is the distance of the mth track segment of the uth UAV; is the threat level of the networked radar to the u-th UAV track, which is evaluated by the radar detection probability and of the track point; T u is the flight time of the uth drone; is the probability that the u-th UAV is detected by the networked radar at time t; is the degree of anti-aircraft gun threat to the u-th UAV track, which is evaluated by the probability and probability of anti-aircraft gun threat to the track point; is the probability that the u-th UAV is threatened by anti-aircraft guns at time t; w 1 、w 2 、w 3 are the weights of the three, and w 1 +w 2 +w 3 =1, where w 1 、w 2 、w 3The value range is [0,1]; M u is the number of track segments contained in the flight track of the u-th UAV; L max is the maximum range; is the heading angle between the u-th UAV and the positive direction of the right-hand rectangular coordinate X axis at time t; is the heading angle of the u-th UAV at time t+1; is the maximum turning angle of the u-th UAV; P r is the detection threshold of the network radar; P g is the anti-aircraft gun threat probability threshold; is the spatial position of the u-th UAV at time t; obstacle is the spatial range of the fixed obstacle; s v is a set of drone RCS values ​​sorted by angle, and v is the ordinal number corresponding to different angles; is the spatial position of the jth UAV at time t; d safe For a safe distance.

[0014] Furthermore, the calculation formula for the networked radar detection probability is:

[0015]

[0016] in, is the detection probability of networked radar at time t, is the detection probability of the UAV by the i-th radar at time t, and N is the number of radars in the network.

[0017] Furthermore, the probability of detecting the UAV by the networked radar is less than a certain threshold P r ,Right now When established, it can ensure the safety of drones.

[0018] Furthermore, the formula for calculating the probability of anti-aircraft gun threat is:

[0019]

[0020] in, is the threat probability of the anti-aircraft gun to the UAV at time t, and d is the distance from the UAV to the anti-aircraft gun; d p is the killing distance of anti-aircraft guns; d max It is the maximum effective range of anti-aircraft guns.

[0021] Furthermore, the probability that the anti-aircraft gun poses a threat to the drone is less than a certain threshold value P g ,Right now When established, it can ensure the safety of drones.

[0022] Furthermore, the heuristic function used in the improved A* algorithm is:

[0023] f(k)=g(k)+ωh(k)

[0024] Among them, f(k) is the comprehensive cost function from the starting point to the end point via the track point k; g(k) is the actual cost function from the starting point to the track point k; h(k) is the estimated cost function from the track point k to the end point of the track, represented by the Manhattan distance; ω is the weighting factor;

[0025] The actual cost function of the drone from the starting point to the track point k is expressed as:

[0026]

[0027] in, represents the actual flight distance of the u-th UAV from the starting point to the track point k; M u,k is the number of track segments from the starting point to the track point k of the u-th UAV; T u,k is the time taken by the u-th UAV to travel from the starting point to the track point k; represents the probability and probability of network radar detection for the track from the starting point to track point k; It represents the probability and value of anti-aircraft gun threat on the track from the starting point to the track point k.

[0028] In one embodiment of the present invention, a UAV cluster stealth track optimization design system based on the A* algorithm includes:

[0029] An environment model building unit, used to build a multi-dimensional threat environment model;

[0030] The optimization model building unit is used to build an optimization model for unmanned swarm stealth trajectory planning by minimizing the comprehensive cost function of the UAV swarm as the optimization goal and satisfying the trajectory feasibility determination and the UAV swarm dynamics restrictions as the constraints;

[0031] The optimization model solving unit is used to solve the unmanned cluster stealth track planning optimization model by using the improved A* algorithm, including: the unmanned aerial vehicle starts from the starting point, first calculates the positions of all the next expandable track points of the current track point, calculates the incident angle of the radar transmission wave to the unmanned aerial vehicle according to the position of the next possible track point, and then obtains the corresponding RCS according to the unmanned aerial vehicle RCS distribution map; then calculates the network radar detection probability and anti-aircraft gun threat probability when the unmanned aerial vehicle is located at the next possible track point; finally calculates the range from the current track point to the next possible track point, and calculates the actual cost of the next possible track point; judges whether the next possible track point is expandable according to the radar detection threshold, the anti-aircraft gun threat probability threshold and other constraints, and if it is expandable, calculates the estimation function, and then calculates the comprehensive cost of the next possible track point; and by comparing the comprehensive costs of each possible track point, selects the optimal next track point, and continues this process until the end point, then the optimization ends, and the first unmanned aerial vehicle track planning is completed; continues to plan the track for the second unmanned aerial vehicle under the premise of satisfying the unmanned aerial vehicle collision avoidance constraints, and then completes the track planning for the entire unmanned aerial vehicle cluster.

[0032] In another embodiment of the present invention, an electronic device includes:

[0033] A memory storing executable program code;

[0034] a processor coupled to the memory;

[0035] The processor calls the executable program code stored in the memory to execute the steps of the above-mentioned method for optimizing the stealth trajectory of a drone cluster based on the A* algorithm.

[0036] Beneficial effects: Compared with the prior art, the technical effects of the present invention are as follows: (1) Considering the two-dimensional multi-threat environment scenario, under the constraints of satisfying the track feasibility judgment and the UAV cluster dynamics limitation, the flight heading angle and other parameters of the UAV cluster track are optimized with the minimization of the comprehensive cost function of the UAV cluster as the optimization goal, thereby improving the cluster track stealth performance; (2) The applicable scenarios are more complex, and the optimal UAV cluster stealth track planning in a multi-threat environment is realized, effectively improving the UAV cluster stealth performance. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 is a flow chart of the method of the present invention;

[0038] Figure 2 Flowchart of the method for solving the optimization model using the improved A* algorithm;

[0039] Figure 3 Drones extend the search process;

[0040] Figure 4 Drone RCS distribution;

[0041] Figure 5 UAV swarm flight paths;

[0042] Figure 6 Changes in the track angle of the drone cluster;

[0043] Figure 7 Probability changes of drone cluster tracks;

[0044] Figure 8 Comparison of algorithmic UAV swarm track probabilities. DETAILED DESCRIPTION

[0045] The structure and working process of the present invention are further described below in conjunction with the accompanying drawings and specific embodiments.

[0046] like Figure 1 As shown, a stealth track optimization design method for a drone cluster based on an A* algorithm of the present invention comprises the following steps:

[0047] S1. Construct a multi-threat environment model:

[0048] The present invention takes into account the multi-dimensional threat consisting of radar, anti-aircraft guns and fixed obstacles.

[0049] For a single radar with a common antenna for transmission and reception, the instantaneous detection probability P of the UAV at time t is t It can be written as:

[0050]

[0051] Where s is the radar cross section; d r is the distance between the UAV and the radar; ε 1 , ε 2 It is a parameter determined by the radar performance.

[0052] For a network radar consisting of N radars, its detection probability at time t is It can be written as:

[0053]

[0054] in, is the probability of detecting the UAV by the i-th radar at time t.

[0055] To ensure the safety of the drone at time t, the probability of the networked radar detecting the drone must be less than a certain threshold P r , that is, when the following formula (3) holds, the safety of the drone can be guaranteed.

[0056]

[0057] Threat probability of anti-aircraft guns against drones at time t It can be written as:

[0058]

[0059] Where, d is the distance from the UAV to the anti-aircraft gun; d p is the killing distance of anti-aircraft guns; d max It is the maximum effective range of anti-aircraft guns.

[0060] To ensure the safety of the UAV at time t, the threat probability of the anti-aircraft gun to the UAV must be less than a certain threshold P g , that is, when the following formula (5) holds, the safety of the drone can be guaranteed.

[0061]

[0062] Fixed obstacles are objects that need to be avoided during the trajectory planning of a drone swarm, such as mountains, buildings, no-fly zones, etc. A drone swarm cannot directly pass through fixed obstacles and must fly around them, otherwise it will crash.

[0063] S2. Construct an optimization model for unmanned swarm stealth trajectory planning;

[0064] Taking minimizing the comprehensive cost function of the UAV swarm as the optimization goal and satisfying the trajectory feasibility judgment and the UAV swarm dynamics restrictions as the constraints, an optimization model for stealth trajectory planning of UAV swarms in a multi-threat environment is constructed, as shown in the following formula:

[0065]

[0066] Among them, U is the number of drones contained in the drone cluster; represents the flight cost of the u-th UAV track, which is evaluated by the UAV flight range; l u,m is the distance of the mth track segment of the uth UAV; is the threat level of the networked radar to the u-th UAV track, which is evaluated by the radar detection probability and of the track point; T u is the flight time of the uth drone; is the probability that the u-th UAV is detected by the networked radar at time t; is the degree of anti-aircraft gun threat to the u-th UAV track, which is evaluated by the probability and probability of anti-aircraft gun threat to the track point; is the probability that the u-th UAV is threatened by anti-aircraft guns at time t; w 1 、w 2 、w 3 are the weights of the three, and w 1 +w2 +w 3 =1, where w 1 、w 2 、w 3 The value range is [0,1]; M u is the number of track segments contained in the flight track of the u-th UAV; L max is the maximum range; is the heading angle between the u-th UAV and the positive direction of the right-hand rectangular coordinate X axis at time t; is the heading angle of the u-th UAV at time t+1; is the maximum turning angle of the u-th UAV; P r is the detection threshold of the network radar; P g is the anti-aircraft gun threat probability threshold; is the spatial position of the u-th UAV at time t; obstacle is the spatial range of the fixed obstacle; s v is a set of drone RCS values ​​sorted by angle, and v is the ordinal number corresponding to different angles; is the spatial position of the jth UAV at time t; d safe For a safe distance.

[0067] S3, using the improved A* algorithm to solve the optimization model (6);

[0068] The heuristic function used in the improved A* algorithm is as follows:

[0069] f(k)=g(k)+ωh(k) (7)

[0070] Among them, f(k) is the comprehensive cost function from the starting point to the end point through the track point k; g(k) is the actual cost function from the starting point to the track point k; h(k) is the estimated cost function from the track point k to the end point of the track, represented by the Manhattan distance; ω is the weighting factor.

[0071] The actual cost function of the drone from the starting point to the track point k can be expressed as:

[0072]

[0073] in, represents the actual flight distance of the u-th UAV from the starting point to the track point k; M u,k is the number of track segments from the starting point to the track point k of the u-th UAV; T u,k is the time taken by the u-th UAV to travel from the starting point to the track point k; represents the probability and probability of network radar detection for the track from the starting point to track point k; It represents the probability and value of anti-aircraft gun threat on the track from the starting point to the track point k.

[0074] The flow chart of the method for solving the optimization model using the improved A* algorithm is shown in the attached figure. Figure 2 As shown. The UAV starts from the starting point, and first initializes the OPEN table and the CLOSE table. The initialized OPEN table contains the starting point of the UAV, which must not be an empty set. The current track point is the starting point, and it is moved into the CLOSE table. Calculate the positions of all adjacent track points that can be extended by the current track point. According to the positions of the adjacent track points, the incident angle of the radar transmission wave on the UAV can be calculated, and then the corresponding RCS can be obtained according to the UAV RCS distribution map; then, according to (1), formula (2), and formula (4), the network radar detection probability and anti-aircraft gun threat probability when the UAV is located at the extendable adjacent track point are calculated; finally, the range from the current track point to the extendable adjacent track point is calculated, and according to formula (8), the actual cost of the UAV from the starting point to the extendable adjacent track point can be calculated. According to whether the constraint conditions in formula (6) are met, it is judged whether the extendable adjacent track point is really extendable. If it is not extendable, the adjacent track point that cannot be extended is deleted from all adjacent track points; if it is extendable, the estimation function is calculated, and then the comprehensive cost of the extendable adjacent track point is calculated according to formula (7). All the extendable adjacent track points are loaded into the OPEN table, and it is determined whether the OPEN table is empty. If it is empty, the UAV cluster planning fails. If the OPEN table is not empty, it is further determined whether the end point appears in the OPEN table or the distance between the current track point and the end point is less than the search step length. If it is determined to be yes, the end point is the new track point, and the optimization is completed. After planning the first UAV track, the track planning for the second UAV is continued under the premise of satisfying the UAV collision avoidance constraint, and then the track planning for the entire UAV cluster is completed. If it is determined to be no, the optimal next track point is selected by comparing the comprehensive cost of each possible track point in the OPEN table, and it is moved from the OPEN table to the CLOSE table, and the positions of all adjacent track points that can be extended by the new current track point are calculated, and the actual cost, estimated cost, network radar detection probability and anti-aircraft gun threat probability corresponding to all extendable adjacent track points are calculated, and the adjacent track points that do not satisfy formula (6) are eliminated, and all extendable adjacent track points are loaded into the OPEN table. The above judgment is repeated until the optimization is completed and the next UAV track planning is continued or the UAV cluster planning fails. The drone search expansion process is as follows Figure 3 As shown in the figure, the UAV space search process is a fan-shaped search with a fixed step length. The UAV is at the starting point A. 0 At the point, the next track point can be extended in all directions, and then extended to track point A 1 When , the expansion can be carried out in the fan-shaped area under the premise of satisfying the heading angle of the UAV. The constraint conditions in formula (6) can be used to determine whether the expandable track points in the search area are really expandable, and the adjacent track points that cannot be expanded are eliminated.

[0075] In one embodiment of the present invention, a UAV cluster stealth track optimization design system based on the A* algorithm includes:

[0076] An environment model building unit, used to build a multi-dimensional threat environment model;

[0077] The optimization model building unit is used to build an optimization model for unmanned swarm stealth trajectory planning by minimizing the comprehensive cost function of the UAV swarm as the optimization goal and satisfying the trajectory feasibility determination and the UAV swarm dynamics restrictions as the constraints;

[0078] The optimization model solving unit is used to solve the unmanned cluster stealth track planning optimization model by using the improved A* algorithm, including: the unmanned aerial vehicle starts from the starting point, first calculates the positions of all the next expandable track points of the current track point, calculates the incident angle of the radar transmission wave to the unmanned aerial vehicle according to the position of the next possible track point, and then obtains the corresponding RCS according to the unmanned aerial vehicle RCS distribution map; then calculates the network radar detection probability and anti-aircraft gun threat probability when the unmanned aerial vehicle is located at the next possible track point; finally calculates the range from the current track point to the next possible track point, and calculates the actual cost of the next possible track point; judges whether the next possible track point is expandable according to the radar detection threshold, the anti-aircraft gun threat probability threshold and other constraints, and if it is expandable, calculates the estimation function, and then calculates the comprehensive cost of the next possible track point; and by comparing the comprehensive costs of each possible track point, selects the optimal next track point, and continues this process until the end point, then the optimization ends, and the first unmanned aerial vehicle track planning is completed; continues to plan the track for the second unmanned aerial vehicle under the premise of satisfying the unmanned aerial vehicle collision avoidance constraints, and then completes the track planning for the entire unmanned aerial vehicle cluster.

[0079] In one embodiment of the present invention, an electronic device includes:

[0080] A memory storing executable program code;

[0081] a processor coupled to the memory;

[0082] The processor calls the executable program code stored in the memory to execute the steps of the above-mentioned method for optimizing the stealth trajectory of a drone cluster based on the A* algorithm.

[0083] In one embodiment of the present invention, a computer-readable storage medium stores computer instructions, which, when called, are used to execute the steps of the above-mentioned method for optimizing the stealth trajectory of a drone cluster based on the A* algorithm.

[0084] Simulation results:

[0085] Assume that the drone cluster consists of six drones with the same performance, the flight area is 500km×500km, and the network radar detection probability threshold P r =0.3, the anti-aircraft gun threat probability threshold is P g =0.4. Assuming that the performance of each drone is the same, the speed is constant at 139m / s, and the maximum turning angle does not exceed The search step length is 5 km. For the convenience of calculation, the heading angle of the drone is uniformly defined as the angle between the speed direction of the drone and the positive direction of the X axis, ranging from [0, 2π). The starting and ending points of the drone are shown in Table 1. The RCS distribution of the drone is shown in the attached figure. Figure 4 shown.

[0086] The simulation scene consists of radar, anti-aircraft guns, and fixed obstacles. The radar parameters are shown in Appendix 2. There are two fixed obstacles, and their location ranges are shown in Appendix 3. Set the range weight w 1 =0.01, weight of anti-aircraft gun threat level w 3 =0.1, weight w of the threat level of the networked radar 2 =1-w 1 -w 3 ; The anti-aircraft gun parameter settings are shown in Appendix 4.

[0087] Table 1 UAV start and end point settings

[0088]

[0089] Table 2 Radar start and end point settings

[0090]

[0091] Table 3 Fixed obstacle range

[0092]

[0093]

[0094] Table 4 Parameter settings of anti-aircraft gun in scenario 3

[0095]

[0096] The simulation results of the UAV cluster trajectory are as follows: Figure 5 As shown in Figure 2. During the flight of the drone cluster, the heading angle of each drone changes as shown in Figure 2. Figure 6 As shown in (a) to (f) in the figure, during the flight of the drone cluster, the probability of each drone’s track being detected by the networked radar at each moment changes as shown in Figure 7 As shown. Figure 5 , Figure 6 (a)~(f) Figure 7It can be seen from the results that the proposed method can successfully plan the trajectory of the UAV cluster that meets the dynamic constraints and ensures the safety of the platform, which illustrates the effectiveness of the proposed method.

[0097] In the same scenario, the standard A* method is used as a comparison method to plan the trajectory of the drone cluster, and the algorithm of the present invention is compared with the comparison algorithm. The calculation results of the radar detection probability of the drone cluster trajectory planned by the comparison algorithm are as follows: Figure 8 shown.

[0098] Depend on Figure 8 It can be seen that the comparison algorithm failed to plan the trajectory. This verifies the superiority of the method of the present invention. Temporarily without considering the network radar detection probability threshold, the cluster trajectory range, comprehensive cost and algorithm running time planned by the method of the present invention and the comparison algorithm are compared, and the comparison results are shown in Table 5. It can be seen from the results in Table 5 that the range cost paid by the method of the present invention is slightly higher, but the comprehensive cost is lower, and the running time is shorter. The method of the present invention can successfully plan a trajectory with a lower comprehensive cost and meets the dynamic constraints while ensuring the safety of the cluster platform, which verifies the superiority of the method of the present invention.

[0099] The working principle and working process of the invention are as follows:

[0100] The present invention starts from the actual combat scenario, and considers that in a two-dimensional multi-threat scenario, the drone cluster combines its own radar scattering characteristics to plan the optimal cluster track that meets the platform safety and drone kinetic energy limit. First, for the scenario of drone cluster track planning, a multi-threat environment model composed of radar, anti-aircraft guns, and fixed obstacles that is more in line with the actual battlefield is constructed; then, combined with the drone radar scattering cross-section characteristics (RCS), a cluster stealth track planning comprehensive cost function that considers the drone range, networked radar detection probability, and anti-aircraft gun threat probability is designed; on this basis, with minimizing the drone cluster comprehensive cost function as the optimization goal, and satisfying the track feasibility judgment and drone cluster dynamics restrictions as the constraint conditions, the flight heading angle and other parameters of the drone cluster track are optimized and designed, and a drone cluster stealth track planning optimization model under a multi-threat environment is constructed; finally, the improved A* algorithm is used to solve the above optimization model, and the cluster track is optimized, so as to achieve the purpose of improving the stealth performance of the cluster track. By solving the optimization model, it is obtained that under the constraint conditions of satisfying the track feasibility judgment and drone cluster dynamics restrictions, the drone heading angle is optimized. is the optimal solution of the model.

Claims

1. A stealth trajectory optimization design method for UAV cluster based on A* algorithm, characterized by: The following steps are involved: First, a multi-dimensional threat environment model is constructed; Then, the optimization goal is to minimize the comprehensive cost function of the UAV cluster, and the constraints are to meet the trajectory feasibility judgment and the dynamics limit of the UAV cluster, and the unmanned cluster stealth trajectory planning optimization model is constructed. The constructed unmanned swarm stealth trajectory planning optimization model is: Among them, U is the number of drones contained in the drone cluster; represents the flight cost of the u-th UAV track, which is evaluated by the UAV flight range; l u,m is the distance of the mth track segment of the uth UAV; is the threat level of the networked radar to the u-th UAV track, which is evaluated by the radar detection probability and of the track point; T u is the flight time of the uth drone; is the probability that the u-th UAV is detected by the networked radar at time t; is the degree of anti-aircraft gun threat to the u-th UAV track, which is evaluated by the probability and probability of anti-aircraft gun threat to the track point; is the probability that the u-th UAV is threatened by anti-aircraft guns at time t; w1, w2, w3 are the weights of the three, and w1+w2+w3=1, where the value range of w1, w2, w3 is [0,1]; M u is the number of track segments contained in the flight track of the u-th UAV; L max is the maximum range; is the heading angle between the u-th UAV and the positive direction of the right-hand rectangular coordinate X axis at time t; is the heading angle of the u-th UAV at time t+1; is the maximum turning angle of the u-th UAV; P r is the detection threshold of the network radar; P g is the anti-aircraft gun threat probability threshold; is the spatial position of the u-th UAV at time t; obstacle is the spatial range of the fixed obstacle; s v is a set of drone RCS values ​​sorted by angle, and v is the ordinal number corresponding to different angles; is the spatial position of the jth UAV at time t; d safe For safe distance; Finally, the improved A* algorithm is used to solve the unmanned cluster stealth trajectory planning optimization model, including: the UAV starts from the starting point, first calculates the positions of all the next expandable trajectory points of the current trajectory point, calculates the incident angle of the radar transmission wave to the UAV according to the position of the next possible trajectory point, and then obtains the corresponding RCS according to the UAV RCS distribution map; then calculates the network radar detection probability and anti-aircraft gun threat probability when the UAV is located at the next possible trajectory point; finally, calculates the range from the current trajectory point to the next possible trajectory point, and calculates the actual cost of the next possible trajectory point; judges whether the next possible trajectory point is expandable according to the radar detection threshold, anti-aircraft gun threat probability threshold and constraint conditions, and if it is expandable, calculates the estimation function, and then calculates the comprehensive cost of the next possible trajectory point; and by comparing the comprehensive costs of each possible trajectory point, selects the optimal next trajectory point until reaching the end point, completing the first UAV trajectory planning; continues to plan the trajectory of other UAVs on the premise of satisfying the UAV collision avoidance constraints, and then completes the trajectory planning of the entire UAV cluster.

2. The method for optimizing the stealth trajectory of a UAV cluster based on the A* algorithm according to claim 1 is characterized in that: Multiple threats include radar, anti-aircraft guns and fixed obstacles.

3. The method for optimizing the stealth trajectory of a UAV cluster based on the A* algorithm according to claim 1 is characterized in that: The calculation formula for the detection probability of networked radar is: in, is the detection probability of networked radar at time t, P i t is the detection probability of the UAV by the i-th radar at time t, and N is the number of radars in the network.

4. The method for optimizing the stealth trajectory of a UAV cluster based on the A* algorithm according to claim 3 is characterized in that: The probability of detecting the UAV by the network radar is less than a certain threshold P r ,Right now When established, it can ensure the safety of drones.

5. The method for optimizing the stealth trajectory of a UAV cluster based on the A* algorithm according to claim 1 is characterized in that: The formula for calculating the probability of anti-aircraft gun threat is: in, is the threat probability of the anti-aircraft gun to the UAV at time t, and d is the distance from the UAV to the anti-aircraft gun; d p is the killing distance of anti-aircraft guns; d max It is the maximum effective range of anti-aircraft guns.

6. The method for optimizing the stealth trajectory of a UAV cluster based on the A* algorithm according to claim 5 is characterized in that: The probability of anti-aircraft guns threatening drones is less than a certain threshold value P g ,Right now When established, it can ensure the safety of drones.

7. The method for optimizing the stealth trajectory of a UAV cluster based on the A* algorithm according to claim 1 is characterized in that: The heuristic function used in the improved A* algorithm is: f(k)=g(k)+ωh(k) Among them, f(k) is the comprehensive cost function from the starting point to the end point via the track point k; g(k) is the actual cost function from the starting point to the track point k; h(k) is the estimated cost function from the track point k to the end point of the track, represented by the Manhattan distance; ω is the weighting factor; The actual cost function of the drone from the starting point to the track point k is expressed as: in, represents the actual flight distance of the u-th UAV from the starting point to the track point k; M u,k is the number of track segments from the starting point to the track point k of the u-th UAV; T u,k is the time taken by the u-th UAV to travel from the starting point to the track point k; represents the probability and probability of network radar detection for the track from the starting point to track point k; It represents the probability and value of anti-aircraft gun threat on the track from the starting point to the track point k.

8. The UAV cluster stealth trajectory optimization design system based on A* algorithm is characterized by: include: An environment model building unit, used to build a multi-dimensional threat environment model; The optimization model building unit is used to build an optimization model for unmanned swarm stealth trajectory planning by minimizing the comprehensive cost function of the UAV swarm as the optimization goal and satisfying the trajectory feasibility determination and the UAV swarm dynamics restrictions as the constraints; The constructed unmanned swarm stealth trajectory planning optimization model is: Among them, U is the number of drones contained in the drone cluster; represents the flight cost of the u-th UAV track, which is evaluated by the UAV flight range; l u,m is the distance of the mth track segment of the uth UAV; is the threat level of the networked radar to the u-th UAV track, which is evaluated by the radar detection probability and of the track point; T u is the flight time of the uth drone; is the probability that the u-th UAV is detected by the networked radar at time t; is the degree of anti-aircraft gun threat to the u-th UAV track, which is evaluated by the probability and probability of anti-aircraft gun threat to the track point; is the probability that the u-th UAV is threatened by anti-aircraft guns at time t; w1, w2, w3 are the weights of the three, and w1+w2+w3=1, where the value range of w1, w2, w3 is [0,1]; M u is the number of track segments contained in the flight track of the u-th UAV; L max is the maximum range; is the heading angle between the u-th UAV and the positive direction of the right-hand rectangular coordinate X axis at time t; is the heading angle of the u-th UAV at time t+1; is the maximum turning angle of the u-th UAV; P r is the detection threshold of the network radar; P g is the anti-aircraft gun threat probability threshold; is the spatial position of the u-th UAV at time t; obstacle is the spatial range of the fixed obstacle; s v is a set of drone RCS values ​​sorted by angle, and v is the ordinal number corresponding to different angles; is the spatial position of the jth UAV at time t; d safe For safe distance; The optimization model solving unit is used to solve the unmanned cluster stealth track planning optimization model by using the improved A* algorithm, including: the unmanned aerial vehicle starts from the starting point, first calculates the positions of all the next expandable track points of the current track point, calculates the incident angle of the radar transmission wave to the unmanned aerial vehicle according to the position of the next possible track point, and then obtains the corresponding RCS according to the unmanned aerial vehicle RCS distribution map; then calculates the network radar detection probability and anti-aircraft gun threat probability when the unmanned aerial vehicle is located at the next possible track point; finally calculates the range from the current track point to the next possible track point, and calculates the actual cost of the next possible track point; judges whether the next possible track point is expandable according to the radar detection threshold, the anti-aircraft gun threat probability threshold and other constraints, and if it is expandable, calculates the estimation function, and then calculates the comprehensive cost of the next possible track point; and selects the optimal next track point by comparing the comprehensive costs of each possible track point, and continues this process until the end point, then the optimization ends, and the first unmanned aerial vehicle track planning is completed; and the track planning of the second unmanned aerial vehicle is continued on the premise of satisfying the unmanned aerial vehicle collision avoidance constraint, and then the track planning of the entire unmanned aerial vehicle cluster is completed.

9. An electronic device, characterized in that: The device comprises: A memory storing executable program code; a processor coupled to the memory; The processor calls the executable program code stored in the memory to execute the steps of the drone cluster stealth trajectory optimization design method based on the A* algorithm as described in any one of claims 1-7.

Citation Information

Cited By

  • Bird Strike Prevention System, Apparatus, and Method for Aircraft with Multi-Sensor Fusion and LLM-Based Autonomous Evasion / Repulsion Software

    KR103020852B1