CN113240226A - Resource distribution method and device between satellite ground stations - Google Patents
Resource distribution method and device between satellite ground stations Download PDFInfo
- Publication number
- CN113240226A CN113240226A CN202110245498.8A CN202110245498A CN113240226A CN 113240226 A CN113240226 A CN 113240226A CN 202110245498 A CN202110245498 A CN 202110245498A CN 113240226 A CN113240226 A CN 113240226A
- Authority
- CN
- China
- Prior art keywords
- satellite
- resource allocation
- target
- ground station
- satellite ground
- 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 66
- 238000013468 resource allocation Methods 0.000 claims abstract description 167
- 238000004422 calculation algorithm Methods 0.000 claims description 61
- 230000006870 function Effects 0.000 claims description 50
- 238000004891 communication Methods 0.000 claims description 40
- 230000002068 genetic effect Effects 0.000 claims description 23
- 238000005457 optimization Methods 0.000 claims description 10
- 230000004044 response Effects 0.000 claims description 7
- 238000007781 pre-processing Methods 0.000 claims description 6
- 230000001960 triggered effect Effects 0.000 claims description 4
- 238000012216 screening Methods 0.000 claims description 3
- 239000000126 substance Substances 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 8
- 210000000349 chromosome Anatomy 0.000 description 5
- 239000011159 matrix material Substances 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000007616 round robin method Methods 0.000 description 1
- 238000002922 simulated annealing Methods 0.000 description 1
- 239000004984 smart glass 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/06313—Resource planning in a project environment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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/06315—Needs-based resource requirements planning or analysis
Abstract
The application provides a method and a device for resource allocation among satellite ground stations, wherein the method for resource allocation among the satellite ground stations comprises the following steps: responding to a resource allocation request, and acquiring target satellite ground station information representing resource allocation among the satellite ground stations; inputting the information of the target satellite ground station into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition; the method provided by the application can effectively solve the problem of resource allocation of hardware equipment of the ground station with a plurality of antennas and optimize resource allocation.
Description
Technical Field
The present application relates to the field of satellite communications technologies, and in particular, to a method and an apparatus for resource allocation between satellite ground stations, a computing device, and a computer-readable storage medium.
Background
The satellite ground station resource allocation refers to the problem of optimizing the resources among the satellite ground stations by reasonably determining the quantity and the distribution of various devices of each ground station, optimally scheduling the devices and improving the resource utilization rate of a ground system aiming at satellite tasks. The related ground station resources comprise antennas, channels, recording equipment and the like, and the connection constraint relation among various resources is required to be met.
In practical applications, when the number of satellites is small, the resource conflict rate is not high, and when the number of satellites is large, the contradiction of limited resources becomes very prominent, and in view of the high cost of the ground station resources, how to fully and reasonably allocate various resources in the ground station and fully exert the use benefits thereof, so as to meet the requirements of the satellite tasks to the maximum extent becomes a technical problem to be solved urgently by technical personnel.
Disclosure of Invention
In view of this, embodiments of the present application provide a method and an apparatus for resource allocation between satellite ground stations, a computing device, and a computer-readable storage medium, so as to solve technical defects in the prior art.
According to a first aspect of the embodiments of the present application, there is provided a method for resource allocation between satellite ground stations, including:
responding to a resource allocation request, and acquiring target satellite ground station information representing resource allocation among the satellite ground stations;
inputting the information of the target satellite ground station into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition;
and acquiring the satellite ground station resource allocation information generated by the satellite ground station resource allocation model.
According to a second aspect of the embodiments of the present application, there is provided an apparatus for resource allocation between satellite ground stations, including:
a response module configured to obtain target satellite ground station information characterizing resources among the satellite ground stations in response to a resource allocation request;
an input module configured to input the target satellite ground station information into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition;
an obtaining module configured to obtain the satellite earth station resource allocation information generated by the satellite earth station resource allocation model.
According to a third aspect of embodiments herein, there is provided a computing device comprising a memory, a processor and computer instructions stored on the memory and executable on the processor, the processor implementing the steps of the method for resource allocation between satellite earth stations when executing the computer instructions.
According to a fourth aspect of embodiments of the present application, there is provided a computer readable storage medium storing computer instructions which, when executed by a processor, implement the steps of the method for resource allocation between satellite ground stations.
The resource allocation method between the satellite ground stations comprises the steps of responding to a resource allocation request, and obtaining target satellite ground station information representing resource allocation between the satellite ground stations; inputting the information of the target satellite ground station into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition; the method provided by the embodiment of the application can effectively solve the problem of resource allocation of hardware equipment of the ground station with a plurality of antennas and optimize resource allocation.
Secondly, on the basis of a satellite ground station resource allocation model based on a classical genetic algorithm, an operator is improved by combining conflict resolution and a resource allocation strategy based on the Hungarian algorithm, and equipment resources are allocated to each generation of chromosomes in the genetic algorithm to obtain an approximately optimal solution.
Drawings
FIG. 1 is a block diagram of a computing device provided by an embodiment of the present application;
fig. 2 is a flowchart of a resource allocation method between satellite ground stations according to an embodiment of the present application;
FIG. 3 is a graph showing a comparison of objective function values of a greedy algorithm and an improved genetic algorithm at different failure numbers according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a resource allocation algorithm flow of an improved genetic algorithm provided by an embodiment of the present application;
fig. 5 is a schematic structural diagram of an apparatus for allocating resources between satellite ground stations according to an embodiment of the present disclosure.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application. This application is capable of implementation in many different ways than those herein set forth and of similar import by those skilled in the art without departing from the spirit of this application and is therefore not limited to the specific implementations disclosed below.
The terminology used in the one or more embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the one or more embodiments of the present application. As used in one or more embodiments of the present application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used in one or more embodiments of the present application refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It will be understood that, although the terms first, second, etc. may be used herein in one or more embodiments of the present application to describe various information, these information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, a first aspect may be termed a second aspect, and, similarly, a second aspect may be termed a first aspect, without departing from the scope of one or more embodiments of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
First, the noun terms to which one or more embodiments of the present invention relate are explained.
The deterministic optimization method comprises the following steps: a scheduling algorithm, a deterministic optimization method includes methods such as linear programming, dynamic programming, integer programming and branch delimitation, and the methods are generally large in computational complexity, only suitable for solving small-scale problems and often not practical in engineering.
The constraint-based scheduling method comprises the following steps: a scheduling algorithm, the scheduling based on constraint is a more widely used scheduling method, the essence is an enumeration optimization method, the optimal scheduling is obtained by enumeration of part of feasible scheduling sets, the method has low efficiency, and the method is not applicable to many practical problems with medium scale.
The intelligent scheduling method comprises the following steps: a scheduling algorithm, intelligent scheduling is a scheduling method based on statistical optimization in nature, and is characterized in that intelligent behaviors of a system, such as genetic algorithm, tabu search, simulated annealing and the like, are embodied through numerical calculation. The intelligent scheduling method provides a new approach for solving the problem of optimal scheduling, but the intelligent scheduling method also has enumeration characteristics to a certain extent, the speed of convergence to an optimal solution is very slow under general conditions, and the optimality judgment of the solution is also difficult.
Model-based analysis methods: because the schedulable system is a typical discrete event dynamic system, a model and a method (such as a Petri network model) for researching the discrete event dynamic system can be used for researching the scheduling problem, the Petri network model can directly reflect the influences of concurrency, resource conflict, scheduling rules and the like in the scheduling process on the system characteristics, and the scheduling system has strong modeling capability but needs to solve the problem of 'state combination explosion' of the Petri network.
The Hungarian algorithm: the Hungarian algorithm is a combined optimization algorithm for solving task allocation problems in polynomial time, and promotes the subsequent original dual method.
In the present application, a method and an apparatus for resource allocation between satellite ground stations, a computing device and a computer readable storage medium are provided, which are described in detail in the following embodiments one by one.
FIG. 1 shows a block diagram of a computing device 100 according to an embodiment of the present application. The components of the computing device 100 include, but are not limited to, memory 110 and processor 120. The processor 120 is coupled to the memory 110 via a bus 130 and a database 150 is used to store data.
Computing device 100 also includes access device 140, access device 140 enabling computing device 100 to communicate via one or more networks 160. Examples of such networks include the Public Switched Telephone Network (PSTN), a Local Area Network (LAN), a Wide Area Network (WAN), a Personal Area Network (PAN), or a combination of communication networks such as the internet. Access device 140 may include one or more of any type of network interface (e.g., a Network Interface Card (NIC)) whether wired or wireless, such as an IEEE802.11 Wireless Local Area Network (WLAN) wireless interface, a worldwide interoperability for microwave access (Wi-MAX) interface, an ethernet interface, a Universal Serial Bus (USB) interface, a cellular network interface, a bluetooth interface, a Near Field Communication (NFC) interface, and so forth.
In one embodiment of the present application, the above-mentioned components of the computing device 100 and other components not shown in fig. 1 may also be connected to each other, for example, by a bus. It should be understood that the block diagram of the computing device architecture shown in FIG. 1 is for purposes of example only and is not limiting as to the scope of the present application. Those skilled in the art may add or replace other components as desired.
Computing device 100 may be any type of stationary or mobile computing device, including a mobile computer or mobile computing device (e.g., tablet, personal digital assistant, laptop, notebook, netbook, etc.), a mobile phone (e.g., smartphone), a wearable computing device (e.g., smartwatch, smartglasses, etc.), or other type of mobile device, or a stationary computing device such as a desktop computer or PC. Computing device 100 may also be a mobile or stationary server.
The processor 120 may perform the steps of the resource allocation method between the satellite ground stations shown in fig. 2. Fig. 2 is a flowchart illustrating a method for allocating resources between satellite ground stations according to an embodiment of the present application, including steps 202 to 206.
Step 202: and responding to the resource allocation request, and acquiring target satellite ground station information representing resource allocation among the satellite ground stations.
In satellite tasks, a plurality of satellites are deployed in space, a plurality of ground stations are arranged on the ground, the ground stations are provided with a plurality of antennas, the satellites communicate with the antennas, and related tasks are executed.
The resource allocation request is a request for re-allocating resources, where the resource allocation refers to allocation between a satellite and a ground station, and specifically, selects one antenna for the satellite to communicate with in the ground station.
In a specific embodiment provided herein, before responding to the resource allocation request, the method further includes:
under the condition that communication between satellite ground stations is detected to be in fault, a resource allocation request is triggered; or
A resource allocation request is received.
In practical application, the resource allocation request may be actively triggered, that is, by monitoring a communication state between the satellite and the ground station, when an antenna in the ground station fails or a device at the rear end of the antenna fails, the communication between the satellite and the ground station fails, and at this time, the resource allocation request may be actively triggered. The resource allocation request may also receive a corresponding task requirement, for example, because of task adjustment, a connection communication correspondence between the satellite and the ground station needs to be reallocated, a third party initiates the resource allocation request, and the system may also receive the resource allocation request initiated by the third party.
The target satellite ground station information specifically refers to satellite ground station information related to the resource allocation request after the resource allocation request is received, and the satellite ground station information is used for representing resource allocation between the satellite and the ground station.
Specifically, the obtaining of the target satellite ground station information representing the resource between the satellite ground stations includes:
reading initial satellite ground station information;
and screening target satellite ground station information representing resources among the satellite ground stations from the initial satellite ground station information according to predefined satellite parameters and ground station resource parameters.
In practical applications, a lot of parameter information is needed for the operation and communication between the satellite and the ground station, and information related to the satellite ground station is first acquired as initial satellite ground station information. The predefined satellite parameters and ground station parameters are specifically parameters used for describing the satellite and ground station needed in the resource allocation request process, and after initial satellite ground station information is read, target satellite ground station information related to the resource allocation request is screened from the initial satellite ground station information according to the predefined satellite parameters and ground station parameters. By predefining the satellite parameters and the ground station resource parameters, the quantity of the parameters in the subsequent processing process can be effectively reduced, the resource allocation time is reduced, and the resource allocation efficiency is improved.
The predefined satellite parameters and ground station resource parameters include:
the method comprises the steps of collecting ground station antennas, collecting ground station tasks, collecting ground station intermediate frequency equipment states, collecting ground station radio frequency equipment states, collecting satellites, priority of target tasks corresponding to target satellites, time required by the target satellites to switch the antennas, whether the target antennas support communication with the target satellites, whether the target antennas are available, whether the target satellites are in communication with the target antennas, whether the target satellites execute the target tasks, and whether the target antennas corresponding to the target satellites are changed. Specifically, the following are shown:
a: the ground station antenna set comprises the speed, the frequency band, the upper rotation limit and the lower rotation limit of the antenna;
t: a ground station task set comprising priorities of tasks;
dm: the ground station intermediate frequency equipment state (Boolean variable) set comprises an intermediate frequency amplifier and an intermediate frequency optical transceiver;
dr: a ground station radio frequency equipment state (Boolean variable) set comprising a radio frequency amplifier and an optical transceiver;
s: a satellite set comprising communication rate, frequency band and longitude of the satellite;
pi,k: representing the priority of the task k corresponding to the satellite i;
Step 204: and inputting the information of the target satellite ground station into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition.
The satellite ground station resource allocation model is a model for generating satellite and ground station resource allocation information according to target satellite ground station information, and the resource allocated to a certain task is described in a related manner as shown in the following formula 1:
wherein p isi，kThe priority of the task k is mainly considered, wherein the main considered factors comprise task importance, economic factors and execution duration;
indicates whether antenna j supports communication with satellite i;
represents the time required for communication with the ith satellite to switch from antenna h to antenna g; a. thejDescribes the antenna j parameter, mainly the antenna communication rate AjVel, working frequency band AjfreqBand, upper rotation limit AjTl, lower rotation limit AjTs, priority Aj.pri； DmjRepresenting intermediate frequency equipment corresponding to an antenna j in a link, and being Boolean variable; drjRepresenting the radio frequency equipment corresponding to the antenna j in the link as a Boolean variable; siThe parameter of the satellite i representing the direction of the mission, mainly the communication rate S of the satelliteiVel, working frequency band SifreqBand, longitude of satellite SiLon, priority Si.pri。
In practical application, a satellite ground station resource allocation model is established according to a preset link constraint condition, and the satellite ground station resource allocation model comprises the following link constraint conditions:
equation 2 shows that the target satellite communicates with one antenna at the same time period, that is, each satellite can only communicate with one antenna at the same time period, i represents the ith satellite, and j and h represent the jth and the h antennas.
Equation 3 shows that the target antenna communicates with a satellite in the same time period, that is, each antenna intelligently communicates with a satellite in the same time period, j represents the jth antenna, and l and i represent the ith and ith satellites.
Si.freqBand∈AjfreqBand equation 4
Equation 4 shows that the target antenna and the target satellite are in the corresponding operating frequency bands, i.e. satellite i and antenna AjThe communication must be within the respective operating frequency band.
Equation 5 represents the device link constraint, and the device state corresponding to the target antenna is an available state, that is, the device state is available for each antenna link, and the link devices include intermediate frequency, radio frequency, and antenna.
Aj.vel≥SiVel equation 6
Equation 6 shows that the communication rate of the target satellite matches the communication rate of the target antenna, i.e. the communication rate of satellite i must match antenna AjAnd matching the communication rate.
Aj.ts≤Si.lon≤Aj Tl equation 7
Equation 8 indicates that the target satellite performs a target task at the same time period, i indicates the ith satellite, and k, s indicate the kth and the s tasks.
Equation 9 indicates that the target task is performed by one satellite at the same time period, i, q indicate the ith and qth satellites, and k indicates the kth task.
The above equations 2 to 9 show the constraint conditions in the satellite earth station resource allocation model, which need to be satisfied simultaneously in the satellite earth station resource allocation model.
Step 206: and acquiring the satellite ground station resource allocation information generated by the satellite ground station resource allocation model.
Specifically, the satellite ground station resource allocation model defines a resource allocation objective function, the resource allocation objective function represents the difference between the priority of all successfully scheduled tasks and the conversion time and the switching times, and the resource allocation objective function is as follows:
wherein the content of the first and second substances,
indicating whether the satellite i is available or not,
indicating whether the satellite i performs the task k, pi,kIndicating the priority of task k for satellite i,
representing the time required for communication with the ith satellite to switch from antenna h to antenna g,
indicating whether the satellite i is available or not,
whether the antenna of the satellite i communication is changed before and after optimization or not is shown, p, q and r respectively show weight coefficients, and p, q and r are in the range of 0,1]To avoid negative values of the objective function, the value of p should be much larger than the values of q and r, i.e. p>v (q + r), v being an integer or decimal greater than 1. In practical application, considering different measures of task priority, switching time and switching times, a normalization variable w is also introduced into a resource allocation objective function1、w2And w3， w1、w2And w3Is calculated asThe following:
where i E [1, n ] represents the ith satellite, k E [1, m ] represents the kth task, and E represents the expectation.
Aiming at a well defined satellite ground station resource allocation model, for each satellite, equipment with a task corresponding to the received satellite is configured to form a satellite-equipment lookup table, a satellite task list is initialized, then a random sequence of natural number codes is generated to serve as an initial population, a resource allocation objective function value of the initial population is calculated, the problem is converted into an optimized combination problem based on sequence by using a natural number coding mode, selection, crossing and variation operations are carried out by adopting a betting method according to the resource allocation objective function, and the optimal individual is selected through preset iteration.
In practical application, the satellite ground station resource allocation information is generated by combining the satellite ground station resource allocation model with conflict resolution and an improved genetic algorithm based on Hungarian algorithm. The method comprises the following specific steps:
performing data preprocessing on the target satellite ground station information, determining a candidate antenna corresponding to each satellite, and generating a satellite equipment lookup table and an initial population, wherein the initial population comprises a plurality of individuals;
calculating an initial objective function value of each individual in the initial population according to a resource allocation objective function;
determining the number of times of conflict among individuals in the initial population, and calculating an intermediate objective function value of each individual in the initial population according to the number of times of conflict and the initial objective function value of each individual;
calculating an objective function value of each individual in the initial population according to an allocation strategy based on a Hungarian algorithm and an intermediate objective function value of each individual in the initial population;
and carrying out selective cross variation on the initial population, eliminating parents according to the objective function value of each individual to generate new offspring, mixing the new offspring with the optimal parents to generate a new population until an iteration termination condition is reached, and generating satellite ground station resource allocation information.
The improved genetic algorithm combining conflict resolution and the Hungarian algorithm is specifically as follows:
s1, in order to reduce the time complexity of traversing the satellite-device lookup table, firstly, data preprocessing needs to be carried out on the ground station information of the target satellite, the antennas which can possibly communicate with each satellite are found out according to the frequency bands, the speed and the pointing range of the satellite and the antennas and by combining the state (intermediate frequency, radio frequency and antenna) of each device, the frequency of traversing all the antennas by the satellite is reduced, the satellite-device lookup table is generated, a random sequence of natural number codes is generated to serve as an initial population, the initial population comprises a plurality of individuals, and the individuals are specifically represented as the connection of the satellite and the antennas, namely the connection of the target satellite and the target antennas is an individual.
S2, calculating an initial objective function value f (x) of the initial population according to the resource allocation objective function.
S3, performing conflict resolution, specifically, calculating the number n of conflicts between individuals in the initial population, and recalculating the intermediate objective function value of each individual of the initial population according to the following formula 14.
f-n.m equation 14
Wherein n is the number of times of calculating conflict, and M is a constant, that is, when a conflict occurs, the function value corresponding to the individual is decreased until an individual satisfying the condition is found.
S4, Hungarian algorithm is a combined optimization algorithm for solving task allocation problem in polynomial time, after the intermediate objective function value corresponding to each satellite is obtained, the task distribution based on the Hungarian algorithm is carried out, that is, the ith individual generates a cost matrix a regarding task priority from the intermediate objective function values corresponding to each satellite, the element in the overhead matrix a is the priority of the task, the higher the priority number, the higher the priority, since the Hungarian algorithm is used to compute the minimum, to accommodate the Hungarian algorithm, it is necessary to multiply each element in the overhead matrix by-1, thus, the maximum value of the calculation overhead matrix A is converted into the minimum value of the calculation overhead matrix-A, the calculation maximization problem is converted into the calculation minimization problem, the minimum value of the-A is calculated according to the Hungarian algorithm, and the objective function value of each individual is further determined.
And S5, performing cross variation in the initial population, eliminating parents according to the objective function value of each individual to generate new offspring, mixing the new offspring with the optimal parent individual to generate a new population until an iteration termination condition is reached, and selecting the scheme of the optimal chromosome in the current population as final satellite ground station resource allocation information when iteration is terminated. The iteration termination condition may be a preset maximum iteration algebra, and the iteration termination condition is reached when the preset maximum iteration algebra is reached.
In one embodiment provided herein, the parameters associated with the improved genetic algorithm are selected as shown in table 1 below.
TABLE 1
In the specific implementation mode provided by the application, in order to embody the advantages of the combination of conflict resolution and the improved genetic algorithm based on the Hungarian algorithm, the combination of the conflict resolution and the improved genetic algorithm based on the Hungarian algorithm is compared with the greedy algorithm in different application scenes, the sum of objective function values of each individual is adopted in simulation for comparison, and the larger the sum of the objective function values is, the better the effect of resource allocation is. In the embodiment, the rotation rate of the antenna is 0.5 degrees/s, any equipment is set to have a fault, and simulation experiments are respectively carried out on the two algorithms.
Tables 2 and 3 below show a comparison of the performance of the greedy algorithm and the improved genetic algorithm, respectively.
TABLE 2
TABLE 3
As shown in tables 2 and 3, the sum of objective function values of the improved genetic algorithm based on the hungarian algorithm and the conflict resolution is better than that of the greedy algorithm under the condition that any equipment has faults, although the calculation amount is higher than that of the greedy algorithm, the time difference is only the difference in seconds, and the scheduling of the ground station tasks is set up hours before the first rail data is received every day, so that the time consumption is acceptable.
When equipment fails, equipment with faults repaired in the prior art is manually contacted, the equipment with faults needs to be repaired within a period of several hours to one day according to the number of the equipment with faults, the current measures are regular maintenance, and the regular maintenance also needs to take several hours, but by adopting the resource allocation method between the satellite ground stations, the currently available equipment can be selected to automatically establish connection when the equipment fails, see fig. 3, and fig. 3 shows a comparison schematic diagram of objective function values of a greedy algorithm and an improved genetic algorithm under different fault numbers, which is provided by the embodiment of the application, as shown in fig. 3, the objective function values of the two algorithms are reduced along with the increase of the equipment faults, but the performance of the improved genetic algorithm is still higher than that of the greedy algorithm.
According to the resource allocation method between the satellite ground stations, target satellite ground station information representing resource allocation between the satellite ground stations is obtained by responding to a resource allocation request; inputting the information of the target satellite ground station into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition; and acquiring the satellite ground station resource allocation information generated by the satellite ground station resource allocation model. The resource allocation method between the satellite ground stations effectively solves the resource allocation problem of hardware equipment of the ground stations with the multiple antennas, and optimizes resource allocation.
Secondly, on the basis of a satellite ground station resource allocation model based on a classical genetic algorithm, an operator is improved by combining conflict resolution and a resource allocation strategy based on the Hungarian algorithm, and equipment resources are allocated to each generation of chromosomes in the genetic algorithm to obtain an approximately optimal solution.
Fig. 4 is a schematic diagram illustrating a resource allocation algorithm for an improved genetic algorithm according to an embodiment of the present application, and as shown in fig. 4, data preprocessing is performed on information of a target satellite ground station to generate a satellite-antenna lookup table, a random sequence of natural number codes is generated as an initial population, an initial objective function value of the initial population is calculated, a number of collisions n in the population is calculated, an intermediate objective function value is calculated based on the number of collisions n, a round-robin method is adopted in the population for selection, crossing and variation, new offspring is generated according to an objective function value elimination parent, and the new offspring and an optimal parent individual are mixed to generate a new population until an iteration termination condition is reached. And after the iteration termination condition is met, the optimal chromosome scheme in the current population is the final satellite ground station resource allocation information.
Corresponding to the above method embodiments, the present application further provides embodiments of a resource allocation apparatus between satellite ground stations, and fig. 5 shows a schematic structural diagram of the resource allocation apparatus between satellite ground stations according to an embodiment of the present application. As shown in fig. 5, the apparatus includes:
a response module 502 configured to obtain target satellite ground station information characterizing resource allocation among the satellite ground stations in response to a resource allocation request;
an input module 504 configured to input the target satellite ground station information into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition;
an obtaining module 506 configured to obtain the satellite earth station resource allocation information generated by the satellite earth station resource allocation model.
Optionally, the satellite ground station resource allocation model includes a resource allocation objective function unit and a link constraint condition unit.
Optionally, the resource allocation objective function unit includes a resource allocation objective function, where the resource allocation objective function is:
wherein the content of the first and second substances,
indicating whether the satellite i is available or not,
indicating whether the satellite i performs the task k, pi,kIndicating the priority of task k for satellite i,
representing the time required for communication with the ith satellite to switch from antenna h to antenna g,
indicating whether the satellite i is available or not,
whether the antenna of the satellite i communication is changed before and after optimization or not is shown, p, q and r respectively show weight coefficients, and p, q and r are in the range of 0,1]， w1、w2And w3Is a normalized variable in which, among other things,
i E [1, n ] denotes the ith satellite, k E [1, m ] denotes the kth task, E denotes expectation.
Optionally, the link constraint unit includes a link constraint, and the link constraint includes:
the target satellite communicates with an antenna at the same time period;
the target antenna communicates with a satellite at the same time period;
the target antenna and the target satellite are in corresponding working frequency bands;
the equipment state corresponding to the target antenna is an available state;
the communication rate of the target satellite is matched with the communication rate of the target antenna;
the longitude of the target satellite conforms to the pointing range of the target antenna;
the target satellite executes a target task in the same time period; and
the target tasks are performed by one satellite at the same time period.
Optionally, the satellite ground station resource allocation information is generated by the satellite ground station resource allocation model in combination with conflict resolution and an improved genetic algorithm based on the hungarian algorithm.
Optionally, the generating of the satellite ground station resource allocation information by the satellite ground station resource allocation model in combination with conflict resolution and an improved genetic algorithm based on the hungarian algorithm includes:
the data preprocessing unit is configured to perform data preprocessing on the target satellite ground station information, determine a candidate antenna corresponding to each satellite, and generate a satellite device lookup table and an initial population, wherein the initial population comprises a plurality of individuals;
a first calculation unit configured to calculate an initial objective function value of each individual in the initial population according to a resource allocation objective function;
a second calculation unit configured to determine a number of collisions between individuals in the initial population, and calculate an intermediate objective function value for each individual in the initial population according to the number of collisions and the initial objective function value for each individual;
a third calculation unit configured to calculate an objective function value for each individual in the initial population according to an allocation strategy based on the Hungarian algorithm and an intermediate objective function value for each individual in the initial population;
and the iteration unit is configured to perform selective cross variation on the initial population, eliminate parents according to the objective function value of each individual, generate new filial generations, mix the new filial generations with the optimal parents to generate a new population until an iteration termination condition is reached, and generate satellite ground station resource allocation information.
Optionally, the response module 502 is further configured to:
reading initial satellite ground station information;
and screening target satellite ground station information representing resources among the satellite ground stations from the initial satellite ground station information according to predefined satellite parameters and ground station resource parameters.
Optionally, the predefined satellite parameters and the ground station resource parameters include:
the method comprises the steps of collecting ground station antennas, collecting ground station tasks, collecting ground station intermediate frequency equipment states, collecting ground station radio frequency equipment states, collecting satellites, priority of target tasks corresponding to target satellites, time required by the target satellites to switch the antennas, whether the target antennas support communication with the target satellites, whether the target antennas are available, whether the target satellites are in communication with the target antennas, whether the target satellites execute the target tasks, and whether the target antennas corresponding to the target satellites are changed.
Optionally, the apparatus further comprises:
the device comprises a detection unit, a resource allocation unit and a resource allocation unit, wherein the detection unit is configured to trigger a resource allocation request when detecting that communication between satellite ground stations has a fault; and/or
A receiving unit configured to receive a resource allocation request.
The resource distribution device between the satellite ground stations, provided by the embodiment of the application, is used for responding to a resource distribution request to obtain target satellite ground station information representing resource distribution between the satellite ground stations; inputting the information of the target satellite ground station into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition; and acquiring the satellite ground station resource allocation information generated by the satellite ground station resource allocation model. The resource allocation device between the satellite ground stations effectively solves the resource allocation problem of hardware equipment of the multiple antenna ground stations and optimizes resource allocation.
Secondly, on the basis of a satellite ground station resource allocation model based on a classical genetic algorithm, an operator is improved by combining conflict resolution and a resource allocation strategy based on the Hungarian algorithm, and equipment resources are allocated to each generation of chromosomes in the genetic algorithm to obtain an approximately optimal solution.
The foregoing is a schematic solution of a resource allocation apparatus between satellite ground stations according to this embodiment. It should be noted that the technical solution of the resource allocation apparatus between the satellite ground stations and the technical solution of the resource allocation method between the satellite ground stations belong to the same concept, and details of the technical solution of the resource allocation apparatus between the satellite ground stations, which are not described in detail, can be referred to the description of the technical solution of the resource allocation method between the satellite ground stations.
An embodiment of the present application further provides a computing device, which includes a memory, a processor, and computer instructions stored in the memory and executable on the processor, where the processor executes the computer instructions to implement the steps of the method for resource allocation between satellite ground stations.
The above is an illustrative scheme of a computing device of the present embodiment. It should be noted that the technical solution of the computing device and the technical solution of the above-mentioned method for allocating resources between satellite ground stations belong to the same concept, and details of the technical solution of the computing device, which are not described in detail, can be referred to the description of the technical solution of the above-mentioned method for allocating resources between satellite ground stations.
An embodiment of the present application further provides a computer readable storage medium, which stores computer instructions, and the computer instructions, when executed by a processor, implement the steps of the method for resource allocation between satellite ground stations as described above.
The above is an illustrative scheme of a computer-readable storage medium of the present embodiment. It should be noted that the technical solution of the storage medium and the technical solution of the above-mentioned method for allocating resources between satellite ground stations belong to the same concept, and details that are not described in detail in the technical solution of the storage medium can be referred to the description of the technical solution of the above-mentioned method for allocating resources between satellite ground stations.
The foregoing description of specific embodiments of the present application has been presented. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The computer instructions comprise computer program code which may be in the form of source code, object code, an executable file or some intermediate form, or the like. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
It should be noted that, for the sake of simplicity, the above-mentioned method embodiments are described as a series of acts or combinations, but those skilled in the art should understand that the present application is not limited by the described order of acts, as some steps may be performed in other orders or simultaneously according to the present application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
The preferred embodiments of the present application disclosed above are intended only to aid in the explanation of the application. Alternative embodiments are not exhaustive and do not limit the invention to the precise embodiments described. Obviously, many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the application and its practical applications, to thereby enable others skilled in the art to best understand and utilize the application. The application is limited only by the claims and their full scope and equivalents.
Claims (12)
1. A method for allocating resources among satellite ground stations is characterized by comprising the following steps:
responding to a resource allocation request, and acquiring target satellite ground station information representing resource allocation among the satellite ground stations;
inputting the information of the target satellite ground station into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition;
and acquiring the satellite ground station resource allocation information generated by the satellite ground station resource allocation model.
2. The method of claim 1, wherein the satellite earth station resource allocation model comprises a resource allocation objective function and link constraints.
3. The method for resource allocation between ground satellite stations according to claim 2, wherein said resource allocation objective function is:
wherein the content of the first and second substances,
indicating whether the satellite i is available or not,
indicating whether the satellite i performs the task k, pi,kIndicating the priority of task k for satellite i,
representing the time required for communication with the ith satellite to switch from antenna h to antenna g,
indicating whether the satellite i is available or not,
whether the antenna of the satellite i communication is changed before and after optimization is shown, p, q and r respectively show weight coefficients, and p, q and r are belonged to[0,1]，w1、w2And w3Is a normalized variable in which, among other things,
i E [1, n ] denotes the ith satellite, k E [1, m ] denotes the kth task, E denotes expectation.
4. The method for resource allocation between ground satellite stations according to claim 2, wherein said link constraint condition comprises:
the target satellite communicates with an antenna at the same time period;
the target antenna communicates with a satellite at the same time period;
the target antenna and the target satellite are in corresponding working frequency bands;
the equipment state corresponding to the target antenna is an available state;
the communication rate of the target satellite is matched with the communication rate of the target antenna;
the longitude of the target satellite conforms to the pointing range of the target antenna;
the target satellite executes a target task in the same time period; and
the target tasks are performed by one satellite at the same time period.
5. The method for resource allocation between ground satellite stations according to claim 1, wherein the satellite ground station resource allocation information is generated by the satellite ground station resource allocation model in combination with conflict resolution and an improved genetic algorithm based on the hungarian algorithm.
6. The method for resource allocation between ground satellite stations according to claim 5, wherein the generation of the resource allocation information of the ground satellite stations by the resource allocation model of the ground satellite stations in combination with conflict resolution and an improved genetic algorithm based on the Hungarian algorithm comprises the following steps:
performing data preprocessing on the target satellite ground station information, determining a candidate antenna corresponding to each satellite, and generating a satellite equipment lookup table and an initial population, wherein the initial population comprises a plurality of individuals;
calculating an initial objective function value of each individual in the initial population according to a resource allocation objective function;
determining the number of times of conflict among individuals in the initial population, and calculating an intermediate objective function value of each individual in the initial population according to the number of times of conflict and the initial objective function value of each individual;
calculating an objective function value of each individual in the initial population according to an allocation strategy based on a Hungarian algorithm and an intermediate objective function value of each individual in the initial population;
and carrying out selective cross variation on the initial population, eliminating parents according to the objective function value of each individual to generate new offspring, mixing the new offspring with the optimal parents to generate a new population until an iteration termination condition is reached, and generating satellite ground station resource allocation information.
7. The method for resource allocation between ground satellite stations according to claim 1, wherein obtaining target ground satellite station information characterizing resources between the ground satellite stations comprises:
reading initial satellite ground station information;
and screening target satellite ground station information representing resources among the satellite ground stations from the initial satellite ground station information according to predefined satellite parameters and ground station resource parameters.
8. The method of claim 7, wherein the predefined satellite parameters and ground station resource parameters comprise:
the method comprises the steps of collecting ground station antennas, collecting ground station tasks, collecting ground station intermediate frequency equipment states, collecting ground station radio frequency equipment states, collecting satellites, priority of target tasks corresponding to target satellites, time required by the target satellites to switch the antennas, whether the target antennas support communication with the target satellites, whether the target antennas are available, whether the target satellites are in communication with the target antennas, whether the target satellites execute the target tasks, and whether the target antennas corresponding to the target satellites are changed.
9. The method for resource allocation between satellite earth stations according to any of claims 1-8, wherein before responding to a resource allocation request, the method further comprises:
under the condition that communication between satellite ground stations is detected to be in fault, a resource allocation request is triggered; or
A resource allocation request is received.
10. An apparatus for allocating resources between satellite ground stations, comprising:
a response module configured to respond to a resource allocation request, and obtain target satellite ground station information representing resource allocation among the satellite ground stations;
an input module configured to input the target satellite ground station information into a satellite ground station resource allocation model, wherein the satellite ground station resource allocation model is established according to a preset link constraint condition;
an obtaining module configured to obtain the satellite earth station resource allocation information generated by the satellite earth station resource allocation model.
11. A computing device comprising a memory, a processor, and computer instructions stored on the memory and executable on the processor, wherein the processor implements the steps of the method of any one of claims 1-9 when executing the computer instructions.
12. A computer-readable storage medium storing computer instructions, which when executed by a processor, perform the steps of the method of any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110245498.8A CN113240226A (en) | 2021-03-05 | 2021-03-05 | Resource distribution method and device between satellite ground stations |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110245498.8A CN113240226A (en) | 2021-03-05 | 2021-03-05 | Resource distribution method and device between satellite ground stations |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113240226A true CN113240226A (en) | 2021-08-10 |
Family
ID=77130306
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110245498.8A Pending CN113240226A (en) | 2021-03-05 | 2021-03-05 | Resource distribution method and device between satellite ground stations |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113240226A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114553300A (en) * | 2022-02-18 | 2022-05-27 | 清华大学 | Method and system for rapidly allocating wireless resources of multi-antenna earth station of satellite system |
| CN115796523A (en) * | 2022-11-30 | 2023-03-14 | 北京华如科技股份有限公司 | Resource allocation method and device |
| CN116582173A (en) * | 2023-07-12 | 2023-08-11 | 银河航天(北京)网络技术有限公司 | Method, device and storage medium for processing data by satellite-based distributed network |
| CN116865842A (en) * | 2023-09-05 | 2023-10-10 | 武汉能钠智能装备技术股份有限公司 | Resource allocation system and method for communication multiple access edge computing server |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2551467A1 (en) * | 2006-07-04 | 2008-01-04 | University Of New Brunswick | System and method for optimizing linehaul operations |
| WO2018196525A1 (en) * | 2017-04-27 | 2018-11-01 | 北京京东尚科信息技术有限公司 | Goods handling method and device |
| CN111162831A (en) * | 2019-12-24 | 2020-05-15 | 中国科学院遥感与数字地球研究所 | Ground station resource scheduling method |
| CN111913787A (en) * | 2020-06-19 | 2020-11-10 | 合肥工业大学 | Imaging satellite scheduling method and system based on genetic algorithm |
-
2021
- 2021-03-05 CN CN202110245498.8A patent/CN113240226A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2551467A1 (en) * | 2006-07-04 | 2008-01-04 | University Of New Brunswick | System and method for optimizing linehaul operations |
| WO2018196525A1 (en) * | 2017-04-27 | 2018-11-01 | 北京京东尚科信息技术有限公司 | Goods handling method and device |
| CN111162831A (en) * | 2019-12-24 | 2020-05-15 | 中国科学院遥感与数字地球研究所 | Ground station resource scheduling method |
| CN111913787A (en) * | 2020-06-19 | 2020-11-10 | 合肥工业大学 | Imaging satellite scheduling method and system based on genetic algorithm |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114553300A (en) * | 2022-02-18 | 2022-05-27 | 清华大学 | Method and system for rapidly allocating wireless resources of multi-antenna earth station of satellite system |
| CN114553300B (en) * | 2022-02-18 | 2023-02-17 | 清华大学 | Method and system for rapidly allocating wireless resources of multi-antenna earth station of satellite system |
| CN115796523A (en) * | 2022-11-30 | 2023-03-14 | 北京华如科技股份有限公司 | Resource allocation method and device |
| CN115796523B (en) * | 2022-11-30 | 2023-07-18 | 北京华如科技股份有限公司 | Resource allocation method and device |
| CN116582173A (en) * | 2023-07-12 | 2023-08-11 | 银河航天(北京)网络技术有限公司 | Method, device and storage medium for processing data by satellite-based distributed network |
| CN116582173B (en) * | 2023-07-12 | 2023-09-22 | 银河航天(北京)网络技术有限公司 | Method, device and storage medium for processing data by satellite-based distributed network |
| CN116865842A (en) * | 2023-09-05 | 2023-10-10 | 武汉能钠智能装备技术股份有限公司 | Resource allocation system and method for communication multiple access edge computing server |
| CN116865842B (en) * | 2023-09-05 | 2023-11-28 | 武汉能钠智能装备技术股份有限公司 | Resource allocation system and method for communication multiple access edge computing server |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113240226A (en) | Resource distribution method and device between satellite ground stations | |
| CN107171848B (en) | Flow prediction method and device | |
| Ozturk et al. | Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming | |
| Liu et al. | Deep learning meets wireless network optimization: Identify critical links | |
| CN109165808B (en) | Power communication network on-site operation and maintenance work order distribution method | |
| CN110324170B (en) | Data analysis equipment, multi-model co-decision system and method | |
| Barrios et al. | A double genetic algorithm for the MRCPSP/max | |
| CN110046777B (en) | Continuous reconfiguration scheduling method and device for flexible job shop | |
| Prayogo et al. | Optimization model for construction project resource leveling using a novel modified symbiotic organisms search | |
| CN110929960B (en) | Policy selection optimization method and device | |
| US11774951B2 (en) | Production line adaptation methods based on industrial internet of things, systems and storage mediums thereof | |
| CN109788489A (en) | A kind of base station planning method and device | |
| CN111950851A (en) | Work order processing method and device | |
| Zhang et al. | Optimized scenario reduction: Solving large-scale stochastic programs with quality guarantees | |
| CN116363452B (en) | Task model training method and device | |
| Gunawan et al. | Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem | |
| CN113312166B (en) | Resource processing method and device | |
| Eriksson et al. | Radio and computational resource management for fog computing enabled wireless camera networks | |
| Shakya et al. | AI based 5G RAN planning | |
| CN115829169B (en) | Business processing method and device based on mixed integer linear programming | |
| CN115859693B (en) | Data processing method and device | |
| CN113296870B (en) | Method and device for predicting Kubernetes cluster configuration | |
| CN110689320A (en) | Large-scale multi-target project scheduling method based on co-evolution algorithm | |
| Kvet et al. | Adapted path-relinking based search for non-dominated set of Emergency medical system designs | |
| CN116450657B (en) | Data fragment scheduling method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |