CN114330856A - Long-time-period large-area remote sensing satellite rapid covering method and system - Google Patents

Long-time-period large-area remote sensing satellite rapid covering method and system Download PDF

Info

Publication number
CN114330856A
CN114330856A CN202111588040.9A CN202111588040A CN114330856A CN 114330856 A CN114330856 A CN 114330856A CN 202111588040 A CN202111588040 A CN 202111588040A CN 114330856 A CN114330856 A CN 114330856A
Authority
CN
China
Prior art keywords
satellite
visible
target
area
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111588040.9A
Other languages
Chinese (zh)
Inventor
常中祥
闫旭涛
路帅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhongke Tianzhi Operation Control Shenzhen Technology Co ltd
Hunan University
Original Assignee
Zhongke Tianzhi Operation Control Shenzhen Technology Co ltd
Hunan University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhongke Tianzhi Operation Control Shenzhen Technology Co ltd, Hunan University filed Critical Zhongke Tianzhi Operation Control Shenzhen Technology Co ltd
Priority to CN202111588040.9A priority Critical patent/CN114330856A/en
Publication of CN114330856A publication Critical patent/CN114330856A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Position Fixing By Use Of Radio Waves (AREA)

Abstract

The invention provides a method and a system for quickly covering a long-time large-area remote sensing satellite, wherein a visible time table of a ground target to the remote sensing satellite is established; determining a set of satellites of which the ground targets to be covered have the earliest opportunity to be visible in the life cycle of the ground targets; sequencing the satellites in the set, sequentially enabling each sequenced satellite to carry out simulated shooting on the current remaining target area to obtain a shooting strip of each satellite and adding the shooting strip into the coverage scheme; calculating the residual target area after the target area is simulated and shot by all satellites; and repeatedly executing the previous steps until the remaining targets are completely covered, and outputting a covering scheme. The method comprises the steps of converting real-time calculation into data query by pre-establishing a visible time table, sequencing visible satellites on the day according to an optimized target, and then carrying out target area simulation shooting on the visible satellites on the day to obtain an earliest strip coverage scheme, and reducing the calculation complexity and improving the calculation performance by reducing the calculation time period and the calculation resources.

Description

