CN106851749B - Relay satellite system resource scheduling method based on resource reservation - Google Patents
Relay satellite system resource scheduling method based on resource reservation Download PDFInfo
- Publication number
- CN106851749B CN106851749B CN201710221987.3A CN201710221987A CN106851749B CN 106851749 B CN106851749 B CN 106851749B CN 201710221987 A CN201710221987 A CN 201710221987A CN 106851749 B CN106851749 B CN 106851749B
- Authority
- CN
- China
- Prior art keywords
- service
- resource
- scheduling
- time
- scheduled
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/26—Resource reservation
-
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
Abstract
A relay satellite system resource scheduling method based on resource reservation carries out relay satellite system resource scheduling under a preset condition, and specifically comprises the following steps: judging whether the service set to be scheduled is empty or not; if not, selecting the service with the highest priority from the service set to be scheduled, and judging whether the selected service is a burst service or a conventional service; if the selected service is a burst service, scheduling the selected service, if the selected service is a conventional service, judging whether the proportion of the available resource set in the total resource set is greater than a preset resource reservation rate, if so, scheduling the selected service, otherwise, performing degradation processing on the selected service, and continuously selecting the service with the highest priority; and carrying out resource matching on the scheduled service. Through a resource reservation mechanism, the problem of rapid scheduling of burst services is solved, the method can be used for large-scale dynamic resource scheduling in a satellite network, the response speed of scheduling is increased, and the effective utilization rate of resources is improved.
Description
Technical Field
The invention relates to the technical field of satellite communication, in particular to a relay satellite system resource scheduling method based on resource reservation.
Background
With the continuous development of technologies such as earth observation, military reconnaissance, deep space exploration and the like in the aerospace field, relay satellite data transmission has the characteristics of high capacity, high speed and diversified relay tasks, and the problem of satellite resource optimization scheduling is more and more urgent and important. Among the requirements of a plurality of measurement and control services, the burst service with higher requirements on quick response accounts for a large proportion, and the requirement of simultaneously ensuring the quick response of the burst service under the condition of ensuring the tracking, measurement and control and data relay requirements of a large-scale user spacecraft provides a challenge for reasonable and quick resource scheduling of a relay satellite system.
At present, according to domestic and foreign literature data, the main object of task scheduling research of the existing relay satellite system is a reservation-type task. The learner applies a constraint planning model to the task scheduling of the relay satellite, establishes a Constraint Satisfaction Planning (CSP) model, and adopts the priority as the allocation basis during resource competition under the condition of meeting the logic constraint condition among tasks, but only aims at the complex task scheduling of a single space target. Zhengwei and the like comprehensively consider the relay satellite S and the Ka frequency band service link, and utilize the conflict detection of a time window to allocate link resources, but the convergence speed of solving the problem by the genetic algorithm is low, so that the method is only suitable for the condition of less task quantity. Some researchers propose a sextuple method to decompose tasks, and use the priority level as the resource allocation basis, but only solve the task scheduling of a single relay satellite. SW Cheng et al propose a task scheduling framework that further decomposes the tasks of relay satellites into a set of sub-tasks of shorter duration, but only decomposable task scheduling for a single spatial target. The research of the reservation-type task scheduling does not consider the burst characteristic of the space task, so that a relay satellite system resource scheduling method which can schedule burst service in time and is simple in calculation needs to be developed.
Disclosure of Invention
Aiming at the problem of resource scheduling in a relay satellite system, the application provides a relay satellite system resource scheduling method based on resource reservation, which comprises the following steps:
judging whether the service set to be scheduled is empty or not;
if not, selecting the service with the highest priority from the service set to be scheduled, and judging whether the selected service is a burst service;
if the selected service is a burst service, scheduling the selected service, otherwise, judging whether the proportion of the available resource set to the total resource set is greater than a preset resource reservation rate, if so, scheduling the selected service, otherwise, performing degradation processing on the selected service, and returning to the service set to be scheduled to continue to select the service with the highest priority;
and carrying out resource matching on the scheduled service.
In one embodiment, the step of determining whether the selected service is a burst service is: and judging whether the deadline time of the selected service is within a preset burst time limit, if so, the selected service is a burst service, and otherwise, the selected service is a conventional service.
In an embodiment, before selecting the service with the highest priority from the service set to be scheduled, it is further determined whether there are multiple services with the same highest priority, and if so, the service with the earliest deadline time is selected from the multiple services with the same highest priority.
In one embodiment, the step of performing resource matching on the scheduled service is:
selecting the resource with the earliest starting time which meets the service requirement time period and the link rate from the available resource set to be matched with the scheduled service;
removing the resource from the available resource set and adding the resource into the occupied resource set;
and removing the scheduled service from the service set to be scheduled and adding the scheduled service into the arranged service set.
In one embodiment, if the resource matching for the scheduled service fails, the method further includes the steps of: and according to the principle of low and high priority, carrying out resource re-matching on the service occupied in the time period required by the scheduling service, adjusting the resource occupation condition of the service, and matching the adjusted idle resource to the scheduled service.
According to the relay satellite system resource scheduling method of the embodiment, whether the service to be scheduled is a burst service or not is divided according to the execution requirement of the service to be scheduled; for non-burst service, firstly judging the use condition of resources, and scheduling according to the priority and the deadline under the condition of sufficient resources; and for burst services, scheduling is directly performed, and the quick response of scheduling is guaranteed. Through a resource reservation mechanism, resource guarantee is provided for burst services needing to be scheduled quickly, the problem of quick scheduling of the burst services is solved, the method can be used for large-scale dynamic resource scheduling in a satellite network, the response speed of scheduling is increased, and the effective utilization rate of resources is improved.
Drawings
FIG. 1 is a schematic diagram of a task time model;
fig. 2 is a flowchart of relay satellite system resource scheduling.
Detailed Description
The present invention will be described in further detail with reference to the following detailed description and accompanying drawings.
Aiming at the characteristics that relay transmission service in a relay satellite system has great difference in real-time performance and service types, five characteristic parameters of data transmission and measurement and control service in terms of start time s (i), deadline e (i), service volume T (i), service transmission rate v (i) and priority p (i) are mainly considered, the embodiment provides a resource scheduling method based on resource reservation, and the basic idea is that by setting a burst time limit tau, the service with the service deadline in the burst time limit is divided into burst services, burst tasks are directly scheduled, if the scheduled services cannot be scheduled, the scheduled services can be inserted, the conventional services are directly scheduled when the task deadline is outside the burst time limit, the current residual resource utilization rate is greater than the given reserved resource utilization rate α, and when the residual resources are less than the required reserved resources, the priority of the conventional services is subjected to degradation processing to wait for next scheduling.
When the relay satellite and the user aircraft are visible, data on the user aircraft or data of the ground station can be respectively transmitted in a relay mode through an uplink link and a downlink link of the relay satellite, and one data transmission process or one data measurement and control task is executed. Since the problem of relay satellite resource scheduling always faces some sudden traffic to be scheduled, since it is impossible to consider all the details and practical constraints in the current research, some basic assumptions and simplifications need to be made, and the assumptions of this example are as follows:
1. the execution time of any service must be within the window of time of visibility between the relay satellite and the user aircraft;
2. the failure of the satellite and the switching time of the service are not considered;
3. the execution time of each task must meet the time-limitation requirement of the task, and the duration must be capable of completing the required traffic and higher than the required traffic transmission rate;
4. the maximum link number provided by the relay satellite is unchanged, and an uplink link and a downlink link are distinguished;
5. the initial priority of the service is given by the user, and the priority for calculation can be adjusted in the scheduling process.
6. The resource scheduling mathematical model of the relay satellite system is as follows:
v(i)D(i)≥T(i),
st(i,j,k)≥ast(i,j,k),
st(i,j,k)+di,j,k≤aet(i,j,k),
i＝1,2,L,j＝1,2,3,k＝1,2,L；
the optimization goal is to maximize the completion degree of the service, i.e. the sum of the weighted priorities of the service, which is determined by the priority and the duration of the service, so as to ensure high throughput and high priority of the overall scheduling.
The meaning of each parameter in the relay satellite system resource scheduling mathematical model is as follows:
d (i, j, k): the relay star j arranges the kth link thereof to the time for the service i to measure and control;
p (i): the priority of task i;
d (i): the duration required for completing the service i, and the scheduling time scheduled for the service i ensures that the transmission rate of the link in the time period is higher than the transmission rate v (i) required by the service and can guarantee the completion of the traffic t (i), wherein the traffic t (i) model diagram in this example is shown in fig. 1;
ast (i, j, k): the kth link of the relay star j can provide the start time for the service i to measure and control, and the time is later than the start time s (i) required by the service i;
aet (i, j, k): the k link of the relay star j can provide the ending time for the measurement and control of the service i, and the time is earlier than the deadline time e (i) required by the service i;
st (i, j, k): actually arranging a k link of the relay star j to the start time of measurement and control of the service i, wherein a scheduling result needs to ensure that the actually arranged start-stop time is within an available start-stop time range, and the actually scheduled start-stop time periods are not overlapped;
τ: a burst time limit, wherein the service with the cut-off time between the current time and the burst time limit tau is specified as a burst service, and the service after the burst time limit is a conventional service;
α, resource reservation rate, the ratio of the remaining resource to the total resource after the burst time limit needs to be larger than the resource reservation rate to ensure the schedulability of the future burst service;
the value range of i is the number of the space vehicles participating in scheduling, j is the number of the relay satellites participating in scheduling, and k is the number of links provided by the relay satellites.
Based on the above assumed conditions, the flowchart of the relay satellite system resource scheduling method of this embodiment is shown in fig. 2, and specifically includes the following steps.
S1: and judging whether the service set to be scheduled is empty or not.
Determining all service sets initiating the application, dividing the service sets into a scheduled service set, a service set to be scheduled and a service set which cannot be scheduled according to the current scheduling condition, before selecting services from the service set to be scheduled, judging whether the service set to be scheduled is empty, if so, finishing scheduling, otherwise, entering step S2.
S2: and selecting the service with the highest priority from the service set to be scheduled, and judging whether the selected service is a burst service or a conventional service.
Before selecting the service, the services in the service set to be scheduled need to be subjected to high-bottom sequencing of priority, then the service with the highest priority is selected, and after the selection, whether the selected service is a burst service or a conventional service needs to be judged.
Further, before selecting the service with the highest priority from the service set to be scheduled, the method also comprises the steps of judging whether the number of the services with the same highest priority is multiple, and if so, selecting the service with the earliest deadline time from the multiple services with the same highest priority.
S3: if the selected service is a burst service, scheduling the selected service, if the selected service is a conventional service, judging whether the proportion of the available resource set in the total resource set is greater than a preset resource reservation rate, if so, scheduling the selected service, otherwise, performing degradation processing on the selected service, and returning to the service set to be scheduled to continue to select the service with the highest priority.
S4: and carrying out resource matching on the scheduled service.
The steps of resource matching for the scheduled service are as follows: selecting the resource with the earliest starting time which meets the service requirement time period and the link rate from the available resource set to be matched with the scheduled service; removing the resource from the available resource set and adding the resource into the occupied resource set; and removing the scheduled service from the service set to be scheduled and adding the scheduled service into the arranged service set.
Further, if the resource matching for the scheduled service fails, that is, the available resources cannot be matched, the process proceeds to step S5.
S5: and according to the principle of low and high priority, carrying out resource re-matching on the service occupied in the time period required by the scheduling service, adjusting the resource occupation condition of the service, and matching the adjusted idle resource to the scheduled service.
Through step S5, the services in the scheduled service set can be started from the services with low priority until the services that can be adjusted are found, the resource occupation condition is adjusted, the adjusted idle resources are matched to the scheduled services, after the resource matching is completed, the available resource set, the occupied resource set, the scheduled service set and the service set to be scheduled are updated, and if the adjustable services cannot be found through step S5, the scheduled services are added to the service set that cannot be scheduled.
And finally, returning the scheduled service set and the service set which can not be scheduled, informing the scheduling condition of the corresponding user service, carrying out demand adjustment on the service which can not be scheduled, and finishing the whole scheduling process.
The present invention has been described in terms of specific examples, which are provided to aid understanding of the invention and are not intended to be limiting. For a person skilled in the art to which the invention pertains, several simple deductions, modifications or substitutions may be made according to the idea of the invention.
Claims (5)
1. A relay satellite system resource scheduling method based on resource reservation is characterized in that relay satellite system resource scheduling is carried out under preset conditions,
the preset conditions are as follows:
1. the execution time of any service must be within the window of time of visibility between the relay satellite and the user aircraft;
2. the failure of the satellite and the switching time of the service are not considered;
3. the execution time of each task must meet the time-limitation requirement of the task, and the duration must be capable of completing the required traffic and higher than the required traffic transmission rate;
4. the maximum link number provided by the relay satellite is unchanged, and an uplink link and a downlink link are distinguished;
5. the initial priority of the service is given by a user, and the priority for calculation can be adjusted in the scheduling process;
6. the resource scheduling mathematical model of the relay satellite system is as follows:
v(i)D(i)≥T(i),
st(i,j,k)≥ast(i,j,k),
st(i,j,k)+di,j,k≤aet(i,j,k),
the optimization target is to maximize the completion degree of the service, namely the sum of the weighted priorities of the service, wherein the completion degree of the service is determined by the priority and the duration of the service together so as to ensure the high throughput and the high priority of the overall scheduling;
the meaning of each parameter in the relay satellite system resource scheduling mathematical model is as follows:
d (i, j, k): the relay star j arranges the kth link thereof to the time for the service i to measure and control;
p (i): the priority of task i;
d (i): the duration time required for completing the service i, and the scheduling time arranged for the service i ensures that the transmission rate of the link in the time period is higher than the transmission rate v (i) required by the service and can guarantee the completion of the service amount T (i);
ast (i, j, k): the kth link of the relay star j can provide the start time for the service i to measure and control, and the time is later than the start time s (i) required by the service i;
aet (i, j, k): the k link of the relay star j can provide the ending time for the measurement and control of the service i, and the time is earlier than the deadline time e (i) required by the service i;
st (i, j, k): actually arranging a k link of the relay star j to the start time of measurement and control of the service i, wherein a scheduling result needs to ensure that the actually arranged start-stop time is within an available start-stop time range, and the actually scheduled start-stop time periods are not overlapped;
τ: a burst time limit, wherein the service with the cut-off time between the current time and the burst time limit tau is specified as a burst service, and the service after the burst time limit is a conventional service;
α, resource reservation rate, the ratio of the remaining resource to the total resource after the burst time limit needs to be larger than the resource reservation rate to ensure the schedulability of the future burst service;
the value range of i is the number of the space aircrafts participating in scheduling, j is the number of the relay satellites participating in scheduling, and k is the number of links provided by the relay satellites;
the method specifically comprises the following steps:
judging whether the service set to be scheduled is empty or not;
if not, selecting the service with the highest priority from the service set to be scheduled, and judging whether the selected service is a burst service or a conventional service;
if the selected service is a burst service, scheduling the selected service, if the selected service is a conventional service, judging whether the proportion of the available resource set in the total resource set is greater than a preset resource reservation rate, if so, scheduling the selected service, otherwise, performing degradation processing on the selected service, and returning to the service set to be scheduled to continue to select the service with the highest priority;
and carrying out resource matching on the scheduled service.
2. The method for scheduling resources of a relay satellite system according to claim 1, wherein the step of determining whether the selected service is a burst service or a regular service is: and judging whether the deadline time of the selected service is within a preset burst time limit, if so, the selected service is a burst service, and otherwise, the selected service is a conventional service.
3. The method for scheduling resources of a relay satellite system according to claim 1, wherein before the service with the highest priority is selected from the service set to be scheduled, the method further comprises determining whether the number of the services with the same highest priority is multiple, and if so, selecting the service with the earliest deadline time from the multiple services with the same highest priority.
4. The method for scheduling resources of a relay satellite system according to claim 1, wherein the step of resource matching the scheduled service comprises:
selecting the resource with the earliest starting time which meets the service requirement time period and the link rate from the available resource set to be matched with the scheduled service;
removing the resource from the available resource set and adding the resource into the occupied resource set;
and removing the scheduled service from the service set to be scheduled and adding the scheduled service into the arranged service set.
5. The method for scheduling resources of a relay satellite system according to claim 1, wherein if the resource matching for the scheduled service fails, further comprising the steps of: and according to the principle of low and high priority, carrying out resource re-matching on the service occupied in the time period required by the scheduling service, adjusting the resource occupation condition of the service, and matching the adjusted idle resource to the scheduled service.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710221987.3A CN106851749B (en) | 2017-04-06 | 2017-04-06 | Relay satellite system resource scheduling method based on resource reservation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710221987.3A CN106851749B (en) | 2017-04-06 | 2017-04-06 | Relay satellite system resource scheduling method based on resource reservation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106851749A CN106851749A (en) | 2017-06-13 |
| CN106851749B true CN106851749B (en) | 2020-04-07 |
Family
ID=59147307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710221987.3A Active CN106851749B (en) | 2017-04-06 | 2017-04-06 | Relay satellite system resource scheduling method based on resource reservation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106851749B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107909207A (en) * | 2017-11-16 | 2018-04-13 | 北京卫星信息工程研究所 | Remote Sensing Ground Station Multiobjective Optimal Operation method and system |
| CN108199763B (en) * | 2017-12-29 | 2019-01-22 | 清华大学 | Repeater satellite method for scheduling task and system |
| CN108882374B (en) * | 2018-05-25 | 2023-04-18 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Ka frequency band multi-address measurement and control resource scheduling method |
| CN109190938B (en) * | 2018-08-17 | 2022-04-19 | 中南大学 | Relay satellite single-address antenna dynamic scheduling method for temporary task arrival |
| CN109409734A (en) * | 2018-10-23 | 2019-03-01 | 中国电子科技集团公司第五十四研究所 | A kind of satellite data production scheduling system |
| CN111132357B (en) * | 2018-10-31 | 2022-11-25 | 成都鼎桥通信技术有限公司 | High-priority guarantee method and device for key service |
| CN109889929B (en) * | 2018-12-20 | 2020-06-12 | 北京邮电大学 | Data transmission method based on satellite optical burst system |
| CN109768822B (en) * | 2018-12-26 | 2022-03-04 | 航天恒星科技有限公司 | Satellite measurement and control resource scheduling method and device |
| CN110072264B (en) * | 2019-05-28 | 2021-02-02 | 重庆邮电大学 | Low-orbit satellite system switching method |
| CN110752868A (en) * | 2019-10-08 | 2020-02-04 | 中国人民解放军32039部队 | On-orbit spacecraft shadow following measurement and control method, device and computer readable medium |
| CN111711991B (en) * | 2020-06-08 | 2023-08-08 | 中国科学院上海微系统与信息技术研究所 | Calculation task scheduling method in star-ground fusion network |
| CN112566125B (en) * | 2020-11-16 | 2023-03-28 | 天地信息网络研究院(安徽)有限公司 | Satellite relay data transmission method based on control channel |
| CN112803987B (en) * | 2021-01-14 | 2022-07-12 | 北京航天飞行控制中心 | Moon relay measurement and control resource allocation method and device |
| CN113709876B (en) * | 2021-07-08 | 2023-06-20 | 北京邮电大学 | Satellite service resource allocation method and electronic equipment |
| CN115580342B (en) * | 2022-11-17 | 2023-04-04 | 成都国恒空间技术工程股份有限公司 | Aerospace information acquisition method and system based on intelligent networking |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5978363A (en) * | 1996-10-18 | 1999-11-02 | Telogy Networks, Inc. | System and method for multi-dimensional resource scheduling |
| CN104935374A (en) * | 2015-06-23 | 2015-09-23 | 西安空间无线电技术研究所 | Satellite internet protocol (IP) resource reservation processing method based on dynamic window |
| CN106385387A (en) * | 2016-09-27 | 2017-02-08 | 中国科学院空间应用工程与技术中心 | Resource scheduling method of information network links, system and application |
-
2017
- 2017-04-06 CN CN201710221987.3A patent/CN106851749B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5978363A (en) * | 1996-10-18 | 1999-11-02 | Telogy Networks, Inc. | System and method for multi-dimensional resource scheduling |
| CN104935374A (en) * | 2015-06-23 | 2015-09-23 | 西安空间无线电技术研究所 | Satellite internet protocol (IP) resource reservation processing method based on dynamic window |
| CN106385387A (en) * | 2016-09-27 | 2017-02-08 | 中国科学院空间应用工程与技术中心 | Resource scheduling method of information network links, system and application |
Non-Patent Citations (1)
| Title |
|---|
| 中继卫星任务调度方法研究;崔子祥;《中国优秀硕士学位论文全文数据库 工程科技II辑》;20100630;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106851749A (en) | 2017-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106851749B (en) | Relay satellite system resource scheduling method based on resource reservation | |
| CN113346944B (en) | Time delay minimization calculation task unloading method and system in air-space-ground integrated network | |
| CN113965255B (en) | Relay satellite task planning method and device for observing transmission coordination | |
| CN107464001B (en) | Reservation ticket distribution processing method and server | |
| CN109768822B (en) | Satellite measurement and control resource scheduling method and device | |
| CN108832993B (en) | Hybrid task-oriented online relay satellite system communication resource allocation method | |
| CN102594433B (en) | Dynamic priority dispatching method of satellite network many-to-one communication conflicts | |
| CN109714097B (en) | Cross-domain cooperative scheduling system for satellite resources | |
| CN108171443B (en) | Multi-satellite emergency task planning method and device considering instruction upper notes | |
| CN109618375B (en) | UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability | |
| CN110825510A (en) | Task-driven multi-satellite cooperative task allocation method and system | |
| CN112330000B (en) | Emergency quick response satellite resource optimization decision method based on current circle strategy | |
| CN112149958B (en) | Method for calculating multidimensional performance evaluation index of antenna base station network resources | |
| CN115103410B (en) | Method, system and device for scheduling measurement and control data transmission resources | |
| CN112423346A (en) | Relay multiple access scheduling method, device, electronic equipment and storage medium | |
| CN115276758B (en) | Relay satellite dynamic scheduling method based on task looseness | |
| CN115866788A (en) | 3C resource scheduling method of heaven and earth fusion network for active migration of MEC tasks | |
| CN106991484B (en) | Secondary resource reservation method based on intelligent repeated reservation | |
| CN112803987B (en) | Moon relay measurement and control resource allocation method and device | |
| CN116822863A (en) | Multi-platform collaborative awareness intelligent planning method and system | |
| CN109710389B (en) | Multi-level satellite cooperative scheduling method and system | |
| Stottler | Satellite communication scheduling, optimization, and deconfliction using artificial intelligence techniques | |
| CN112990688A (en) | Flight guarantee automatic scheduling system | |
| CN112801394A (en) | Resource scheduling method | |
| Wided et al. | Effective simulation-based optimization algorithm for the aircraft runway scheduling problem |
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 | ||
| CB02 | Change of applicant information |
Address after: 201109 Minhang District, Shanghai Road, No. 1777 spring Applicant after: Shanghai Spaceflight Institute of TT&C And Telecommunication Address before: 200080 Shanghai city Hongkou District street Xingang Tianbao Road No. 881 Applicant before: Shanghai Spaceflight Institute of TT&C And Telecommunication |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |