Methods and Systems for Planning Regional Scanning Coverage Missions of Two-Dimensional Scanning Satellite Constellations

By discretizing the target area into a set of points and assigning benefit values, and prioritizing the scanning of high-benefit areas, the problem of area omissions in multi-satellite joint mission planning of two-dimensional scanning satellite constellations is solved, and rapid, full-coverage area scanning is achieved.

CN118289227BActive Publication Date: 2026-11-17SHANGHAI SATELLITE ENG INST
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202410350914.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-03-26
Publication Date
2026-11-17
Estimated Expiration
2044-03-26

AI Technical Summary

Technical Problem

In existing technologies, satellites with two-dimensional scanning capabilities cannot effectively utilize the scanning capabilities of their payloads when planning multi-satellite joint regional scanning missions, resulting in some areas being missed and low efficiency in the execution of scanning missions.

Method used

By discretizing the target area into a set of points, assigning benefit values, prioritizing the detection area based on the benefit values, updating the benefit values ​​of the discrete points, and planning the scanning range of the satellites, a multi-satellite joint regional scanning coverage mission can be achieved.

Benefits of technology

It enables rapid and efficient full-coverage scanning of the target area within a limited time, improving scanning efficiency and coverage. The method is simple, clear, highly applicable, and practical.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118289227B_ABST
    Figure CN118289227B_ABST
Patent Text Reader

Abstract

This invention provides a method and system for planning regional scanning coverage missions for a two-dimensional scanning satellite constellation, including the following steps: S1: collecting data from the target area and discretizing the target area into a set of points; S2: calculating and processing relevant parameters, including discrete area benefits, satellite transit timing, and single-satellite detectable time; S3: if all preset satellites have been planned, output the planning result; otherwise, repeat step S2. This invention enables satellites to prioritize scanning undetected portions of the target area, achieving scanning of a larger area within a limited time, and quickly and effectively achieving full coverage scanning of the target area. The regional scanning mission planning method of this invention is simple and clear, can be implemented through numerical calculations alone, without the need for complex simulation tools, and has strong practicality.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of aerospace technology, and more specifically, to a method and system for planning regional scanning coverage missions for a two-dimensional scanning satellite constellation. Background Technology

[0002] In recent years, with the development of satellite technology, satellite constellation systems capable of performing various observation tasks have been formed by networking multiple satellites of different types and purposes. In multi-satellite joint regional scanning coverage missions, satellites with two-dimensional scanning capabilities have unique advantages. In order to further improve the utilization rate of satellite payloads and the regional scanning efficiency of multi-satellite joint systems, it is necessary to formulate efficient observation mission plans through multi-satellite joint mission planning for regional scanning missions and to coordinate and manage the observation missions of satellite constellations.

[0003] In traditional satellite pushbroom operations, the satellite payload remains relatively fixed in attitude to the satellite, relying solely on the satellite's orbital movement to scan the area. When planning multi-satellite regional scanning missions, only the transit time of the satellite over the target area needs to be considered, resulting in low mission efficiency. For satellites with 2D scanning capabilities, their payloads employ diverse scanning patterns, such as strip mosaic scanning and sector scanning. Planning based solely on transit time fails to effectively utilize the satellite payload's scanning capabilities, and sometimes, due to the payload's unique scanning method, some areas are missed during the coverage process. Therefore, it is necessary to develop a multi-satellite joint regional scanning coverage mission planning method for satellites with 2D scanning capabilities to achieve rapid and efficient full-coverage regional scanning.

[0004] Chinese patent document CN211653129U discloses a two-dimensional scanning device and a lidar device incorporating the two-dimensional scanning device. The two-dimensional scanning device includes a reflector, a scanning drive system, and an axis. The reflector reflects the emitted laser beam, with its normal forming a fixed angle α with the axis, and its normal forming an incident angle θ with the incident emitted laser beam. The emitted laser beam arrives at the reflector surface with a fixed direction. The scanning drive system drives the reflector to rotate 360° around the axis via a scanning axis, causing the reflection direction of the emitted laser beam to change periodically, forming a circular laser scanning trajectory, thus achieving two-dimensional scanning of the target. However, the two-dimensional scanning device provided in this patent document only improves the effective utilization rate of the emitted laser beam, while this invention discretizes the target area based on the satellite's field of view, reducing the efficiency value of planned discrete points in the area to achieve multi-satellite joint scanning coverage of the target area. This is fundamentally different from the technical problem solved by the patent document. Summary of the Invention

[0005] To address the shortcomings of existing technologies, the purpose of this invention is to provide a method and system for planning regional scanning coverage missions for two-dimensional scanning satellite constellations.

[0006] A method for planning regional scanning coverage missions for a two-dimensional scanning satellite constellation according to the present invention includes:

[0007] Step S1: Collect data from the target area and discretize the target area into a set of points;

[0008] Step S2: Calculate and process the relevant parameters;

[0009] The parameters include discrete region benefits, satellite transit timing, and single-satellite detectable time.

[0010] Step S3: If all preset satellites have been planned, output the planning results; otherwise, repeat step S2.

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

[0012] Step S1.1: Construct a discrete set in the target area; based on a preset value not greater than the instantaneous swath width of the satellite, discretize the target area into a point set P, and for each point p... i Perform coverage;

[0013] Step S1.2: Construct the benefit value of the discrete point set; based on the point set P, calculate the benefit value for each point p. i Distributed benefit value v i This forms a set of benefit values ​​V, and assigns an initial benefit value of 1 to all points; the set of benefit values ​​V corresponds one-to-one with the set of discrete points.

[0014] Step S1.3: Single scan area; Using the larger of the instantaneous swath width and the instantaneous swath width on the side closest to the nadir point as the diameter, and taking the first discrete point as the center, a circular area is formed; the area of ​​the circular area is smaller than the maximum area that can be scanned by a single star in a single scan.

[0015] Step S1.4: Slide the center of the circle horizontally or vertically at intervals of half the radius of the circular region until the circle extends beyond the target region; traverse the entire target region to construct different circular regions and obtain a set of circular regions C.

[0016] Preferably, the preset value of the instantaneous swath width includes half the length of the shorter side of the rectangular field of view when the satellite field of view points to the nadir point, and each discrete point is unique.

[0017] Preferably, the lateral sliding includes sliding from east to west along the east-west direction; the longitudinal sliding includes sliding from north to south along the north-south direction.

[0018] Preferably, step S2 includes the following sub-steps:

[0019] Step S2.1: Calculate the benefits of the discrete region; calculate the distance between each point in set P and the center of each circle to obtain the distance between each circle c. i The discrete points contained therein are calculated, and c is calculated. i The corresponding benefit value cv i This forms the corresponding benefit set CV of the circular region set C;

[0020] Step S2.2: Calculate the satellite transit time series; establish a satellite set S, and calculate the transit time series of all satellites over the target area in the future period through orbit recursion;

[0021] Step S2.3: Calculate the detectable time of a single satellite; select a satellite s i The detectable time period T of the target area is calculated based on its visible range. i ;

[0022] Step S2.4: Based on the satellite scanning and detection time Δt, calculate and determine the detectable circular area, and select the circular area with the maximum benefit value as the detection object; if multiple circular areas have the same benefit value, select the circular area that first meets the preset detection conditions as the detection object.

[0023] Step S2.5: Update discrete point benefit; reduce the discrete point benefit value of the probe object and recalculate the benefit value cv. i ;

[0024] Step S2.6: In T i Remove the time period occupied by the selected detection object, calculate and determine the feasibility of the satellite to other circular areas. If the feasibility exists, proceed to step S2.4.

[0025] Preferably, in step S2.4, the center of the circular region is within the maneuverable range of the satellite pointing, and a neighborhood is formed with half the scanning and detection time as the radius, centered on the moment the satellite points to the center of the circle; when the neighborhood is completely contained within the detectable time period of the satellite, the circular region can be detected by the satellite.

[0026] Preferably, step S2.1 includes mapping the discrete point set P to the set of regions to be scanned C, and mapping the circular region c to the set of regions to be scanned C. i The sum of the benefit values ​​of all discrete points in the region is taken as the benefit value cv of that region. i .

[0027] Preferably, the satellite transit time sequence is obtained by recursively calculating the satellite transit time windows within the mission planning time based on the orbit model of each satellite, and then sorting them.

[0028] Preferably, step S3 includes determining whether all satellites have been processed. If so, the current mission planning ends and the mission planning result is output; otherwise, step S2.3 is executed.

[0029] According to the present invention, a regional scanning coverage mission planning system for a two-dimensional scanning satellite constellation includes:

[0030] Module M1: Collects data from the target area and discretizes the target area into a set of points;

[0031] Module M2: Calculates and processes relevant parameters;

[0032] The parameters include discrete region benefits, satellite transit timing, and single-satellite detectable time.

[0033] Module M3: If all preset satellites have been planned, output the planning results; otherwise, repeat module M2.

[0034] Preferably, module M1 includes the following sub-modules:

[0035] Module M1.1: Constructs a discrete set in the target area; based on a preset value not greater than the instantaneous swath width of the satellite, the target area is discretized into a point set P, and for each point p... i Perform coverage;

[0036] Module M1.2: Constructs the benefit value of a discrete point set; based on the point set P, it calculates the benefit value for each point p. i Distributed benefit value v i This forms a set of benefit values ​​V, and assigns an initial benefit value of 1 to all points; the set of benefit values ​​V corresponds one-to-one with the set of discrete points.

[0037] Module M1.3: Single scan area; Taking the larger of the instantaneous swath width on the side closest to the nadir point and the instantaneous swath width as the diameter, and taking the first discrete point as the center, a circular area is formed; the area of ​​the circular area is smaller than the maximum area that can be scanned by a single satellite in a single scan;

[0038] Module M1.4: Slide the center of the circle horizontally or vertically at intervals of half the radius of the circular region until the circle extends beyond the target region; traverse the entire target region to construct different circular regions, resulting in a set of circular regions C.

[0039] Preferably, the preset value of the instantaneous swath width includes half the length of the shorter side of the rectangular field of view when the satellite field of view points to the nadir point, and each discrete point is unique.

[0040] Preferably, the lateral sliding includes sliding from east to west along the east-west direction; the longitudinal sliding includes sliding from north to south along the north-south direction.

[0041] Preferably, module M2 includes the following sub-modules:

[0042] Module M2.1: Calculates the benefits of discrete regions; calculates the distance between a point in set P and the center of each circle, obtaining the distance for each circle c. i The discrete points contained therein are calculated, and c is calculated. i The corresponding benefit value cv i This forms the corresponding benefit set CV of the circular region set C;

[0043] Module M2.2: Calculate satellite transit time series; establish a satellite set S, and calculate the transit time series of all satellites over the target area in the future period through orbit recursion;

[0044] Module M2.3: Calculates the detectable time of a single satellite; selects a satellite s i The detectable time period T of the target area is calculated based on its visible range. i ;

[0045] Module M2.4: Based on the satellite scanning and detection time Δt, calculate and determine the detectable circular area, and select the circular area with the maximum benefit value as the detection target; if multiple circular areas have the same benefit value, select the circular area that first meets the preset detection conditions as the detection target.

[0046] Module M2.5: Update discrete point benefit; reduce the discrete point benefit value of the detected object and recalculate the benefit value cv. i ;

[0047] Module M2.6: In T i Remove the time period occupied by the selected detection object, calculate and determine the feasibility of the satellite to other circular areas. If the feasibility exists, execute module M2.4.

[0048] Preferably, the center of the circular region in module M2.4 is within the maneuverable range of the satellite pointing, and a neighborhood is formed with half the scanning and detection time as the radius, centered on the moment the satellite points to the center of the circle; when the neighborhood is completely contained within the detectable time period of the satellite, this circular region can be detected by the satellite.

[0049] Preferably, module M2.1 includes mapping a discrete point set P to a set of regions to be scanned C, and mapping a circular region c to a circular region c. i The sum of the benefit values ​​of all discrete points in the region is taken as the benefit value cv of that region. i .

[0050] Preferably, the satellite transit time sequence is obtained by recursively calculating the satellite transit time windows within the mission planning time based on the orbit model of each satellite, and then sorting them.

[0051] Preferably, module M3 includes determining whether all satellites have been processed. If so, the current mission planning ends and the mission planning result is output; otherwise, module M2.3 is executed.

[0052] Compared with the prior art, the present invention has the following beneficial effects:

[0053] 1. This invention can discretize the target area into a set of points and assign benefit values. Each time, a single satellite selects the area to be detected according to the rule of benefit value priority, and updates the benefit values ​​of the planned discrete points, thereby realizing the planning of multi-satellite joint regional scanning coverage mission.

[0054] 2. In multi-satellite joint planning tasks, this invention can plan the uncovered parts of the target area as early as possible based on the continuously iterated discrete point benefit values, thereby achieving rapid full coverage of the region. The method provided has high universality, is flexible in terms of the conditions for use in region scanning tasks, is simple in process, and can achieve rapid full coverage of the region within an acceptable error range.

[0055] 3. This invention enables satellites to prioritize scanning undetected portions of regional targets, thereby scanning a larger area within a limited time and achieving rapid and efficient full coverage scanning of regional targets. The task planning method for regional scanning involved in this invention is simple and clear, and can be implemented solely through numerical calculations without the need for complex simulation tools, making it highly practical.

[0056] Other beneficial effects of the present invention will be explained in detail through the introduction of specific technical features and technical solutions in specific embodiments. Those skilled in the art should be able to understand the beneficial technical effects brought about by these technical features and technical solutions through the introduction of these technical features and technical solutions. Attached Figure Description

[0057] Other features, objects, and advantages of the present invention will become more apparent from the following detailed description of non-limiting embodiments with reference to the accompanying drawings:

[0058] Figure 1 This is a flowchart of the method of the present invention.

[0059] Figure 2 This is a schematic diagram of the satellite scanning method and field of view parameters in an embodiment of the present invention.

[0060] Figure 3 This is a schematic diagram of the discrete distribution of regional targets in an embodiment of the present invention.

[0061] Figure 4 This is a schematic diagram of a single-satellite single-circular scan area in an embodiment of the present invention.

[0062] Figure 5This is a schematic diagram illustrating the composition of the circular region set to be scanned in an embodiment of the present invention. Detailed Implementation

[0063] The present invention will now be described in detail with reference to specific embodiments. These embodiments will help those skilled in the art to further understand the present invention, but do not limit the invention in any way. It should be noted that those skilled in the art can make several changes and improvements without departing from the concept of the present invention. These all fall within the protection scope of the present invention.

[0064] To address the shortcomings of existing technologies, the purpose of this invention is to provide a regional scanning coverage mission planning method for satellite constellations with two-dimensional scanning detection capabilities.

[0065] The basic idea of ​​this invention is to discretize regional targets based on the satellite's field of view, assign benefit values ​​to these discretized points, and use the satellite's single scan range as a threshold to divide the regional targets into a circular set of areas to be scanned. The satellite's detection of regional targets is planned based on the principle of prioritizing the sum of the benefits of the discretized points in each circular area. The benefit values ​​of the discretized points in the planned areas are reduced, thereby achieving multi-satellite joint scanning coverage of regional targets. Based on this idea, satellites can be prioritized to scan undetected areas within a specified time period, allowing for a more even distribution of planned tasks among multiple satellites, and achieving full coverage scanning of regional targets in the shortest possible time.

[0066] Reference Figure 1 As shown, a method for planning regional scanning coverage missions for a two-dimensional scanning satellite constellation includes:

[0067] The target satellite is one with two-dimensional scanning detection capabilities, and its detection field of view range in the range direction is defined as ξ. R Instantaneous amplitude is L R The azimuth scanning range angle is ξ A The instantaneous swath width on the side closest to the sub-satellite point is L. A .

[0068] Step 1: Construction of the Discrete Set of the Mission Region: Discretize the region into a set P of points, with each point p in set P not exceeding half the smaller value of the satellite's instantaneous swath width. i Coverage means coverage of its neighborhood. Here, half of the smaller instantaneous swath width of the satellite refers to half the length of the shorter side of the rectangular field of view when the satellite's field of view is pointed towards the nadir point.

[0069] Step 2: Constructing the set of benefit values ​​for the discrete point set: For each point p, refer to the discrete point set P. i Distributed benefit value v iThis forms a benefit value set V, and all points are assigned an initial benefit value of 1. The benefit value set V corresponds one-to-one with the discrete point set P from step 1, meaning that each discrete point has its own benefit value.

[0070] Step 3: Single scan area: L R and L A The larger value in the equation represents the diameter. A circular region is formed with the first discrete point as the center. The area of ​​this circular region is smaller than the maximum area that a single satellite can scan in a single operation, and it is used as the detection target for single-satellite single-operation planning in subsequent steps.

[0071] Step 4: Set of regions to be scanned: Slide the center of the circular region horizontally at intervals equal to half the radius of the original circular region to create a second circular region. Continue this process until the boundary of the circle reaches the outside of the region. Then, slide the center of the circle vertically once to perform the second row of sliding, until the entire region has been traversed. This yields a set of circular regions C. When dividing the target region using circular regions, slide horizontally along the east-west direction from east to west; slide vertically along the north-south direction from north to south. The center of the circular region does not necessarily coincide with the discrete points.

[0072] Step 5: Discrete Region Benefit Calculation: Calculate the distance between the midpoint of set P and the center of each circle to obtain the distance between each circle c. i The discrete points contained therein are calculated, and c is calculated. i The corresponding benefit value cv i This forms the corresponding benefit set CV of the circular region set C. By calculating the distances between discrete points in the target region and the centers of each circle in the scanned region set C, the discrete point set P is mapped to the scanned region set C, and the circular region c is... i The sum of the benefit values ​​of all discrete points in the region is taken as the benefit value cv of that region. i .

[0073] Step 6: Satellite transit sequence calculation: Establish a satellite set S, and calculate the transit sequence of all satellites over the region in the future through orbital recursion. For each satellite in the satellite set S, orbital recursion needs to be performed based on the satellite's orbital model to calculate the satellite transit time window within the mission planning duration. Finally, the transit sequence of satellites over the target region is obtained by sorting them, and then the field of view of each satellite is considered.

[0074] Step 7: Calculation of the detectable time of a single satellite: Take the time of a satellite as an example. i The detectable time period T for regional targets is calculated by combining its visible range. i .

[0075] Step 8: Prioritize detection based on efficiency: Calculate and determine the detectable circular region based on the scanning and detection time Δt, and select the circle with the highest efficiency value as the detection target; if multiple circles have the same efficiency value, select the one that meets the detection conditions first; when determining the detectable circular region, its center must be within the satellite's pointing maneuvering range, and a neighborhood must be formed with half the scanning and detection time as the radius, centered on the time when the satellite points to the center of the circle; only if this neighborhood is completely included within the satellite's detectable time period for the region is the circular region considered detectable by the satellite.

[0076] Step 9: Discrete Point Benefit Update: Based on the selected probe object, reduce its contained discrete point benefit value. Then recalculate the entire CV. i The benefit value can be reduced by a fixed amount each time, or reduced proportionally, depending on the needs of the scanning task.

[0077] Step 10: Calculate the feasibility of other scanned regions: In T i Remove the time period occupied by the selected detection object, calculate and determine the feasibility of the satellite to other circular areas, and if so, repeat steps 8-9.

[0078] Step 11: Determine if all satellites have been processed. If so, end the current task planning and output the task planning result; otherwise, jump to step 7.

[0079] This invention can discretize the target area into a set of points and assign benefit values. Each time, a single satellite selects the area to be detected according to the rule of benefit value priority, and updates the benefit values ​​of the planned discrete points, thereby realizing the planning of multi-satellite joint regional scanning coverage mission. The mission planning method involving regional scanning is simple and clear, and can be implemented by numerical calculation alone without the need for complex simulation tools, which has strong practicality.

[0080] The above are basic embodiments of the present invention. The technical solution of the present invention will be further described below through a preferred embodiment.

[0081] Example 1

[0082] Reference Figure 1 and Figure 2 As shown, a method for planning regional scanning coverage missions for a two-dimensional scanning satellite constellation includes:

[0083] Step 1: Constructing the discrete set of the task region:

[0084] The discrete point spacing r (discrete radius) of the task region can be expressed as:

[0085]

[0086] Among them, L RL represents the instantaneous swath width of the detectable field of view in the range direction. A The instantaneous swath width of the azimuth scan on the side closest to the sub-satellite point.

[0087] After discretization, the set P of points formed by the discretized region can be represented as:

[0088] P = {p1, p2, p3, ..., p} i ,…p n};

[0089] Step 2: Constructing the set of benefit values ​​for discrete point sets:

[0090] Reference Figure 3 As shown, point p in the set P of discrete points in the region i The corresponding benefit value is allocated, denoted as p. i →v i , all v i The set of benefit values ​​V constituting the discrete point set is represented as:

[0091] V = {v1, v2, v3, ..., v} i ,…v n};

[0092] All v i The initial value is set to 1. The set of benefit values ​​V corresponds one-to-one with the set of discrete points P in step 1, that is, each discrete point has its own benefit value.

[0093] Step 3: Single scan area:

[0094] Reference Figure 4 As shown, the radius r of the circular region in a single scan C It can be represented as:

[0095]

[0096] Among them, L R L represents the instantaneous swath width of the detectable field of view in the range direction. A The azimuth scan measures the instantaneous swath width on the side closest to the nadir point, with the center of the circle located at the position of the first point p1 in set P. The area of ​​the circular region is smaller than the maximum area that a single satellite can scan in a single scan, and it is used as the detection target for single-satellite scan planning in subsequent steps.

[0097] Step 4: Set of regions to be scanned:

[0098] Reference Figure 5As shown, when determining whether the boundary of the circular region reaches the outside of the region, the maximum or minimum point of the longitude or latitude of the circular region is taken, and a line segment is formed by connecting it with the first discrete point p1 in step 3. It is then determined whether this line segment intersects with all boundary line segments of the polygonal region. If so, the boundary of the circular region reaches the outside of the region; otherwise, it does not reach the outside of the region. The pseudocode is as follows:

[0099]

[0100]

[0101] Slide the center of the circle horizontally at intervals of 1 / 2 of the radius of the single scanned circular region to create a second circular region, until the boundary of the circle reaches the outside of the region. Then slide the center of the circle vertically once to perform the second row of sliding, until the entire region has been traversed.

[0102] The set C of circular regions to be scanned, formed by sliding, can be represented as:

[0103] C = {c1, c2, c3, ..., c} i ,…c m};

[0104] When dividing the target area by sliding a circular region, the horizontal direction is along the east-west direction, sliding from east to west, and the vertical direction is along the north-south direction, sliding from north to south; the center of the circular region does not necessarily coincide with the discrete point.

[0105] Step 5: Calculation of discrete region benefits:

[0106] Circular scanning area c i The coordinates are represented as c i (x ci ,y ci ), discrete point p in the region j The coordinates are represented as p j (x pj ,y pj ), then c i With p j The distance d between ci-pj Represented as:

[0107]

[0108] If d ci-pj ≤r c Then the discrete point p in the region j In the circular scan area c i Inside, represented as Otherwise, the discrete point p in the region j Not in the circular scan area c i Inside. Among them, cp i Represents the circular scanning area ci The set of discrete points contained, r c Represents the circular scanning area c i The radius.

[0109] Let cp i ={p x ,p y ,p z}, that is, the discrete points p contained in the circular scanned region ci. x ,p y ,p z Three points, and their corresponding benefit value set cv i ={v x ,v y ,v z};v x ,v y ,v z Let c be the benefit values ​​at three discrete points, then the circular scan area is... i Total Value of Benefits | CV i |represented as|cv i |=v x +v y +v z .

[0110] The calculation process for steps 6-11 is described as follows: Calculate the transit time sequence of the satellites over the target area based on the satellite set. Iterate through the satellites in the set, calculate the detectable window for each individual satellite, and select the target area from the set of circular areas to be scanned (C) according to the principle of prioritizing efficiency. For the selected circular area, reduce the efficiency value of the discrete points within it, until all satellites have been traversed and planned, at which point the mission planning ends. For each satellite in the satellite set S, orbital recursion is performed based on the satellite's orbital model to calculate the satellite transit time window within the mission planning duration. Finally, the transit time sequence of the satellites over the target area is obtained by sorting them. Then, based on the field of view of a single satellite, when determining a detectable circular area, its center must be within the satellite's maneuverable range. A neighborhood is formed with the satellite pointing to the center as the center and half the scanning and detection time as the radius. Only if this neighborhood is completely contained within the satellite's detectable time period over the area is the circular area considered detectable by that satellite. Depending on the scanning mission requirements, the efficiency value is reduced by a fixed value or proportionally each time. The pseudocode for the above steps is as follows:

[0111]

[0112]

[0113] The present invention also provides a regional scanning coverage mission planning system for a two-dimensional scanning satellite constellation. The regional scanning coverage mission planning system for a two-dimensional scanning satellite constellation can be implemented by executing the process steps of the regional scanning coverage mission planning method for a two-dimensional scanning satellite constellation. That is, those skilled in the art can understand the regional scanning coverage mission planning method for a two-dimensional scanning satellite constellation as a preferred embodiment of the regional scanning coverage mission planning system for a two-dimensional scanning satellite constellation.

[0114] Specifically, a regional scanning coverage mission planning system for a two-dimensional scanning satellite constellation includes:

[0115] Module M1: Collects data from the target area and discretizes the target area into a set of points;

[0116] Module M2: Calculates and processes relevant parameters;

[0117] The parameters include discrete region benefits, satellite transit timing, and single-satellite detectable time.

[0118] Module M3: If all preset satellites have been planned, output the planning results; otherwise, repeat module M2.

[0119] The module M1 includes the following sub-modules:

[0120] Module M1.1: Constructs a discrete set in the target area; based on a preset value not greater than the instantaneous swath width of the satellite, the target area is discretized into a point set P, and for each point p... i Perform coverage;

[0121] Module M1.2: Constructs the benefit value of a discrete point set; based on the point set P, it calculates the benefit value for each point p. i Distributed benefit value v i This forms a set of benefit values ​​V, and assigns an initial benefit value of 1 to all points; the set of benefit values ​​V corresponds one-to-one with the set of discrete points.

[0122] Module M1.3: Single scan area; Taking the larger of the instantaneous swath width on the side closest to the nadir point and the instantaneous swath width as the diameter, and taking the first discrete point as the center, a circular area is formed; the area of ​​the circular area is smaller than the maximum area that can be scanned by a single satellite in a single scan;

[0123] Module M1.4: Slide the center of the circle horizontally or vertically at intervals of half the radius of the circular region until the circle extends beyond the target region; traverse the entire target region to construct different circular regions, resulting in a set of circular regions C.

[0124] The preset value of the instantaneous swath width includes half the length of the shorter side of the rectangular field of view when the satellite field of view points to the nadir point, and each discrete point is unique.

[0125] The lateral sliding includes sliding from east to west along the east-west direction; the longitudinal sliding includes sliding from north to south along the north-south direction.

[0126] Module M2 includes the following sub-modules:

[0127] Module M2.1: Calculates the benefits of discrete regions; calculates the distance between a point in set P and the center of each circle, obtaining the distance for each circle c. i The discrete points contained therein are calculated, and c is calculated. i The corresponding benefit value cv i This forms the corresponding benefit set CV of the circular region set C;

[0128] Module M2.2: Calculate satellite transit time series; establish a satellite set S, and calculate the transit time series of all satellites over the target area in the future period through orbit recursion;

