CN117371764A - Task planning method, device and equipment for relay satellite and storage medium - Google Patents

Task planning method, device and equipment for relay satellite and storage medium Download PDF

Info

Publication number
CN117371764A
CN117371764A CN202311652993.6A CN202311652993A CN117371764A CN 117371764 A CN117371764 A CN 117371764A CN 202311652993 A CN202311652993 A CN 202311652993A CN 117371764 A CN117371764 A CN 117371764A
Authority
CN
China
Prior art keywords
task
planning
target
time window
tasks
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311652993.6A
Other languages
Chinese (zh)
Inventor
孟超凡
崔荣
陈琦
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shifang Star Chain Suzhou Aerospace Technology Co ltd
Original Assignee
Shifang Star Chain Suzhou Aerospace Technology Co ltd
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 Shifang Star Chain Suzhou Aerospace Technology Co ltd filed Critical Shifang Star Chain Suzhou Aerospace Technology Co ltd
Priority to CN202311652993.6A priority Critical patent/CN117371764A/en
Publication of CN117371764A publication Critical patent/CN117371764A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations

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)
  • Radio Relay Systems (AREA)

Abstract

The application discloses a task planning method, device and equipment for a relay satellite and a storage medium. The task planning method may include: acquiring a target task and a planning task sequence related to the relay satellite, wherein the planning task sequence comprises a plurality of preset tasks which are arranged according to a corresponding preset time window; determining whether a conflict task which conflicts with the target task exists in the plurality of preset tasks based on the target time window of the target task and the preset time windows of the plurality of preset tasks; if so, determining one of the target task and the conflict task as a first task added to the planning task sequence, and the other task as a second task for performing task re-planning; the first task is located at a position of the conflict task in the planning task sequence.

Description

