Airborne radar detection method based on simulated annealing algorithm and other devices

Through the simulation annealing algorithm, the airborne radar detection method is optimized, and the system computing power reduction caused by the large amount of traditional computing methods is solved, and more efficient detection area calculation and real-time position adjustment are achieved, which improves detection accuracy and flexibility .

CN118917165APending Publication Date: 2024-11-08TIANJIN 712 COMM & BROADCASTING CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410664067.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-05-27
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

The traditional minimum ball coverage calculation method has a large amount of calculation, which leads to a decrease in the system's computing power and is difficult to meet the requirements of airborne radar detection accuracy. Especially when the target points in the detection area are orders of magnitude, the calculation performance occupies too much.

Method used

The airborne radar detection method based on simulated annealing algorithm is adopted, and the initial spherical center is randomly selected, and the radius of the minimum covering ball and its spherical center coordinates are iteratively calculated by using the simulated annealing algorithm to determine the minimum detection range of the airborne radar.

Benefits of technology

The computational complexity and number of iterations per iteration are optimized, which significantly improves the computing efficiency, can process a large number of point sets faster, and improves the computing power and real-timeness of the detection area.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118917165A_ABST
    Figure CN118917165A_ABST
Patent Text Reader

Abstract

The invention provides an airborne radar detection method based on a simulated annealing algorithm and other devices. The method comprises the following steps: randomly selecting a point in a spatial point set as an initial sphere center; carrying out iterative calculation according to a preset simulated annealing algorithm to obtain the radius of the minimum coverage ball and the center coordinates of the minimum coverage ball, and determining the number of iterations according to the set initial temperature and the algorithm jump-out value by the simulated annealing algorithm; and determining the minimum detection range of the airborne radar according to the radius and the sphere center coordinate. According to the method, the position is adjusted in real time according to the current information, the deployment of the airborne equipment can be more flexible by increasing the calculation efficiency, and the real-time performance of obtaining the target information is high.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of radar detection technology, and in particular, relates to an airborne radar detection method and other devices based on a simulated annealing algorithm. Background Art

[0002] At present, based on the optimization research on the deployment of flight equipment, the minimum detection range composed of all detection targets in the detection area is calculated by using the minimum sphere coverage to maximize the utilization rate of the airborne radar detection distance.

[0003] The traditional calculation of the minimum coverage sphere is based on the three-point circle determination method and the four-point minimum inscribed sphere method. The calculation amount is large and the operation time increases rapidly with the increase of the point set. When the number of target points in the detection area that the flight equipment needs to cover is very large, the traditional calculation method requires a huge amount of computing performance, resulting in a decrease in system computing power, which in turn leads to insufficient detection accuracy of the airborne radar and makes it difficult to meet actual detection needs. Summary of the invention

[0004] In view of this, the present application aims to propose an airborne radar detection method and other devices based on a simulated annealing algorithm to solve the problem that traditional calculation methods require extremely large computing performance, resulting in a decrease in system computing power, which in turn leads to insufficient airborne radar detection accuracy and difficulty in meeting actual detection needs.

[0005] To achieve the above purpose, the technical solution of this application is implemented as follows:

[0006] In a first aspect, the present application provides an airborne radar detection method based on a simulated annealing algorithm, comprising:

[0007] Randomly select a point in the spatial point set as the initial sphere center;

[0008] Iteratively calculating the radius of the minimum covering sphere and the coordinates of the sphere center according to a preset simulated annealing algorithm, wherein the simulated annealing algorithm determines the number of iterations according to a preset initial temperature and an algorithm jump-out value;

[0009] The minimum detection range of the airborne radar is determined according to the radius and the coordinates of the sphere center.

[0010] In the second aspect, based on the same inventive concept, the present application also provides an airborne radar detection device based on a simulated annealing algorithm, comprising:

[0011] A sphere center selection module is configured to randomly select a point in the spatial point set as the initial sphere center;

[0012] An annealing calculation module is configured to iteratively calculate the radius of the minimum covering sphere and the coordinates of the sphere center according to a preset simulated annealing algorithm, wherein the simulated annealing algorithm determines the number of iterations according to a preset initial temperature and an algorithm jump-out value;

[0013] The detection range determination module is configured to determine the minimum detection range of the airborne radar according to the radius and the sphere center coordinates.

[0014] In the third aspect, based on the same inventive concept, the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the airborne radar detection method based on the simulated annealing algorithm as described in the first aspect is implemented.

[0015] In the fourth aspect, based on the same inventive concept, the present application also provides a non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the airborne radar detection method based on the simulated annealing algorithm as described in the first aspect.

[0016] Compared with the prior art, the airborne radar detection method and other devices based on the simulated annealing algorithm described in this application have the following beneficial effects:

[0017] The airborne radar detection method and other devices based on the simulated annealing algorithm described in this application optimize the computational complexity of each iteration. When the number of detection targets in the detection area that the flight equipment needs to cover is large, the computational complexity is increased by an order of magnitude, which is more conducive to calculating the minimum coverage sphere for a larger level of point set. For the optimization of the number of iterations, the computational time is increased by an order of magnitude, and it can also cope with the calculation of more target point sets in the detection area. At the same time, the flight equipment adjusts its position in real time according to the current information. The increase in computational efficiency can make the deployment of the flight equipment more flexible and the real-time acquisition of target information is strong. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] The drawings constituting a part of the present application are used to provide a further understanding of the present application. The illustrative embodiments and descriptions of the present application are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0019] Figure 1 This is a flow chart of the airborne radar detection method based on the simulated annealing algorithm described in an embodiment of the present application;

[0020] Figure 2 This is a flow chart of the simulated annealing algorithm described in the embodiment of the present application;

[0021] Figure 3This is a diagram of the simulation results of the traditional algorithm described in the embodiment of the present application;

[0022] Figure 4 This is a simulation result diagram of the simulated annealing algorithm described in the embodiment of the present application;

[0023] Figure 5 This is a schematic diagram of the structure of an airborne radar detection device based on a simulated annealing algorithm described in an embodiment of the present application;

[0024] Figure 6 A schematic diagram of the hardware structure of the electronic device described in an embodiment of the present application. DETAILED DESCRIPTION

[0025] In order to make the objectives, technical solutions and advantages of the present application more clearly understood, the present application is further described in detail below in combination with specific embodiments and with reference to the accompanying drawings.

[0026] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present application should be the usual meanings understood by people with ordinary skills in the field to which the present application belongs. The "first", "second" and similar words used in the embodiments of the present application do not represent any order, quantity or importance, but are only used to distinguish different components. "Including" or "comprising" and similar words mean that the elements or objects appearing in front of the word cover the elements or objects listed after the word and their equivalents, without excluding other elements or objects. "Connect" or "connected" and similar words are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. "Up", "down", "left", "right" and the like are only used to indicate relative positional relationships. When the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0027] The embodiments of the present application are described in detail below with reference to the accompanying drawings.

[0028] For the optimization of the computational complexity of each iteration, when the number of targets in the detection area that the flight equipment (the flight equipment described in this embodiment can be an early warning aircraft, a drone or other aircraft) needs to cover is very large, the traditional calculation method needs to occupy a large amount of computing performance. Based on this, based on the simulated annealing algorithm and combined with actual practice, an airborne radar detection method based on the simulated annealing algorithm is proposed, and the time advantage of the method of this embodiment is proved through simulation experiments. The practical significance of this embodiment is that in a complex environment, the flight equipment needs to adjust its position in real time according to the current information. The increase in computing efficiency can make the deployment of the flight equipment more flexible, and the real-time acquisition of target information is stronger.

[0029] Before explaining this solution, we first introduce the method for calculating the minimum ball covering the center of a sphere designed in this embodiment and why this method can be implemented using a simulated annealing algorithm. For a point set of N points in space, to find the minimum ball to cover the center of all points, it can be divided into the following steps:

[0030] If N = 1, then the center of the sphere is this point and the radius is infinitesimal;

[0031] If N = 2, the center of the sphere is the midpoint of the two-point line segment, and the radius is half the length of the line segment;

[0032] If N = 3, then the plane formed by the three points must be a great circle of the sphere, the center of the sphere is the circumcenter of the triangle, and the radius is the distance from the circumcenter to the three points;

[0033] If N=4, determine whether the four points are coplanar. If they are coplanar, switch to the case of N==3. If the four points are not coplanar, the tetrahedron can uniquely identify a circumscribed sphere.

[0034] For the case where N>5, the smallest sphere must be the circumscribed sphere of some four points.

[0035] The traditional calculation method is to continuously use the three-point circle determination method and the four-point sphere determination method to calculate until the point with the smallest radius is found. The method described in this embodiment is that when any point is selected as the center of the minimum covering sphere, the distance of the farthest point from it is calculated to be the radius that can cover all points. At this time, the center of the sphere is slowly approached to the farthest point while gradually reducing the approach step. In this way, after repeating the process enough times, the center of the sphere can reach the most accurate position. This repeated process can be calculated using the annealing process of the simulated annealing algorithm. Its core content is:

[0036] Step 1, set the initial temperature T0 to be large enough and calculate the initial solution S;

[0037] Step 2, set the temperature drop index λ (generally between 0.8 and 0.99), and calculate T = λT0;

[0038] Step 3: Solve the current X t Apply random perturbations, generate a new solution Xt+1 in its neighborhood, and calculate the new solution S';

[0039] Step 4: Calculate the increment ΔT = C(S′)-C(S), where C(S) is the evaluation function. If ΔT<0, accept the new solution as the current solution. Otherwise, accept S' as the new current solution with probability exp(-ΔT / T).

[0040] Step 5, repeat step 3 to step 5 L times at the current temperature;

[0041] Step 6: Determine whether the temperature reaches the termination temperature level, if yes, terminate the algorithm, otherwise return to step 2;

[0042] The above algorithm is divided into two steps of alternating calculations. The first step is to randomly perturb the new model and calculate the objective function change. The second step is to decide whether the new model is accepted. Since the algorithm starts at high temperature, the model that increases the objective function value is likely to be accepted, so the local minimum can be discarded. Through slow cooling, the algorithm can converge to the global optimal point.

[0043] When the center of the sphere approaches the farthest point, the new radius calculated by the method described in this embodiment must be smaller than the original solution, that is, ΔT must be greater than 0. Therefore, the step of allowing the simulated annealing algorithm to accept a worse solution with a certain probability can be omitted and optimized, and finally the method described in this embodiment is obtained, as shown in FIG. Figure 1 and Figure 2 As shown, the specific steps include:

[0044] Step S101: randomly select a point in the spatial point set as the initial sphere center.

[0045] Step S102, iteratively calculating the radius of the minimum covering sphere and the coordinates of the sphere center according to a preset simulated annealing algorithm, wherein the simulated annealing algorithm determines the number of iterations according to a preset initial temperature and an algorithm jump-out value.

[0046] In some embodiments, the distances from all remaining points in the point set to the selected initial sphere center are calculated based on the selected initial sphere center, the farthest point from the initial sphere center is searched, and the farthest distance between the two is recorded;

[0047] Move the initial sphere center closer to the farthest point along a straight line at a certain step ratio, and calculate the current temperature value based on the initial temperature value;

[0048] Compare the current temperature value with the algorithm jump value;

[0049] In response to the current temperature value being less than the algorithm jump-out value, the center coordinates and radius of the minimum coverage sphere at this time are output.

[0050] The initial sphere center approaches the farthest point at a preset step ratio. The step ratio formula is:

[0051]

[0052] In the formula, S x,y,z Indicates the three-dimensional coordinate value of the farthest point, C x,y,z Represents the three-dimensional coordinate value of the initial sphere center, R max represents the distance between the farthest point and the initial sphere center, and T represents the initial temperature

[0053] The calculation formula for calculating the current temperature value based on the initial temperature is as follows:

[0054] T = λT0;

[0055] In the formula, T represents the current temperature value, λ represents the temperature drop exponent, and T0 represents the initial temperature value

[0056] In response to the current temperature value being greater than the algorithm jump-out value, continue the annealing iteration calculation until the current temperature value is less than the algorithm jump-out value.

[0057] Specifically, in this embodiment, it specifically includes:

[0058] 1) Randomly select 1 point in the point set N as the center of the sphere;

[0059] 2) Set the initial temperature T0. The setting of the initial temperature T0 determines the number of calculation times of the algorithm. For different magnitudes of the point set N, the value of T0 selected will also change accordingly. The specific corresponding relationship will be described in the subsequent simulation experiment process;

[0060] 3) Calculate the distance D from all other points in the point set to the selected center point of the sphere max , find the point farthest from the selected center point of the sphere, and record the farthest distance R max ;

[0061] 4) Move the selected center of the sphere along a straight line towards the farthest point. Among them, the X coordinate is equal to (X max -X) / R max *T, the Y coordinate is equal to (Y max -Y) / R max *T, and the Z coordinate is equal to (Z max -Z) / R max *T;

[0062] 5) Set the temperature drop exponent λ to 0.99, and recalculate the temperature T = λT0;

[0063] 6) Compare the magnitudes of the temperature T and the algorithm jump-out value eps. Generally, the value of eps is 10 -6 , if T < eps, then proceed to the next step, otherwise go back to step 3;

[0064] 7) Exit the algorithm and return the center of the minimum covering sphere and the radius.

[0065] Step S103: Determine the minimum detection range of the airborne radar according to the radius and the center coordinates of the sphere.

[0066] The method described in this embodiment has the following advantages compared with the traditional method:

[0067] a) Optimization of the calculation complexity of each iteration.

[0068] In the traditional method, each iteration requires first calculating the minimum inscribed sphere of four random points, and then calculating the distances from other points in the point set to the center of the minimum inscribed sphere. This embodiment only needs to calculate the distances from the selected center to the remaining points in the point set in each iteration, which greatly reduces the amount of calculation.

[0069] b) Optimization of the number of iterations.

[0070] The most important optimization is that according to the method provided in this embodiment, the solution calculated in each iteration is a better solution than the previous one, which greatly improves the time complexity of solving the problem using a brute force algorithm in the traditional method.

[0071] The airborne radar detection method based on the simulated annealing algorithm described in this embodiment optimizes the computational complexity of each iteration. When the number of targets in the detection area that the flight equipment needs to cover is very large, the computational complexity is improved by an order of magnitude, which is more conducive to calculating the minimum coverage sphere for a larger level of point sets. The optimization of the number of iterations improves the computational time by an order of magnitude, and can also cope with the calculation of more detection target point sets. At the same time, the flight equipment adjusts its position in real time according to the current information. The increase in computing efficiency can make the deployment of the flight equipment more flexible and the real-time acquisition of target information is strong.

[0072] When this scheme is implemented specifically, this embodiment uses Matlab to simulate the two algorithms respectively. The program implements the input to generate a random number of discrete points and the coordinate range of the points to calculate the minimum sphere coverage. At the same time, the time difference of the main part of the program algorithm is calculated, and finally the discrete points and the formed minimum coverage circle are drawn.

[0073] First, 20 random discrete points are simulated. The traditional algorithm is to continuously calculate the minimum inscribed sphere of 4 points. The algorithm of this embodiment first selects a random point C in combination with the first step of the algorithm. In the second step, the initial temperature value T is set to 100. In the third step, the distance from all other points to point C is calculated to find the farthest point S. In the fourth step, point C is moved closer to point S. The step calculation method is: Where R max The value of is the distance between points C and S. Repeat the above steps until T is less than the set eps value. The simulation results show that the time and effect of the two are as follows: Figure 3 , 4 shown.

[0074] From the above two figures, we can see that this paper combines the simulated annealing algorithm to calculate the minimum covering ball, which has a multiple improvement in time. Then, through several groups of experiments on different random points in different ranges, we compare the time of calculating the minimum ball by the traditional minimum ball covering calculation method and the time of calculating the minimum ball by the simulated annealing algorithm. The comparison results are shown in Table 1:

[0075] Table 1. Time comparison of two algorithms

[0076]

[0077] As can be seen from Table 1, the calculation of the minimum covering sphere based on the simulated annealing algorithm in this embodiment is improved by 79% to 84% at various range levels of 20 spatial points, 40 spatial points and 100 spatial points compared to the traditional calculation method, and as the number of spatial points increases, the advantage of the algorithm becomes more obvious.

[0078] It should be noted that the above describes some embodiments of the present application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the above embodiments and still achieve the desired results. In addition, the processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0079] Based on the same inventive concept, corresponding to any of the above-mentioned embodiments and methods, an embodiment of the present application further provides an airborne radar detection device based on a simulated annealing algorithm.

[0080] like Figure 5 As shown, the airborne radar detection device based on the simulated annealing algorithm includes:

[0081] A sphere center selection module 11 is configured to randomly select a point in the spatial point set as an initial sphere center;

[0082] The annealing calculation module 12 is configured to iteratively calculate the radius of the minimum covering sphere and the coordinates of the sphere center according to a preset simulated annealing algorithm, wherein the simulated annealing algorithm determines the number of iterations according to a preset initial temperature and an algorithm jump-out value;

[0083] The detection range determination module 13 is configured to determine the minimum detection range of the airborne radar according to the radius and the sphere center coordinates.

[0084] For the convenience of description, the above devices are described in terms of functions and are divided into various modules. Of course, when implementing the embodiments of the present application, the functions of each module can be implemented in the same or multiple software and / or hardware.

[0085] The device of the above embodiment is used to implement the corresponding airborne radar detection method based on simulated annealing algorithm in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0086] Based on the same inventive concept, corresponding to any of the above-mentioned embodiments and methods, an embodiment of the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the airborne radar detection method based on the simulated annealing algorithm as described in any of the above embodiments is implemented.

[0087] Figure 6 A more specific schematic diagram of the hardware structure of an electronic device provided in this embodiment is shown, and the device may include: a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040 are connected to each other through the bus 1050 in the device.

[0088] The processor 1010 can be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0089] The memory 1020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 may store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program codes are stored in the memory 1020 and are called and executed by the processor 1010.

[0090] The input / output interface 1030 is used to connect the input / output module to realize information input and output. The input / output module can be configured in the device as a component (not shown in the figure), or it can be externally connected to the device to provide corresponding functions. The input device may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output device may include a display, a speaker, a vibrator, an indicator light, etc.

[0091] The communication interface 1040 is used to connect a communication module (not shown) to realize communication interaction between the device and other devices. The communication module can realize communication through a wired mode (such as USB, network cable, etc.) or a wireless mode (such as mobile network, WIFI, Bluetooth, etc.).

[0092] The bus 1050 includes a path that transmits information between the various components of the device (eg, the processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040).

[0093] It should be noted that, although the above device only shows the processor 1010, the memory 1020, the input / output interface 1030, the communication interface 1040 and the bus 1050, in the specific implementation process, the device may also include other components necessary for normal operation. In addition, it can be understood by those skilled in the art that the above device may also only include the components necessary for implementing the embodiments of the present specification, and does not necessarily include all the components shown in the figure.

[0094] The electronic device of the above embodiment is used to implement the corresponding airborne radar detection method based on simulated annealing algorithm in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0095] Based on the same inventive concept, corresponding to any of the above-mentioned embodiment methods, the present application also provides a non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the airborne radar detection method based on the simulated annealing algorithm as described in any of the above embodiments.

[0096] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, read-only compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, tape disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device.

[0097] The computer instructions stored in the storage medium of the above embodiment are used to enable the computer to execute the airborne radar detection method based on the simulated annealing algorithm as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0098] Those skilled in the art should understand that the discussion of any of the above embodiments is merely illustrative and is not intended to imply that the scope of the present application (including the claims) is limited to these examples. In line with the concept of the present application, the technical features in the above embodiments or different embodiments may be combined, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present application as described above, which are not provided in detail for the sake of simplicity.

[0099] In addition, to simplify the description and discussion, and in order not to make the embodiments of the present application difficult to understand, the known power supply / ground connection with the integrated circuit (IC) chip and other components may or may not be shown in the provided drawings. In addition, the device can be shown in the form of a block diagram to avoid making the embodiments of the present application difficult to understand, and this also takes into account the fact that the details of the implementation of these block diagram devices are highly dependent on the platform to be implemented in the embodiments of the present application (that is, these details should be fully within the scope of understanding of those skilled in the art). In the case of elaborating specific details (e.g., circuits) to describe exemplary embodiments of the present application, it is obvious to those skilled in the art that the embodiments of the present application can be implemented without these specific details or when these specific details are changed. Therefore, these descriptions should be considered to be illustrative rather than restrictive.

[0100] Although the present application has been described in conjunction with specific embodiments of the present application, many replacements, modifications and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.

[0101] The embodiments of the present application are intended to cover all such substitutions, modifications and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiments of the present application should be included in the scope of protection of the present application.

Claims

1. An airborne radar detection method based on simulated annealing algorithm, characterized in that: include: Randomly select a point in the spatial point set as the initial sphere center; Iteratively calculating the radius of the minimum covering sphere and the coordinates of the sphere center according to a preset simulated annealing algorithm, wherein the simulated annealing algorithm determines the number of iterations according to a preset initial temperature and an algorithm jump-out value; The minimum detection range of the airborne radar is determined according to the radius and the coordinates of the sphere center.

2. The airborne radar detection method based on simulated annealing algorithm according to claim 1, characterized in that: The simulated annealing algorithm includes: Calculate the distances from all remaining points in the point set to the selected initial sphere center point according to the selected initial sphere center point, search for the farthest point from the initial sphere center point, and record the farthest distance between the two; Move the initial sphere center closer to the farthest point along a straight line, and calculate the current temperature value according to the initial temperature value; Compare the current temperature value with the algorithm jump-out value; In response to the current temperature value being less than the algorithm jump-out value, the center coordinates and radius of the minimum coverage sphere at this time are output.

3. The airborne radar detection method based on simulated annealing algorithm according to claim 2 is characterized in that: The initial sphere center approaches the farthest point at a preset step ratio, and the step ratio formula is: In the formula, S x,y,z Indicates the three-dimensional coordinate value of the farthest point, C x,y,z Represents the three-dimensional coordinate value of the initial sphere center, R max represents the distance between the farthest point and the initial sphere center, and T represents the initial temperature.

4. The airborne radar detection method based on simulated annealing algorithm according to claim 2, characterized in that: The calculation formula for calculating the current temperature value based on the initial temperature is: T = λT0; Where T represents the current temperature value, λ represents the temperature drop index, and T0 represents the initial temperature value.

5. The airborne radar detection method based on simulated annealing algorithm according to claim 2, characterized in that: In response to the current temperature value being greater than the algorithm exit value, the annealing iterative calculation is continued until the current temperature value is less than the algorithm exit value.

6. An airborne radar detection device based on simulated annealing algorithm, characterized in that: include: A sphere center selection module is configured to randomly select a point in the spatial point set as the initial sphere center; An annealing calculation module is configured to iteratively calculate the radius of the minimum covering sphere and the coordinates of the sphere center according to a preset simulated annealing algorithm, wherein the simulated annealing algorithm determines the number of iterations according to a preset initial temperature and an algorithm jump-out value; The detection range determination module is configured to determine the minimum detection range of the airborne radar according to the radius and the sphere center coordinates.

7. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the airborne radar detection method based on the simulated annealing algorithm described in any one of claims 1 to 5 is implemented.

8. A non-transitory computer-readable storage medium, characterized in that: in, The non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the airborne radar detection method based on the simulated annealing algorithm as described in any one of claims 1-5.