Long-time-period large-area remote sensing satellite rapid covering method and system
Technical Field
The invention relates to the technical field of satellite remote sensing, in particular to a method and a system for quickly covering a long-time large-area remote sensing satellite.
Background
With the wider application of remote sensing data in various fields, the number of remote sensing satellites at home and abroad is rapidly developed in recent years, and how to reasonably perform multi-satellite multi-load coverage analysis on a large area target under the condition of sufficient imaging satellite resources is a major difficult point problem to be solved urgently in remote sensing satellite task planning.
The existing multi-satellite multi-load coverage analysis of an observation area mainly comprises the steps of converting an area target into a point target, carrying out window calculation on the point target, and carrying out coverage selection on the calculated window according to the strategies of coverage priority, time priority, imaging quality priority and the like so as to form an area target multi-satellite multi-load coverage scheme. The method for converting the regional target into the point target is mainly based on equal-width division and grid division, wherein the equal-width division is used for dividing the regional target according to the horizontal satellite offline of the satellite load width, and the multi-satellite region coverage scheme is obtained by window calculation and optimization selection on the basis of single-satellite equal-width division (as shown in figure 1); the grid division is to perform gridding division on the region target according to grid granularity smaller than the width (as shown in fig. 2), then obtain a coverage strip through grid point visibility calculation, and obtain a multi-star region coverage scheme through optimization selection of the coverage strip. Although the above two area coverage methods can obtain a multi-satellite area coverage scheme, the calculation resource requirement is high, the calculation time consumption is long, and the method can only adapt to short-term and limited area targets, and has the problem of incomplete coverage for long-period and large-area targets.
Disclosure of Invention
The invention provides a method and a system for quickly covering a long-period large-area remote sensing satellite, aiming at solving the technical problem of quickly covering a long-period large-area target.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
a long-time large-area remote sensing satellite quick coverage method comprises the following steps:
step 1, establishing a visible time table of a ground area target to a remote sensing satellite;
step 2: determining a satellite set O 'of the ground area target to be covered at the earliest visible opportunity in the life cycle of the ground area target according to the visible schedule of the ground area target to the remote sensing satellite't min
And step 3: according to an optimization target to satellite set O'tminSequencing the satellites, and sequentially enabling each sequenced satellite to carry out simulated shooting on the current residual target area to obtain a shooting strip of each satellite and adding the shooting strip into the coverage scheme; the current residual target area refers to a target area which is remained after the previous satellite subtracts the residual target area from the covered strip;
and 4, step 4: calculate satellite set O'tminAll the satellites in the system simulate the residual target area after shooting the target area;
and 5: and (3) repeating the steps 1 to 3 on the residual target area until the residual target area is completely covered or the end time of the regional target life cycle is reached, and outputting a covering scheme F.
Further, the method for determining the set of satellites having the earliest visible opportunity in the life cycle of the target in the ground area in step 2 is as follows:
step 2.1: determining a target area grid point set;
step 2.2: calculating the visible condition of the target area grid points in the satellite orbit period according to the determined target area grid point set;
step 2.3: calculating a visible satellite set of the target region at the moment t according to the visible condition of the target region in the satellite orbit period;
step 2.4: the set of satellites visible to the target area and the time are calculated from the set of visible satellites of the target area at time t.
Further, the method for determining the set of target area grid points in step 2.1 is as follows:
taking the grid points covered by the target area as a grid point set P, and selecting characteristic grid points from the target area grid point set P through the orbital inclination angle of the satellite and the minimum satellite width to form a characteristic grid point set P', wherein
Figure BDA0003428258990000031
The characteristic grid points are latitude lines passing through the geometric center point of the target area, and the distance between the latitude lines and the grid points in the target area grid point set P is less than or equal to one grid size;
P′={p′1,p′2,p′3,...,p′n},
n is the number of characteristic grid points.
Further, the method for calculating the visibility of the target area in the satellite orbit period in step 2.2 is as follows:
inquiring a visible time table of the remote sensing satellite to obtain characteristic grid point p'i|p′iE P' visibility schedule M for all satellitesP′i
The set of visible schedules M for the set P' of target feature grid points of the ground area for all satellitesP′Union of visible schedules for each feature grid point
MP′=Mp′1∪Mp′2∪Mp′3...∪Mp′n|p′n∈P′。
Further, the method for calculating the set of visible satellites in the target area at the time t in step 2.3 is:
step 2.3.1 calculating pairs of feature grid points p 'at time t'iA set of satellites with a chance of being visible;
traverse feature grid point p'iVisibility schedule M for all satellitesP′i,MP′iEach element V inmDenotes a characteristic grid point p'iTo satellite smIs calculated at time t characteristic grid points p'iTo satellite smVisible timetable reference time t0mThe offset t';
t′=(t-t0m)/Tsm,Tsmis a satellite smThe orbital regression cycle of (1) in days;
if t' is equal to Dm|Dm∈VmThen satellite smAt time t to characteristic grid point p'iVisible, satellite smAdded to the characteristic grid point p 'at the time point t'iSet of visible satellites Sp′iIs prepared from p'iJoining satellites smSet of grid points visible at time t
Figure BDA0003428258990000041
DmRepresenting a satellite SmBasing feature grid points on time t0mThe visible offset within one orbit period is a set of natural numbers smaller than the orbit regression period;
step 2.3.2. calculate the set of satellites that have a visible chance at time t for the regional target.
Traverse MP′Then the set of satellites having a visible opportunity for the regional target at time point t is the intersection of the set of visible satellites at each feature grid point, denoted as Ot=Sp′1∩Sp′2∩Sp′2∩...∩Sp′n
Further, the method of calculating the earliest set of visible satellites to the regional target and the time in step 2.4 is:
if the result is OtIf the number of the satellite sets is middle, the calculation is finished, and the satellite set which is visible earliest for the regional target is marked as O't minThe earliest visible time is denoted as tmin
If O is presenttAdding t +1 to t, repeating step 2.3 to obtain the final product, wherein t +1 is not more than te,teThe end time of the time period required to be acquired in the current target area is represented, 1 unit is day, 1 day is represented, and the visible set O of the area targetst+1Until O is calculatedt+1Medium elements, or time conditions are not satisfied.
Further, the optimization objective in step 3 is: coverage first, time first, imaging quality first.
Further, the specific method of step 3 is:
step 3.1: and if coverage is prioritized, the satellite set O 'visible to the regional target earliest't minThe satellites in the satellite list are sorted from big to small according to the satellite width;
if time is first, to O't minSorting from morning to evening according to the local time of the descending intersection point;
if imaging quality is prioritized, pair O't minSorting according to the resolution from high to low;
step 3.2: go through O 'in turn't minSatellite of (5), the current satellite being marked as scBy scAs the inclination angle, through scAt time tminOf visible grid point p'c|p′c∈Psct minCreating a straight line L and adding the straight line L into a straight line set L to form a satellite scA set of straight lines L with the orbit tilt angle as the tilt angle and passing through the visible grid points;
step 3.3: traversing L, calculating the distance between the straight line L I epsilon L and the intersecting line segment of the target area (if the length of the tangent intersecting line segment is 0), finding the longest intersecting line segment, taking the end point of the intersecting line segment as the central point, being vertical to the intersecting line segment, and prolonging the satellite scHalf of the breadth, generating a stripe q containing four verticesscIf the strip vertex is within the region target, then the extent direction extends the strip until four vertices are not within the region target, with the last determined strip labeled q'scAdding the strip to the overlay protocol F';
step 3.4: obtaining a residual uncovered area by subtracting the target area and the calculated strip area and then using O't minThe other satellites in (1) carry out simulation shooting on the uncovered area to calculate the covered strip, and then O 'is obtained't minAnd F 'covering the area, adding the scheme F' into the scheme F, if no residual area exists, then F is the multi-satellite covering scheme of the area and outputting, and if the residual area exists, turning to the step 4.
The invention also provides a long-time large-area remote sensing satellite rapid coverage system, which comprises the following steps:
the remote sensing satellite visible time table building module is used for building a visible time table of ground area targets to the remote sensing satellite;
the computer-visible opportunity satellite module: satellite set O 'for determining earliest visible opportunity of ground area target to be covered in life cycle of ground area target according to visible schedule of ground area target to remote sensing satellite't min
A simulated shooting strip covering module: for set of satellites O 'according to optimization target't minSequencing the satellites, and sequentially enabling each sequenced satellite to carry out simulated shooting on the current residual target area to obtain a shooting strip of each satellite and adding the shooting strip into the coverage scheme; the residual target area refers to a residual target area obtained by subtracting the covered strip from the residual target area of the previous satellite;
a remaining target area calculation module: for calculating satellite set O't minAll the satellites in the system simulate the residual target area after shooting the target area;
a coverage scheme output module: and the coverage scheme F is output until the residual target area is completely covered or the end time of the target life cycle of the area is reached.
By adopting the technical scheme, the invention has the following beneficial effects:
according to the method and the system for quickly covering the remote sensing satellite in the long-time large area, the satellite set with the earliest visible opportunity of the ground area target in the life cycle of the ground area target is determined by establishing and maintaining the visible time table of the global grid remote sensing satellite and the grid characteristic points of the grid ground area target, the visible time table is established in advance to convert real-time calculation into data query, the calculation complexity during coverage analysis of the area target is reduced, and the calculation performance is improved; then, sorting the satellites visible on the day according to the optimization target, and sequentially carrying out target area simulation shooting on the sorted satellites visible on the day to obtain an earliest strip coverage scheme, wherein the calculation complexity is reduced by shortening the calculation time period and calculating resources, and the calculation performance is improved; and then, simulating and shooting the rest target areas which are not shot after the target area is simulated and shot according to the method to obtain the coverage strips, wherein the overall calculation complexity is reduced and the calculation performance is improved by gradually solving the reduction problem. The method can be used for quickly dividing the remote sensing observation area target of a long-period large area in a full-coverage manner.
Drawings
FIG. 1 is a schematic diagram of equal-width division;
FIG. 2 is a schematic diagram of meshing;
FIG. 3 is a flow chart of the system of the present invention;
FIG. 4 is a flow chart illustrating the determination of a set of satellites for which a local target has the earliest opportunity to be visible during its lifecycle;
fig. 5 is a schematic diagram of stripe division.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 to 5 show a specific embodiment of the method for rapidly covering a remote sensing satellite in a large area for a long period of time, as shown in fig. 3,
step 1, establishing a visible time table of a ground area target to a remote sensing satellite;
in the embodiment, the earth surface is subjected to grid division by adopting a GeoSOT subdivision method to obtain a grid set P, and a visible time table V of each grid point to each satellite is constructedmFurther forming a visible schedule M of the grid point pairs to all satellites;
M={V1,V2,V3,...,Vy};
Vm={sm,t0m,Dm}
Dmrepresenting a satellite smBasing grid points on time t0mThe visible offset within one orbit period is a set of natural numbers smaller than the orbit regression period; smA satellite representing only one earth observation payload; t is t0mRepresenting a satellite smThe reference time of the visible time offset (a certain past time point can be arbitrarily selected); y represents the number of satellites.
Step 2: determining a satellite set O 'of the ground area target to be covered at the earliest visible opportunity in the life cycle of the ground area target according to the visible schedule of the ground area target to the remote sensing satellite't minAs shown in fig. 4;
in this embodiment, the method for determining the satellite set having the earliest visible opportunity in the life cycle of the ground area target in step 2 is as follows:
step 2.1: a set of target area grid points is determined.
In this embodiment, the method for determining the target area grid point set is as follows:
taking the grid points covered by the target area as a grid point set P, and selecting characteristic grid points from the target area grid point set P through the orbital inclination angle of the satellite and the minimum satellite width to form a characteristic grid point set P', wherein
Figure BDA0003428258990000081
The characteristic grid points are latitude lines passing through the geometric center point of the target area, and grid points in the target area grid point set P, which are less than or equal to one grid from the latitude lines.
P′={p′1,p′2,p′3,...,p′n},
n is the number of characteristic grid points.
Step 2.2: and calculating the visibility of the area grid points in the satellite orbit period according to the determined target area grid point set.
The method for calculating the visibility of the target area in the satellite orbit cycle in the embodiment is as follows:
inquiring a visible time table of the remote sensing satellite to obtain characteristic grid point p'i|p′iE P' visibility schedule M for all satellitesP′i
The set of visible schedules M for the set P' of target feature grid points of the ground area for all satellitesP′Union of visible schedules for each feature grid point
MP′=Mp′1∪Mp′2∪Mp′3...∪Mp′n|p′n∈P′。
Step 2.3: calculating a visible satellite set of the target region at the moment t according to the visible condition of the target region in the satellite orbit period;
in this embodiment, the method for calculating the visible satellite set in the target area at the time t includes: step 2.3.1 of calculating pairs of feature grid points p 'at time t'iA set of satellites with a chance of being visible;
traverse feature grid point p'iVisibility schedule M for all satellitesP′i,MP′iEach element V inmDenotes a characteristic grid point p'iTo satellite smIs calculated at time t characteristic grid points p'iTo satellite smVisible timetable reference time t0mThe offset t';
t′=(t-t0m)/Tsm,Tsmis a satellite smThe orbital regression cycle of (1) in days;
if t' is equal to Dm|Dm∈VmThen satellite smAt time t to characteristic grid point p'iVisible, satellite smAdded to the characteristic grid point p 'at the time point t'iSet of visible satellites Sp′iIs prepared from p'iJoining satellites smSet of grid points visible at time t
Figure BDA0003428258990000082
DmRepresenting a satellite SmBasing feature grid points on time t0mThe visible offset within one orbit period is a set of natural numbers smaller than the orbit regression period;
step 2.3.2. calculate the set of satellites that have a visible chance at time t for the regional target.
Traverse MP′Then the set of satellites having a visible opportunity for the regional target at time point t is the intersection of the set of visible satellites at each feature grid point, denoted as Ot=Sp′1∩Sp′2∩Sp′2∩...∩Sp′n
Step 2.4: the set of satellites visible to the target area and the time are calculated from the set of visible satellites of the target area at time t.
The method for calculating the earliest visible satellite set and time for regional targets in the embodiment is as follows:
if the result is OtIf the number of the satellite sets is middle, the calculation is finished, and the satellite set which is visible earliest for the regional target is marked as O't minThe earliest visible time is denoted as tmin
If O is presenttAdding t +1 to t, repeating step 2.3 to obtain the final product, wherein t +1 is not more than te,teThe end time of the time period required to be acquired in the current target area is represented, 1 unit is day, 1 day is represented, and the visible set O of the area targetst+1Until O is calculatedt+1Medium elements, or time conditions are not satisfied.
And step 3: according to an optimization target to satellite set O't minSequencing the satellites, and sequentially enabling each sequenced satellite to carry out simulated shooting on the current residual target area to obtain a shooting strip of each satellite and adding the shooting strip into the coverage scheme; the current remaining target area refers to a target area remaining after the previous satellite subtracts the remaining target area from the covered strip.
The optimization objective in this embodiment is: coverage first, time first, imaging quality first.
Step 3.1: and if coverage is prioritized, the satellite set O 'visible to the regional target earliest't minThe satellites in the satellite list are sorted from big to small according to the satellite width;
if time is first, to O't minSorting from morning to evening according to the local time of the descending intersection point;
if imaging quality is prioritized, pair O't minThe ordering is from high to low resolution.
Step 3.2: go through O 'in turn't minSatellite of (5), the current satellite being marked as scBy scAs the inclination angle, through scAt time tminOf visible grid point p'c|p′c∈Psct minCreating a straight line L and adding it to the set L to form a satellite scThe orbit tilt angle is taken as the tilt angle and passes through a set L of straight lines that can see the grid points, as shown in fig. 5.
Step 3.3: traversing L, calculating the distance between the straight line L I epsilon L and the intersecting line segment of the target area (if the length of the tangent intersecting line segment is 0), finding the longest intersecting line segment, taking the end point of the intersecting line segment as the central point, being vertical to the intersecting line segment, and prolonging the satellite scHalf of the breadth, generating a stripe q containing four verticesscIf the strip vertex is within the region target, then the extent direction extends the strip until four vertices are not within the region target, with the last determined strip labeled q'scAdding the strip to the overlay protocol F';
step 3.4: obtaining a residual uncovered area by subtracting the target area and the calculated strip area and then using O't minThe other satellites in (1) carry out simulation shooting on the uncovered area to calculate the covered strip, and then O 'is obtained't minCoverage scheme F' for the area. And adding the scheme F' into the scheme F, if no residual region exists, then F is the region multi-star coverage scheme and outputs, and if the residual region exists, turning to the step 4.
In the embodiment, the satellites in the visible satellite set are sequenced according to the optimized target, then each satellite is traversed in sequence to enable the current satellite to carry out simulated shooting on the target area, so that the coverage strip is obtained, and other satellites are used for carrying out simulated shooting on the rest area, so that a multi-satellite coverage scheme is obtained, and therefore a strip with the largest coverage can be selected quickly.
And 4, step 4: and repeating the steps 1 to 3 on the residual target area until the residual target area is completely covered or the end time of the regional target life cycle is reached.
The invention also provides a long-time large-area remote sensing satellite rapid coverage system, which comprises the following steps:
the remote sensing satellite visible time table building module is used for building a visible time table of a ground area target to be covered on the remote sensing satellite;
the computer-visible opportunity satellite module: determining a satellite set O 'of which the ground area target has the earliest visible opportunity in the life cycle according to the visible schedule of the ground area target to the remote sensing satellite't min
A simulated shooting strip covering module: for set of satellites O 'according to optimization target't minSequencing the satellites, and sequentially enabling each sequenced satellite to carry out simulated shooting on the current residual target area to obtain a shooting strip of each satellite and adding the shooting strip into the coverage scheme; the residual target area refers to a residual target area obtained by subtracting the covered strip from the residual target area of the previous satellite;
a remaining target area calculation module: for calculating satellite set O't minAll the satellites in the system simulate the residual target area after shooting the target area;
a coverage scheme output module: and the coverage scheme F is output until the residual target area is completely covered or the end time of the target life cycle of the area is reached.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (9)

1. A long-time large-area remote sensing satellite quick coverage method is characterized by comprising the following steps:
step 1, establishing a visible time table of a ground area target to a remote sensing satellite;
step 2: determining a satellite set O 'of the ground area target to be covered at the earliest visible opportunity in the life cycle of the ground area target according to the visible schedule of the ground area target to the remote sensing satellite'tmin
And step 3: according to an optimization target to satellite set O'tminSequencing the satellites, and sequentially enabling each sequenced satellite to carry out simulated shooting on the current residual target area to obtain a shooting strip of each satellite and adding the shooting strip into the coverage scheme; the current residual target area refers to a target area which is remained after the previous satellite subtracts the residual target area from the covered strip;
and 4, step 4: calculate satellite set O'tminAll the satellites in the system simulate the residual target area after shooting the target area;
and 5: and (3) repeating the steps 1 to 3 on the residual target area until the residual target area is completely covered or the end time of the regional target life cycle is reached, and outputting a covering scheme F.
2. The overlay method of claim 1 wherein the determination of the set of satellites for which the ground area target has the earliest opportunity to be seen during its lifetime in step 2 is:
step 2.1: determining a target area grid point set;
step 2.2: calculating the visible condition of the target area grid points in the satellite orbit period according to the determined target area grid point set;
step 2.3: calculating a visible satellite set of the target region at the moment t according to the visible condition of the target region in the satellite orbit period;
step 2.4: the set of satellites visible to the target area and the time are calculated from the set of visible satellites of the target area at time t.
3. The overlay method according to claim 2 wherein the method of determining the set of target area grid points in step 2.1 is:
taking the grid points covered by the target area as a grid point set P, and selecting characteristic grid points from the target area grid point set P through the orbital inclination angle of the satellite and the minimum satellite width to form a characteristic grid point set P', wherein
Figure FDA0003428258980000021
The characteristic grid points are latitude lines passing through the geometric center point of the target area, and the distance between the latitude lines and the grid points in the target area grid point set P is less than or equal to one grid size;
P′={p′1,p′2,p′3,...,p′n},
n is the number of characteristic grid points.
4. The overlay method according to claim 2 wherein the method of calculating visibility of the target area within the satellite orbit period in step 2.2 is:
inquiring a visible time table of the remote sensing satellite to obtain characteristic grid point p'i|p′iE P' visibility schedule M for all satellitesP′i
The set of visible schedules M for the set P' of target feature grid points of the ground area for all satellitesP′Union of visible schedules for each feature grid point
MP′=Mp′1∪Mp′2∪Mp′3...∪Mp′n|p′n∈P′。
5. The overlay method according to claim 2 wherein the method of calculating the set of visible satellites in the target area at time tmarget in step 2.3 is:
step 2.3.1 calculating pairs of feature grid points p 'at time t'iA set of satellites with a chance of being visible;
traverse feature grid point p'iVisibility schedule M for all satellitesP′i,MP′iEach element V inmDenotes a characteristic grid point p'iTo satellite smIs calculated at time t characteristic grid points p'iTo satellite smVisible timetable reference time t0mThe offset t';
t′=(t-t0m)/Tsm,Tsmis a satellite smThe orbital regression cycle of (1) in days;
if t' is equal to Dm|Dm∈VmThen satellite smAt time t to characteristic grid point p'iVisible, satellite smAdded to the characteristic grid point p 'at the time point t'iSet of visible satellites Sp′iIs prepared from p'iJoining satellites smSet of grid points visible at time t
Figure FDA0003428258980000022
DmRepresenting a satellite SmBasing feature grid points on time t0mThe visible offset within one orbit period is a set of natural numbers smaller than the orbit regression period;
step 2.3.2. calculate the set of satellites that have a visible chance at time t for the regional target.
Traverse MP′Then the set of satellites having a visible opportunity for the regional target at time point t is the intersection of the set of visible satellites at each feature grid point, denoted as Ot=Sp′1∩Sp′2∩Sp′2∩...∩Sp′n
6. The overlay method according to claim 2 wherein the method of calculating the earliest visible set of satellites to regional targets and time in step 2.4 is:
if the result is OtIf the number of the satellite sets is middle, the calculation is finished, and the satellite set which is visible earliest for the regional target is marked as O'tminThe earliest visible time is denoted as tmin
If O is presenttAdding t +1 to t, repeating step 2.3 to obtain the final product, wherein t +1 is not more than te,teThe end time of the time period required to be acquired in the current target area is represented, 1 unit is day, 1 day is represented, and the visible set O of the area targetst+1Until O is calculatedt+1Medium elements, or time conditions are not satisfied.
7. The overlay method according to claim 1, wherein the optimization goal in step 3 is: coverage first, time first, imaging quality first.
8. The covering method according to claim 7, wherein the specific method of step 3 is:
step 3.1: and if coverage is prioritized, the satellite set O 'visible to the regional target earliest'tminThe satellites in the satellite list are sorted from big to small according to the satellite width;
if time is first, to O'tminSorting from morning to evening according to the local time of the descending intersection point;
if imaging quality is prioritized, pair O'tminSorting according to the resolution from high to low;
step 3.2: go through O 'in turn'tminSatellite of (5), the current satellite being marked as scBy scAs the inclination angle, through scAt time tminOf visible grid point p'c|p′c∈PsctminCreating a straight line L and adding the straight line L into a straight line set L to form a satellite scA set of straight lines L with the orbit tilt angle as the tilt angle and passing through the visible grid points;
step 3.3: traversing L, calculating the distance between the straight line L I epsilon L and the intersecting line segment of the target area (if the length of the tangent intersecting line segment is 0), finding the longest intersecting line segment, taking the end point of the intersecting line segment as the central point, being vertical to the intersecting line segment, and prolonging the satellite scHalf of the breadth, generating a stripe q containing four verticesscIf the strip vertex is within the region target, then the extent direction extends the strip until four vertices are not within the region target, with the last determined strip labeled q'scAdding the strip to the overlay protocol F';
step 3.4: obtaining a residual uncovered area by subtracting the target area and the calculated strip area and then using O'tminThe other satellites in (1) carry out simulation shooting on the uncovered area to calculate the covered strip, and then O 'is obtained'tminAnd F 'covering the area, adding the scheme F' into the scheme F, if no residual area exists, then F is the multi-satellite covering scheme of the area and outputting, and if the residual area exists, turning to the step 4.
9. A long-time large-area remote sensing satellite rapid coverage system is characterized by comprising the following steps:
the remote sensing satellite visible time table building module is used for building a visible time table of ground area targets to the remote sensing satellite;
the computer-visible opportunity satellite module: satellite set O 'for determining earliest visible opportunity of ground area target to be covered in life cycle of ground area target according to visible schedule of ground area target to remote sensing satellite'tmin
A simulated shooting strip covering module: for set of satellites O 'according to optimization target'tminSequencing the satellites, and sequentially enabling each sequenced satellite to carry out simulated shooting on the current residual target area to obtain a shooting strip of each satellite and adding the shooting strip into the coverage scheme; the residual target area refers to a residual target area obtained by subtracting the covered strip from the residual target area of the previous satellite;
a remaining target area calculation module: for calculating satellite set O'tminAll the satellites in the system simulate the residual target area after shooting the target area;
a coverage scheme output module: and the coverage scheme F is output until the residual target area is completely covered or the end time of the target life cycle of the area is reached.
CN202111588040.9A 2021-12-23 2021-12-23 Long-time-period large-area remote sensing satellite rapid covering method and system Pending CN114330856A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111588040.9A CN114330856A (en) 2021-12-23 2021-12-23 Long-time-period large-area remote sensing satellite rapid covering method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111588040.9A CN114330856A (en) 2021-12-23 2021-12-23 Long-time-period large-area remote sensing satellite rapid covering method and system