Task planning method, device and equipment for relay satellite and storage medium
Technical Field
The present invention relates to the field of satellite communications and data processing, and in particular, to a method, an apparatus, a device, and a storage medium for task planning of a relay satellite.
Background
As one type of communication satellite, a relay satellite can realize data transmission of a large data amount. As more users of relay satellites currently increase, so does the data transmission tasks they perform. The method also causes more and more conflicting tasks to occur in the task processing process, so that the low satisfaction rate of the tasks causes low transmission efficiency of the relay satellite, and further reduces the experience of users.
Disclosure of Invention
The technical problem to be solved by the embodiments of the present application is how to improve the transmission efficiency of the relay satellite, and meanwhile, to realize the maximum utilization of resources.
In order to solve the problems, the application discloses a task planning method, device and equipment for a relay satellite and a storage medium. The task planning method can dynamically adjust the resource allocation of the relay satellite, and conduct task flow arrangement, and realize the data transmission of the relay satellite by utilizing the resource combination.
According to a first aspect of the present application, a mission planning method for a relay satellite is provided. The task planning method may include: acquiring a target task and a planning task sequence related to the relay satellite, wherein the planning task sequence comprises a plurality of preset tasks which are arranged according to a corresponding preset time window; determining whether a conflict task which conflicts with the target task exists in the plurality of preset tasks based on the target time window of the target task and the preset time windows of the plurality of preset tasks; if so, determining one of the target task and the conflict task as a first task added to the planning task sequence, and the other task as a second task for performing task re-planning; the first task is located at a position of the conflict task in the planning task sequence.
According to some embodiments of the present application, the determining whether there is a conflicting task may include: determining whether a predetermined task corresponding to a predetermined time window overlapping the target time window exists; if so, designating the preset task as the conflict task.
According to some embodiments of the present application, the determining the first task and the second task may include: acquiring the duration of the preset time window and the duration of the target time window; designating the larger as the first task and the smaller as the second task.
According to some embodiments of the present application, performing task rescheduling on the second task may include: acquiring one or more idle time intervals; determining a time utilization rate of each idle time interval for a time window of the second task; and determining an idle time interval corresponding to the maximum time utilization rate as a target time interval, and executing the second task in the target time interval.
According to some embodiments of the present application, determining the time utilization may include: designating the ratio of the duration of the time window of the second task to the duration of the idle time interval as the time utilization rate; wherein the ratio is not more than 1.
According to some embodiments of the present application, the method may further comprise: and sending the processing result of the target task and/or the conflict task.
According to some embodiments of the present application, the method may further comprise: determining whether the first task conflicts with other preset tasks after being added into the planning task sequence; if yes, terminating the first task to join the planning task sequence.
According to some embodiments of the present application, the method may further comprise: and receiving a task adjustment instruction to adjust the planning task sequence.
According to a second aspect of the present application, a mission planning system for a relay satellite is provided. The mission planning system may include: the device comprises an acquisition module, a determination module and an execution module; the acquisition module is used for acquiring a target task and a planning task sequence related to the relay satellite, wherein the planning task sequence comprises a plurality of preset tasks which are arranged according to a corresponding preset time window; the determining module is used for determining whether a conflict task which conflicts with the target task exists in the plurality of preset tasks or not based on the target time window of the target task and the preset time windows of the plurality of preset tasks; the execution module is used for determining one of the target task and the conflict task as a first task added to the planning task sequence and the other as a second task for executing task re-planning under the condition that the conflict task exists; the first task is located at a position of the conflict task in the planning task sequence.
According to some embodiments of the present application, to determine whether conflicting tasks exist, the determining module may be configured to: determining whether a predetermined task corresponding to a predetermined time window overlapping the target time window exists; if so, designating the preset task as the conflict task.
According to some embodiments of the present application, to determine the first task and the second task, the execution module may be configured to: acquiring the duration of the preset time window and the duration of the target time window; designating the larger as the first task and the smaller as the second task.
According to some embodiments of the present application, to perform task re-planning on the second task, the execution module may be configured to: acquiring one or more idle time intervals; determining a time utilization rate of each idle time interval for a time window of the second task; and determining an idle time interval corresponding to the maximum time utilization rate as a target time interval, and executing the second task in the target time interval.
According to some embodiments of the present application, to determine the time utilization, the execution module may be configured to: designating the ratio of the duration of the time window of the second task to the duration of the idle time interval as the time utilization rate; wherein the ratio is not more than 1.
According to some embodiments of the present application, the mission planning system further comprises a transmission module; the transmission module is used for sending the processing result of the target task and/or the conflict task.
According to some embodiments of the application, the execution module may further be configured to: determining whether the first task conflicts with other preset tasks after being added into the planning task sequence; if yes, terminating the first task to join the planning task sequence.
According to some embodiments of the application, the execution module may further be configured to: and receiving a task adjustment instruction to adjust the planning task sequence.
According to a third aspect of the present application, a mission planning apparatus is provided. The apparatus comprises a memory, a processor and a computer program stored on the memory and executable on the processor, which when executed by the processor implements the steps of the task planning method as described above.
According to a fourth aspect of the present application, a computer readable storage medium is provided. The storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the method as described above.
Drawings
The present application will be further illustrated by way of example embodiments, which will be described in detail with reference to the accompanying drawings. The embodiments are not limiting, in which like numerals represent like structures, wherein:
FIG. 1 is an exemplary application scenario diagram of a mission planning system for a relay satellite according to some embodiments of the present application;
FIG. 2 is an exemplary block diagram of a computing device for implementing task planning shown in accordance with some embodiments of the present application;
FIG. 3 is an exemplary flow chart of a mission planning method for a relay satellite shown in accordance with some embodiments of the present application;
FIG. 4 is an exemplary schematic diagram of a time interval plan for a relay satellite shown in accordance with some embodiments of the present application;
fig. 5 is an exemplary block diagram of a processing system for mission planning for a relay satellite, shown in accordance with some embodiments of the present application.
Detailed Description
In order to make the above objects, features and advantages of the present application more comprehensible, embodiments accompanied with figures are described in detail below. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application. This application is, however, susceptible of embodiment in many other forms than those described herein and similar modifications can be made by those skilled in the art without departing from the spirit of the application, and therefore the application is not to be limited to the specific embodiments disclosed below.
It will be understood that when an element is referred to as being "mounted" to another element, it can be directly mounted to the other element or intervening elements may also be present. When an element is referred to as being "connected" to another element, it can be directly connected to the other element or intervening elements may also be present. The terms "vertical," "horizontal," "left," "right," and the like are used herein for illustrative purposes only.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein in the description of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The term "and/or" and/or "as used herein includes any and all combinations of one or more of the associated listed items.
Some preferred embodiments of the present application are described below with reference to the accompanying drawings. It should be noted that the following description is for illustrative purposes and is not intended to limit the scope of the present application.
Fig. 1 is an exemplary application scenario diagram of a mission planning system for a relay satellite according to some embodiments of the present description. In some embodiments, mission planning system 100 may achieve high utilization of resources of relay satellites and high efficiency of mission transmission. As shown in fig. 1, mission planning system 100 may include a processing device 110, a storage device 120, a terminal 130, a network 140, a mission source 150, a ground station 160, and a relay satellite 170.
The processing device 110 may be used to process information and/or data related to mission planning to perform one or more of the functions disclosed in this specification. For example, the processing device 110 may receive a target task that requires task planning. For another example, the processing device 110 may process the target task and an existing task sequence to add the target task to the task sequence. In some embodiments, the processing device 110 may be implemented by a single server or a group of servers. The processing device 110 may be a single server or a group of servers. The server farm may be centralized or distributed. In some embodiments, the processing device 110 may be local or remote. In some embodiments, processing device 110 may be implemented on a cloud platform. For example only, the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud, a distributed cloud, a multiple cloud, or the like, or any combination of the foregoing examples. In some embodiments, processing device 110 may be implemented on a computing device as shown in fig. 2 of the present application. For example, processing device 110 may be implemented on one computing device 200 as shown in fig. 2, including one or more components in computing device 200.
In some embodiments, processing device 110 may include one or more processing engines (e.g., single core processing engines or multi-core processors). By way of example only, the processing device 110 may include one or more combinations of a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), an application specific instruction set processor (ASIP), an image processor (GPU), a physical arithmetic processing unit (PPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), a Programmable Logic Device (PLD), a controller, a microcontroller unit, a Reduced Instruction Set Computer (RISC), a microprocessor, and the like.
The storage device 120 may store data and/or instructions. In some embodiments, storage device 120 may store data resulting from processing of a target task by processing device 110. For example, the planning task sequence for the resource portfolio is re-performed. In some embodiments, the storage device 120 may store data and/or instructions for execution or use by the processing device 110, which may be executed or used by the processing device 110 to implement the exemplary methods in this specification. For example, processing device 110 may access information and/or data stored on storage device 120 or received from task source 150 via network 140. As another example, processing device 110 may be directly connected to storage device 120 to access stored information and/or data. In some embodiments, the storage device 120 may be part of the processing device 110. In some embodiments, the storage device 120 may include mass memory, removable memory, volatile read-write memory (RAM), read-only memory (ROM), and the like, or any combination thereof. Exemplary mass storage devices may include magnetic disks, optical disks, solid state disks, and the like. Exemplary removable memory may include flash drives, floppy disks, optical disks, memory cards, compact disks, tape, and the like. Exemplary RAM may include Dynamic RAM (DRAM), double rate synchronous dynamic RAM (DDR SDRAM), static RAM (SRAM), thyristor RAM (T-RAM), zero capacitance RAM (Z-RAM), and the like. Exemplary ROMs may include Mask ROM (MROM), programmable ROM (PROM), erasable programmable ROM (PEROM), electrically Erasable Programmable ROM (EEPROM), compact disk ROM (CD-ROM), and digital versatile disk ROM, among others. In some embodiments, storage device 120 may be a distributed storage system. In some embodiments, storage device 120 may be implemented on a cloud platform. For example only, the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud, a distributed cloud, an internal cloud, a multi-layer cloud, or the like, or any combination thereof. For example, some algorithms or data in this specification may be stored on a cloud platform, updated periodically, and the processing device 110 accesses the algorithms or data through a network to achieve unification and interaction of the algorithms or data throughout the mission planning system 100.
The terminal 130 may be an operational front end of the processing device 110 and may include, but is not limited to, a mobile device 130-1, a tablet computer 130-2, a notebook computer 130-3, a desktop computer 130-4, etc., or any combination thereof. For example, an operator may input control instructions corresponding to operations that the mission planning system 100 may perform on the terminal 130. For example, a currently existing planning task sequence is queried. In some embodiments, terminal 130 may be inter-coupled with processing device 110. For example, the computing power (e.g., CPU, GPU, etc.) of the terminal 130 itself may be used to implement the functionality of the processing device 110. While input ports of the terminal 130 (e.g., a touch virtual keyboard of the mobile device 130-1 and the tablet 130-2 such as a smart phone smart pad, a mouse keyboard of the notebook 130-3 and the desktop 130-4, etc.) may be used for input of operation instructions.
The network 140 may facilitate the exchange of information and/or data. In some embodiments, one or more components of mission planning system 100 (e.g., processing device 110, storage device 120, mission source 150, and ground station 160) may communicate information to other components of mission planning system 100 via network 140. For example, processing device 110 may obtain a pending archive from task source 150 via network 140. In some embodiments, network 140 may be any form of wired or wireless network, or any combination thereof. By way of example only, the network 140 may be one or more combinations of a wired network, a fiber optic network, a telecommunications network, an internal network, the internet, a Local Area Network (LAN), a Wide Area Network (WAN), a Wireless Local Area Network (WLAN), a Metropolitan Area Network (MAN), a Wide Area Network (WAN), a Public Switched Telephone Network (PSTN), a bluetooth network, a zigbee network, a Near Field Communication (NFC) network, a global system for mobile communications (GSM) network, a Code Division Multiple Access (CDMA) network, a Time Division Multiple Access (TDMA) network, a General Packet Radio Service (GPRS) network, an enhanced data rates for GSM evolution (EDGE) network, a Wideband Code Division Multiple Access (WCDMA) network, a High Speed Downlink Packet Access (HSDPA) network, a Long Term Evolution (LTE) network, a User Datagram Protocol (UDP) network, a transmission control protocol/internet protocol (TCP/IP) network, a Short Message Services (SMS) network, a Wireless Application Protocol (WAP) network, a wideband (UWB) network, a mobile communications (1G, 2G, 3G, 4G, 5G) network, wi-Fi, li-Fi, narrowband internet of things (NB-infrared (IoT), ultra-band internet of things), etc. In some embodiments, network 140 may include one or more network access points. For example, network 140 may include wired or wireless network access points such as base stations and/or internet switching points. Through which one or more components of archive management system 100 may connect to network 140 to exchange information and/or data.
The task source 150 may provide tasks to be performed by the relay satellite, such as data transmission tasks. The task source 150 may send data transfer tasks to the processing device 110 for task planning via the network 140. In some embodiments, the operator of the task source 150 may also be referred to as a user of the relay satellite. The relay satellite provides a data transmission means, and users put forward data transmission demands.
Ground station 160 may be a ground-based device for space communication with relay satellites 170, including relay satellites 170-1, 170-2, and 170-3, etc. In some embodiments, the ground station 160 may communicate with the processing device 110 via the network 140 to obtain the data transmission tasks that need to be sent to the relay satellite 170. Alternatively, ground station 160 may communicate directly with processing device 110 to obtain the data transfer tasks. In some embodiments, the data transmission tasks sent by the ground station 160 to the relay satellite 170 may be mission planned. For example, the signals may be sequentially transmitted to the relay satellite 170 according to the progress of time.
Fig. 2 is a block diagram of an exemplary processing device, shown in accordance with some embodiments of the present description. Processing device 110 may include any of the components used to implement the systems described in the embodiments of the present description. For example, the processing device 110 may be implemented in hardware, software programs, firmware, or a combination thereof. For convenience, only one processing device is depicted, but the computing functions described in connection with the recommendation area determining system 100 of the present embodiments may be implemented in a distributed manner by a set of similar platforms to distribute the processing load of the system.
In some embodiments, processing device 110 may include a processor 210, a memory 220, an input/output component 230, and a communication port 240. In some embodiments, the processor (e.g., CPU) 210 may execute program instructions in the form of one or more processors. In some embodiments, the memory 220 includes various forms of program memory and data memory, such as a hard disk, read-only memory (ROM), random Access Memory (RAM), etc., for storing a wide variety of data files for processing and/or transmission by a computer. In some embodiments, the input/output component 230 may be used to support input/output between the processing device 110 and other components. In some embodiments, the communication port 240 may be connected to a network for enabling data communication. An exemplary processing device may include program instructions stored in read-only memory (ROM), random Access Memory (RAM), and/or other types of non-transitory storage media for execution by processor 210. The methods and/or processes of the embodiments of the present description may be implemented in the form of program instructions. The processing device 110 may also receive the programs and data disclosed in the present specification through network communication.
For ease of understanding, only one processor is schematically depicted in fig. 2. However, it should be noted that the processing device 110 in the embodiments of the present specification may include a plurality of processors, and thus the operations and/or methods described in the embodiments of the present specification as being implemented by one processor may also be implemented by a plurality of processors collectively or individually. For example, if in this specification the processors of processing device 110 perform operations 1 and 2, it should be understood that operations 1 and 2 may also be performed jointly or independently by two different processors of processing device 110 (e.g., a first processor performing operation 1, a second processor performing operation 2, or both first and second processors jointly performing operations 1 and 2).
Fig. 3 is an exemplary flow chart of a mission planning method for a relay satellite according to some embodiments of the present application. In some embodiments, the mission planning method 300 may be performed by the mission planning system 500. For example, the mission planning method 300 may be stored in a storage device (e.g., an on-board storage unit or an external storage device of the mission planning system 500) in the form of a program or instructions that, when executed, may implement the mission planning method 300. As shown in fig. 1, the mission planning method 300 may include the following operations.
Step 310, obtaining a target task and a planning task sequence related to the relay satellite. In some embodiments, this step may be performed by the acquisition module 510.
In some embodiments, the target task may include a data transfer task issued by a user (e.g., task source 150). The data transfer tasks may include specific data to be transferred, as well as desired data transfer times. By way of example, the target tasks may include having a predetermined target time window, a designated ground station, a designated relay satellite, a task target star, and the like. These contents may be set by the user who made the transmission application. For example, mission planning system 100 or a system for relay satellite data transmission and time planning has user-oriented programs, such as software programs running on a computer and/or smart mobile-oriented applications (e.g., smartphones, etc.). The user can apply for task transmission on the program. For example, submitting data to be transmitted, an expected transmission time window, designated relay satellites and/or ground stations, mission target satellites, and the like. These may be obtained by the processing device 110 or the acquisition module 510 of the mission planning system 500 as data contained in the target mission. The transmission time window may include a start time and an end time, and the task is completed in a time period within the two times, so as to realize data transmission. In other examples, the target task may first be stored in a storage unit of processing device 110 (e.g., storage device 120) or an on-board storage unit or an off-board storage device of mission planning system 500. The acquisition module 510 may communicate with it to acquire the target task.
In some embodiments, the target task may or may not include a user-specified relay satellite. If not, mission planning system 500 may automatically assign (also referred to as designating) a relay satellite to the target mission. The planning task sequence may be scheduling information for the existing tasks of the designated relay satellite. In some embodiments, the planning task sequence may include a plurality of predefined tasks arranged in a corresponding predefined time window. It will be appreciated that each task requiring data transmission needs to be planned according to the actual situation of the relay satellite (e.g., available time intervals, etc.) and other already established tasks. After planning, the tasks occupy the available transmission time period of the relay satellite according to the corresponding transmission time window (the transmission time window can be a time window expected when the tasks are applied, or can be a time window after planning and adjustment). These tasks that have been planned may be referred to as the scheduled tasks, as compared to the target tasks that have not been planned. These predetermined tasks may be ordered in accordance with a planned transmission time window (i.e., the predetermined time window described above). The start time of the corresponding predetermined time window is early, and the predetermined task is arranged before in the available time interval of the relay satellite. Referring to fig. 4, fig. 4 is an exemplary schematic diagram of time interval planning for a relay satellite according to some embodiments of the present application. As shown in fig. 4, T represents a time interval of the relay satellite, and from left to right represents a time from first to last. Six predetermined tasks have been planned within this time interval, including PM1, PM2, PM3, PM4, PM5, and PM6. The ordering of the six predetermined tasks within the time interval is arranged according to the respective predetermined time window. The start time of the corresponding predetermined time window is preceded, then the predetermined task is ordered and executed first.
The planning task sequence may also be a storage unit (e.g., storage device 120) pre-stored at processing device 110 or an on-board or off-board storage device of task planning system 500, as well as the same or similar. The acquisition module 510 may communicate with it to acquire the planning task sequence.
Step 320, determining whether there is a conflict task that conflicts with the target task in a plurality of predetermined tasks included in the planning task sequence. In some embodiments, this step may be performed by the determination module 520.
In some embodiments, a target time window of the target task and a respective predetermined time window of a plurality of predetermined tasks in the sequence of planning tasks may be used to compare to determine whether there is a conflicting task that conflicts with the target task. For example, if there is a predetermined task corresponding to a predetermined time window overlapping the target time window, the predetermined task may be designated as the conflicting task. For example, assume that the time interval available to the relay satellite is 12:00-18:00. The scheduled time window for sequencing the first scheduled task in the task sequence is 12:30-13:10, the scheduled time window for sequencing the second scheduled task is 14:00-16:00, and the scheduled time window for sequencing the third scheduled task is 16:50-18:00. Assuming that the target time window of the target task is 12:30-13:20, the target task conflicts with the first scheduled task of the order. The first scheduled task of the order may be determined to be a conflicting task. If the target time window for the target task is 12:30-16:00, then the target task conflicts with two predetermined tasks ordered first and second, which may be determined to be conflicting tasks. It may also be noted that the time intervals in the example where the relay satellite is available also include three time intervals that are unoccupied, e.g., 12:00-12:30, 13:10-14:00, and 16:00-16:50. If the target time window of the target task is 12:10-12:30, or 13:10-13:30, or 16:00-16:30, these time periods will fall into the unoccupied time interval, which means that the target task does not conflict with any predetermined task in the planned task sequence. In some embodiments, when it is determined that conflicting tasks exist, the task planning method 300 will continue to step 330. Otherwise, the task planning method 300 may be terminated, and the target task may be directly added to the planning task sequence to complete the task planning process.
Step 330, determining one of the target task and the conflicting task as a first task joining the planning task sequence and the other as a second task performing task re-planning. In some embodiments, this step may be performed by the execution module 530.
It will be appreciated that only one must be selected for execution when two tasks conflict. For example, after reaching the corresponding time window, data transmission is started until the time window ends. Only one of the target task and the conflicting task can be executed at a desired time. That is, only one of the target task and the conflicting task may enter the planning task sequence, while the other needs to be task re-planned, with another available transmission time period allocated thereto. Referring back to the example in step 320, conflicting tasks that conflict with the target task (whose corresponding target time window is 12:30-13:20) are the first scheduled tasks (whose corresponding scheduled time window is 12:30-13:10) ordered. Both occupy a period of 12:30-13:10, while the available resources of the relay satellite can only allow one task to be performed.
Based on this, the execution module 530 may acquire the duration of the predetermined time window of the predetermined task and the duration of the target time window of the target task, which are conflicting tasks, and designate the task corresponding to the larger of the two as the first task and the task corresponding to the smaller as the second task. Continuing with the example above, the target time window for the target task has a duration of 50 minutes and the predetermined time window for the first predetermined task ordered in the planned task sequence as a conflicting task has a duration of 40 minutes. Then the target task will be designated as the first task, will be added to the planning task sequence, and will occupy the position of the scheduled task that is removed from the planning task sequence. Thus, the target task will be the first scheduled task in the sequence of planning tasks, with a scheduled time window of 12:30-13:10. And the scheduled tasks that were moved out of the planning task sequence will be re-planned.
In some embodiments, to implement the re-planning of the second task, the execution module 530 may obtain one or more idle time intervals and determine a time utilization of each idle time interval for a time window of the second task. The idle interval corresponding to the maximum time utilization rate is determined as a target time interval, and the second task is executed in the target time interval.
In some embodiments, the idle time interval may be an idle time interval possessed by a designated relay satellite. For example, 12:00-12:30, 13:20-14:00 (taking up these ten minutes of 13:10-13:20 as the target task is the first task joining the planning task sequence) and 16:00-16:50 time intervals in the previous example. The idle time interval may also be an idle time interval available to other relay satellites. Mission planning system 500 may be in communication with a plurality of relay satellites to enable the above idle time intervals to be acquired. The relay satellite 170 as shown in fig. 1 includes a plurality of relay satellites 170-1, 170-2, and 170-3. The idle time interval of the above relay satellite can be acquired.
In some embodiments, to determine the time utilization, the execution module 530 may determine a ratio of a duration of the time window of the second task to a duration of the idle time interval as the time utilization. Returning to the previous example, the duration of the time window of the second task is 40 minutes, and the duration of the three idle time windows of the relay satellite is 30 minutes, 40 minutes and 50 minutes, respectively. The corresponding three ratios are 1.33, 1 and 0.8, respectively. These three ratios are the time utilization of the idle time interval for the time window of the second task. It should be noted that the time utilization may be not more than 1. A duration exceeding 1 indicates that the idle time interval is less than the duration of the time window of the second task, and is insufficient for performing the second task in the space time interval to complete the data transmission.
In some embodiments, after determining the time utilization rate corresponding to each idle time interval, the execution module 530 may use the idle time interval corresponding to the maximum time utilization rate as a target time interval, and plan the second task to execute in the target time interval. For example, the second task may be performed during a period of 13:20-14:00.
In some embodiments, the idle time interval of other relay satellites acquired by the execution module 530, for example, the aforementioned relay satellite may be referred to as relay satellite a, and further includes idle time intervals of relay satellite B and relay satellite C. The time utilization rate corresponding to the idle time interval 13:20-14:00 of the relay satellite A is 1. An idle time interval 12:40-13:20 of the relay satellite B corresponds to a time utilization of 1. An idle time interval 12:30-13:10 of the relay satellite C corresponds to a time utilization of 1. At this time, the execution module 530 takes the hollow o-time interval of the time window nearest to the second task as the target time interval. For example, the idle time interval of the intermediate satellite C will be determined as the target idle time.
In some embodiments, the execution module 530 may further confirm whether the first task collides with other predetermined tasks after joining the planning task sequence. For example, the target time window for the target task determined to be the first task is 12:30-13:20, which upon joining the planned task sequence occupies not only the predetermined time window 12:30-13:10 for the ordered first predetermined task identified as the second task, but also partially occupies 13:10-13:20 in the idle time interval 13:10-14:00. But does not affect other predetermined tasks. If the target time window of the target task is too long in duration, e.g., 12:30-14:10, then the idle time interval 13:00-14:00 is fully occupied and overlaps with the predetermined time window 14:00-16:00 of the second scheduled task ordered. At this point, adding the target task to the planning task sequence will conflict with other tasks. At this time. The first task will be terminated to join the planning task sequence and the task planning will be resumed. For example, the same or similar to the re-planning of the second task. And the second task may perform a re-planning, or rejoin the planning task sequence.
The above flow is briefly described with reference to fig. 4. Within the time interval T of the relay satellite, 6 predetermined tasks have been planned, including PM1 to PM6. Wherein, there is an idle time interval F1 in PM1 and PM2, an idle time interval F2 in PM3 and PM4, and an idle time interval F3 in PM5 and PM6. TM is the target task. Upon confirmation, the target task TM collides with the predetermined task PM 3. By comparison, the duration of the time window of the target task TM is greater than the duration of the time window of the predetermined task PM 3. Thus, the target task TM will be identified as the first task to join the planned task sequence and occupy the position of the scheduled task PM3 identified as the second task. And PM3, after task re-planning, may be added to the idle time interval F3. If the duration of the time window of the target task TM is smaller than the duration of the time window of the predetermined task PM3, PM3 will be determined as the first task and remain unchanged in the planned task sequence. The target task TM will be determined as the second task and a task re-planning can be performed. For example, to the idle time interval F3. If the target task TM, after being added to the planning task sequence, will overlap with the scheduled task PM4, this operation will be terminated. The target task TM may be re-planned, e.g. added to the idle time interval F3.
In some embodiments, processing results for the target task and/or the conflicting task may be sent. The transmission module 540 of the mission planning system 500 may be used to perform the operations described above. For a target task, the processing results may include that the task may be performed during a desired time window (i.e., a target time window), during a reallocated time interval (i.e., a target time interval), not performed (e.g., designated as a first task but in conflict with other predetermined tasks or designated as a second task, there is no suitable idle time interval for rescheduling), etc. For conflicting tasks, the processing results may include that the task is re-planned to be executed in a new time interval (i.e., the target time interval), that the task is not performed as expected due to conflicts (e.g., there is no suitable idle time interval for re-planning), and so on. The transmission module 540 may send the processing results to the task initiator, i.e., the user. As in fig. 1, the transmission module 540 may send the processing results back to the task source 150 through the network 140 or through a direct connection with the task source 150. In some examples, the processing results may be displayed on a user-oriented program and a reminder may be sent to remind the user to view.
In some embodiments, the planning task sequence may be adjusted. For example, after receiving an externally input task adjustment instruction, the execution module 530 may adjust a predetermined task in the planned task sequence based on the task adjustment instruction, such as adding or deleting the predetermined task, adjusting an execution time of the predetermined task, and the like. Referring to fig. 1, a user inputs a task adjustment instruction such as adjusting the position of each predetermined task in a planning task sequence through an input component of the terminal 130, and the processing device 110 may perform a corresponding operation after receiving the instruction.
It should be noted that the above description of the steps in fig. 3 is only for illustration and description, and does not limit the application scope of the present specification. Various modifications and changes to the steps of fig. 1 may be made by those skilled in the art under the guidance of this specification. However, such modifications and variations are still within the scope of the present description.
The task planning method for the relay satellite can improve the task satisfaction rate so as to reduce or eliminate task conflict, flexibly arrange the tasks, improve the resource utilization rate of the relay satellite and improve the user experience.
FIG. 5 is an exemplary block diagram of a mission planning system, according to some embodiments of the present description. The mission planning system can realize mission planning of the relay satellite. As shown in fig. 5, the mission planning system 500 may include an acquisition module 510, a determination module 520, an execution module 530, and a transmission module 540.
The acquisition module 510 may be configured to acquire a target mission, and a planned mission sequence associated with the relay satellite. The target tasks may include data transfer tasks issued by users (e.g., task sources 150). The planning task sequence may be scheduling information for an existing task of the designated relay satellite.
The determination module 520 may determine whether there are conflicting tasks that conflict with the target task among a plurality of predetermined tasks included in the planning task sequence. The determination module 520 may compare the target time window of the target task with respective ones of a plurality of predetermined tasks in the sequence of planned tasks to determine whether there is a conflicting task that conflicts with the target task. If there is a predetermined task corresponding to a predetermined time window overlapping the target time window, the determining module 520 may determine the predetermined task as a conflicting task.
The execution module 530 may determine, after determining that there is a conflicting task, that one of the target task and the conflicting task is a first task joining the planned task sequence and the other is a second task for performing task re-planning. The execution module 530 may obtain the duration of the predetermined time window of the predetermined task and the duration of the target time window of the target task, which are conflicting tasks, and designate the task corresponding to the larger of the two as the first task and the task corresponding to the smaller as the second task. To implement the re-planning of the second task, the execution module 530 may obtain one or more idle time intervals, and determine a time utilization of each idle time interval for a time window of the second task. The execution module 530 may determine a ratio of a duration of the time window of the second task to a duration of the idle time interval as the time utilization. The idle interval corresponding to the maximum time utilization may be determined by the determining module 530 as a target time interval within which the second task is to be performed.
The execution module 530 may also determine whether the first task has collided with other predetermined tasks after joining the planning task sequence. If so, the execution module 530 may terminate the addition of the first task to the planning task sequence and re-perform the task planning.
The transmission module 540 may send the processing results for the target task and/or the conflicting task. For example, the transmission module 540 may send the processing results to the task initiator, i.e., the user.
For other descriptions of the above modules, reference may be made to the flow chart portion of the present application, for example, fig. 3, and no further description is given here.
It should be understood that the system shown in fig. 5 and its modules may be implemented in a variety of ways. For example, in some embodiments, the system and its modules may be implemented in hardware, software, or a combination of software and hardware. Wherein the hardware portion may be implemented using dedicated logic; the software portions may then be stored in a memory and executed by a suitable instruction execution system, such as a microprocessor or special purpose design hardware. Those skilled in the art will appreciate that the methods and systems described above may be implemented using computer executable instructions and/or embodied in processor control code, such as provided on a carrier medium such as a magnetic disk, CD or DVD-ROM, a programmable memory such as read only memory (firmware), or a data carrier such as an optical or electronic signal carrier. The system of the present specification and its modules may be implemented not only with hardware circuits such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, etc., or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., but also with software executed by various types of processors, for example, and with a combination of the above hardware circuits and software (e.g., firmware).
It should be noted that the above description of the modules is for convenience of description only and is not intended to limit the present description to the scope of the illustrated embodiments. It will be appreciated by those skilled in the art that, given the principles of the system, various modules may be combined arbitrarily or a subsystem may be constructed in connection with other modules without departing from such principles. The respective modules may share one memory module, or the respective modules may have respective memory modules. Such variations are within the scope of the present description.
Having described the basic concepts herein, it will be apparent to those skilled in the art that the foregoing detailed disclosure is by way of example only and is not intended to be limiting. Although not explicitly described herein, various modifications, improvements, and adaptations to the present disclosure may occur to one skilled in the art. Such modifications, improvements, and modifications are intended to be suggested within this specification, and therefore, such modifications, improvements, and modifications are intended to be included within the spirit and scope of the exemplary embodiments of the present invention.
Meanwhile, the specification uses specific words to describe the embodiments of the specification. Reference to "one embodiment," "an embodiment," and/or "some embodiments" means that a particular feature, structure, or characteristic is associated with at least one embodiment of the present description. Thus, it should be emphasized and should be appreciated that two or more references to "an embodiment" or "one embodiment" or "an alternative embodiment" in various positions in this specification are not necessarily referring to the same embodiment. Furthermore, certain features, structures, or characteristics of one or more embodiments of the present description may be combined as suitable.
Furthermore, those skilled in the art will appreciate that the various aspects of the specification can be illustrated and described in terms of several patentable categories or circumstances, including any novel and useful procedures, machines, products, or materials, or any novel and useful modifications thereof. Accordingly, aspects of the present description may be performed entirely by hardware, entirely by software (including firmware, resident software, micro-code, etc.), or by a combination of hardware and software. The above hardware or software may be referred to as a "data block," module, "" engine, "" unit, "" component, "or" system. Furthermore, aspects of the specification may take the form of a computer product, comprising computer-readable program code, embodied in one or more computer-readable media.
The computer storage medium may contain a propagated data signal with the computer program code embodied therein, for example, on a baseband or as part of a carrier wave. The propagated signal may take on a variety of forms, including electro-magnetic, optical, etc., or any suitable combination thereof. A computer storage medium may be any computer readable medium that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code located on a computer storage medium may be propagated through any suitable medium, including radio, cable, fiber optic cable, RF, or the like, or a combination of any of the foregoing.
The computer program code necessary for operation of portions of the present description may be written in any one or more programming languages, including an object oriented programming language such as Java, scala, smalltalk, eiffel, JADE, emerald, C ++, c#, vb net, python and the like, a conventional programming language such as C language, visual Basic, fortran 2003, perl, COBOL 2002, PHP, ABAP, a dynamic programming language such as Python, ruby and Groovy, or other programming languages and the like. The program code may execute entirely on the user's computer or as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any form of network, such as a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet), or the use of services such as software as a service (SaaS) in a cloud computing environment.
Furthermore, the order in which the elements and sequences are processed, the use of numerical letters, or other designations in the description are not intended to limit the order in which the processes and methods of the description are performed unless explicitly recited in the claims. While certain presently useful inventive embodiments have been discussed in the foregoing disclosure, by way of various examples, it is to be understood that such details are merely illustrative and that the appended claims are not limited to the disclosed embodiments, but, on the contrary, are intended to cover all modifications and equivalent arrangements included within the spirit and scope of the embodiments of the present disclosure. For example, while the system components described above may be implemented by hardware devices, they may also be implemented solely by software solutions, such as installing the described system on an existing server or mobile device.
Likewise, it should be noted that in order to simplify the presentation disclosed in this specification and thereby aid in understanding one or more inventive embodiments, various features are sometimes grouped together in a single embodiment, figure, or description thereof. This method of disclosure, however, is not intended to imply that more features than are presented in the claims are required for the present description. Indeed, less than all of the features of a single embodiment disclosed above.
Finally, it should be understood that the embodiments described in this specification are merely illustrative of the principles of the embodiments of this specification. Other variations are possible within the scope of this description. Thus, by way of example, and not limitation, alternative configurations of embodiments of the present specification may be considered as consistent with the teachings of the present specification. Accordingly, the embodiments of the present specification are not limited to only the embodiments explicitly described and depicted in the present specification.

Claims (18)

1. The task planning method for the relay satellite is characterized by comprising the following steps of:
acquiring a target task and a planning task sequence related to the relay satellite, wherein the planning task sequence comprises a plurality of preset tasks which are arranged according to a corresponding preset time window;
Determining whether a conflict task which conflicts with the target task exists in the plurality of preset tasks based on the target time window of the target task and the preset time windows of the plurality of preset tasks;
if so, determining one of the target task and the conflict task as a first task added to the planning task sequence, and the other task as a second task for performing task re-planning;
the first task is located at a position of the conflict task in the planning task sequence.
2. The task planning method of claim 1, wherein the determining whether conflicting tasks exist comprises:
determining whether a predetermined task corresponding to a predetermined time window overlapping the target time window exists; if so, designating the preset task as the conflict task.
3. The task planning method of claim 1, wherein the determining the first task and the second task comprises:
acquiring the duration of the preset time window and the duration of the target time window;
designating the larger as the first task and the smaller as the second task.
4. The task planning method of claim 1 wherein performing task re-planning on the second task comprises:
Acquiring one or more idle time intervals;
determining a time utilization rate of each idle time interval for a time window of the second task;
and determining an idle time interval corresponding to the maximum time utilization rate as a target time interval, and executing the second task in the target time interval.
5. The mission planning method of claim 4, wherein determining a time utilization comprises:
designating the ratio of the duration of the time window of the second task to the duration of the idle time interval as the time utilization rate; wherein the ratio is not more than 1.
6. The mission planning method of claim 1, further comprising:
and sending the processing result of the target task and/or the conflict task.
7. The mission planning method of claim 1, further comprising:
determining whether the first task conflicts with other preset tasks after being added into the planning task sequence;
if yes, terminating the first task to join the planning task sequence.
8. The mission planning method of claim 1, further comprising:
And receiving a task adjustment instruction to adjust the planning task sequence.
9. A mission planning system for a relay satellite, the mission planning system comprising: the device comprises an acquisition module, a determination module and an execution module;
the acquisition module is used for acquiring a target task and a planning task sequence related to the relay satellite, wherein the planning task sequence comprises a plurality of preset tasks which are arranged according to a corresponding preset time window;
the determining module is used for determining whether a conflict task which conflicts with the target task exists in the plurality of preset tasks or not based on the target time window of the target task and the preset time windows of the plurality of preset tasks;
the execution module is used for determining one of the target task and the conflict task as a first task added to the planning task sequence and the other as a second task for executing task re-planning under the condition that the conflict task exists;
the first task is located at a position of the conflict task in the planning task sequence.
10. The mission planning system of claim 9, wherein to determine whether conflicting tasks exist, the determination module is to:
Determining whether a predetermined task corresponding to a predetermined time window overlapping the target time window exists; if so, designating the preset task as the conflict task.
11. The mission planning system of claim 9, wherein to determine the first and second tasks, the execution module is to:
acquiring the duration of the preset time window and the duration of the target time window;
designating the larger as the first task and the smaller as the second task.
12. The mission planning system of claim 9, wherein to perform mission re-planning for the second mission, the execution module is to:
acquiring one or more idle time intervals;
determining a time utilization rate of each idle time interval for a time window of the second task;
and determining an idle time interval corresponding to the maximum time utilization rate as a target time interval, and executing the second task in the target time interval.
13. The mission planning system of claim 12, wherein to determine time utilization, the execution module is to:
designating the ratio of the duration of the time window of the second task to the duration of the idle time interval as the time utilization rate; wherein the ratio is not more than 1.
14. The mission planning system of claim 9, further comprising a transmission module;
the transmission module is used for sending the processing result of the target task and/or the conflict task.
15. The mission planning system of claim 9, wherein the execution module is further configured to:
determining whether the first task conflicts with other preset tasks after being added into the planning task sequence;
if yes, terminating the first task to join the planning task sequence.
16. The mission planning system of claim 9, wherein the execution module is further configured to:
and receiving a task adjustment instruction to adjust the planning task sequence.
17. A mission planning apparatus, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, which when executed by the processor, implements the steps of the task planning method according to any one of claims 1-8.
18. A computer readable storage medium, characterized in that the storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the method according to any of claims 1-8.
CN202311652993.6A 2023-12-05 2023-12-05 Task planning method, device and equipment for relay satellite and storage medium Pending CN117371764A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311652993.6A CN117371764A (en) 2023-12-05 2023-12-05 Task planning method, device and equipment for relay satellite and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311652993.6A CN117371764A (en) 2023-12-05 2023-12-05 Task planning method, device and equipment for relay satellite and storage medium

Publications (1)

Publication Number Publication Date
CN117371764A true CN117371764A (en) 2024-01-09

Family

ID=89394841

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311652993.6A Pending CN117371764A (en) 2023-12-05 2023-12-05 Task planning method, device and equipment for relay satellite and storage medium

Country Status (1)

Country Link
CN (1) CN117371764A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112070370A (en) * 2020-08-21 2020-12-11 中南大学 Relay satellite task planning method, system and storage medium
CN113965255A (en) * 2021-12-21 2022-01-21 北京航空航天大学 Relay satellite task planning method and device for observing transmission coordination
CN115276758A (en) * 2022-06-21 2022-11-01 重庆邮电大学 Relay satellite dynamic scheduling method based on task slack

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112070370A (en) * 2020-08-21 2020-12-11 中南大学 Relay satellite task planning method, system and storage medium
CN113965255A (en) * 2021-12-21 2022-01-21 北京航空航天大学 Relay satellite task planning method and device for observing transmission coordination
CN115276758A (en) * 2022-06-21 2022-11-01 重庆邮电大学 Relay satellite dynamic scheduling method based on task slack

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
赵国秋: "《走过心灵的雨季:中学生心理健康读本》", 30 November 2008, 浙江科学技术出版社, pages: 168 *

Similar Documents

Publication Publication Date Title
CN108614726B (en) Virtual machine creation method and device
US11455582B2 (en) Systems and methods for optimizing an online on-demand service
CN109002451B (en) Map data thinning method and device
CN105144109B (en) Distributive data center technology
EP3651545A1 (en) System, method, and device for exposing wireless module data storage
CN112988362B (en) Task processing method and device, electronic equipment and storage medium
CN106406983A (en) Task scheduling method and device in cluster
Shu et al. Dependency-aware and latency-optimal computation offloading for multi-user edge computing networks
CN102662740B (en) Asymmetric multi-core system and realization method thereof
Zhou et al. Optimal mobile device selection for mobile cloud service providing
WO2017172820A1 (en) Time-based adjustable load balancing
CN108319499B (en) Task scheduling method and device
CN107704310B (en) Method, device and equipment for realizing container cluster management
CN110704177A (en) Computing task processing method and device, computer equipment and storage medium
CN111352735A (en) Data acceleration method, device, storage medium and equipment
CN117371764A (en) Task planning method, device and equipment for relay satellite and storage medium
EP3985493A1 (en) Group member management method and apparatus, group message processing method and apparatus, device, and storage medium
US10452126B2 (en) Method for fair off-loading of computational tasks for efficient energy management in mobile devices like smart phones
CN107491352A (en) A kind of resource regulating method and device
CN111126604A (en) Model training method, device, server and storage medium
US9854035B2 (en) Maintaining state synchronization of an application between computing devices as well as maintaining state synchronization of common information between different applications without requiring periodic synchronization
CN112688980B (en) Resource distribution method and device, and computer equipment
US11650845B2 (en) Computation sharing among devices using device OS clustering
AU2017216572A1 (en) System and method for management of goods delivery
CN112148935B (en) Method and apparatus for NBMP function execution for multiple instances

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