[0129] Module M2.3: Calculates the detectable time of a single satellite; selects a satellite s i The detectable time period T of the target area is calculated based on its visible range. i ;

[0130] Module M2.4: Based on the satellite scanning and detection time Δt, calculate and determine the detectable circular area, and select the circular area with the maximum benefit value as the detection target; if multiple circular areas have the same benefit value, select the circular area that first meets the preset detection conditions as the detection target.

[0131] Module M2.5: Update discrete point benefit; reduce the discrete point benefit value of the detected object and recalculate the benefit value cv. i ;

[0132] Module M2.6: In T i Remove the time period occupied by the selected detection object, calculate and determine the feasibility of the satellite to other circular areas. If the feasibility exists, execute module M2.4.

[0133] In module M2.4, the center of the circular region is within the maneuverable range of the satellite pointing, and a neighborhood is formed with half the scanning and detection time as the radius, centered on the moment the satellite points to the center of the circle. When the neighborhood is completely contained within the detectable time period of the satellite, the circular region can be detected by the satellite.

[0134] The module M2.1 includes mapping a discrete point set P to a set of regions to be scanned C, and mapping a circular region c. i The sum of the benefit values ​​of all discrete points in the region is taken as the benefit value cv of that region. i .

[0135] The satellite transit time sequence is obtained by recursively calculating the satellite transit time windows within the planned mission duration based on the orbital model of each satellite, and then sorting them.

[0136] Module M3 includes determining whether all satellites have been processed. If so, the current mission planning ends and the mission planning result is output; otherwise, module M2.3 is executed.

[0137] Those skilled in the art will understand that, besides implementing the system and its various devices, modules, and units provided by this invention in the form of purely computer-readable program code, the same functions can be achieved entirely through logical programming of the method steps, making the system and its various devices, modules, and units of this invention function in the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers. Therefore, the system and its various devices, modules, and units provided by this invention can be considered as a hardware component, and the devices, modules, and units included therein for implementing various functions can also be considered as structures within the hardware component; alternatively, the devices, modules, and units for implementing various functions can be considered as both software modules implementing the method and structures within the hardware component.

[0138] In the description of this application, it should be understood that the terms "upper", "lower", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. They are only for the convenience of describing this application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limitations on this application.

[0139] Specific embodiments of the present invention have been described above. It should be understood that the present invention is not limited to the specific embodiments described above, and those skilled in the art can make various changes or modifications within the scope of the claims, which do not affect the essence of the present invention. Unless otherwise specified, the embodiments and features described in this application can be arbitrarily combined with each other.

Claims

1. A method for planning regional scanning coverage missions for a two-dimensional scanning satellite constellation, characterized in that, include: Step S1: Collect data from the target area and discretize the target area into a set of points; Step S2: Calculate and process the relevant parameters; The parameters include discrete region benefits, satellite transit timing, and single-satellite detectable time. Step S3: If all preset satellites have been planned, output the planning results; Otherwise, repeat step S2; Step S1 includes the following sub-steps: Step S1.1: Construct a discrete set in the target region; discretize the target region into a point set based on a preset value not greater than the instantaneous swath width of the satellite. For each point Perform coverage; Step S1.2: Construct the benefit value of the discrete point set; based on the point set For each point Distributed benefit value To form a set of benefit values The initial benefit value is assigned to all points as 1; the set of benefit values Each point corresponds one-to-one with a set of discrete points. Step S1.3: Single scan area; Using the larger of the instantaneous swath width and the instantaneous swath width on the side closest to the nadir point as the diameter, and taking the first discrete point as the center, a circular area is formed; the area of ​​the circular area is smaller than the maximum area that can be scanned by a single star in a single scan. Step S1.4: Slide the center of the circle horizontally or vertically at intervals of half the radius of the circular region until the circle extends beyond the target region; traverse the entire target region to construct different circular regions, obtaining a set of circular regions. ; Step S2 includes the following sub-steps: Step S2.1: Calculate the benefits of the discrete region; calculate the set The distance between a point in the middle and the centers of each circle is used to obtain the distance of each circle. The discrete points contained therein, and calculate Corresponding benefit value Forming a circular area set The corresponding benefit set ; Step S2.2: Calculate satellite transit time series; establish satellite set. By recursively calculating the transit time of all satellites over the target area in the future, the transit time of all satellites over the target area is calculated. Step S2.3: Calculate the detectable time of a single satellite; Select a satellite The detectable time period for the target area is calculated based on its visible range. ; Step S2.4: Satellite-based scanning and detection time The system calculates and determines the detectable circular areas, and selects the circular area with the highest benefit value as the detection target. If multiple circular areas have the same benefit value, the circular area that first meets the preset detection conditions is selected as the detection target. Step S2.5: Update discrete point benefit; reduce the discrete point benefit value of the detected object and recalculate the benefit value. ; Step S2.6: In Remove the time period occupied by the selected detection object, calculate and determine the feasibility of the satellite to other circular areas. If the feasibility exists, proceed to step S2.

