CN108988933B - Satellite data receiving window global optimization distribution method - Google Patents
Satellite data receiving window global optimization distribution method Download PDFInfo
- Publication number
- CN108988933B CN108988933B CN201810832417.2A CN201810832417A CN108988933B CN 108988933 B CN108988933 B CN 108988933B CN 201810832417 A CN201810832417 A CN 201810832417A CN 108988933 B CN108988933 B CN 108988933B
- Authority
- CN
- China
- Prior art keywords
- receiving
- satellite
- allocation
- global
- receiving station
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention discloses a global optimization allocation method for satellite data receiving windows, which aims at the problem of joint optimization allocation of multi-observation satellites by multi-receiving station data receiving windows, adopts a method of traversing the whole solution space to obtain an optimal solution, and firstly carries out clustering processing on single receiving station data receiving windows to form a conflict group and generates an allocation scheme in the conflict group; secondly, combining the conflict group allocation schemes in the receiving station and among the receiving stations to generate a global data receiving resource allocation scheme; then, screening out unreasonable distribution combinations under the satellite receiving resource balancing and receiving station load balancing criteria; and finally, selecting an optimal allocation scheme based on the task scheduling rate, wherein the method has the characteristics of global optimization, high resource utilization rate and the like, and is suitable for solving the problem of optimal allocation of large-scale satellite data receiving resources under the condition of sufficient computing resources or solving the problem of optimal allocation of small-scale satellite data receiving resources under the condition of limited computing resources.
Description
Technical Field
The invention relates to a satellite data receiving window global optimization distribution method based on conflict groups and task scheduling rates, which is particularly suitable for the field of large-scale satellite data receiving resource optimization distribution under the condition of sufficient computing resources or the field of small-scale satellite data receiving resource optimization distribution under the condition of limited computing resources.
Background
The space mission planning plays a key role in the whole observation satellite service application process, and realizes effective allocation and scheduling of observation satellite resources and data receiving resources according to the observation mission so as to complete the observation requirement submitted by a user to the maximum extent, and the result directly influences the mission execution effect of the observation satellite system.
The present invention generally relates to optimized allocation and scheduling of data reception resources. According to the observation task, the satellite resources and the receiving station resources, firstly, the data receiving windows of the satellite resources and the receiving station resources are calculated, then, the joint distribution and the scheduling are carried out on all the data receiving windows, and a conflict-free receiving window optimized distribution scheme is generated. The data reception resource allocation problem can be modeled as an optimization problem and can be solved by adopting various optimization algorithms. The optimization algorithm can be essentially divided into an optimization algorithm, a rule-based heuristic algorithm and an intelligent optimization algorithm, the optimization algorithm has the characteristics of high time complexity and capability of obtaining an optimal solution, the optimization problem of small-scale optimization is usually solved by limiting computing resources in the past, and the application scale of the optimization method is gradually increased along with the mature application of parallel computing and cloud computing technologies at present; the heuristic algorithm based on the rules has the characteristics of simplicity, intuition, convenience in implementation, high operation efficiency and the like, but generally cannot obtain an optimal solution; the intelligent optimization algorithm comprises a simulated annealing algorithm, a tabu search algorithm, a genetic algorithm and the like, has strong capability in solving the problem of combinatorial optimization, has time complexity between the optimization algorithm and a heuristic algorithm, and generally cannot obtain an optimal solution.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a satellite data receiving window optimal distribution method based on conflict groups and task arrangement rate, which is used for avoiding the defects of a rule-based heuristic algorithm and an intelligent optimization algorithm in the background art. The method has the characteristics of high resource utilization rate, capability of obtaining an optimal solution, capability of running in parallel in the solving process and the like.
The technical problem to be solved by the invention is realized by the following technical scheme:
a satellite data receiving window global optimization distribution method comprises the following steps:
(1) calculating a data receiving window according to the number of the satellite orbits and the geographic position of a receiving station, and loading a satellite observation task;
(2) clustering processing is carried out on a data receiving window of a single receiving station to generate a conflict group and an allocation scheme in the conflict group;
(3) combining the conflict group distribution schemes in each receiving station to generate a single receiving station distribution scheme, and combining a plurality of receiving station distribution schemes to generate a global distribution scheme;
(4) screening out unreasonable distribution schemes in the global distribution scheme under the satellite data receiving resource balancing and receiving station load balancing criteria;
(5) establishing a mapping relation between the observation task and the data receiving window according to the satellite for each distribution scheme in the rest global distribution schemes;
(6) calculating the task scheduling rate of each satellite in each global distribution scheme, and selecting an optimal global distribution scheme under the satellite task scheduling rate balance criterion;
and completing satellite data receiving window optimized distribution.
Wherein, the step (3) is specifically as follows:
the global allocation scheme number N of all receiving station combinations in one data receiving window allocation period is:
wherein m isjThe number of collision groups corresponding to the jth receiving station;
the number of allocation schemes corresponding to the ith collision group of the jth receiving station; mjThe number of the distribution schemes corresponding to the jth receiving station; j ═ 1,2, …, l; 1,2, …, mj(ii) a l is the number of receiving stations.
Wherein, the step (6) of selecting the optimal global distribution scheme under the satellite task scheduling rate balance criterion specifically comprises the following steps:
firstly, under the balance rule of the satellite task scheduling rate, selecting a global distribution scheme meeting the following conditions
Wherein the content of the first and second substances,
representing the task scheduling rate of the kth satellite in the p allocation scheme, D (-) represents the variance, the smaller the value of the variance is, the more fair the data receiving resource allocation among the satellites is, s represents the total number of the satellites, and delta represents the threshold value;
assuming that the number of allocation schemes satisfying the above condition is N ', the following formula is satisfied by selecting from the N' combinations
The allocation scheme of (a) is an optimal global allocation scheme.
Compared with the background technology, the invention has the following advantages:
1. the invention searches the optimal solution in the whole solution space, and can realize the optimal utilization of the data receiving resource;
2. from the practical application point of view, the invention considers the lower limit of the single-satellite data receiving resource and the upper limit of the receiving load of a single receiving station in the process of allocating the data receiving resource;
3. in the invention, the processes of generating the distribution scheme in the conflict group, generating the distribution scheme in the receiving station, generating the global distribution scheme between the receiving stations, calculating the task scheduling rate and the like can be processed in parallel, so that the time complexity in the optimizing process can be reduced;
drawings
FIG. 1 illustrates a global allocation scheme for all receiving stations according to the present invention;
FIG. 2 illustrates the distribution of conflicting groups within a single receiving station in accordance with the present invention
FIG. 3 is a partial allocation scheme within a conflict group of the present invention;
FIG. 4 is a partial allocation scheme for a single receiving station according to the present invention;
FIG. 5 is a mapping relationship between a single-star observation task and a data receiving window according to the present invention.
Detailed Description
The present invention will be further described with reference to fig. 1 to 5.
A satellite data receiving window global optimization distribution method comprises the following steps:
(1) and calculating a data receiving window according to the number of the satellite orbits and the geographic position of the receiving station, and loading the satellite observation task.
(2) And clustering the data receiving windows of the single receiving stations to generate conflict groups and distribution schemes in the conflict groups. It is assumed that each receiving station has only one data-transmission receiving antenna and the shortest adjacent receiving window interval is Δ T. And for the same receiving station, if the interval between the adjacent receiving windows is less than delta T, the receiving windows are classified as a receiving window collision group. Then, the interval between two adjacent collision groups is greater than or equal to Δ T, i.e. the receiving window allocations between adjacent collision groups do not affect each other, as shown in fig. 2. For each conflict group, several allocation schemes can be obtained under the maximum use criterion of the first allocated receiving window, taking conflict group 1 in fig. 2 as an example, five allocation schemes exist, such as a, b, c, d, e, and the like, as shown in fig. 3, and the dark receiving window in fig. 3 is a window finally allocated after conflict resolution.
(3) The allocation schemes of the conflict groups in each receiving station are combined to generate a single-receiving-station allocation scheme, the allocation schemes of the multiple receiving stations are combined to generate a global allocation scheme, and the j (j is 1,2, …, l) th receiving station is assumed to have l receiving stationsThe number of collision groups corresponding to a station is mjI (i ═ 1,2, …, m) of j-th receiving stationj) The number of the distribution schemes corresponding to each conflict group is ni jAnd (4) respectively. Then, the number N of global allocation schemes generated by all receiving stations in one receiving window allocation period is:
where M isjThe number of allocation schemes corresponding to the j (j ═ 1,2, …, l) th receiving station. The combination of the partial allocation schemes for the jth receiving station is shown in fig. 4, where
Represents the u-th (u-1, 2, …, m)j) V th in a conflict group
An allocation scheme, a complete path in the figure (containing m)jCircles) represents an allocation scheme for the jth receiving station; the global allocation scheme combinations for all receiving stations are shown in fig. 1, where
The y (y) th (1, 2, …, M) of the x (x) th (1, 2, …, l) th receiving stationl) One complete path (containing l circles) represents a global allocation scheme for all receiving stations.
(4) Under the criteria of satellite receiving resource balance and receiving station load balance, unreasonable distribution schemes are screened out in the global distribution scheme. For each of the above N global allocation schemes, the total length of the receive window obtained by a single satellite is first calculated
(k is 1,2, …, s, where s represents the total number of satellites, and p is 1,2, …, N), if a satellite simultaneously obtains the receiving windows of multiple receiving stations, the overlapping time windows need to be deduplicated, that is, a satellite only transmits data to one receiving station at the same time; then, the total length of the receiving window needed to be completed by the single receiving station is calculated
(j-1, 2, …, l, p-1, 2, …, N). Suppose that the lower limit of the single-satellite receiving window in one receiving window distribution period is SatminThe upper limit of the receiving window of the receiving station is StamaxThen a global allocation scheme that satisfies one of the following conditions is considered an unreasonable combination, sifting out:
under the condition 1, the method of producing,
under the condition 2, the content of the organic solvent,
the number of global allocation schemes remaining after the sifting is set to N ', obviously N' ≦ N.
(5) For each of the remaining N' global assignments, a mapping is established between observation tasks and receive windows per satellite. The mapping relationship between the single-star observation tasks and the data receiving window is processed sequentially from front to back in time sequence, as shown in fig. 5, in the figure, the observation tasks 1 and 2 are played back in the receiving window a, the observation tasks 3, 4 and 5 are played back in the receiving window B, the observation tasks 6, 7, 8 and 9 are played back in the receiving window C, and the observation task 10 is not arranged to be played back.
(6) Calculating the task scheduling rate of each satellite in each global distribution scheme:
where c iskRepresents the k < th >k is 1,2, …, s) number of observation tasks of the satellite,
representing the number of scheduled observations for playback for the kth satellite in the p-th allocation,
representing the mission scheduling rate of the kth satellite in the pth allocation scheme, it is clear
Then, firstly, under the balance criterion of the satellite task scheduling rate, selecting a global distribution scheme meeting the following conditions
Here, D (-) represents a variance, the smaller the value of which is, the more fair the distribution of the reception resources among the satellites is, and δ represents a threshold value, which is a value taken depending on the actual engineering application. Assuming that the number of allocation schemes satisfying the above condition is N '(N' ≦ N '), then selecting N' combinations satisfying the above condition
The allocation scheme of (a) is an optimal global allocation scheme.
Claims (1)
1. A satellite data receiving window global optimization distribution method is characterized by comprising the following steps:
(1) calculating a data receiving window according to the number of the satellite orbits and the geographic position of a receiving station, and loading a satellite observation task;
(2) clustering processing is carried out on a data receiving window of a single receiving station to generate a conflict group and an allocation scheme in the conflict group; the specific implementation manner of generating the conflict group is as follows: for the same receiving station, if the interval between adjacent receiving windows is less than delta T, the receiving windows are classified as a receiving window conflict group, wherein the delta T is the shortest interval between adjacent receiving windows of only one data transmission receiving antenna of the receiving station; the specific implementation mode for generating the distribution scheme in the conflict group is as follows: aiming at each conflict group, under the maximum use criterion of a receiving window allocated for the first time, utilizing the transverse sliding of delta T on a time axis and obtaining a plurality of allocation schemes based on the cutting of the receiving window;
(3) combining the conflict group distribution schemes in each receiving station to generate a single receiving station distribution scheme, and combining a plurality of receiving station distribution schemes to generate a global distribution scheme; the specific implementation manner of the global allocation scheme is as follows:
the global allocation scheme number N of all receiving station combinations in one data receiving window allocation period is:
wherein m isjThe number of collision groups corresponding to the jth receiving station;
the number of allocation schemes corresponding to the ith collision group of the jth receiving station; mjThe number of the distribution schemes corresponding to the jth receiving station; j ═ 1,2, …, l; 1,2, …, mj(ii) a l is the number of receiving stations;
(4) screening out unreasonable distribution schemes in the global distribution scheme under the satellite data receiving resource balancing and receiving station load balancing criteria; the method specifically comprises the following steps:
for each of all N global allocation schemes, the total length of the receive window obtained by a single satellite is first calculated
s represents the total number of satellites, p is 1,2,…, N, if one satellite obtains the receiving windows of a plurality of receiving stations at the same time, the overlapping time windows are processed by de-duplication, namely, one satellite only transmits data to one receiving station at the same time; then, the total length of the receiving window needed to be completed by the single receiving station is calculated
N; suppose that the lower limit of the single-satellite receiving window in one receiving window distribution period is SatminThe upper limit of the receiving window of the receiving station is StamaxThen a global allocation scheme that satisfies one of the following conditions is an unreasonable combination, sifting out:
under the condition 1, the method of producing,
under the condition 2, the content of the organic solvent,
setting the number of the residual global distribution schemes after screening as N';
(5) establishing a mapping relation between the observation task and the data receiving window according to the satellite for each distribution scheme in the rest global distribution schemes;
(6) calculating the task scheduling rate of each satellite in each global distribution scheme, and selecting an optimal global distribution scheme under the satellite task scheduling rate balance criterion; the method specifically comprises the following steps:
calculating the task scheduling rate of each satellite in each global distribution scheme:
wherein, ckRepresents the number of observation tasks for the kth satellite, k being 1,2, …, s,
representing the number of scheduled observations for playback for the kth satellite in the p-th allocation,
representing a mission scheduling rate for a kth satellite in the pth allocation; then, selecting an optimal global distribution scheme under the satellite task scheduling rate balance criterion:
under the balance criterion of the satellite task scheduling rate, selecting a global distribution scheme meeting the following conditions:
wherein the content of the first and second substances,
representing the task scheduling rate of the kth satellite in the p allocation scheme, D (-) represents the variance, the smaller the value of the variance is, the more fair the data receiving resource allocation among the satellites is, s represents the total number of the satellites, and delta represents the threshold value;
assuming that the number of the distribution schemes meeting the above condition is N ', selecting the distribution scheme meeting the following formula from the N' combination as the optimal global distribution scheme;
and completing global optimization distribution of the satellite data receiving window.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810832417.2A CN108988933B (en) | 2018-07-26 | 2018-07-26 | Satellite data receiving window global optimization distribution method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810832417.2A CN108988933B (en) | 2018-07-26 | 2018-07-26 | Satellite data receiving window global optimization distribution method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108988933A CN108988933A (en) | 2018-12-11 |
| CN108988933B true CN108988933B (en) | 2021-12-17 |
Family
ID=64550891
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810832417.2A Active CN108988933B (en) | 2018-07-26 | 2018-07-26 | Satellite data receiving window global optimization distribution method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108988933B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111178419B (en) * | 2019-12-24 | 2023-05-19 | 上海交通大学 | Agile remote sensing satellite multi-target task planning method based on task clustering |
| CN112994779B (en) * | 2021-02-24 | 2022-08-16 | 重庆两江卫星移动通信有限公司 | Single-station double-satellite time overlapping task tracking method, system, terminal and medium |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105165100B (en) * | 2013-05-03 | 2019-11-01 | 交互数字专利控股公司 | Score Carrier Sense Multiple access/conflict avoidance system and method for WLAN |
| CN104008443B (en) * | 2014-05-13 | 2017-05-03 | 中国科学院遥感与数字地球研究所 | Mission planning and scheduling system of land observation satellite data ground receiving station network |
| CN104113368B (en) * | 2014-07-01 | 2017-11-03 | 中国科学院遥感与数字地球研究所 | Based on the ground receiver resource allocation methods for receiving resource capability constraint |
| CN105630582B (en) * | 2014-11-15 | 2019-07-19 | 航天恒星科技有限公司 | Ground satellite station receives resource contention processing method and system |
| CN104598759B (en) * | 2015-02-13 | 2017-11-03 | 中国科学院遥感与数字地球研究所 | A kind of efficiency estimation method and device of satellite data reception system |
| CN106059652B (en) * | 2016-05-30 | 2018-09-14 | 中国电子科技集团公司第五十四研究所 | A kind of heuristic quick satellite data reception Resource co-allocation method |
| CN106384169B (en) * | 2016-09-22 | 2018-02-06 | 合肥工业大学 | A kind of satellite task planing method based on meta-heuristic algorithms |
-
2018
- 2018-07-26 CN CN201810832417.2A patent/CN108988933B/en active Active
Non-Patent Citations (3)
| Title |
|---|
| 一种解决多星遥感地面接收资源冲突及优化的方法;王无敌 等;《系统工程与电子技术》;20110630;第33卷(第6期);第1299-1304页 * |
| 卫星数传调度的蚁群优化模型及算法研究;陈祥国;《中国博士学位论文全文数据库工程科技Ⅱ辑》;20110415;正文第1-2页，第32-93页，附图3.3 * |
| 多卫星综合任务规划关键技术研究;刘晓娣;《中国优秀硕士学位论文全文数据库-基础科学辑》;20090715;第43-52页，图4.2-4.4 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108988933A (en) | 2018-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106059652B (en) | A kind of heuristic quick satellite data reception Resource co-allocation method | |
| Waiming et al. | A two-phase genetic annealing method for integrated earth observation satellite scheduling problems | |
| CN110602633B (en) | Explosive flow-oriented mobile edge computing unmanned aerial vehicle cluster auxiliary communication method | |
| CN109409773B (en) | Dynamic planning method for earth observation resources based on contract network mechanism | |
| CN107045667B (en) | Measurement and control data transmission integrated station network resource scheduling method | |
| CN108832993B (en) | Hybrid task-oriented online relay satellite system communication resource allocation method | |
| CN109726917B (en) | Freight flight scheduling method and device based on four-dimensional track | |
| CN111162831B (en) | Ground station resource scheduling method | |
| CN108988933B (en) | Satellite data receiving window global optimization distribution method | |
| CN103744733A (en) | Method for calling and configuring imaging satellite resources | |
| CN109933842A (en) | A kind of mobile target list star mission planning method based on constraint satisfaction genetic algorithm | |
| CN108717572A (en) | Imaging task schedulability prediction technique based on structural neural networks | |
| CN107180309B (en) | Collaborative planning method for space-sky-ground observation resources | |
| CN112149958B (en) | Method for calculating multidimensional performance evaluation index of antenna base station network resources | |
| Chen | Unrelated parallel machine scheduling with secondary resource constraints | |
| Zhang et al. | Receding horizon optimization for energy-efficient UAV communication | |
| CN110516871B (en) | Dynamic vehicle path optimization method based on fuzzy rolling time domain control strategy | |
| Dai et al. | Dynamic scheduling for emergency tasks in space data relay network | |
| CN113552897A (en) | Task priority based air-to-ground unmanned system reconnaissance collaborative path planning method | |
| CN104077634A (en) | Active-reactive type dynamic project scheduling method based on multi-objective optimization | |
| CN113131992B (en) | Space internet satellite ground station space-ground resource allocation method and system | |
| CN111950859B (en) | Dynamic adaptation method and device for aviation communication data chain and storage medium | |
| CN107682812B (en) | link adaptation method and device for heterogeneous multi-communication link convergence network | |
| CN112217558B (en) | Space information network task planning method based on resource interchange | |
| CN116187637A (en) | Multi-star measurement and control resource scheduling method and device and computer readable 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 | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Bai Jing Inventor after: Peng Huixiang Inventor after: Chen Taoyi Inventor after: Wang Shicheng Inventor after: Du Chu Inventor after: Liu Xiaoli Inventor after: Li Yanping Inventor after: Liu Rangguo Inventor after: Wang Baowei Inventor before: Bai Jing Inventor before: Du Chu Inventor before: Liu Xiaoli Inventor before: Peng Huixiang Inventor before: Wang Shicheng Inventor before: Li Yanping Inventor before: Liu Rangguo Inventor before: Wang Baowei |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |