CN111046320B - Dynamic allocation method for remote sensing satellite mission planning energy - Google Patents

Dynamic allocation method for remote sensing satellite mission planning energy Download PDF

Info

Publication number
CN111046320B
CN111046320B CN201911288508.5A CN201911288508A CN111046320B CN 111046320 B CN111046320 B CN 111046320B CN 201911288508 A CN201911288508 A CN 201911288508A CN 111046320 B CN111046320 B CN 111046320B
Authority
CN
China
Prior art keywords
energy
track
satellite
orb
nmax
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.)
Active
Application number
CN201911288508.5A
Other languages
Chinese (zh)
Other versions
CN111046320A (en
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.)
Nanjing University of Aeronautics and Astronautics
Original Assignee
Nanjing University of Aeronautics and Astronautics
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 Nanjing University of Aeronautics and Astronautics filed Critical Nanjing University of Aeronautics and Astronautics
Priority to CN201911288508.5A priority Critical patent/CN111046320B/en
Publication of CN111046320A publication Critical patent/CN111046320A/en
Application granted granted Critical
Publication of CN111046320B publication Critical patent/CN111046320B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • 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
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Physics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • General Engineering & Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Mathematical Analysis (AREA)
  • Software Systems (AREA)
  • Computational Mathematics (AREA)
  • Development Economics (AREA)
  • Databases & Information Systems (AREA)
  • Educational Administration (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Algebra (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention provides a dynamic allocation method of remote sensing satellite mission planning energy, which specifically comprises the following steps: according to the average starting time of each track of the satellite N track, the pre-planned starting time of the satellite on each track is used for judging whether dynamic energy allocation is needed, and if so, the track Orb with the largest residual redundant energy and the smallest circle number is selected Tmax And the track Orb with the largest number of objects to be drawn and the largest circle number Nmax The method comprises the steps of carrying out a first treatment on the surface of the Calculation of Orb Tmax The remaining redundant energy in the track needs to be allocated to Orb Nmax And is distributed in amounts; stopping energy distribution when the residual redundant energy in the track with the residual redundant energy is 0 or when the number of the to-be-drawn objects of the track with the to-be-drawn objects is 0, otherwise, entering a new round of energy distribution; and re-program the on-time per track of the satellite. The invention fully and efficiently utilizes satellite energy and improves satellite imaging mapping efficiency.

Description

Dynamic allocation method for remote sensing satellite mission planning energy
Technical Field
The invention belongs to the field of remote sensing satellite mission planning, and particularly relates to a dynamic allocation method of remote sensing satellite mission planning energy.
Background
Earth observation remote sensing satellites are used as artificial earth observation satellites for space remote sensing platforms, and have a large specific gravity among various satellites. The earth observation remote sensing satellite obtains information such as images and signals of ground targets by utilizing satellite-borne remote sensing loads, transmits the obtained information back to a satellite ground station or a relay satellite through radio waves, and obtains detailed data or information about the earth through analysis processing. The earth observation remote sensing satellite is not only applied to the aspects of environmental monitoring, weather forecast, homeland investigation and the like, but also applied to the fields of national defense and military, such as military reconnaissance, missile early warning, battlefield situation awareness and the like.
Under the condition that the remote sensing task is observed in the earth, the remote sensing satellite task planning and scheduling can be guaranteed, the satellite energy consumption can be saved, and the remote sensing satellite development cost can be reduced. In order to improve the imaging mapping efficiency and the in-orbit use efficiency of the remote sensing satellite, the satellite efficient task planning and scheduling are necessary. The overall utilization efficiency of satellite resources is effectively improved through a satellite multi-orbit energy dynamic allocation strategy by considering the constraints such as satellite load, satellite-ground resources and the like, the limited imaging capability of the satellite and the like, and the earth observation imaging time of the satellite is reduced, so that the satellite multi-orbit energy dynamic allocation strategy becomes a focus of attention of satellite task planning research.
Disclosure of Invention
The invention aims to: the invention provides a dynamic allocation method of remote sensing satellite mission planning energy, which aims to solve the problems that satellite energy cannot be fully utilized and the like in the prior art.
The technical scheme is as follows: the invention provides a dynamic allocation method of remote sensing satellite mission planning energy, which comprises the following steps:
step 1: according to the type and area of the target mapped by the remote sensing satellite on each circle of orbit, the starting time T of the remote sensing satellite on each of N circles of orbits is planned in advance i ，i＝1,2,…N；
Step 2: according to the preset monorail average startup time T of the remote sensing satellite mean Monorail maximum on time T max Judging whether the dynamic energy allocation is needed or not according to the number of the orbits and the preset startup time of the remote sensing satellites on each orbit, if not, not carrying out the dynamic energy allocation, otherwise, turning to the step 3;
step 3: according to T mean And T i Obtaining a track with residual redundant energy and a track with a target number to be drawn; the number of the to-be-drawn targets is an imaging target in seconds, and the residual redundant energy is the starting time in seconds;
step 4: selecting the track Orb with the most residual redundant energy and the smallest circle number Tmax And the track Orb with the largest number of objects to be drawn and the largest circle number Nmax ；
Step 5: according to Orb Tmax The remaining redundant energy in (a)With Orb Nmax Number of objects to be drawn in (B)Calculating the size of +.>Is required to be allocated to Orb Nmax Is a measure of (2); and will be +.>Distribution to Orb Nmax ；
Step 6: when the residual redundant energy in all the tracks with the residual redundant energy is 0, stopping energy distribution, and turning to the step 7, otherwise turning to the step 4; or stopping energy distribution when the number of the to-be-painted objects of the track with the number of the to-be-painted objects is 0, otherwise, turning to the step 4;
step 7: if the number of the mapping targets to be detected exists in the orbit at the moment and still exists in the orbit, subtracting the number of the mapping targets with the orbit from the preset starting time of the satellite on the orbit; the actual starting time of the satellite on the orbit is obtained, and the starting time of the satellite on the orbit is adjusted to be the actual starting time.
Further, the specific judging method in the step 2 is as follows: if it isThen energy allocation is required or else not.
Further, the specific method in the step 3 is as follows: determining a pre-planned time T of a satellite on an ith track i And T is mean If T is the size of i ＜T mean The track has residual redundant energy, and the residual redundant energy isIf T i ＞T mean The track has a number of objects to be painted, and the number of objects to be painted is
Further, the step 5 calculatesIs required to be allocated to Orb Nmax The amount of track; if it isThen indicate Orb Tmax Distribution of remaining redundant energy in a track to orbs Nmax After that there is a residual redundant energy, the residual amount is +.>If->All +.>Distribution to Orb Nmax A track; if->All +.>Distribution to Orb Nmax Track, and Orb Nmax Is still present->The number of drawing targets to be measured.
The beneficial effects are that: according to the power-on time per orbit obtained after the dynamic energy allocation strategy, the invention re-plans the power-on time per orbit of the satellite N orbit, thereby fully and efficiently utilizing the satellite energy and improving the imaging mapping efficiency of the satellite.
Drawings
FIG. 1 is a flow chart of the present invention.
Detailed Description
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention.
As shown in fig. 1, the present embodiment provides a dynamic allocation method of remote sensing satellite mission planning energy, which specifically includes:
step one, judging whether the imaging start-up time (the start-up time on average) of each track of the N tracks of the satellite is required to be dynamically allocated according to the imaging start-up time (the start-up time on average) of each track of the N tracks of the satellite. If yes, carrying out dynamic energy distribution, and entering a step two; if not, the dynamic energy distribution is not needed.
And step two, calculating the residual redundant energy and the number of objects to be drawn of each orbit of the satellite N orbit according to the average starting time of the satellite monorail.
Step three, calculating orbit Orb with maximum residual redundant energy and small orbit number in the satellite N orbits Tmax And the track Orb with the largest number of the to-be-drawn objects and the largest track number Nmax 。
Step four, according to the maximum starting time of the satellite monorail, the orbit Orb is started Tmax Dynamically allocating remaining redundant energy to track Orb Nmax Calculating the track Orb after distribution Tmax Possibly surplus energy and orbit Orb Nmax There is still a remaining number of objects to be painted.
Step five, stopping energy distribution when the residual redundant energy in all the tracks with the residual redundant energy is 0, and turning to step 6, otherwise turning to step 3; or stopping energy distribution when the number of the to-be-painted objects of the track with the number of the to-be-painted objects is 0, otherwise, turning to the step 3.
And step six, calculating the imaging time of each orbit of the satellite N orbit after dynamic energy distribution.
The number of the dynamic average orbits of the satellite energy sources is assumed to be N circles; satellite single-rail average start-up time T mean And monorail maximum on time T max (T max ＞T mean ) The method comprises the steps of carrying out a first treatment on the surface of the Single track bootable time of satellite N circle orbit preplanned is T i i.ltoreq.N (the pre-planned monorail bootable time is derived from the type and area of targets mapped by the satellite on each orbit). In this embodiment, satellite energy is selectedThe number of the dynamic distribution track turns is 10; satellite single-rail average start-up time T mean Presetting to 100s; and (5) pre-planning the starting time of each track of 10 circles of orbits of the satellite according to the maximum starting time 150s of the energy constraint monorail.
And judging whether the satellite pre-programs each track of starting time is required to be subjected to dynamic energy distribution. First, judgeWhether or not to be greater than NxT mean If yes, dynamic energy allocation is needed; if not, the dynamic energy distribution is not needed. If the dynamic energy distribution is needed, judging the single track start-up time T of N circles of track pre-planning i I is less than or equal to N and average startup time T of satellite per track mean Magnitude relation between the two. When T is i ≥T mean I is less than or equal to N, and the startup time of each track of N circles is enabled to be T mean . In this example, the total imaging number of 10 orbits of the satellite is 1023s and more than 1000s, so dynamic energy allocation is required.
According to the satellite single-rail average starting time T mean And the satellite N-circle orbit pre-planning start-up time T i I is less than or equal to N, and the residual redundant energy T of the partial orbit of the satellite N circles is calculated mean -T i (T mean ≥T i ) And the number of objects to be drawn T i -T mean (T i ≥T mean ). Calculating the orbit Orb corresponding to the most redundant energy source and the least orbit number in the N orbits of the satellite Tmax The most redundant energy left in the N circles of tracks isThe values were calculated as follows:
wherein, if T mean -T i If the track is positive, the track has redundant resources, and can be allocated to other tracks for imaging, and if the track is negative, the track needs additional resources for imaging; if it is zero, thenIndicating that the track is imaged without unwanted resources and without unwanted imaging targets.
Calculating the orbit Orb with the largest number of objects to be drawn and the largest orbit number in all orbits of the N circles of satellites Nmax The number of objects to be painted in the N circles of tracks is at mostThe values were calculated as follows:
and carrying out dynamic distribution of N circles of orbit energy sources of the satellite. If it isDescription of Orb Tmax The residual redundant energy of the track can be completely distributed to the Orb Nmax The orbit is used for imaging the target to be mapped, and Orb Nmax The track still has objects to be painted. Orb after dispensing Tmax The remaining redundant energy of the track is 0, orb Nmax The number of the drawing targets to be tested in the track is stillIf->Description of Orb Tmax The remaining redundant energy of the track can be partially distributed to Orb Nmax For imaging the object to be painted and Orb Tmax The track still has a residual source of energy. Orb after dispensing Tmax The residual redundant energy of the track is +.>Orb Nmax The track still has a number of objects to be painted of 0. If->Orb then Tmax The residual redundant energy of the track can be completely distributed to the Orb Nmax The track can be used entirely forImaging the drawing target to be measured.
Updating the residual redundant energy of each orbit of the satellite and the number of drawing targets to be tested, and judging whether the residual redundant energy of the N orbits of the satellite is at most 0 or whether the number of drawing targets to be tested of the N orbits of the satellite is at most 0. If yes, the satellite N-circle orbit has no residual energy distribution or the satellite N-circle orbit has no object to be painted to be imaged, and the satellite N-circle energy dynamic distribution is finished. If not, the dynamic energy distribution cycle is needed to be continued.
Calculating the monorail bootable time of the orbit with the to-be-painted object based on the number of objects still to be painted in the N circles of orbits of the satellite after the dynamic energy distribution and the pre-planned monorail boot time, wherein the monorail bootable time is equal to the monorail with the to-be-painted object still to be painted after the pre-planned monorail boot time is subtracted from the dynamic energy distribution; the monorail of the remaining redundant energy source track may be on for a constant period of time.
In this embodiment, the process of energy allocation is shown in the representation 1, the orbit with the most redundant energy and the smallest orbit number in the 10 orbits of the satellite is orbit 1, and the remaining redundant energy is 45s; the number of the drawing targets to be tested is the largest, the number of the tracks is the largest, namely the track 10, and the number of the drawing targets to be tested is 50s; after the first dynamic energy allocation, redundant energy still exists in the satellite orbit and a drawing target to be tested exists, which indicates that the dynamic energy allocation still needs to be carried out. After the fifth dynamic energy allocation, the dynamic energy allocation is completed if no redundant energy exists in the 10 circles of orbits of the satellite. The monorail of the remaining redundant energy tracks in the 10 circles of tracks can be started for a constant time, and the tracks with the number of objects to be painted are 7, 8, 9 and 10 respectively; the satellite on these orbits had on-times 118s,134s,140s and 145s in sequence.
TABLE 1
In addition, the specific features described in the above embodiments may be combined in any suitable manner without contradiction. The various possible combinations of the invention are not described in detail in order to avoid unnecessary repetition.

Claims (4)

1. The dynamic distribution method of the remote sensing satellite mission planning energy is characterized by comprising the following steps:
step 1, pre-planning the starting time T of the remote sensing satellite on each of N circles of orbits according to the type and the area of a target mapped on each circle of orbits by the remote sensing satellite i ，i＝1,2,…N；
Step 2: according to the preset monorail average startup time T of the remote sensing satellite mean Monorail maximum on time T max Judging whether the dynamic energy allocation is needed or not according to the number of the orbits and the preset startup time of the remote sensing satellites on each orbit, if not, not carrying out the dynamic energy allocation, otherwise, turning to the step 3;
step 3: according to T mean And T i Obtaining a track with residual redundant energy and a track with a target number to be drawn; the number of the to-be-drawn targets is an imaging target in seconds, and the residual redundant energy is the starting time in seconds;
step 4: selecting the track Orb with the most residual redundant energy and the smallest circle number Tmax And the track Orb with the largest number of objects to be drawn and the largest circle number Nmax ；
Step 5: according to Orb Tmax The remaining redundant energy in (a)With Orb Nmax The number of objects to be drawn->Calculating the size of +.>Is required to be allocated to Orb Nmax Is a measure of (2); and will be +.>Distribution to Orb Nmax ；
Step 6: when the residual redundant energy in all the tracks with the residual redundant energy is 0, stopping energy distribution, and turning to the step 7, otherwise turning to the step 4; or stopping energy distribution when the number of the to-be-painted objects of the track with the number of the to-be-painted objects is 0, otherwise, turning to the step 4;
step 7: if the number of the drawing targets to be tested still exists in the orbit at the moment, subtracting the number of the drawing targets to be tested in the orbit from the preset starting time of the satellite on the orbit; the actual starting time of the satellite on the orbit is obtained, and the starting time of the satellite on the orbit is adjusted to be the actual starting time.
2. The method for dynamically allocating remote sensing satellite mission planning energy according to claim 1, wherein the specific judging method in step 2 is as follows: if it isThen energy allocation is required or else not.
3. The method for dynamically distributing remote sensing satellite mission planning energy according to claim 1, wherein the specific method in the step 3 is as follows: determining a pre-planned time T of a satellite on an ith track i And T is mean If T is the size of i ＜T mean The track has residual redundant energy, and the residual redundant energy isIf T i ＞T mean The track has a number of objects to be painted, and the number of objects to be painted is +.>
4. A method for dynamic allocation of remote sensing satellite mission planning energy according to claim 3, wherein said step 5 calculatesIs required to be allocated to Orb Nmax The amount of track; if->Orb then Tmax Distribution of remaining redundant energy in a track to orbs Nmax After that, there is residual redundant energy, the residual quantity isIf->All +.>Distribution to Orb Nmax A track; if it isAll +.>Distribution to Orb Nmax Track, and Orb Nmax Still exists in (3)The number of drawing targets to be measured.
CN201911288508.5A 2019-12-12 2019-12-12 Dynamic allocation method for remote sensing satellite mission planning energy Active CN111046320B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911288508.5A CN111046320B (en) 2019-12-12 2019-12-12 Dynamic allocation method for remote sensing satellite mission planning energy

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911288508.5A CN111046320B (en) 2019-12-12 2019-12-12 Dynamic allocation method for remote sensing satellite mission planning energy

Publications (2)

Publication Number Publication Date
CN111046320A CN111046320A (en) 2020-04-21
CN111046320B true CN111046320B (en) 2023-10-13

Family

ID=70236445

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911288508.5A Active CN111046320B (en) 2019-12-12 2019-12-12 Dynamic allocation method for remote sensing satellite mission planning energy

Country Status (1)

Country Link
CN (1) CN111046320B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108335012A (en) * 2017-12-26 2018-07-27 佛山科学技术学院 A kind of intelligence remote sensing satellite stratification distributed freedom cotasking planning system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120029812A1 (en) * 2010-07-29 2012-02-02 King Abdul Aziz City For Science And Technology Method and system for automatically planning and scheduling a remote sensing satellite mission

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108335012A (en) * 2017-12-26 2018-07-27 佛山科学技术学院 A kind of intelligence remote sensing satellite stratification distributed freedom cotasking planning system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
马红梅 ; 项杰 ; 王昊 ; 李瑞琴 ; .一种基于DCSP模型的遥感卫星任务调度算法仿真与分析.制导与引信.2018,(第01期),全文. *

Also Published As

Publication number Publication date
CN111046320A (en) 2020-04-21

Similar Documents

Publication Publication Date Title
Pierro et al. Data-driven upscaling methods for regional photovoltaic power estimation and forecast using satellite and numerical weather prediction data
CN107864007B (en) Multi-satellite multi-ground station resource collaborative allocation management method for regional targets
CN112580906A (en) Satellite remote sensing task planning and ground resource scheduling combined solving method
CN107392382B (en) High-resolution geostationary orbit imaging satellite observation task planning method
CN110221321B (en) Calibration satellite ground application system and method
CN106793080A (en) It is a kind of based on hotspot can localization method offline
CN113132945B (en) Energy-saving scheduling method and system for railway private network base station cell
KR20160150039A (en) Gnss receiver with an on-board capability to implement an optimal error correction mode
Zheng et al. Forecast scheme and strategy for extended-range predictable components
Moldwin et al. The story of plumes: The development of a new conceptual framework for understanding magnetosphere and ionosphere coupling
CN112529437A (en) Multi-target satellite imaging planning method
CN111046320B (en) Dynamic allocation method for remote sensing satellite mission planning energy
CN109840360A (en) A kind of satellite faces constellation smallest size design method under the detection mode of side
CN115765041A (en) Electric energy scheduling method of photovoltaic charging station based on weather prediction
Madaus et al. Hyper-local, efficient extreme heat projection and analysis using machine learning to augment a hybrid dynamical-statistical downscaling technique
CN103558592B (en) A kind of satellite-borne SAR Echo searching method based on MPI parallel computation
CN101915904A (en) Multiple trajectory fusion processing method
CN113190911B (en) Regional multi-target satellite detection simulation method and system
CN104276293B (en) A kind of fast respone space system
Gu et al. Study on TT&C resources scheduling technique based on inter-satellite link
Corbin et al. Scheduling of twin telescopes and the impact on troposphere and UT1 estimation
CN102523058A (en) Three-dimensional communication model for predicting wireless signal intensity
Syed et al. Short term wind speed forecasting using hybrid elm approach
CN115879667A (en) Determination method of target constellation of observation task and observation task handover method
JP2019154213A (en) Solar power generation amount prediction device and solar power generation amount prediction system

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
GR01 Patent grant
GR01 Patent grant