CN116090695A - Regional target planning method and device - Google Patents
Regional target planning method and device Download PDFInfo
- Publication number
- CN116090695A CN116090695A CN202211532383.8A CN202211532383A CN116090695A CN 116090695 A CN116090695 A CN 116090695A CN 202211532383 A CN202211532383 A CN 202211532383A CN 116090695 A CN116090695 A CN 116090695A
- Authority
- CN
- China
- Prior art keywords
- visibility
- area
- region
- cellular
- regional
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000001413 cellular effect Effects 0.000 claims description 57
- 238000004364 calculation method Methods 0.000 claims description 17
- 238000012634 optical imaging Methods 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 230000001174 ascending effect Effects 0.000 claims description 3
- 238000009432 framing Methods 0.000 claims description 3
- 230000036632 reaction speed Effects 0.000 abstract description 5
- 238000000354 decomposition reaction Methods 0.000 description 10
- 238000003384 imaging method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000035484 reaction time Effects 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
Abstract
The invention provides a regional target planning method and a regional target planning device, which divide the whole world in advance according to a fixed scale, calculate and record the observation conditions of all honeycomb regions; for a region planning task, firstly, access conditions of all the honeycomb regions under the current scale contained in a task region are obtained, and an observation strip set is generated according to a specific rule and by adopting a greedy algorithm on the access conditions of all the honeycomb regions in the task region. The greedy algorithm selects the bands more simply and rapidly, and can generate the locally optimal regional co-observation scheme at a faster speed. Therefore, the reaction speed of the regional planning algorithm is limited to the second order, and the regional planning algorithm can adapt to regional target planning of different areas, and meets the requirements of small-range accurate observation and large-range wide-area search.
Description
Technical Field
The invention relates to the technical field of satellite remote sensing, in particular to a regional target planning method and device.
Background
Aiming at the problem of collaborative observation of an imaging satellite on a specific area, researchers in various countries currently propose various regional decomposition methods, which mainly comprise the following categories: the method is based on a point target coverage method of an independent scene, and the method decomposes a region into a set coverage problem according to the independent scene; secondly, decomposing the regional target into parallel strips with fixed width according to the satellite flight direction and imaging breadth by a strip decomposition method based on the fixed width; thirdly, converting a Gaussian projection area target from a geodetic coordinate system to a plane coordinate system by using a Gaussian projection area target, decomposing the target under the plane coordinate system, and converting the target under the geodetic coordinate system by using Gaussian back calculation; fourth, a single scene decomposition method based on a predefined reference system decomposes a regional target into a plurality of independent scenes according to a defined global reference system.
The defects and shortcomings of the method are mainly manifested in the following three points:
1. the target area of the treated area is relatively small;
2. the target decomposition error is larger for the region with larger longitude difference;
3. when the decomposition method of Gaussian projection is adopted, multiple Gaussian projections and inverse operation are required, so that the calculated amount is large and the efficiency is low.
Therefore, how to provide a more effective area target planning method is a problem to be solved at present.
Disclosure of Invention
In order to solve the problems, the invention provides a regional target planning method and a regional target planning device.
In a first aspect of an embodiment of the present invention, there is provided a method for planning an area target, including:
dividing the global cellular region according to the division standard;
visibility calculation and recording of each global cellular region;
performing honeycomb area matching on a task area to be observed;
inquiring the visibility of the honeycomb corresponding to the task area;
segmenting and sequencing the queried visibility records according to time;
selecting the bands according to a preset strategy and by adopting a greedy algorithm;
a multi-satellite cooperative observation scheme is generated.
Optionally, the step of dividing the global into cellular regions according to the division standard specifically includes:
the global cellular region division is carried out by adopting a military framing standard, and the size of the selected scale is 1:50000.
Optionally, the method for calculating the visibility of the honeycomb area specifically includes:
calculating satellite coverage areas in a specific time period according to the number of orbits, the orbit heights and the satellite loading capacity of the satellites;
and calculating the obtained cellular area covered by the satellite coverage area.
Optionally, the method for calculating the visibility of the cellular region further includes:
considering the requirements of the optical imaging satellite on the solar altitude angle, after the four corner points are calculated, calculating whether the solar altitude of the four corner points in the current time period meets the requirements or not;
and if all the satellites do not meet the solar altitude requirements, not calculating the visible conditions of the satellites to the current area in the current time period.
Optionally, the step of querying the visibility of the cell corresponding to the task area specifically includes:
taking out access conditions of the corresponding cellular areas according to satellite information and time period ranges;
grouping all access conditions to obtain access periods of all possible satellites to the current task area.
The step of segmenting and sequencing the queried visibility records according to time concretely comprises the following steps:
all the stripes are sorted in ascending order of access start time.
Optionally, the step of selecting the stripe according to a preset strategy and by adopting a greedy algorithm specifically includes:
selecting the side swing angle of the current processing strip at one time according to a preset strategy;
a greedy algorithm is used to generate a set of observation bands.
Optionally, after global honeycombed area partitioning, a larger honeycombed area includes a plurality of smaller honeycombed areas partitioned at smaller scale, and in calculating global honeycombed area visibility,
the visibility of the larger honeycombed area at the larger scale is calculated, and when the resultant satellite coverage area covers the honeycombed area, the visibility of the smaller honeycombed area at the smaller scale is calculated, and only if all the smaller honeycombed areas contained in one larger honeycombed area are covered, the larger honeycombed area is considered to be completely covered.
In a second aspect of the embodiment of the present invention, there is provided an area target planning apparatus,
the device comprises:
the honeycomb dividing unit is used for dividing the honeycomb region of the world according to the dividing standard;
a visibility calculation unit for calculating and recording the visibility of each of the global cellular regions;
the honeycomb dividing unit is also used for carrying out honeycomb region matching on the task region to be observed; the visibility query unit is used for querying the visibility of the honeycomb corresponding to the task area;
the visibility ordering unit is used for segmenting and ordering the queried visibility records according to time;
the strip selecting unit is used for selecting strips according to a preset strategy and by adopting a greedy algorithm;
and the scheme generating unit is used for generating a multi-satellite collaborative observation scheme.
In summary, the invention provides a method and a device for planning regional targets, which divide the whole world in advance according to a fixed scale, calculate and record the observation conditions of all the honeycomb regions; for a region planning task, firstly, access conditions of all the honeycomb regions under the current scale contained in a task region are obtained, and an observation strip set is generated according to a specific rule and by adopting a greedy algorithm on the access conditions of all the honeycomb regions in the task region. The greedy algorithm selects the bands more simply and rapidly, and can generate the locally optimal regional co-observation scheme at a faster speed. Therefore, the reaction speed of the regional planning algorithm is limited to the second order, and the regional planning algorithm can adapt to regional target planning of different areas, and meets the requirements of small-range accurate observation and large-range wide-area search.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method for planning an area target according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of satellite coverage areas for a particular time period according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of adjacent scale cellular area relationships according to an embodiment of the present invention;
fig. 4 is a functional block diagram of an area target planning apparatus according to an embodiment of the present invention.
Icon:
a cellular dividing unit 110; a visibility calculation unit 120; a visibility query unit 130; a visibility ordering unit 140; a strip selecting unit 150; the scheme generating unit 160.
Detailed Description
Aiming at the problem of collaborative observation of an imaging satellite on a specific area, researchers in various countries currently propose various regional decomposition methods, which mainly comprise the following categories: the method is based on a point target coverage method of an independent scene, and the method decomposes a region into a set coverage problem according to the independent scene; secondly, decomposing the regional target into parallel strips with fixed width according to the satellite flight direction and imaging breadth by a strip decomposition method based on the fixed width; thirdly, converting a Gaussian projection area target from a geodetic coordinate system to a plane coordinate system by using a Gaussian projection area target, decomposing the target under the plane coordinate system, and converting the target under the geodetic coordinate system by using Gaussian back calculation; fourth, a single scene decomposition method based on a predefined reference system decomposes a regional target into a plurality of independent scenes according to a defined global reference system. The defects and shortcomings of the method are mainly manifested in the following three points:
1. the target area of the treated area is relatively small;
2. the target decomposition error is larger for the region with larger longitude difference;
3. when the decomposition method of Gaussian projection is adopted, multiple Gaussian projections and inverse operation are required, so that the calculated amount is large and the efficiency is low.
Therefore, how to provide a more effective area target planning method is a problem to be solved at present.
In view of the above, the designer designs a regional target planning method and a regional target planning device, which aim to limit the reaction speed of the regional target planning method to the second order, adapt to regional target planning of different areas and meet the requirements of small-range accurate observation and large-range wide-area search.
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. The components of the embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the invention, as presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
In the description of the present invention, it should be noted that, directions or positional relationships indicated by terms such as "top", "bottom", "inner", "outer", etc., are directions or positional relationships based on those shown in the drawings, or those that are conventionally put in use, are merely for convenience in describing the present invention and simplifying the description, and do not indicate or imply that the apparatus or elements referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and the like, are used merely to distinguish between descriptions and should not be construed as indicating or implying relative importance.
In the description of the present invention, it should also be noted that, unless explicitly specified and limited otherwise, the terms "disposed," "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; can be directly connected or indirectly connected through an intermediate medium, and can be communication between two elements. The specific meaning of the above terms in the present invention will be understood in specific cases by those of ordinary skill in the art.
It should be noted that, without conflict, the embodiments of the present invention and features of the embodiments may be combined with each other.
Examples
Referring to fig. 1, a method for planning an area target according to an embodiment of the invention includes:
step S101, dividing the global cellular region according to the division standard;
the regional target planning algorithm based on the global cellular region firstly adopts the military framing standard to divide the global cellular region, and the selection of the scale is both compatible with the precision and compatible with the data quantity.
As a preferred embodiment, the algorithm selects a scale of 1:50000, at which the world is divided into about 100 more than ten thousand cellular areas of about 22km 17.8 km. The method comprises the steps of carrying out a first treatment on the surface of the
Step S102, calculating and recording the visibility of each global cellular region.
Based on the above-mentioned dividing mode, the visibility of the global cellular region is pre-calculated, that is, the access condition of the satellite to the ground target in a specific time period in the future is pre-calculated, the calculated result is recorded, and the data is updated periodically for the subsequent regional target planning.
As a preferred embodiment, the method of calculating the visibility of the honeycomb region is:
calculating satellite coverage areas in a specific time period according to the number of orbits, the orbit heights and the satellite loading capacity of the satellites;
and calculating the obtained cellular area covered by the satellite coverage area.
Calculation of satellite coverage area for a particular time period as shown in figure 3, the amount of data per day is about 190 ten thousand if calculated at 1000km of maximum satellite coverage (about 90 ten thousand for optical imaging satellites due to solar altitude limitations). The update data time is limited in access computing capacity, and is calculated by 20 access computing nodes, and the update data of one day takes about 2-3 minutes.
The visibility of the space position is calculated in the process, the requirement of the optical imaging satellite on the solar altitude angle is considered, after the four corner points are calculated, whether the solar altitude of the four corner points in the current time period meets the requirement is firstly calculated, and if the solar altitude requirement is not met, the visible condition of the satellite on the current area in the current time period is not calculated.
Further, as a preferred embodiment, visibility analysis is performed on all point objects that need to be computed by parallel object access computation. The specific calculation mode is as follows:
the plurality of business software can send calculation applications to the parallel calculation scheduling server at the same time, and the parallel calculation scheduling server inquires corresponding node information from the database server according to the calculation applications. And then the corresponding access computing tasks are distributed to a plurality of access computing nodes in parallel, and finally the calculated return structures are sent to the corresponding service software.
Step S103, performing honeycomb area matching on the task area to be observed.
After receiving a new observation task, carrying out honeycomb area matching on a task area to be observed according to the previous division mode to obtain the range of the task area.
Step S104, inquiring the visibility of the honeycomb corresponding to the task area.
And acquiring access conditions of all the cellular areas under the current scale contained in the area through inquiry. The specific method is as follows:
and according to the range of the task area, calculating all the honeycombed areas in the range of the current area, and taking out the access condition of all the honeycombed areas according to the satellite information and the time period range. Grouping all access conditions to obtain access periods of all possible satellites to the current task area.
Step S105, the queried visibility records are segmented and ordered according to time.
All the stripes are sorted in ascending order of access start time.
Step S106, selecting the bands according to a preset strategy and by adopting a greedy algorithm.
And selecting the roll angle of the current processing strip at one time according to a preset strategy, and generating an observation strip set according to a specific rule and a greedy algorithm on the access condition of all the cellular areas.
The greedy algorithm is selected as the algorithm for generating the collaborative scheme, because the greedy algorithm is simpler and quicker to select the stripes, and can generate the locally optimal regional collaborative observation scheme at a faster speed. On the premise of adopting a greedy algorithm, the observation condition of the 24h region is calculated, and the reaction time is in the order of seconds.
And step S107, generating a multi-satellite collaborative observation scheme.
It should be noted that, according to the above procedure, there is a contradiction between the preparation data duration and the stripe accuracy. If the scale is small, the area of each cellular region is small, the number of the global cellular regions is large, the data quantity prepared in advance is large, but the stripe precision is high; if the scale is large, the area of each corresponding cellular region is large, the number of global cellular regions is small, the amount of data prepared in advance is small, but the stripe accuracy is low. In order to solve the contradiction, the embodiment of the invention also provides a honeycomb area pyramid algorithm.
After global cellular region division, a larger cellular region includes a plurality of smaller cellular regions divided by smaller scale, the visibility of the larger cellular region at a larger scale is calculated when the global cellular region visibility is calculated, and the visibility of the smaller cellular region at a smaller scale is calculated when the cellular region covered by the satellite coverage area is calculated, and only if all the smaller cellular regions contained in one larger cellular region are covered, the larger cellular region is considered to be completely covered.
The specific algorithm is that when the access condition of the global honeycombed area is calculated in advance, the adopted scale is larger, the number of the global honeycombed areas is small, the access calculation is carried out on all the global honeycombed areas, and the access calculation result is recorded; when the area planning calculation task area is calculated corresponding to the access condition of the honeycomb area, the adopted scale is smaller, and the precision is high. A larger honeycombed area is considered to be fully covered only if all of the smaller honeycombed areas contained within that larger honeycombed area are covered. Taking 1:25000 and 1:50000 as examples, each 1:50000 honeycomb area is composed of 4 1:25000 small honeycomb areas, as shown in fig. 3. In the treatment, only 4 small honeycomb areas of 1:25000 were covered, and the honeycomb areas of 1:50000 were considered to be completely covered.
According to the regional target planning method provided by the embodiment, the global is divided in advance according to a fixed scale, and the observation conditions of all the honeycomb regions are calculated and recorded; for a region planning task, firstly, access conditions of all the honeycomb regions under the current scale contained in a task region are obtained, and an observation strip set is generated according to a specific rule and by adopting a greedy algorithm on the access conditions of all the honeycomb regions in the task region. The greedy algorithm selects the bands more simply and rapidly, and can generate the locally optimal regional co-observation scheme at a faster speed. Therefore, the reaction speed of the regional planning algorithm is limited to the second order, and the regional planning algorithm can adapt to regional target planning of different areas, and meets the requirements of small-range accurate observation and large-range wide-area search.
As shown in fig. 4, the area target planning device provided by the embodiment of the present invention includes:
a cellular division unit 110 for dividing a cellular region of the world according to a division standard;
a visibility calculation unit 120 for calculating and recording the visibility of each of the global cellular regions;
the cellular dividing unit 110 is further configured to perform cellular region matching on a task region to be observed;
a visibility query unit 130, configured to query the visibility of the cell corresponding to the task area;
a visibility ranking unit 140 for segmenting and ranking the queried visibility records by time;
the stripe selecting unit 150 is configured to perform stripe selection according to a preset policy and by adopting a greedy algorithm;
and a scheme generating unit 160 for generating a multi-satellite cooperative observation scheme.
The area target planning device provided by the embodiment of the invention is used for realizing the area target planning method, so that the specific implementation manner is the same as the method and is not repeated here.
In summary, the invention provides a method and a device for planning regional targets, which divide the whole world in advance according to a fixed scale, calculate and record the observation conditions of all the honeycomb regions; for a region planning task, firstly, access conditions of all the honeycomb regions under the current scale contained in a task region are obtained, and an observation strip set is generated according to a specific rule and by adopting a greedy algorithm on the access conditions of all the honeycomb regions in the task region. The greedy algorithm selects the bands more simply and rapidly, and can generate the locally optimal regional co-observation scheme at a faster speed. Therefore, the reaction speed of the regional planning algorithm is limited to the second order, and the regional planning algorithm can adapt to regional target planning of different areas, and meets the requirements of small-range accurate observation and large-range wide-area search.
In addition, the functional modules in the embodiments of the present application may be integrated together to form a single part, or each module may exist alone, or two or more modules may be integrated to form a single part.
Claims (8)
1. A method for planning an area target, the method comprising:
dividing the global cellular region according to the division standard;
visibility calculation and recording of each global cellular region;
performing honeycomb area matching on a task area to be observed;
inquiring the visibility of the honeycomb corresponding to the task area;
segmenting and sequencing the queried visibility records according to time;
selecting the bands according to a preset strategy and by adopting a greedy algorithm;
a multi-satellite cooperative observation scheme is generated.
2. The regional goal planning method according to claim 1, wherein the step of dividing the global cellular region according to the division criteria specifically comprises:
the global cellular region division is carried out by adopting a military framing standard, and the size of the selected scale is 1:50000.
3. The area target planning method according to claim 2, characterized in that the method for calculating the visibility of the cellular area specifically comprises:
calculating satellite coverage areas in a specific time period according to the number of orbits, the orbit heights and the satellite loading capacity of the satellites;
and calculating the obtained cellular area covered by the satellite coverage area.
4. The area target planning method of claim 3, wherein the method of calculating the visibility of the cellular area further comprises:
considering the requirements of the optical imaging satellite on the solar altitude angle, after the four corner points are calculated, calculating whether the solar altitude of the four corner points in the current time period meets the requirements or not;
and if all the satellites do not meet the solar altitude requirements, not calculating the visible conditions of the satellites to the current area in the current time period.
5. The regional goal planning method according to claim 4, wherein the step of querying the visibility of the cell corresponding to the task region specifically includes:
taking out access conditions of the corresponding cellular areas according to satellite information and time period ranges;
grouping all access conditions to obtain access periods of all possible satellites to the current task area.
The step of segmenting and sequencing the queried visibility records according to time concretely comprises the following steps:
all the stripes are sorted in ascending order of access start time.
6. The regional goal planning method according to claim 5, wherein the step of selecting the strips according to a preset strategy and using a greedy algorithm specifically comprises:
selecting the side swing angle of the current processing strip at one time according to a preset strategy;
a greedy algorithm is used to generate a set of observation bands.
7. The regional goal planning method of claim 6, wherein after global cellular region division, a larger cellular region comprises a plurality of smaller cellular regions divided by smaller scale, and when calculating global cellular region visibility, the visibility of the larger cellular region at a larger scale is calculated, and when calculating cellular regions covered by the obtained satellite coverage region, the visibility of the smaller cellular region at a smaller scale is calculated, and only if all of the smaller cellular regions contained in one larger cellular region are covered, the larger cellular region is considered to be completely covered.
8. An area target staging apparatus, the apparatus comprising:
the honeycomb dividing unit is used for dividing the honeycomb region of the world according to the dividing standard;
a visibility calculation unit for calculating and recording the visibility of each of the global cellular regions;
the honeycomb dividing unit is also used for carrying out honeycomb region matching on the task region to be observed;
the visibility query unit is used for querying the visibility of the honeycomb corresponding to the task area;
the visibility ordering unit is used for segmenting and ordering the queried visibility records according to time;
the strip selecting unit is used for selecting strips according to a preset strategy and by adopting a greedy algorithm;
and the scheme generating unit is used for generating a multi-satellite collaborative observation scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211532383.8A CN116090695A (en) | 2022-12-01 | 2022-12-01 | Regional target planning method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211532383.8A CN116090695A (en) | 2022-12-01 | 2022-12-01 | Regional target planning method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116090695A true CN116090695A (en) | 2023-05-09 |
Family
ID=86187650
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211532383.8A Pending CN116090695A (en) | 2022-12-01 | 2022-12-01 | Regional target planning method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116090695A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011089477A1 (en) * | 2010-01-25 | 2011-07-28 | Tarik Ozkul | Autonomous decision system for selecting target in observation satellites |
| CN109165858A (en) * | 2018-09-05 | 2019-01-08 | 中国人民解放军国防科技大学 | Multi-satellite scheduling method for large-area target observation |
| CN109636214A (en) * | 2018-12-19 | 2019-04-16 | 航天恒星科技有限公司 | A kind of fast worktodo planing method towards multi-source earth observation satellite |
| CN114266137A (en) * | 2021-11-29 | 2022-04-01 | 航天科工海鹰集团有限公司 | Constellation region target side-sway angle scheduling method based on greedy algorithm |
| CN114462681A (en) * | 2022-01-11 | 2022-05-10 | 武汉大学 | Task preprocessing method and system for hypersensitive short satellite multi-class target imaging integrated planning |
-
2022
- 2022-12-01 CN CN202211532383.8A patent/CN116090695A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011089477A1 (en) * | 2010-01-25 | 2011-07-28 | Tarik Ozkul | Autonomous decision system for selecting target in observation satellites |
| CN109165858A (en) * | 2018-09-05 | 2019-01-08 | 中国人民解放军国防科技大学 | Multi-satellite scheduling method for large-area target observation |
| CN109636214A (en) * | 2018-12-19 | 2019-04-16 | 航天恒星科技有限公司 | A kind of fast worktodo planing method towards multi-source earth observation satellite |
| CN114266137A (en) * | 2021-11-29 | 2022-04-01 | 航天科工海鹰集团有限公司 | Constellation region target side-sway angle scheduling method based on greedy algorithm |
| CN114462681A (en) * | 2022-01-11 | 2022-05-10 | 武汉大学 | Task preprocessing method and system for hypersensitive short satellite multi-class target imaging integrated planning |
Non-Patent Citations (1)
| Title |
|---|
| 杨纪伟等: "基于全球网格的卫星成像区域目标规划算法", 《航天器工程》, vol. 30, no. 01, pages 31 - 37 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109165858B (en) | Multi-satellite scheduling method for large-area target observation | |
| CN101604018B (en) | Method and system for processing high-definition remote sensing image data | |
| CN106780416B (en) | Method and device for planning path by using vector topographic map | |
| CN101479622A (en) | System and method for positioning in configured environments | |
| CN109916413A (en) | Road matching method, system, device and storage medium based on grid dividing | |
| CN1897559A (en) | Automatic guiding method | |
| CN115454148B (en) | Method, medium and device for planning coverage path of fixed wing cluster unmanned aerial vehicle area | |
| Nardin et al. | Contact plan design for GNSS constellations: A case study with optical intersatellite links | |
| CN114679214A (en) | Method and system for calculating number of satellites visible to user, electronic equipment and storage medium | |
| CN116090695A (en) | Regional target planning method and device | |
| CN117580054A (en) | NTN cell construction method, device, equipment and medium based on use demand data | |
| Walton | Models for the management of satellite-based sensors | |
| Malladi et al. | Satellite constellation image acquisition problem: A case study | |
| CN112232649A (en) | Task processing evaluation method, system and equipment | |
| CN115792963A (en) | Ionized layer correction method based on GIM (global information model), electronic equipment and storage medium | |
| CN114489068A (en) | Routing method and device for routing inspection task path of inspection robot under complex path | |
| CN111578945A (en) | Unmanned aerial vehicle track planning method based on GNSS-machine vision | |
| CN116484118B (en) | Unmanned aerial vehicle flight environment data service system and method | |
| Kigawa et al. | An algorithm for correction of lunar contamination in AMSU-A data | |
| KR20040003549A (en) | Method, device and system for providing location information using map information | |
| Wu et al. | ROCSAT-2 imaging planning and scheduling | |
| Southwould et al. | Behind the Scenes: Geospatial Technologies Used at Branch SAR | |
| Watkins et al. | Evaluation of IGS orbits with satellite laser ranging | |
| Pereira | Multi-objective design of next-generation GNSS | |
| CN116129677A (en) | Flight plan generation method, flight plan generation device, computer equipment and storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230509 |