High-directional antenna deployment methods and systems

By constructing a scanning detection area model and a metaheuristic algorithm, and combining the satellite's stationary and moving states to optimize the deployment of highly directional antennas, the problem of insufficient adaptability of highly directional antennas in multiple scenarios is solved, and an efficient antenna deployment scheme is achieved.

CN123122628APending Publication Date: 2026-11-17SHENZHEN ZHENGDA XINWEI COMM EQUIP CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611281620.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-08-22
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing technologies for highly directional antennas lack adaptability to various scenarios and are difficult to deploy effectively in complex environments.

Method used

A scanning detection area model is constructed, and a high-directional antenna deployment optimization model is built based on different satellite motion states. A metaheuristic algorithm is used to solve the model, and the deployment results of the high-directional antenna are optimized by combining the static and dynamic states of the satellite.

Benefits of technology

It improves the adaptability of highly directional antennas in complex scenarios, enables efficient antenna deployment, and meets the needs of various scenarios.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure REF-OBJ-1787311804305-000015
    Figure REF-OBJ-1787311804305-000015
  • Figure REF-OBJ-1787311804305-000016
    Figure REF-OBJ-1787311804305-000016
  • Figure REF-OBJ-1787311804305-000022
    Figure REF-OBJ-1787311804305-000022
Patent Text Reader

Abstract

This application relates to the field of antenna technology, specifically disclosing a method and system for deploying highly directional antennas. The method and system provided by this invention construct different optimization models for deploying highly directional antennas based on different satellite motion states and scanning detection area models, and further integrate the different optimization models to confirm the deployment results of the highly directional antennas. This enables the deployment of highly directional antennas to be completed in more complex scenarios and with more demanding requirements.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of antennas, and more particularly to methods for deploying highly directional antennas. Background Technology

[0002] In existing technologies, a system consisting of a Global Navigation Satellite System (GNSS), high-directional antennas, and corresponding signal processing devices can be used to monitor specific moving targets. During the monitoring of moving targets, it is necessary to cross the boundaries between different high-directional antennas. Therefore, improving the multi-scenario adaptability of high-directional antennas has become an increasingly important task. Summary of the Invention

[0003] The purpose of this application is to provide a method for deploying highly directional antennas to improve the adaptability of highly directional antennas in multiple scenarios.

[0004] This application provides a method for deploying a highly directional antenna, including: Construct a scanning detection area model; Based on the scanning detection area model and the first state of the satellite, a first high-directional antenna deployment optimization model is constructed. A second high-directional antenna deployment optimization model is constructed based on the scanning detection area model and the second state of the satellite. The high-directional antenna deployment result is determined based on the first high-directional antenna deployment optimization model and the second high-directional antenna deployment optimization model; The first state of the satellite and the second state of the satellite are different motion states.

[0005] In some embodiments, constructing a first high-directional antenna deployment optimization model based on the scan detection area model and the first state of the satellite includes: Taking the first state of the satellite as a stationary state, the first boundary of the scanning detection area corresponding to each of the highly directional antennas is determined according to the scanning detection area model; The coverage rate of the first detection area is determined based on the boundary of the scanning detection area corresponding to each of the high-directional antennas and the range of the area to be detected. Using the number of highly directional antennas and their corresponding location set as decision variables, the coverage rate of the first detection area not less than a given threshold as a constraint, and minimizing the number of highly directional antennas as the optimization objective, a first highly directional antenna deployment optimization model is constructed.

[0006] In some embodiments, a second high-directional antenna deployment optimization model is constructed based on the scan detection area model and the second state of the satellite, including: Taking the second state of the satellite as the motion state, the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each moment is determined according to the scanning detection area model; The minimum instantaneous coverage rate and the average time coverage rate are determined based on the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each time moment; The switching cost of the high-directional antenna is determined based on the time-varying pairing relationship between the high-directional antenna and the satellite; Using the number of high-directional antennas, their corresponding location sets, and the time-varying pairing relationship between the high-directional antennas and the satellite as decision variables, and the average time coverage rate and minimum instantaneous coverage rate as constraints, the optimization objective is to minimize the sum of the weighted deployment scale and the switching cost. A second high-directional antenna deployment optimization model is then constructed.

[0007] In some embodiments, the high-directional antenna deployment result is solved using a metaheuristic algorithm, the solution steps of which include: Step S1: Perform random addition of high-directional antennas, removal of close-range high-directional antennas, and fine-tuning of the positions of high-directional antennas into the candidate high-directional antenna set to obtain the initial population; Step S2: Calculate the first fitness and second fitness of each individual in the initial population; wherein the first fitness corresponds to the objective function of the first high-directional antenna deployment optimization model, and the second fitness corresponds to the objective function of the second high-directional antenna deployment optimization model; based on the first fitness and the second fitness, select the optimal individual from the current population and record it as the global optimal solution; Step S3: Update the loop iteration count. If the current iteration count has reached the maximum iteration count, terminate the algorithm and output the current global optimal solution. If the current iteration count is less than the maximum iteration count, calculate the mode transition parameter and compare the mode transition parameter with a preset first threshold. If the mode transition parameter is less than or equal to the preset first threshold, perform a local search operation. If the mode transition parameter is greater than the preset first threshold, proceed to step S4. Step S4: Generate a random number and preset a second threshold and a third threshold, wherein the second threshold is less than the third threshold; based on the value of the random number, select one of the following three methods to update the current individual; If the random number is less than the second threshold, copy the global optimal solution as a temporary solution, then replace some of the high-directional antennas in the temporary solution with the high-directional antennas in the current individual, or replace them with the high-directional antennas in other random individuals, and randomly add or delete a small number of high-directional antennas, using the temporary solution as the updated current individual; If the random number is between the second threshold and the third threshold, the current individual is copied as a temporary solution. A portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution. High-directional antennas are then extracted from other randomly selected individuals and attempted to be added. If the high-directional antenna to be added already exists in the temporary solution, it is deleted, and the temporary solution is used as the updated current individual. If the random number is greater than or equal to the third threshold, the current individual is copied as a temporary solution, and only a portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution, and the temporary solution is used as the updated current individual; Step S5: If the fitness of the updated current individual is better than the global optimum, then update the global optimum to the current individual; then increment the iteration counter by 1 and return to step S2 until the maximum number of iterations is reached.

[0008] In some embodiments, the method further includes the following steps prior to step S5: Step S6: Check the current individual updated in step S6: If there are redundant highly directional antennas that do not violate the coverage constraint after deletion, remove them to simplify the current individual.

[0009] In some embodiments, step S6 is followed by: Step S7: Check whether the coverage of the current global optimal solution meets the preset target threshold: if it does, no operation is required; if it does not, add high directional antennas one by one from the candidate high directional antenna set to the global optimal solution until the coverage requirement is met.

[0010] This invention also provides a highly directional antenna deployment system, the system comprising: The scanning detection area model building module is used to build the scanning detection area model; The first high-directional antenna deployment optimization model construction module is used to construct the first high-directional antenna deployment optimization model based on the scanning detection area model and the first state of the satellite. The second high-directional antenna deployment optimization model construction module is used to construct a second high-directional antenna deployment optimization model based on the scanning detection area model and the second state of the satellite. The determining module is used to determine the high-directional antenna deployment result based on the first high-directional antenna deployment optimization model and the second high-directional antenna deployment optimization model; The first state of the satellite and the second state of the satellite are different motion states.

[0011] The high-directional antenna deployment method and system provided by this invention constructs different high-directional antenna deployment optimization models based on different satellite motion states and scanning detection area models, and further integrates different high-directional antenna deployment optimization models to confirm the high-directional antenna deployment results, enabling the high-directional antenna deployment work to be completed in more complex scenarios and with more demanding requirements. Attached Figure Description

[0012] Other objects and results of the invention will become more apparent and readily understood by referring to the following description taken in conjunction with the accompanying drawings, and with a more complete understanding of the invention. In the drawings: Figure 1 This is a flowchart illustrating the highly directional antenna deployment method according to an embodiment of the present invention; Figure 2 This is a schematic diagram of the modules of a highly directional antenna deployment system according to an embodiment of the present invention. Detailed Implementation

[0013] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0014] Reference Figure 1 The diagram shown is a flowchart illustrating a highly directional antenna deployment method according to an embodiment of the present invention. In this embodiment, a highly directional antenna deployment method includes: Construct a scanning detection area model; Specifically, the system uses a three-dimensional Cartesian coordinate system to describe the spatial relationship between the satellite, the ground-based high-directional antenna, and the target. Position is determined by coordinates Confirmed, high directional antenna Location is The length of the baseline between the two is Its spatial orientation is determined by the azimuth angle. (baseline horizontal projection and) (angle between axes) and angle of elevation (The angle of inclination of the baseline relative to the horizontal plane) are used to describe this.

[0015] The target is located Its height is recorded as The horizontal projection from the origin to the target is denoted as The surveillance boundary is set at... In-plane. Three-dimensional scan set of a highly directional antenna and The intersection of the planes forms the scanning detection area of ​​the highly directional antenna.

[0016] The equation set (1) characterizing the scanning detection region of the highly directional antenna is shown below:

[0017]

[0018] in, This represents the distance vector from the highly directional antenna to the target. For high signal-to-noise ratio antennas, This is the proportional adjustment coefficient, which is generally taken as 0.5-0.8.

[0019] The establishment of a scanning detection area model enables a more accurate representation of the scanning detection area range, thereby improving the accuracy of detection area coverage assessment.

[0020] Based on the scanning detection area model and the first state of the satellite, a first high-directional antenna deployment optimization model is constructed. Specifically, the first state of the satellite is a stationary state, which can be instantaneous; the first boundary of the scanning detection area corresponding to each of the highly directional antennas is determined according to the scanning detection area model.

[0021] The coverage rate of the first detection area is determined based on the boundary of the scanning detection area corresponding to each of the high-directional antennas and the range of the area to be detected. Specifically, the total area of ​​the union of the scanning detection areas of each high-directional antenna can be calculated based on the boundary of the scanning detection area corresponding to each high-directional antenna. Then, by dividing by the area of ​​the detection region, the coverage rate of the first detection area can be obtained.

[0022] Using the number of highly directional antennas and their corresponding location sets as decision variables, the coverage rate of the first detection area being no less than a given threshold as a constraint, and minimizing the number of highly directional antennas as the optimization objective, a first highly directional antenna deployment optimization model is constructed; wherein... The system of equations (1) can be determined.

[0023] In some embodiments, a second high-directional antenna deployment optimization model is constructed based on the scanning detection area model and the second state of the satellite; Specifically, the second state of the satellite is a continuous motion state. In order to ensure that the detection coverage rate is consistently higher than the set threshold, and at the same time to give full play to the ability of the high directional antenna to dynamically switch paired satellites and adapt to the dynamic changes in the coverage area, the optimization solution needs to collaboratively determine the deployment position of the high directional antenna and the satellite pairing scheme that evolves over time.

[0024] Taking the second state of the satellite as the motion state, the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each moment is determined according to the scanning detection area model; The minimum instantaneous coverage rate and the average time coverage rate are determined based on the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each time moment; The switching cost of the high-directional antenna is determined based on the time-varying pairing relationship between the high-directional antenna and the satellite; Using the number of high-directional antennas, their corresponding location sets, and the time-varying pairing relationship between the high-directional antennas and the satellite as decision variables, and the average time coverage rate and minimum instantaneous coverage rate as constraints, the optimization objective is to minimize the sum of the weighted deployment scale and the switching cost. A second high-directional antenna deployment optimization model is then constructed.

[0025] The high-directional antenna deployment result is determined based on the first high-directional antenna deployment optimization model and the second high-directional antenna deployment optimization model; wherein the first state of the satellite and the second state of the satellite are different motion states.

[0026] This invention builds and solves optimization models by using two different satellite operating modes (instantaneous stationary state and continuous motion state). Relying on the first and second high-directional antenna deployment optimization models, it makes up for the lack of adaptability of traditional single models and can complete the deployment of high-directional antennas in more complex scenarios and with more demanding requirements.

[0027] Specifically, the deployment results of the highly directional antennas are obtained through a metaheuristic algorithm; The solution steps include: Step S1: Perform random addition of high-directional antennas, removal of close-range high-directional antennas, and fine-tuning of the positions of high-directional antennas into the candidate high-directional antenna set to obtain the initial population; Step S2: Calculate the first fitness and second fitness of each individual in the initial population; wherein the first fitness corresponds to the objective function of the first high-directional antenna deployment optimization model, and the second fitness corresponds to the objective function of the second high-directional antenna deployment optimization model; based on the first fitness and the second fitness, select the optimal individual from the current population and record it as the global optimal solution; Step S3: Update the loop iteration count. If the current iteration count has reached the maximum iteration count, terminate the algorithm and output the current global optimal solution. If the current iteration count is less than the maximum iteration count, calculate the mode transition parameter and compare the mode transition parameter with a preset first threshold. If the mode transition parameter is less than or equal to the preset first threshold, perform a local search operation. If the mode transition parameter is greater than the preset first threshold, proceed to step S4. The mode conversion parameters can be determined based on the normalized iteration progress; specifically, they can be obtained by performing an arctangent calculation on the normalized iteration progress.

[0028] By introducing mode transition parameters, the algorithm can autonomously adapt to different stages of iteration without human intervention.

[0029] Specifically, the preset first threshold can be 1. If the mode conversion parameter is less than or equal to the preset first threshold 1, the algorithm enters the local search phase, performs foraging and predator avoidance behaviors inherited from the original ALA, and conducts fine local mining around the current optimal solution. If the mode conversion parameter is greater than the preset first threshold 1, the algorithm enters the global exploration phase and proceeds to step S4 to perform exploration behavior.

[0030] Step S4: Generate a random number and preset a second threshold and a third threshold, wherein the second threshold is less than the third threshold; based on the value of the random number, select one of the following three methods to update the current individual; If the random number is less than the second threshold, copy the global optimal solution as a temporary solution, then replace some of the high-directional antennas in the temporary solution with the high-directional antennas in the current individual, or replace them with the high-directional antennas in other random individuals, and randomly add or delete a small number of high-directional antennas, using the temporary solution as the updated current individual; Specifically, the random number can be a constant between 0 and 1. If the random number is less than the second threshold, the global optimal solution is copied as a temporary solution. Then, some of the high-directional antennas in the temporary solution are replaced with high-directional antennas in the current individual, or replaced with high-directional antennas in other random individuals. A small number of high-directional antennas are randomly added or deleted. The temporary solution is used as the updated current individual. Through this operation, fragments of other high-quality individuals can be introduced while inheriting the core features of the optimal solution, thus expanding the search breadth.

[0031] If the random number is between the second threshold and the third threshold, the current individual is copied as a temporary solution. A portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution. High-directional antennas are then extracted from other randomly selected individuals and attempted to be added. If the high-directional antenna to be added already exists in the temporary solution, it is deleted, and the temporary solution is used as the updated current individual. Specifically, if the random number is between the second threshold and the third threshold, the current individual is copied as a temporary solution, and some high-directional antennas are extracted from the global optimal solution and added to the temporary solution. Then, high-directional antennas are extracted from other randomly selected individuals and tried to be added. If the high-directional antenna to be added already exists in the temporary solution, it is deleted, and the temporary solution is used as the updated current individual. Through this operation, the continuity of the current solution structure and the diversity of the population can be balanced, while injecting high-quality features of the optimal solution.

[0032] If the random number is greater than or equal to the third threshold, the current individual is copied as a temporary solution, and only a portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution, and the temporary solution is used as the updated current individual; Specifically, if the random number is greater than or equal to the third threshold, the current individual is copied as a temporary solution, and only a portion of the highly directional antennas are extracted from the global optimal solution and added to this temporary solution. This temporary solution is then used as the updated current individual. This operation provides a conservative exploration method that moderately introduces new elements while maintaining structural stability.

[0033] Step S5: If the fitness of the updated current individual is better than the global optimum, then update the global optimum to the current individual. Then increment the iteration counter by 1 and return to step S2, until the maximum number of iterations is reached.

[0034] By integrating the characteristics of the global optimal solution and the diversity of the population, a high-efficiency and high-quality solution model can be obtained to complete the deployment scheme of highly directional antennas.

[0035] In some embodiments, the method further includes the following steps prior to step S5: Step S6: Check the current individual updated in step S6: If there are redundant highly directional antennas that do not violate the coverage constraint after deletion, remove them to simplify the current individual.

[0036] This mechanism can streamline deployment schemes without breaking coverage constraints.

[0037] In some embodiments, step S6 is followed by: Step S7: Check whether the coverage of the current global optimal solution meets the preset target threshold: if it does, no operation is required; if it does not, add high directional antennas one by one from the candidate high directional antenna set to the global optimal solution until the coverage requirement is met.

[0038] This mechanism can meet the engineering requirements for balancing output results and solution speed.

[0039] The high-directional antenna deployment method provided by this invention constructs different high-directional antenna deployment optimization models based on different satellite motion states and scanning detection area models, and further integrates different high-directional antenna deployment optimization models to confirm the high-directional antenna deployment results. This method can complete the high-directional antenna deployment work under more complex scenarios and requirements.

[0040] like Figure 2 The diagram shown is a schematic diagram of the high directional antenna deployment system of the present invention.

[0041] The high directional antenna deployment system 100 of the present invention may include a scanning detection area model construction module 101, a first high directional antenna deployment optimization model construction module 102, a second high directional antenna deployment optimization model construction module 103, and a determination module 104.

[0042] In this embodiment, the functions of each module / unit are as follows: The scanning detection area model construction module 101 is used to construct the scanning detection area model; The first high-directional antenna deployment optimization model construction module 102 is used to construct a first high-directional antenna deployment optimization model based on the scanning detection area model and the first state of the satellite. The second high-directional antenna deployment optimization model construction module 103 is used to construct a second high-directional antenna deployment optimization model based on the scanning detection area model and the second state of the satellite. The determining module 104 is used to determine the high-directional antenna deployment result based on the first high-directional antenna deployment optimization model and the second high-directional antenna deployment optimization model; wherein the first satellite state and the second satellite state are assumed to be different motion states.

[0043] The high-directional antenna deployment system provided by this invention constructs different high-directional antenna deployment optimization models based on different satellite motion states and scanning detection area models, and further integrates different high-directional antenna deployment optimization models to confirm the high-directional antenna deployment results. This enables the high-directional antenna deployment work to be completed in more complex scenarios and with more demanding requirements.

[0044] Based on the scanning detection area model and the first state of the satellite, a first high-directional antenna deployment optimization model is constructed. Specifically, the first state of the satellite is a stationary state, which can be instantaneous; the first boundary of the scanning detection area corresponding to each of the highly directional antennas is determined according to the scanning detection area model.

[0045] The coverage rate of the first detection area is determined based on the boundary of the scanning detection area corresponding to each of the high-directional antennas and the range of the area to be detected. Specifically, the total area of ​​the union of the scanning detection areas of each high-directional antenna can be calculated based on the boundary of the scanning detection area corresponding to each high-directional antenna. Then, by dividing by the area of ​​the detection region, the coverage rate of the first detection area can be obtained.

[0046] Using the number of highly directional antennas and their corresponding location sets as decision variables, the coverage rate of the first detection area being no less than a given threshold as a constraint, and minimizing the number of highly directional antennas as the optimization objective, a first highly directional antenna deployment optimization model is constructed; wherein... The system of equations (1) can be determined.

[0047] In some embodiments, a second high-directional antenna deployment optimization model is constructed based on the scanning detection area model and the second state of the satellite; Specifically, the second state of the satellite is a continuous motion state. In order to ensure that the detection coverage rate is consistently higher than the set threshold, and at the same time to give full play to the ability of the high directional antenna to dynamically switch paired satellites and adapt to the dynamic changes in the coverage area, the optimization solution needs to collaboratively determine the deployment position of the high directional antenna and the satellite pairing scheme that evolves over time.

[0048] Taking the second state of the satellite as the motion state, the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each moment is determined according to the scanning detection area model; The minimum instantaneous coverage rate and the average time coverage rate are determined based on the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each time moment; The switching cost of the high-directional antenna is determined based on the time-varying pairing relationship between the high-directional antenna and the satellite; Using the number of high-directional antennas, their corresponding location sets, and the time-varying pairing relationship between the high-directional antennas and the satellite as decision variables, and the average time coverage rate and minimum instantaneous coverage rate as constraints, the optimization objective is to minimize the sum of the weighted deployment scale and the switching cost. A second high-directional antenna deployment optimization model is then constructed.

[0049] Specifically, the deployment results of the highly directional antennas are obtained through a metaheuristic algorithm; The solution steps include: Step S1: Perform random addition of high-directional antennas, removal of close-range high-directional antennas, and fine-tuning of the positions of high-directional antennas into the candidate high-directional antenna set to obtain the initial population; Step S2: Calculate the first fitness and second fitness of each individual in the initial population; wherein the first fitness corresponds to the objective function of the first high-directional antenna deployment optimization model, and the second fitness corresponds to the objective function of the second high-directional antenna deployment optimization model; based on the first fitness and the second fitness, select the optimal individual from the current population and record it as the global optimal solution; Step S3: Update the loop iteration count. If the current iteration count has reached the maximum iteration count, terminate the algorithm and output the current global optimal solution. If the current iteration count is less than the maximum iteration count, calculate the mode transition parameter and compare the mode transition parameter with a preset first threshold. If the mode transition parameter is less than or equal to the preset first threshold, perform a local search operation. If the mode transition parameter is greater than the preset first threshold, proceed to step S4. The mode conversion parameters can be determined based on the normalized iteration progress; specifically, they can be obtained by performing an arctangent calculation on the normalized iteration progress.

[0050] By introducing mode transition parameters, the algorithm can autonomously adapt to different stages of iteration without human intervention.

[0051] Specifically, the preset first threshold can be 1. If the mode conversion parameter is less than or equal to the preset first threshold 1, the algorithm enters the local search phase, performs foraging and predator avoidance behaviors inherited from the original ALA, and conducts fine local mining around the current optimal solution. If the mode conversion parameter is greater than the preset first threshold 1, the algorithm enters the global exploration phase and proceeds to step S4 to perform exploration behavior.

[0052] Step S4: Generate a random number and preset a second threshold and a third threshold, wherein the second threshold is less than the third threshold; based on the value of the random number, select one of the following three methods to update the current individual; If the random number is less than the second threshold, copy the global optimal solution as a temporary solution, then replace some of the high-directional antennas in the temporary solution with the high-directional antennas in the current individual, or replace them with the high-directional antennas in other random individuals, and randomly add or delete a small number of high-directional antennas, using the temporary solution as the updated current individual; Specifically, the random number can be a constant between 0 and 1. If the random number is less than the second threshold, the global optimal solution is copied as a temporary solution. Then, some of the high-directional antennas in the temporary solution are replaced with high-directional antennas in the current individual, or replaced with high-directional antennas in other random individuals. A small number of high-directional antennas are randomly added or deleted. The temporary solution is used as the updated current individual. Through this operation, fragments of other high-quality individuals can be introduced while inheriting the core features of the optimal solution, thus expanding the search breadth.

[0053] If the random number is between the second threshold and the third threshold, the current individual is copied as a temporary solution. A portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution. High-directional antennas are then extracted from other randomly selected individuals and attempted to be added. If the high-directional antenna to be added already exists in the temporary solution, it is deleted, and the temporary solution is used as the updated current individual. Specifically, if the random number is between the second threshold and the third threshold, the current individual is copied as a temporary solution, and some high-directional antennas are extracted from the global optimal solution and added to the temporary solution. Then, high-directional antennas are extracted from other randomly selected individuals and tried to be added. If the high-directional antenna to be added already exists in the temporary solution, it is deleted, and the temporary solution is used as the updated current individual. Through this operation, the continuity of the current solution structure and the diversity of the population can be balanced, while injecting high-quality features of the optimal solution.

[0054] If the random number is greater than or equal to the third threshold, the current individual is copied as a temporary solution, and only a portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution, and the temporary solution is used as the updated current individual; Specifically, if the random number is greater than or equal to the third threshold, the current individual is copied as a temporary solution, and only a portion of the highly directional antennas are extracted from the global optimal solution and added to this temporary solution. This temporary solution is then used as the updated current individual. This operation provides a conservative exploration method that moderately introduces new elements while maintaining structural stability.

[0055] Step S5: If the fitness of the updated current individual is better than the global optimum, then update the global optimum to the current individual; then increment the iteration counter by 1 and return to step S2 until the maximum number of iterations is reached.

[0056] By integrating the characteristics of the global optimal solution and the diversity of the population, a high-efficiency and high-quality solution model can be obtained to complete the deployment scheme of highly directional antennas.

[0057] It will be apparent to those skilled in the art that the present invention is not limited to the details of the exemplary embodiments described above, and that the present invention can be implemented in other specific forms without departing from the spirit or essential characteristics of the present invention.

[0058] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.

Claims

1. A method for deploying a highly directional antenna, comprising: Construct a scanning detection area model; Based on the scanning detection area model and the first state of the satellite, a first high-directional antenna deployment optimization model is constructed. A second high-directional antenna deployment optimization model is constructed based on the scanning detection area model and the second state of the satellite. The high-directional antenna deployment result is determined based on the first high-directional antenna deployment optimization model and the second high-directional antenna deployment optimization model; The first state of the satellite and the second state of the satellite are different motion states.

