An adaptive circumferential target point coverage selection box generation method and system

Abstract

This invention provides an adaptive method and system for generating circular target point coverage selection boxes, relating to the field of computer geometric analysis. The method includes: obtaining the azimuth angle set of all target points on the circumference and marking each target point as an uncovered target point; performing cyclic coverage based on a greedy strategy until all target points are marked as covered target points, obtaining a set of initial selection boxes covering all target points and their center azimuth angles; performing center position centralization adjustment on the center azimuth angles of all initial selection boxes within the group, and outputting the final selection box set. This invention minimizes the number of selection boxes and centralizes their center positions, and reliably handles the circular cyclic boundary problem.

Description

Technical Field

[0001] This invention relates to the fields of computer algorithms and computational geometry, and more specifically, to a target coverage optimization method in circular space, particularly an adaptive generation method that can completely cover discrete target points on a circle with the fewest and most concentrated selection boxes. Background Technology

[0002] In applications such as radar scanning, wireless communication sector allocation, and circumferential monitoring sensor deployment, it is often necessary to use one or more "selection boxes" (such as beamwidth or sector) with a fixed angular range to cover a series of target points randomly distributed on a circle. The optimization goal is usually to minimize the number of selection boxes used while ensuring that each target point is covered by at least one selection box, and to concentrate the center positions of these selection boxes as much as possible to facilitate system resource scheduling and reduce energy consumption.

[0003] The existing methods mainly include the following: 1) Fixed step size method: Select boxes are arranged at fixed intervals on the circumference. This method is simple but will generate a large number of redundant boxes in areas without targets, resulting in low efficiency; 2) Direct box arrangement method for target points: Select boxes are arranged with each target point as the center. Although it can guarantee coverage, it will result in too many boxes and extremely scattered center points; 3) Manual selection method: It relies on experience, is inefficient, has poor stability, and cannot cope with dynamically changing target point distribution.

[0004] These existing technologies generally suffer from problems such as resource waste, scattered layout, inability to adapt to dynamic changes, and unreliability in handling circular cyclic boundaries (connection between 0° and 360°). Therefore, this invention proposes an adaptive circular target point coverage selection box generation method and system. Summary of the Invention

[0005] The purpose of this invention is to overcome the shortcomings of existing technologies and provide an adaptive method and system for generating circular target point coverage selection boxes. This method aims to ensure full coverage while simultaneously minimizing the number of selection boxes and centralizing their center positions, and reliably handling circular boundary problems, providing an efficient and optimized input scheme for related computer algorithm engineering applications. To achieve the above objectives, the technical solution adopted by this invention is as follows: Firstly, this application provides a method for generating an adaptive circular target point coverage selection box, including: Obtain the set of azimuth angles of all target points on the circumference, and mark each target point as an uncovered target point; The greedy strategy is used to perform cyclic coverage until all target points are marked as covered target points, resulting in a set of selection boxes covering all target points and their center azimuth angles; Perform a center position centralization adjustment on the center azimuth of all selection boxes within the group, and output the final set of selection boxes.

[0006] Preferably, the greedy strategy-based cyclic coverage is performed as follows: in each iteration, for each uncovered target point, the number of currently uncovered target points that can be covered by a selection box centered on the azimuth angle of that point or its neighboring offset azimuth angle and with a width of a predetermined angle is calculated, preferably the predetermined angle is 15°; Select the selection box that covers the most uncovered target points, record its center azimuth angle, and mark the selected box as a valid box. Mark all target points within the coverage area of ​​this selection box as covered target points. Continue until all target points are marked as covered target points, thus obtaining a set of selection boxes with the fewest possible values.

[0007] Preferably, the number of uncovered target points that the selection box can cover is calculated by determining whether the target point is within the coverage area of ​​the selection box; The determination is made by calculating the cyclic distance between the azimuth of the target point and the azimuth of the center of the selection box; If the loop distance is less than or equal to half of the predetermined angle, the target point is determined to be within the coverage area of ​​the selection box; Otherwise, it is determined to be outside the range; The formula for calculating the cycle distance is: ,in and These are the azimuth angles of the target point and the center azimuth angle of the selection box, respectively.

[0008] Preferably, the central position centralization adjustment of the center azimuth angle includes: Calculate the circumferential mean azimuth angle of the center azimuth angle of a set of selection boxes; The center azimuth angle of each selection box is then finely adjusted toward the circumferential average azimuth angle. After each fine-tuning, verify whether the selection box still covers all its original target points, and decide whether to update or restore its center azimuth angle accordingly.

[0009] Preferably, the formula for calculating the circumferential average azimuth angle is: ; in, θ is the average azimuth angle of the circle, θ is the center azimuth angle of each selection box, and n is the number of selection boxes.

[0010] Preferably, the step of sequentially fine-tuning the center azimuth angle of each selection box towards the circumferential average azimuth angle includes: Adjust the center azimuth of the current selection box by a fixed azimuth step in the direction of the circumferential average azimuth.

[0011] Preferably, verifying whether the selection box can still cover all its original target points includes: Calculate the cyclic distance between the azimuth angle of each target point covered by the selection box before fine-tuning and the center azimuth angle after fine-tuning, and determine whether all cyclic distances are less than or equal to half the predetermined selection box width.

[0012] Preferably, the method for generating the neighboring offset azimuth angle is as follows: using the azimuth angle of the currently uncovered target point as a reference, within the interval [ -Δ, Sampling is performed within a fixed step size within +Δ], where θ is the center azimuth angle of the uncovered target point, and Δ is the predetermined maximum offset.

[0013] Preferably, the central position adjustment is performed iteratively until no successful fine-tuning update occurs after traversing all selection boxes.

[0014] Secondly, this application also provides an adaptive circular target point coverage selection box generation system, including: The data acquisition and initialization module is used to acquire the set of azimuth angles of all target points on the circumference and mark each target point as an uncovered target point; The greedy coverage processing module is used to perform loop coverage based on a greedy strategy until all target points are marked as covered target points, resulting in a set of selection boxes covering all target points and their center azimuth angles; The centralization adjustment module is used to perform centralization adjustment on the center azimuth angle of the group of selection boxes to obtain the final set of selection boxes.

[0015] The beneficial effects of this invention are as follows: This invention employs a "greedy strategy to perform cyclic coverage," which iteratively selects the optimal box that covers the most uncovered target points, approximating the minimum number of selection boxes with a greedy strategy. Then, it uses "centralized adjustment," which iteratively fine-tunes the center of the generated selection boxes towards the global circumferential average azimuth angle and rigorously verifies coverage, causing the layout of the selection boxes to converge centripetally. This successfully transforms the complex multi-objective optimization problem into two efficiently solvable sequential subproblems. In this way, the two techniques mentioned above jointly achieve the minimization of the number of selection boxes and the centralization of the layout, achieving the fundamental goal of dual optimization of resources and layout while ensuring full coverage.

[0016] This invention introduces and applies a cyclic distance formula throughout the entire process for distance calculation and coverage determination involving all circumferential orientations, achieving seamless and robust handling of circumferential boundaries and completely resolving the reliability issues of coverage in 0° and 360° boundary regions. It fundamentally avoids the inapplicability of traditional straight-line distances in circular space, ensuring correct geometric judgment for cases crossing 360° boundaries during key steps such as calculating the selection box coverage and verifying the feasibility of fine-tuning. This guarantees the logical correctness of the algorithm under any target point distribution.

[0017] Other features and advantages of the invention will be set forth in the following description, and will be apparent in part from the description, or may be learned by practicing embodiments of the invention. The objects and other advantages of the invention may be realized and obtained by means of the structures particularly pointed out in the written description, claims, and drawings. Attached Figure Description

[0018] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0019] Figure 1 This is a schematic diagram of the overall process of the method of the present invention. Detailed Implementation

[0020] 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, not all, of the embodiments of the present invention. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

[0021] It should be noted that similar reference numerals and letters in the following figures indicate similar items; therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures. Furthermore, in the description of this invention, terms such as "first," "second," etc., are used only to distinguish descriptions and should not be construed as indicating or implying relative importance.

[0022] Example 1: See Figure 1 The figure shows that this method includes: Step S100: Obtain the set of azimuth angles of all target points on the circumference, and mark each target point as an uncovered target point; Obtain the azimuth angles of all target points to be covered in the circular space, forming a set of target point azimuth angles. Where m is the total number of target points, and each target point The azimuth angle value is between 0° and 360°. Initialize each target point in set P. The target point is not covered.

[0023] Step S200: Perform loop coverage based on a greedy strategy until all target points are marked as covered target points, and obtain a set of selection boxes covering all target points and their center azimuth angles.

[0024] This step aims to cover all target points in an approximately optimal manner using the fewest number of selection boxes with a fixed angle and width W, where W = 15°. This stage is an iterative process, and step S200 specifically includes: Step S201: For each uncovered target point, calculate the number of uncovered target points that can be covered by a selection box with a predetermined angle as its width and the center azimuth angle of the target point or its nearest offset azimuth angle as its center. Specifically, at the beginning of each iteration, all uncovered target points are traversed, and for each uncovered target point... Its azimuth is , by azimuth Used as the center azimuth angle of the selection box.

[0025] Preferably, in some embodiments, the nearest offset azimuth angle based on the center azimuth angle is used as the candidate center to increase the likelihood of finding a better coverage location. Specifically, in the interval [ -Δ, Within +Δ], sampling is performed with a fixed step size δ to generate a set of candidate center azimuth angles. Wherein, Δ is the preset maximum offset, and in some specific embodiments, Δ=W / 4, δ=1°.

[0026] Step S202: Select a selection box that can cover the most uncovered target points, record its center azimuth angle, and mark all target points within the coverage area of ​​the selection box as covered target points; For each candidate center azimuth angle , calculation The number of currently uncovered target points that can be covered by a selection box centered at the center and with a width of W.

[0027] Determine the target point Its azimuth is The criterion for determining whether a target point is covered by the selection box is: by calculating the cyclic distance between the azimuth of the target point and the azimuth of the center of the selection box; Calculate the target point With the azimuth of the candidate center Cycle distance between , azimuth of the target point , For candidate center azimuth angle .

[0028] If the loop distance d ≤ the width W / 2 of the selection box, then the target point is determined. Covered. Iterate through all uncovered target points and count the number of covered points that meet the criteria. After all candidate boxes have had their target points counted, select the candidate box with the highest coverage count as the optimal selection box for this iteration. .

[0029] In some specific embodiments, if multiple candidate boxes have the same maximum coverage, the candidate box with the smallest center azimuth angle can be selected as the unique optimal candidate box.

[0030] Step S203: Record the optimal selection box. central azimuth Set the target azimuth angle and All target points whose cyclic distance is less than or equal to W / 2 are updated to covered target points, regardless of whether their original state was "uncovered" or they were marked as "covered" in previous rounds.

[0031] After the update is complete, check if there are still any uncovered target points. If so, return to step S201 to start the next iteration; otherwise, complete the loop and obtain a set of initial selection boxes covering all target points. and its corresponding set of central azimuth angles , where n is the number of selection boxes obtained through the greedy strategy.

[0032] Step S300: Perform a center position centralization adjustment on the center azimuth angles of all selection boxes within the group, and output the final set of selection boxes. While ensuring that the selected boxes do not disrupt the full coverage of all target points, the center azimuth angles of all selection boxes are converged as much as possible towards a single center position to improve the layout's concentration. Step S300 specifically includes: Step S301: Calculate the circumferential average azimuth angle of the center azimuth angle of a set of selection boxes; Calculate the circumferential mean azimuth angle of the initial selection box center azimuth angle set Φ. Set the center azimuth angle of each selection box. Considering it as a vector on the unit circle, calculate the average of the sine and cosine components of all vectors, and then obtain the average direction using the four-quadrant arctangent function atan2. The circumferential average azimuth angle is then described. The specific calculation formula is as follows: .

[0033] Step S302: Fine-tune the center azimuth angle of each selection box in turn toward the direction of the circumferential average azimuth angle; The center azimuth angle of each selection box Circumferential mean azimuth Approach. Preset a fine-tuning step size. In some specific embodiments =0.5°. For the set in turn... Each initial selection box in implement: Set the initial selection box central azimuth Circumferential mean azimuth Adjust the direction by a fine-tuning step. The center azimuth angle after fine-tuning is obtained. 'Calculate the center azimuth angle after fine-tuning' 'With the center azimuth angle The loop distance between them is determined, and it is determined whether all loop distances are less than or equal to half the width of the predetermined selection box, that is, whether they are less than or equal to W / 2. If they are, the verification is successful.

[0034] This invention employs a vector-based method for calculating the circumferential average azimuth angle during the centralization adjustment phase and implements fine-tuning. This ensures that every movement of the azimuth angle undergoes rigorous coverage checks and effective convergence, thereby achieving the goal of improving layout concentration without disrupting the stability of existing coverage.

[0035] Step S303: If the verification passes, the initial selection box will be... central azimuth Updated to the finely adjusted center azimuth angle If the verification fails, abandon this fine-tuning and return to the initial selection box. central azimuth constant.

[0036] Step S304: Output the final set of selection boxes.

[0037] Each initial selection box after centralized adjustment and its corresponding central azimuth angle or The output yields the final set of selection boxes. ={ ,..., } and its central azimuth angle The final set of selection boxes This is the final optimized solution that achieves complete coverage, minimal quantity, and concentrated central location, and can be directly provided to upper-layer application modules such as radar control systems and wireless resource schedulers.

