CN116090743A - Satellite task allocation method and device, electronic equipment and storage medium - Google Patents
Satellite task allocation method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN116090743A CN116090743A CN202211532370.0A CN202211532370A CN116090743A CN 116090743 A CN116090743 A CN 116090743A CN 202211532370 A CN202211532370 A CN 202211532370A CN 116090743 A CN116090743 A CN 116090743A
- Authority
- CN
- China
- Prior art keywords
- task
- satellite
- bidding
- unit
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000011156 evaluation Methods 0.000 claims description 7
- 230000008901 benefit Effects 0.000 claims description 6
- 230000006855 networking Effects 0.000 claims description 6
- 239000007787 solid Substances 0.000 claims description 6
- 230000009471 action Effects 0.000 claims description 4
- 238000007689 inspection Methods 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 abstract description 6
- 238000013461 design Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 13
- 230000006870 function Effects 0.000 description 9
- 238000004422 calculation algorithm Methods 0.000 description 8
- 238000012545 processing Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000005611 electricity Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000000354 decomposition reaction Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 235000021538 Chard Nutrition 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 239000000047 product Substances 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/08—Auctions
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Finance (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Position Fixing By Use Of Radio Waves (AREA)
Abstract
The invention provides a satellite task allocation method, a device, electronic equipment and a storage medium, which establish a task allocation model for a plurality of collaborative work modes of a distributed agile satellite and design an allocation result profit calculation model; and adopting strategies such as buying, selling, exchanging and replacing in the contract to perform auction and allocation of the observation task.
Description
Technical Field
The invention relates to the technical field of satellite remote sensing, in particular to a satellite task allocation method, a satellite task allocation device, electronic equipment and a storage medium.
Background
Aiming at the problem of task collaborative distribution in multi-star networking pair observation, researchers in various countries currently propose a plurality of regional decomposition methods, which mainly comprise the following categories: firstly, a heuristic algorithm is applied to task allocation, so that the requirements of different task demands on allocation modes are well met; secondly, distributed task planning and foreign distributed task planning algorithm systems are relatively mature, wherein Richards and the like of NASA aim at the on-orbit running problem of a distributed satellite constellation, an on-board self-service planning system is developed, and the system adopts a flexible hierarchical organization structure and can be well adapted to the change of resources or tasks.
The defects and shortcomings of the method are mainly manifested in the following three points:
domestic technology is not mature enough and cannot be temporarily compared with foreign technology;
the traditional centralized task planning can not meet the normal condition that new tasks are continuously added;
the collaboration and interaction of multiple stars cannot be realized in the time dimension, so that resources can be better utilized at the system level.
Therefore, how to provide a satellite task allocation method with higher efficiency is a problem to be solved at present.
Disclosure of Invention
In order to solve the problems, the invention provides a satellite task allocation method, a satellite task allocation device, electronic equipment and a storage medium.
In a first aspect of the embodiment of the present invention, a satellite task allocation method is provided, which is applied to a distributed remote sensing satellite system of a multi-satellite network, and the method includes:
receiving task information of a user, forming bidding requirements according to task demands in the task information, and sending the bidding requirements to each satellite unit serving as a bidding party;
comparing the load capacity and the resource data of the self-control satellite according to the task requirement in the received satellite bidding requirement, and filling in a bidding scheme on the premise of meeting the basic requirement;
comparing and evaluating received bidding schemes fed back by each satellite unit, and selecting a bidding scheme meeting the conditions according to the task execution conditions;
and notifying each satellite unit of the winning bid condition of each unit, and simultaneously notifying the satellite unit meeting the task execution conditions to add the corresponding task into the own satellite task queue.
Optionally, the method for judging whether the basic requirement is met by the satellite includes:
and judging whether the access time of the satellite to the task target meets the time requirement in the task information.
Optionally, the step of determining whether the access time of the satellite to the task target meets the time requirement in the task information specifically includes:
firstly, judging that the access time of a satellite to a task target meets the time requirement in task information;
and judging whether the window is within the time requirement range of the task information for the access time window of the satellite in the task information to the task target.
Optionally, the method for filling the bidding scheme by the satellite according to the task demand comparison in the bidding requirement comprises the following steps:
determining whether a task can be executed, the time and equipment for executing the task, the loading action condition of a satellite when the task is executed and other information to form a bidding scheme;
the satellite unit internally calculates the cost and the acquired benefits of executing the task.
Optionally, the step of determining whether the task can be executed and the time for executing the task specifically includes:
and sequentially selecting time windows according to a time sequence for a time set meeting the time range constraint in the task information, and judging whether the task can be executed or not according to the task feasibility judging step until a time window capable of executing the task is determined or a conclusion that the task cannot be executed is obtained.
Optionally, the task feasibility determining step specifically includes:
judging whether the satellite needs to perform attitude maneuver according to the current attitude of the satellite and the attitude information of the satellite when the task is executed, and performing attitude adjustment operation on the satellite in advance according to the time required by the satellite attitude maneuver;
the method comprises the steps of obtaining attitude information of a satellite when a previous observation task of a current task is finished and satellite attitude information when the current task is executed, judging whether attitude adjustment is carried out, if the attitude adjustment is needed, carrying out attitude adjustment on the satellite in advance, and adjusting the satellite to the attitude of the current task;
after the posture adjustment is completed, performing on-satellite resource inspection, including judging whether the power consumption of the task is smaller than the current available power of the satellite and judging whether the solid storage required for storing the current task is smaller than the current available storage capacity of the satellite;
if the satellite pose and the resource satisfy, the time window is determined to be the time window satisfying the task.
Optionally, the step of internally calculating the cost and the obtained benefit for executing the task by the satellite unit specifically includes:
for satellites that can perform tasks, revenue is calculated from the resources consumed performing the tasks.
In a second aspect of the embodiment of the present invention, a satellite task allocation device is provided, which is applied to a distributed remote sensing satellite system of a multi-star networking, and the device includes:
the task bidding unit is used for receiving task information of a user, forming bidding requirements according to task demands in the task information and sending the bidding requirements to each satellite unit serving as a bidding party;
the bidding document receiving unit is used for comparing the loading capacity and the resource data of the self-control satellite according to the task requirement in the received satellite bidding requirement, and filling a bidding document scheme on the premise of meeting the basic requirement;
the bidding evaluation unit is used for comparing and evaluating the received bidding schemes fed back by each satellite unit, and selecting a bidding scheme meeting the conditions according to the task execution conditions;
and the winning bid notification unit is used for notifying each satellite unit of winning bid conditions of each unit and simultaneously notifying the satellite units meeting the task execution conditions to add the corresponding tasks into own satellite task queues.
A third aspect of an embodiment of the present invention provides an electronic device, including:
one or more processors; a memory; one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more applications configured to perform the method of the first aspect.
A fourth aspect of an embodiment of the present invention provides a computer readable storage medium, wherein the computer readable storage medium has program code stored therein, the program code being callable by a processor to perform the method according to the first aspect.
In summary, the invention provides a satellite task allocation method, a device, electronic equipment and a storage medium, which build a task allocation model for a plurality of collaborative working modes of a distributed agile satellite and design an allocation result profit calculation model; and adopting strategies such as buying, selling, exchanging and replacing in the contract to perform auction and allocation of the observation task.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of an application scenario of a satellite task allocation method and apparatus according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for assigning tasks to satellites according to an embodiment of the invention;
FIG. 3 is a flowchart of a method for task feasibility determining step according to an embodiment of the invention;
FIG. 4 is a task negotiation diagram of a contract net algorithm according to an embodiment of the present invention;
FIG. 5 is a functional block diagram of a satellite task allocation apparatus according to an embodiment of the present invention;
fig. 6 is a block diagram of an electronic device for performing a satellite task allocation method according to an embodiment of the present invention.
Fig. 7 is a block diagram of a computer-readable storage medium storing or carrying program code for implementing a satellite mission allocation method according to an embodiment of the present invention.
Icon:
ground or main star 100; a remote sensing satellite 200; a task bidding unit 110; a tagbook receiving unit 120; a tagout evaluation unit 130; a winning bid notification unit 140; an electronic device 300; a processor 310; a memory 320; a computer-readable storage medium 400; program code 410.
Detailed Description
Aiming at the problem of task collaborative distribution in multi-star networking pair observation, researchers in various countries currently propose a plurality of regional decomposition methods, which mainly comprise the following categories: firstly, a heuristic algorithm is applied to task allocation, so that the requirements of different task demands on allocation modes are well met; secondly, distributed task planning and foreign distributed task planning algorithm systems are relatively mature, wherein Ri chards and the like of NASA aim at the on-orbit running problem of a distributed satellite constellation, an on-board self-service planning system is developed, and the system adopts a flexible hierarchical organization structure and can be well adapted to the change of resources or tasks.
The defects and shortcomings of the method are mainly manifested in the following three points:
domestic technology is not mature enough and cannot be temporarily compared with foreign technology;
the traditional centralized task planning can not meet the normal condition that new tasks are continuously added;
the collaboration and interaction of multiple stars cannot be realized in the time dimension, so that resources can be better utilized at the system level.
Therefore, how to provide a satellite task allocation method with higher efficiency is a problem to be solved at present.
In view of the above, the designer of the invention designs a satellite task allocation method, a satellite task allocation device, electronic equipment and a storage medium, realizes the cooperation and interaction of multiple satellites, and can better utilize resources in a system level.
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. The components of the embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the invention, as presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
In the description of the present invention, it should be noted that, directions or positional relationships indicated by terms such as "top", "bottom", "inner", "outer", etc., are directions or positional relationships based on those shown in the drawings, or those that are conventionally put in use, are merely for convenience in describing the present invention and simplifying the description, and do not indicate or imply that the apparatus or elements referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and the like, are used merely to distinguish between descriptions and should not be construed as indicating or implying relative importance.
In the description of the present invention, it should also be noted that, unless explicitly specified and limited otherwise, the terms "disposed," "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; can be directly connected or indirectly connected through an intermediate medium, and can be communication between two elements. The specific meaning of the above terms in the present invention will be understood in specific cases by those of ordinary skill in the art.
It should be noted that, without conflict, the embodiments of the present invention and features of the embodiments may be combined with each other.
Examples
Referring to fig. 1, an application scenario diagram of a satellite task allocation method and apparatus is provided in this embodiment.
As shown in fig. 1, the method and the device for distributing satellite tasks are applied to a distributed remote sensing satellite system of a multi-satellite networking, a plurality of remote sensing satellites 200 are connected with the ground or a main satellite 100 in a wireless communication mode, the ground or the main satellite 100 receives task information from a user, and generated signboards are respectively sent to the remote sensing satellites 200. In the present system, the ground or main satellite 100 acts as the bidding party and each remote sensing satellite 200 acts as the bidding party.
On the basis of the above, as shown in fig. 2, a satellite task allocation method according to an embodiment of the present invention includes:
step S101, receiving task information of a user, forming bidding requirements according to task demands in the task information, and sending the bidding requirements to each satellite unit serving as a bidding party;
the task information includes information such as user information of the release task, task targets, task time range requirements and the like, and according to the information, corresponding task requirements can be extracted, so that bidding requirements are formed, and bidding is carried out on each satellite unit serving as a bidding party.
Step S102, comparing the load capacity and the resource data of the self-control satellite according to the task requirement in the received satellite bidding requirement, and filling in a bidding scheme on the premise of meeting the basic requirement.
For the satellite units receiving the bidding request, whether the basic bidding requirement is met or not is judged according to the self-control satellite condition, and on the basis, the self-resource and task information are compared to fill in a bidding scheme. After the completion of the bidding scheme, the satellite feeds back the bidding scheme to the bidding party.
In this embodiment, the method for determining whether the satellite meets the basic requirement includes:
and judging whether the access time of the satellite to the task target meets the time requirement in the task information.
The method is limited by satellite attitude maneuver capability, satellite imaging mode, satellite orbit and target position relationship, and the execution time of the satellite on the target needs to meet the constraint of a visible time window.
Specifically, the method for judging whether the access time of the satellite to the task target meets the time requirement in the task information specifically comprises the following steps:
firstly, judging that the access time of a satellite to a task target meets the time requirement in task information;
and judging whether the window is within the time requirement range of the task information for the access time window of the satellite in the task information to the task target.
Based on the two conditions, it can be determined whether the satellite satisfies the basic conditions for performing the task. For some satellites, the above basic conditions may not be satisfied. For some satellites, there may be one or more time windows that satisfy the above basic conditions.
For satellites with time windows meeting basic conditions, a bidding scheme needs to be filled in for the resources of the satellites according to the task demand ratio in bidding requirements.
As a preferred embodiment, the method for filling out the bidding scheme specifically includes:
determining whether a task can be executed, the time and equipment for executing the task, the loading action condition of a satellite when the task is executed and other information to form a bidding scheme;
the satellite unit internally calculates the cost and the acquired benefits of executing the task.
For satellites, there is a time window that satisfies the basic conditions, which does not necessarily mean that it is able to perform a task, requiring a further determination. The specific operation mode is that for a time set meeting the time range constraint in the task information, time windows are sequentially selected according to a time sequence, and whether the task can be executed is judged according to the task feasibility judging step until a time window capable of executing the task is determined or a conclusion that the task cannot be executed is obtained.
If all time windows in the time window set of one satellite cannot be judged through task feasibility, judging that the satellite cannot execute tasks. And judging sequentially according to the time sequence, and if the time window of one satellite passes the task feasibility judgment, determining that the satellite can execute the task. And determining a mission plan and a bidding scheme supplement according to the time window, and performing subsequent profit calculation.
As shown in fig. 3, the task feasibility determining step specifically includes:
step S201, judging whether the satellite needs to conduct attitude maneuver according to the current attitude of the satellite and the attitude information of the satellite when the task is executed, and conducting attitude adjustment operation on the satellite in advance according to the time required by the satellite attitude maneuver;
when the satellite executes the task, the satellite is positioned at a corresponding star attitude angle according to the task content. Therefore, when the bidding document is received, the current posture of the satellite is not necessarily matched with the posture angle of the star for executing the task, and if the current posture of the satellite is not matched with the posture angle of the star for executing the task, the satellite needs to conduct posture maneuver if the task is to be executed. At this time, the time required by the attitude maneuver needs to be calculated, and the satellite can start to execute the task after completing the attitude maneuver, so the time required by the attitude maneuver, namely the preparation time, needs to be calculated.
Step S202, comparing the attitude information of the satellite when the previous observation task of the current task is finished with the attitude information of the satellite when the current task is executed, judging whether to carry out attitude adjustment, if so, carrying out attitude adjustment on the satellite in advance, and adjusting the satellite to the attitude of the current task;
the attitude of the satellite may be continuously adjusted while the satellite performs the previous observation task, so that it is necessary to determine the attitude information of the satellite at the end of the previous observation task of the current task. And then comparing the satellite attitude information with satellite attitude information when the current task is executed, and if the satellite attitude information and the satellite attitude information are not matched, indicating that the satellite needs to be subjected to attitude adjustment. For the satellite with the posture needing to be adjusted, the action of satellite posture adjustment is executed in advance until the satellite is adjusted to be at the same position as the satellite posture information of the current task.
And step S203, after the posture adjustment is completed, performing on-satellite resource inspection, including judging whether the power consumption of the task is smaller than the current available power of the satellite and judging whether the solid storage required for storing the current task is smaller than the current available storage capacity of the satellite.
After the satellite attitude adjustment is completed, it is further necessary to determine whether the satellite satisfies the resource constraint. The resource constraint inspection mainly comprises two aspects of content, namely task electricity consumption and task required solid storage, and is used for judging whether the task electricity consumption is smaller than the current available electricity of the satellite and judging whether the task required solid storage is smaller than the current available storage capacity of the satellite. If the power consumption of the task is too large or the required solid storage of the task is too large, the task cannot be completed.
In step S204, if the satellite attitude and the resource satisfy the condition, the time window is determined to be a time window satisfying the task.
For satellites where both time constraints and resource constraints are met, subsequent revenue calculations may be performed.
In this embodiment, the step of calculating the benefit specifically includes:
for satellites that can perform tasks, revenue is calculated from the resources consumed performing the tasks.
For the satellite capable of executing the task, the resources consumed by the satellite for executing the task can be differentiated according to the time consumed by the satellite for adjusting the posture and the self resource condition. Thus, there is a need to calculate the profitability of the task being performed for evaluation by the ground or the stars.
And step S103, comparing and evaluating the received bidding schemes fed back by each satellite unit, and selecting the bidding scheme meeting the conditions according to the task execution conditions.
After receiving all the bidding schemes fed back by the satellite capable of executing the task, evaluating all the bidding, and selecting an optimal scheme by a bidding party to finish the bidding process.
In the preferred embodiment, when the evaluation is performed, a proper matching strategy is adopted according to the requirement condition of the task, and the winning satellites can be distinguished under different strategies. For example, when demand weights are more placed on completion time, the winning satellite may be selected that is capable of completing the task fastest, and when demand weights are more placed on revenue, the winning satellite may be selected that is highest in revenue.
Step S104, notifying each satellite unit of the winning bid condition of each unit, and notifying the satellite unit meeting the task execution conditions to add the corresponding task into the own satellite task queue.
After confirming the winning bid satellite unit, notifying each satellite unit of winning bid conditions of each unit, after confirming successful bidding of the winning bid satellite unit, adding the corresponding task in the bidding scheme into a task queue of the winning bid unit, waiting until the corresponding time node, and starting executing the task.
It should be noted that the satellite task bidding method provided by the invention can be realized through a contract network algorithm model, and the contract network algorithm processes operations such as multi-star task negotiation, claim, distribution, planning and the like in a distributed manner. The data required by the contract network negotiation is realized by the inter-satellite links, the contract network protocol is completed based on the inter-satellite links in an iteration mode of bidding, bid evaluation, exchange, buying and selling, replacement and the like, and a task allocation model of the contract network algorithm is shown in the following figure 4.
The satellite task allocation method provided by the embodiment establishes a task allocation model for a plurality of collaborative work modes of the distributed agile satellite, and designs an allocation result profit calculation model; and adopting strategies such as buying, selling, exchanging and replacing in the contract to perform auction and allocation of the observation task.
As shown in fig. 5, the satellite task allocation device provided by the embodiment of the present invention includes:
a task bidding unit 110 for receiving task information of a user, forming bidding requirements according to task demands in the task information, and transmitting the bidding requirements to each satellite unit as a bidding party;
the bidding document receiving unit 120 is configured to compare the loading capacity and the resource data of the autonomous satellite according to the task requirement in the received satellite bidding requirement, and fill in a bidding document scheme on the premise of meeting the basic requirement;
the bidding evaluation unit 130 is configured to compare and evaluate received bidding schemes fed back by each satellite unit, and select a bidding scheme meeting the conditions according to the task execution conditions;
and the winning bid notification unit 140 is configured to notify each satellite unit of winning bid in each unit, and notify the satellite unit that the task execution condition is met to add the corresponding task to its own satellite task queue.
The satellite task allocation device provided by the embodiment of the present invention is used for implementing the satellite task allocation method, so that the specific implementation manner is the same as the above method, and will not be repeated here.
As shown in fig. 6, an embodiment of the present invention provides a block diagram of an electronic device 300. The electronic device 300 may be a smart phone, tablet, electronic book, etc. capable of running an application program of the electronic device 300. The electronic device 300 in this application may include one or more of the following components: a processor 310, a memory 320, and one or more application programs, wherein the one or more application programs may be stored in the memory 320 and configured to be executed by the one or more processors 310, the one or more program(s) configured to perform the method as described in the foregoing method embodiments.
Processor 310 may include one or more processing cores. The processor 310 utilizes various interfaces and lines to connect various portions of the overall electronic device 300, perform various functions of the electronic device 300, and process data by executing or executing instructions, programs, code sets, or instruction sets stored in the memory 320, and invoking data stored in the memory 320. Alternatively, the processor 310 may be implemented in hardware in at least one of digital signal processing (Digital Signal Processing, DSP), field programmable gate array (Field-Programmable Gate Array, FPGA), programmable logic array (Programmable Logic Array, PLA). The processor 310 may integrate one or a combination of several of a central processing unit (Central Processing Unit, CPU), an image processor (Graphics Processing Unit, GPU), and a modem, etc. The CPU mainly processes an operating system, a user interface, an application program and the like; the GPU is used for being responsible for rendering and drawing of display content; the modem is used to handle wireless communications. It will be appreciated that the modem may not be integrated into the processor 310 and may be implemented solely by a single communication chip.
The Memory 320 may include a random access Memory (Random Access Memory, RAM) or a Read-Only Memory (Read-Only Memory). Memory 320 may be used to store instructions, programs, code sets, or instruction sets. The memory 320 may include a stored program area and a stored data area, wherein the stored program area may store instructions for implementing an operating system, instructions for implementing at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the various method embodiments described below, etc. The storage data area may also store data created by the terminal in use (such as phonebook, audio-video data, chat-record data), etc.
As shown in fig. 7, a block diagram of a computer-readable storage medium 400 is provided according to an embodiment of the present invention. The computer readable medium has stored therein a program code 410, said program code 410 being callable by a processor for performing the method described in the above method embodiments.
The computer readable storage medium 400 may be an electronic memory such as a flash memory, an EEPROM (electrically erasable programmable read only memory), an EPROM, a hard disk, or a ROM. Optionally, the computer readable storage medium 400 comprises a non-volatile computer readable medium (non-transitory computer-readable storage medium). The computer readable storage medium 400 has storage space for program code 410 that performs any of the method steps described above. These program code 410 can be read from or written to one or more computer program products. Program code 410 may be compressed, for example, in a suitable form.
In summary, the invention provides a satellite task allocation method, a device, electronic equipment and a storage medium, which build a task allocation model for a plurality of collaborative working modes of a distributed agile satellite and design an allocation result profit calculation model; and adopting strategies such as buying, selling, exchanging and replacing in the contract to perform auction and allocation of the observation task.
In several embodiments disclosed in this application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The apparatus embodiments described above are merely illustrative, for example, flow diagrams and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, the functional modules in the embodiments of the present application may be integrated together to form a single part, or each module may exist alone, or two or more modules may be integrated to form a single part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Claims (10)
1. A satellite mission allocation method applied to a distributed remote sensing satellite system of a multi-satellite networking, the method comprising:
receiving task information of a user, forming bidding requirements according to task demands in the task information, and sending the bidding requirements to each satellite unit serving as a bidding party;
comparing the load capacity and the resource data of the self-control satellite according to the task requirement in the received satellite bidding requirement, and filling in a bidding scheme on the premise of meeting the basic requirement;
comparing and evaluating received bidding schemes fed back by each satellite unit, and selecting a bidding scheme meeting the conditions according to the task execution conditions;
and notifying each satellite unit of the winning bid condition of each unit, and simultaneously notifying the satellite unit meeting the task execution conditions to add the corresponding task into the own satellite task queue.
2. The method for assigning tasks to satellites according to claim 1, wherein the method for determining whether the satellite meets basic requirements comprises:
and judging whether the access time of the satellite to the task target meets the time requirement in the task information.
3. The method for assigning tasks to satellites according to claim 2, wherein the step of determining whether the access time of the satellites to the task objects meets the time requirement in the task information comprises:
firstly, judging that the access time of a satellite to a task target meets the time requirement in task information;
and judging whether the window is within the time requirement range of the task information for the access time window of the satellite in the task information to the task target.
4. The method for allocating tasks to satellites according to claim 3, wherein the method for filling out a bidding scheme for the satellites according to the task demand ratio in the bidding requirements comprises the following steps:
determining whether a task can be executed, the time and equipment for executing the task, the loading action condition of a satellite when the task is executed and other information to form a bidding scheme;
the satellite unit internally calculates the cost and the acquired benefits of executing the task.
5. The method for assigning tasks to satellites as claimed in claim 4, wherein the step of determining whether a task can be executed or not and the time for executing the task specifically comprises:
and sequentially selecting time windows according to a time sequence for a time set meeting the time range constraint in the task information, and judging whether the task can be executed or not according to the task feasibility judging step until a time window capable of executing the task is determined or a conclusion that the task cannot be executed is obtained.
6. The method for assigning tasks to satellites as set forth in claim 5, wherein the task feasibility determining step comprises:
judging whether the satellite needs to perform attitude maneuver according to the current attitude of the satellite and the attitude information of the satellite when the task is executed, and performing attitude adjustment operation on the satellite in advance according to the time required by the satellite attitude maneuver;
the method comprises the steps of obtaining attitude information of a satellite when a previous observation task of a current task is finished and satellite attitude information when the current task is executed, judging whether attitude adjustment is carried out, if the attitude adjustment is needed, carrying out attitude adjustment on the satellite in advance, and adjusting the satellite to the attitude of the current task;
after the posture adjustment is completed, performing on-satellite resource inspection, including judging whether the power consumption of the task is smaller than the current available power of the satellite and judging whether the solid storage required for storing the current task is smaller than the current available storage capacity of the satellite;
if the satellite pose and the resource satisfy, the time window is determined to be the time window satisfying the task.
7. The method for assigning tasks to satellites as claimed in claim 6, wherein the step of internally calculating the cost and the gain paid for executing the tasks by the satellite unit comprises the steps of:
for satellites that can perform tasks, revenue is calculated from the resources consumed performing the tasks.
8. A satellite mission allocation apparatus for use in a distributed remote sensing satellite system for a multi-satellite networking, the apparatus comprising:
the task bidding unit is used for receiving task information of a user, forming bidding requirements according to task demands in the task information and sending the bidding requirements to each satellite unit serving as a bidding party;
the bidding document receiving unit is used for comparing the loading capacity and the resource data of the self-control satellite according to the task requirement in the received satellite bidding requirement, and filling a bidding document scheme on the premise of meeting the basic requirement;
the bidding evaluation unit is used for comparing and evaluating the received bidding schemes fed back by each satellite unit, and selecting a bidding scheme meeting the conditions according to the task execution conditions;
and the winning bid notification unit is used for notifying each satellite unit of winning bid conditions of each unit and simultaneously notifying the satellite units meeting the task execution conditions to add the corresponding tasks into own satellite task queues.
9. An electronic device, comprising:
one or more processors;
a memory;
one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more applications configured to perform the method of any of claims 1-7.
10. A computer readable storage medium, characterized in that the computer readable storage medium has stored therein a program code, which is callable by a processor for executing the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211532370.0A CN116090743A (en) | 2022-12-01 | 2022-12-01 | Satellite task allocation method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211532370.0A CN116090743A (en) | 2022-12-01 | 2022-12-01 | Satellite task allocation method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116090743A true CN116090743A (en) | 2023-05-09 |
Family
ID=86209186
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211532370.0A Pending CN116090743A (en) | 2022-12-01 | 2022-12-01 | Satellite task allocation method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116090743A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116599575A (en) * | 2023-07-17 | 2023-08-15 | 数字太空(北京)科技股份公司 | Simulation environment construction method and device for large-scale remote sensing task system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108832989A (en) * | 2018-05-07 | 2018-11-16 | 哈尔滨工程大学 | The online Dynamic Programming terminal of the task of low rail microsatellite and planing method used in |
| US20190121665A1 (en) * | 2017-10-20 | 2019-04-25 | HawkEye 360, Inc. | Hierarchical satellite task scheduling system |
| CN112257902A (en) * | 2020-09-25 | 2021-01-22 | 北京空间飞行器总体设计部 | Task allocation method for cooperative work of constellation |
| US20210175966A1 (en) * | 2018-09-06 | 2021-06-10 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Network Synchronization of a Beam-Hopping Satellite System |
-
2022
- 2022-12-01 CN CN202211532370.0A patent/CN116090743A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190121665A1 (en) * | 2017-10-20 | 2019-04-25 | HawkEye 360, Inc. | Hierarchical satellite task scheduling system |
| CN108832989A (en) * | 2018-05-07 | 2018-11-16 | 哈尔滨工程大学 | The online Dynamic Programming terminal of the task of low rail microsatellite and planing method used in |
| US20210175966A1 (en) * | 2018-09-06 | 2021-06-10 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Network Synchronization of a Beam-Hopping Satellite System |
| CN112257902A (en) * | 2020-09-25 | 2021-01-22 | 北京空间飞行器总体设计部 | Task allocation method for cooperative work of constellation |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116599575A (en) * | 2023-07-17 | 2023-08-15 | 数字太空(北京)科技股份公司 | Simulation environment construction method and device for large-scale remote sensing task system |
| CN116599575B (en) * | 2023-07-17 | 2023-10-13 | 数字太空(北京)科技股份公司 | Simulation environment construction method and device for large-scale remote sensing task system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107437144A (en) | A kind of order dispatch method, system, computer equipment and storage medium | |
| CN107392382B (en) | High-resolution geostationary orbit imaging satellite observation task planning method | |
| Sim | Towards complex negotiation for cloud economy | |
| CN111353840A (en) | Order information processing method and device and electronic equipment | |
| CN108832989A (en) | The online Dynamic Programming terminal of the task of low rail microsatellite and planing method used in | |
| CN108259078B (en) | Resource allocation method and system for on-satellite integrated electronic system | |
| CN116090743A (en) | Satellite task allocation method and device, electronic equipment and storage medium | |
| Lim et al. | Incentive mechanism design for resource sharing in collaborative edge learning | |
| CN108182112A (en) | The resource allocation mechanism of sensing network focusing on people based on combinational auction | |
| CN112183928B (en) | Scheduling system suitable for remote sensing satellite imaging | |
| CN109040193B (en) | Mobile device cloud resource allocation method based on independent subtasks | |
| CN109934537A (en) | Order allocation method, device, server and storage medium | |
| CN110012054A (en) | A kind of method for processing business and system based on alliance's chain network | |
| CN108615165A (en) | Server unit, method and the equipment of dynamic pricing for multiplying altogether | |
| US20230130643A1 (en) | System and Method for End-to-End Train Trip Management | |
| CN111275229B (en) | Resource model training method, resource gap prediction method, device and electronic equipment | |
| CN105447980B (en) | Intelligent self-service is sold goods type rice mill husk rice method | |
| CN112862175B (en) | Local optimization control method and device based on P2P power transaction | |
| WO2023071374A1 (en) | Method and apparatus for processing data of goods | |
| EP3399481A1 (en) | System and method for one-to-many aggregation system | |
| CN104899759A (en) | System for profit feedback by applying transaction sequencing | |
| CN115801804A (en) | Multi-user mobile edge computing unloading method and system based on dynamic pricing | |
| Hussain et al. | Fog Computing for Next Generation Transport-a Battery Swapping System Case Study | |
| CN110751532B (en) | Resource allocation method and device | |
| CN113807662A (en) | Cooperative scheduling method, device, equipment and storage medium for shared bicycle enterprises |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230509 |