4.

2. The method for planning regional scanning coverage missions of a two-dimensional scanning satellite constellation according to claim 1, characterized in that, The preset value of the instantaneous swath width includes half the length of the shorter side of the rectangular field of view when the satellite field of view points to the nadir point, and each discrete point is unique.

3. The method for planning regional scanning coverage missions of a two-dimensional scanning satellite constellation according to claim 1, characterized in that, The lateral sliding includes sliding from east to west along the east-west direction; the longitudinal sliding includes sliding from north to south along the north-south direction.

4. The method for planning regional scanning coverage missions of a two-dimensional scanning satellite constellation according to claim 1, characterized in that, In step S2.4, the center of the circular region is within the maneuverable range of the satellite pointing, and a neighborhood is formed with half the scanning and detection time as the radius, centered on the moment the satellite points to the center of the circle; when the neighborhood is completely contained within the detectable time period of the satellite, the circular region can be detected by the satellite.

5. The method for planning regional scanning coverage missions of a two-dimensional scanning satellite constellation according to claim 1, characterized in that, Step S2.1 includes setting the discrete point set... Mapped to the set of regions to be scanned In the middle, the circular area The sum of the benefit values ​​of all discrete points in the region is taken as the benefit value of the region. .

6. The method for planning regional scanning coverage missions of a two-dimensional scanning satellite constellation according to claim 1, characterized in that, The satellite transit time sequence is obtained by recursively calculating the satellite transit time windows within the planned mission duration based on the orbital model of each satellite, and then sorting them.

7. The method for planning regional scanning coverage missions of a two-dimensional scanning satellite constellation according to claim 1, characterized in that, Step S3 includes determining whether all satellites have been processed. If so, the current mission planning ends and the mission planning result is output; otherwise, step S2.3 is executed.

8. A regional scanning coverage mission planning system for a two-dimensional scanning satellite constellation, characterized in that, include: Module M1: Collects data from the target area and discretizes the target area into a set of points; Module M2: Calculates and processes relevant parameters; The parameters include discrete region benefits, satellite transit timing, and single-satellite detectable time. Module M3: If all preset satellites have been planned, output the planning results; otherwise, repeat module M2. The module M1 includes the following sub-steps: Module M1.1: Constructs a discrete set in the target area; discretizes the target area into a point set based on a preset value not greater than the instantaneous swath width of the satellite. For each point Perform coverage; Module M1.2: Constructing the benefit value of a discrete point set; based on the point set For each point Distributed benefit value To form a set of benefit values The initial benefit value is assigned to all points as 1; the set of benefit values Each point corresponds one-to-one with a set of discrete points. Module M1.3: Single scan area; Taking the larger of the instantaneous swath width on the side closest to the nadir point and the instantaneous swath width as the diameter, and taking the first discrete point as the center, a circular area is formed; the area of ​​the circular area is smaller than the maximum area that can be scanned by a single satellite in a single scan; Module M1.4: Slide the center of the circle horizontally or vertically at intervals of half the radius of the circular region until the circle extends beyond the target area; traverse the entire target area, construct different circular regions, and obtain a set of circular regions. ; The module M2 includes the following sub-steps: Module M2.1: Calculates the benefits of discrete regions; calculates the set The distance between a point in the middle and the centers of each circle is used to obtain the distance of each circle. The discrete points contained therein, and calculate Corresponding benefit value Forming a circular area set The corresponding benefit set ; Module M2.2: Calculate satellite transit timing; establish satellite set. By recursively calculating the transit time of all satellites over the target area in the future, the transit time of all satellites over the target area is calculated. Module M2.3: Calculates the detectable time of a single satellite; Select a satellite The detectable time period for the target area is calculated based on its visible range. ; Module M2.4: Satellite-based scanning and detection time The system calculates and determines the detectable circular areas, and selects the circular area with the highest benefit value as the detection target. If multiple circular areas have the same benefit value, the circular area that first meets the preset detection conditions is selected as the detection target. Module M2.5: Update discrete point benefit; reduce the discrete point benefit value of the detected object and recalculate the benefit value. ; Module M2.6: In Remove the time period occupied by the selected detection object, calculate and determine the feasibility of the satellite to other circular areas. If the feasibility exists, execute module M2.4.

Citation Information

Patent Citations

  • Two-dimensional scanning device and laser radar device with two-dimensional scanning device

    CN211653129U

  • Region coverage calculation method based on discrete point access information clustering

    CN117494997A