[0038] Example 2: This embodiment provides an adaptive method for generating a circular target point coverage selection box. The application background of this embodiment is a phased array radar system performing scanning and tracking of multiple aerial targets. In this system, the radar beam's azimuth scanning range at a certain elevation layer is a complete circle (0°-360°). At any given time, the beam can only illuminate a fixed azimuth angle range, which is defined as the "selection box," and its width is determined by the radar beamwidth, set to a fixed value of 15° in this embodiment. The system needs to track a batch of randomly distributed airborne targets; the number and azimuth of the targets change in real time.

[0039] When the system needs to plan the scanning beam dwell positions (i.e., selection boxes) for a batch of newly appearing or updated targets, the method described in this invention is invoked. The execution process of this method in the radar system is described in detail below.

[0040] Taking an electronic scanning system as an example, the instantaneous azimuth range (i.e., the selection box width W) of the system's scanning beam is fixed at 15°. Assume the system detects 15 aircraft targets in real time, with their azimuth angles randomly distributed on a circle ranging from 0° to 360°. Obtain the specific azimuth angle set of the 15 target points, for example: [23°, 45°, 67°, 89°, 120°, 155°, 188°, 210°, 235°, 260°, 278°, 300°, 325°, 350°, 359°]. Mark all target points as "uncovered target points".

[0041] Starting with an uncovered target point, for example, 23°, calculate the uncovered target points that can be covered by a selection box centered at 23° with a preset angle of 15° (coverage range [8°, 38°]). This is done by calculating the loop distance. Determine whether the target point is covered.

[0042] After the discrimination is completed, the selection box centered at 87° can cover 89°, 120°, etc., with a total of 4 uncovered target points. This is the candidate box with the largest coverage. Therefore, it is confirmed as the first selection box. Central azimuth =87°, and mark the target points it covers as "covered target points".

[0043] Repeat the above process for the remaining uncovered points. Assume that subsequent selections are made with centers at 155°, 210°, 260°, 300°, 350°, and 5° (note the handling of loop boundaries). to .

[0044] When all target points are marked as "covered target points", 7 initial selection boxes are obtained. its central azimuth set .

[0045] Then, for the initial selection box The center azimuth angles of all initial selection boxes within the selection box are adjusted to centrally control their positions; this is done first based on the set of center azimuth angles. Calculate the mean azimuth angle of the circle Calculate the vector average of the seven center azimuth angles mentioned above. Calculate the circular average azimuth angle. ≈ 195°.

[0046] Set fine-tuning step size =1°, from the initial selection box Initially, try adjusting it to 88° in the direction of the average azimuth angle of the circle, which is 195°. Verify the initial selection box. Check if all previously covered target points are still within the bounded box centered at 88° and 15° wide. If so, update the initial selection box. central azimuth =87° is =88°; If at least one point is not present, the initial selection box is... central azimuth Keep the temperature at 87°.

[0047] The remaining 6 initial selection boxes were then fine-tuned in the same way.

[0048] After completing one round of fine-tuning of all initial selection boxes, multiple rounds of fine-tuning can be repeated (recalculate the circumferential average azimuth angle with the updated center azimuth angle, and try fine-tuning again until the center of no selection box changes in a certain round, then the adjustment ends).

[0049] Finally, the system outputs the optimized center azimuth angles of the seven selection boxes. .

[0050] In multiple simulations and field tests of the aforementioned radar scenario, when the number of targets is 15 and randomly distributed, the traditional fixed-step method (with a step size of 15°) requires 24 frames to ensure complete coverage. Even after manual optimization, approximately 11 frames are still needed, with a central standard deviation of about 72°. Applying the method of this invention, only 7 selection frames are required to achieve complete coverage, and the central standard deviation is reduced to 66°. Quantitative results show that the system scanning time is reduced by more than 30%, and resource consumption is significantly decreased. This fully verifies the superiority of this invention in solving the problem of circular target point coverage: achieving more reliable coverage with fewer resources and a more concentrated layout.

[0051] Example 3: This embodiment provides an adaptive circular target point coverage selection box generation system, including: a data acquisition and initialization module, used to acquire the azimuth angle set of all target points on the circumference and mark each target point as an uncovered target point; The greedy coverage processing module is used to perform loop coverage based on a greedy strategy until all target points are marked as covered target points, resulting in a set of selection boxes covering all target points and their center azimuth angles; The centralization adjustment module is used to perform centralization adjustment on the center azimuth angle of the group of selection boxes to obtain the final set of selection boxes.