Publications (1)

Publication Number Publication Date
CN114330856A true CN114330856A (en) 2022-04-12

Family

ID=81054204

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111588040.9A Pending CN114330856A (en) 2021-12-23 2021-12-23 Long-time-period large-area remote sensing satellite rapid covering method and system

Country Status (1)

Country Link
CN (1) CN114330856A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115426035A (en) * 2022-11-04 2022-12-02 中国人民解放军战略支援部队航天工程大学 Positioning initial value searching method and system based on subdivision grids
CN116740306A (en) * 2023-08-09 2023-09-12 北京空间飞行器总体设计部 Remote sensing satellite earth observation task planning method and device based on road network guidance

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115426035A (en) * 2022-11-04 2022-12-02 中国人民解放军战略支援部队航天工程大学 Positioning initial value searching method and system based on subdivision grids
CN115426035B (en) * 2022-11-04 2023-03-24 中国人民解放军战略支援部队航天工程大学 Positioning initial value searching method and system based on subdivision grids
CN116740306A (en) * 2023-08-09 2023-09-12 北京空间飞行器总体设计部 Remote sensing satellite earth observation task planning method and device based on road network guidance
CN116740306B (en) * 2023-08-09 2023-11-07 北京空间飞行器总体设计部 Remote sensing satellite earth observation task planning method and device based on road network guidance