2. The high directional antenna deployment method as described in claim 1, wherein constructing a first high directional antenna deployment optimization model based on the scanning detection area model and the first state of the satellite includes: Taking the first state of the satellite as a stationary state, the first boundary of the scanning detection area corresponding to each of the highly directional antennas is determined according to the scanning detection area model; The coverage rate of the first detection area is determined based on the boundary of the scanning detection area corresponding to each of the high-directional antennas and the range of the area to be detected. Using the number of highly directional antennas and their corresponding location set as decision variables, the coverage rate of the first detection area not less than a given threshold as a constraint, and minimizing the number of highly directional antennas as the optimization objective, a first highly directional antenna deployment optimization model is constructed.

3. The highly directional antenna deployment method as described in claim 1, characterized in that, Based on the scanning detection area model and the second state of the satellite, a second high-directional antenna deployment optimization model is constructed, including: Taking the second state of the satellite as the motion state, the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each moment is determined according to the scanning detection area model; The minimum instantaneous coverage rate and the average time coverage rate are determined based on the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each time moment; The switching cost of the high-directional antenna is determined based on the time-varying pairing relationship between the high-directional antenna and the satellite; Using the number of high-directional antennas, their corresponding location sets, and the time-varying pairing relationship between the high-directional antennas and the satellite as decision variables, and the average time coverage rate and minimum instantaneous coverage rate as constraints, the optimization objective is to minimize the sum of the weighted deployment scale and the switching cost. A second high-directional antenna deployment optimization model is then constructed.

4. The highly directional antenna deployment method as described in claim 1, characterized in that, The deployment results of the highly directional antenna are obtained using a metaheuristic algorithm, and the solution steps include: Step S1: Perform random addition of high-directional antennas, removal of close-range high-directional antennas, and fine-tuning of the positions of high-directional antennas into the candidate high-directional antenna set to obtain the initial population; Step S2: Calculate the first fitness and second fitness of each individual in the initial population; wherein the first fitness corresponds to the objective function of the first high-directional antenna deployment optimization model, and the second fitness corresponds to the objective function of the second high-directional antenna deployment optimization model; based on the first fitness and the second fitness, select the optimal individual from the current population and record it as the global optimal solution; Step S3: Update the loop iteration count. If the current iteration count has reached the maximum iteration count, terminate the algorithm and output the current global optimal solution. If the current iteration count is less than the maximum iteration count, calculate the mode transition parameter and compare the mode transition parameter with a preset first threshold. If the mode transition parameter is less than or equal to the preset first threshold, perform a local search operation. If the mode transition parameter is greater than the preset first threshold, proceed to step S4. Step S4: Generate a random number and preset a second threshold and a third threshold, wherein the second threshold is less than the third threshold; based on the value of the random number, select one of the following three methods to update the current individual; If the random number is less than the second threshold, copy the global optimal solution as a temporary solution, then replace some of the high-directional antennas in the temporary solution with the high-directional antennas in the current individual, or replace them with the high-directional antennas in other random individuals, and randomly add or delete a small number of high-directional antennas, using the temporary solution as the updated current individual; If the random number is between the second threshold and the third threshold, the current individual is copied as a temporary solution. A portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution. High-directional antennas are then extracted from other randomly selected individuals and attempted to be added. If the high-directional antenna to be added already exists in the temporary solution, it is deleted, and the temporary solution is used as the updated current individual. If the random number is greater than or equal to the third threshold, the current individual is copied as a temporary solution, and only a portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution, and the temporary solution is used as the updated current individual; Step S5: If the fitness of the updated current individual is better than the global optimum, then update the global optimum to the current individual; then increment the iteration counter by 1 and return to step S2 until the maximum number of iterations is reached.

5. The highly directional antenna deployment method as described in claim 4, characterized in that, The procedure preceding step S5 also includes: Step S6: Check the current individual updated in step S6: If there are redundant highly directional antennas that do not violate the coverage constraint after deletion, remove them to simplify the current individual.

6. The highly directional antenna deployment method as described in claim 1, characterized in that, Following step S6, the following is also included: Step S7: Check whether the coverage of the current global optimal solution meets the preset target threshold: if it does, no operation is required; if it does not, add high directional antennas one by one from the candidate high directional antenna set to the global optimal solution until the coverage requirement is met.

7. A highly directional antenna deployment system, the system comprising: The scanning detection area model building module is used to build the scanning detection area model; The first high-directional antenna deployment optimization model construction module is used to construct the first high-directional antenna deployment optimization model based on the scanning detection area model and the first state of the satellite. The second high-directional antenna deployment optimization model construction module is used to construct a second high-directional antenna deployment optimization model based on the scanning detection area model and the second state of the satellite. The determining module is used to determine the high-directional antenna deployment result based on the first high-directional antenna deployment optimization model and the second high-directional antenna deployment optimization model; The first state of the satellite and the second state of the satellite are different motion states.

8. The highly directional antenna deployment system as described in claim 7, characterized in that, The step of constructing the first high-directional antenna deployment optimization model based on the scanning detection area model and the first state of the satellite includes: Taking the first state of the satellite as a stationary state, the first boundary of the scanning detection area corresponding to each of the highly directional antennas is determined according to the scanning detection area model; The coverage rate of the first detection area is determined based on the boundary of the scanning detection area corresponding to each of the high-directional antennas and the range of the area to be detected. Using the number of highly directional antennas and their corresponding location set as decision variables, the coverage rate of the first detection area not less than a given threshold as a constraint, and minimizing the number of highly directional antennas as the optimization objective, a first highly directional antenna deployment optimization model is constructed.

9. The highly directional antenna deployment system as described in claim 8, characterized in that, Based on the scanning detection area model and the second state of the satellite, a second high-directional antenna deployment optimization model is constructed, including: Taking the second state of the satellite as the motion state, the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each moment is determined according to the scanning detection area model; The minimum instantaneous coverage rate and the average time coverage rate are determined based on the instantaneous coverage rate of the scanning detection area corresponding to the high directional antenna at each time moment; The switching cost of the high-directional antenna is determined based on the time-varying pairing relationship between the high-directional antenna and the satellite; Using the number of high-directional antennas, their corresponding location sets, and the time-varying pairing relationship between the high-directional antennas and the satellite as decision variables, and the average time coverage rate and minimum instantaneous coverage rate as constraints, the optimization objective is to minimize the sum of the weighted deployment scale and the switching cost. A second high-directional antenna deployment optimization model is then constructed.

10. The highly directional antenna deployment system as described in claim 9, characterized in that, The deployment results of the highly directional antenna are obtained using a metaheuristic algorithm, and the solution steps include: Step S1: Perform random addition of high-directional antennas, removal of close-range high-directional antennas, and fine-tuning of the positions of high-directional antennas into the candidate high-directional antenna set to obtain the initial population; Step S2: Calculate the first fitness and second fitness of each individual in the initial population; wherein the first fitness corresponds to the objective function of the first high-directional antenna deployment optimization model, and the second fitness corresponds to the objective function of the second high-directional antenna deployment optimization model; based on the first fitness and the second fitness, select the optimal individual from the current population and record it as the global optimal solution; Step S3: Update the loop iteration count. If the current iteration count has reached the maximum iteration count, terminate the algorithm and output the current global optimal solution. If the current iteration count is less than the maximum iteration count, calculate the mode transition parameter and compare the mode transition parameter with a preset first threshold. If the mode transition parameter is less than or equal to the preset first threshold, perform a local search operation. If the mode transition parameter is greater than the preset first threshold, proceed to step S4. Step S4: Generate a random number and preset a second threshold and a third threshold, wherein the second threshold is less than the third threshold; based on the value of the random number, select one of the following three methods to update the current individual; If the random number is less than the second threshold, copy the global optimal solution as a temporary solution, then replace some of the high-directional antennas in the temporary solution with the high-directional antennas in the current individual, or replace them with the high-directional antennas in other random individuals, and randomly add or delete a small number of high-directional antennas, using the temporary solution as the updated current individual; If the random number is between the second threshold and the third threshold, the current individual is copied as a temporary solution. A portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution. High-directional antennas are then extracted from other randomly selected individuals and attempted to be added. If the high-directional antenna to be added already exists in the temporary solution, it is deleted, and the temporary solution is used as the updated current individual. If the random number is greater than or equal to the third threshold, the current individual is copied as a temporary solution, and only a portion of the high-directional antennas are extracted from the global optimal solution and added to the temporary solution, and the temporary solution is used as the updated current individual; Step S5: If the fitness of the updated current individual is better than the global optimum, then update the global optimum to the current individual; then increment the iteration counter by 1 and return to step S2 until the maximum number of iterations is reached.