[0052] This invention constructs a sequential analysis framework of "suspected point screening - path reconstruction - vulnerability determination," deeply coupling and verifying the semantic understanding capabilities of large models with the structured tracing capabilities of static analysis. This approach achieves the technical effect of outputting a structured report containing detailed scoring reasons, evidence coordinates, and judgment criteria, thereby solving the problems of poor interpretability and difficulty in manual review of traditional automated tool outputs, as well as the high dependence of security analysis on expert experience and insufficient automation.

[0053] It should be noted that the specific manner in which each module performs its operation in the apparatus described in the above embodiments has been described in detail in the embodiments of the method, and will not be elaborated here.

[0054] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

[0055] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method for generating an adaptive circular target point coverage selection box, characterized in that, include: Obtain the set of azimuth angles of all target points on the circumference, and mark each target point as an uncovered target point; The greedy strategy is used to perform loop coverage until all target points are marked as covered target points, resulting in a set of initial selection boxes covering all target points and their center azimuth angles. Perform a center position centralization adjustment on the center azimuth of all initial selection boxes within the group, and output the final set of selection boxes.

2. The adaptive circular target point coverage selection box generation method according to claim 1, characterized in that, The loop coverage based on the greedy strategy includes: For each uncovered target point, calculate the number of uncovered target points that can be covered by a selection box centered on the center azimuth angle of that target point or its nearest offset azimuth angle and with a width of a predetermined angle; Select the selection box that covers the most uncovered target points, record its center azimuth angle, and mark all target points within the coverage area of ​​the selection box as covered target points.

3. The method for generating an adaptive circular target point coverage selection box according to claim 2, characterized in that, The number of uncovered target points that the selection box can cover is calculated by determining whether the target point is within the coverage area of ​​the selection box; The determination is made by calculating the cyclic distance between the azimuth of the target point and the azimuth of the center of the selection box; If the loop distance is less than or equal to half of the predetermined angle, the target point is determined to be within the coverage area of ​​the selection box; Otherwise, it is determined to be outside the range; The formula for calculating the cycle distance is: ,in and These are the azimuth angles of the target point and the center azimuth angle of the selection box, respectively.

4. The method for generating an adaptive circular target point coverage selection box according to claim 1, characterized in that, The central position adjustment for the center azimuth angle includes: Calculate the circumferential mean azimuth angle of the center azimuth angle of a set of selection boxes; The center azimuth angle of each selection box is then finely adjusted toward the circumferential average azimuth angle. After each fine-tuning, verify whether the selection box still covers all its original target points, and decide whether to update or restore its center azimuth angle accordingly.

5. The method for generating an adaptive circular target point coverage selection box according to claim 4, characterized in that, The formula for calculating the mean azimuth angle of the circle is: ； Where α is the average azimuth angle of the circle, θ is the center azimuth angle of each selection box, and n is the number of selection boxes.

6. The method for generating an adaptive circular target point coverage selection box according to claim 4, characterized in that, The step of sequentially fine-tuning the center azimuth angle of each selection box towards the direction of the circumferential average azimuth angle includes: Adjust the center azimuth of the current selection box by a fixed azimuth step in the direction of the circumferential average azimuth.

7. The method for generating an adaptive circular target point coverage selection box according to claim 4, characterized in that, The verification of whether the selection box can still cover all its original target points includes: Calculate the cyclic distance between the azimuth angle of each target point covered by the selection box before fine-tuning and the center azimuth angle after fine-tuning, and determine whether all cyclic distances are less than or equal to half the predetermined selection box width.

8. The method for generating an adaptive circular target point coverage selection box according to claim 2, characterized in that, The method for generating the neighboring offset azimuth angle is as follows: taking the azimuth angle of the currently uncovered target point as a reference, sampling is performed in the interval [θ-Δ, θ+Δ] with a fixed step size, where θ is the azimuth angle of the uncovered target point and Δ is the predetermined maximum offset.

9. The method for generating an adaptive circular target point coverage selection box according to claim 1, characterized in that, The central position adjustment is performed iteratively until no successful fine-tuning update occurs after traversing all selection boxes.

10. An adaptive circular target point coverage selection box generation system, characterized in that, include: The data acquisition and initialization module is used to acquire the set of azimuth angles of all target points on the circumference and mark each target point as an uncovered target point; The greedy coverage processing module is used to perform loop coverage based on a greedy strategy until all target points are marked as covered target points, resulting in a set of selection boxes covering all target points and their center azimuth angles; The centralization adjustment module is used to perform centralization adjustment on the center azimuth angle of the group of selection boxes to obtain the final set of selection boxes.

Images