Similar Documents

Publication Publication Date Title
CN114330856A (en) Long-time-period large-area remote sensing satellite rapid covering method and system
Mavromatidis et al. Evaluation of photovoltaic integration potential in a village
CN109165858B (en) Multi-satellite scheduling method for large-area target observation
Machete et al. The use of 3D GIS to analyse the influence of urban context on buildings’ solar energy potential
Bilitza et al. The international reference ionosphere today and in the future
CN111861230B (en) Disaster emergency-oriented multi-star collaborative observation task planning method and device
Partanen et al. Climate and health implications of future aerosol emission scenarios
CN109377075B (en) Task scheduling method based on look-ahead prediction
CN113343777B (en) Satellite rapid planning method and system for natural disaster emergency response
CN113568426B (en) Satellite cluster collaborative planning method based on multiple satellites and multiple loads
Santos et al. Solar potential analysis in Lisbon using LiDAR data
Koschny et al. Flux densities of meteoroids derived from optical double-station observations
Frank et al. Scheduling ocean color observations for a GEO-stationary satellite
CN111967734B (en) Method for planning earth observation requirement of micro-nano remote sensing network
Dewanto et al. Application of web 3D GIS to display urban model and solar energy analysis using the unmanned aerial vehicle (UAV) data (Case study: National Cheng Kung university buildings)
Paletta et al. Omnivision forecasting: combining satellite observations with sky images for improved intra-hour solar energy predictions
Achbab et al. Estimation of Photovoltaic Potential at the Urban Level from 3d City Model (Solar Cadaster): Case of Casablanca City, Morocco
CN116341873A (en) Multi-star resource scheduling and task planning method, system and storage medium
CN116205428A (en) Intelligent planning method and device for global multi-region satellite imaging task
Martín et al. Solar radiation interpolation
Niu et al. Multi-satellite observation scheduling for large area disaster emergency response
Murshed et al. Evaluation of Two Solar Radiation Algorithms on 3D City Models for Calculating Photovoltaic Potential.
Fincannon Lunar South Pole illumination: review, reassessment, and power system implications
CN112183921A (en) Monitoring task planning method and system for remote sensing satellite networking
Louie et al. Simulations Predicting the Ability of Multi-color Simultaneous Photometry to Distinguish TESS Candidate Exoplanets from False Positives

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination