CN113254188A - Scheduling optimization method and device, electronic equipment and storage medium - Google Patents

Scheduling optimization method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN113254188A
CN113254188A CN202110765005.3A CN202110765005A CN113254188A CN 113254188 A CN113254188 A CN 113254188A CN 202110765005 A CN202110765005 A CN 202110765005A CN 113254188 A CN113254188 A CN 113254188A
Authority
CN
China
Prior art keywords
task
scheduling
model
optimization
mobile device
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.)
Granted
Application number
CN202110765005.3A
Other languages
Chinese (zh)
Other versions
CN113254188B (en
Inventor
任涛
胡哲源
谷宁波
牛建伟
胡舒程
李青锋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Innovation Research Institute of Beihang University
Original Assignee
Hangzhou Innovation Research Institute of Beihang University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Innovation Research Institute of Beihang University filed Critical Hangzhou Innovation Research Institute of Beihang University
Priority to CN202110765005.3A priority Critical patent/CN113254188B/en
Publication of CN113254188A publication Critical patent/CN113254188A/en
Application granted granted Critical
Publication of CN113254188B publication Critical patent/CN113254188B/en
Priority to PCT/CN2022/091260 priority patent/WO2022242468A1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/21Design or setup of recognition systems or techniques; Extraction of features in feature space; Blind source separation
    • G06F18/214Generating training patterns; Bootstrap methods, e.g. bagging or boosting
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/23Clustering techniques
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • G06F9/5072Grid computing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/04Architecture, e.g. interconnection topology
    • G06N3/044Recurrent networks, e.g. Hopfield networks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Mathematical Physics (AREA)
  • Biomedical Technology (AREA)
  • Computing Systems (AREA)
  • Molecular Biology (AREA)
  • General Health & Medical Sciences (AREA)
  • Computational Linguistics (AREA)
  • Biophysics (AREA)
  • Health & Medical Sciences (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Biology (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the application provides a scheduling optimization method and device, an electronic device and a storage medium, and relates to the technical field of scheduling optimization. The scheduling optimization method is applied to electronic equipment, the electronic equipment is in communication connection with a mobile edge computing network system, the mobile edge computing network system comprises at least one base station, an unmanned aerial vehicle and mobile equipment, and the scheduling optimization method comprises the following steps: firstly, acquiring a task to be processed and current position information of at least one mobile device; secondly, inputting the task to be processed and the current position information into a preset scheduling optimization model to obtain a scheduling strategy; the scheduling policy is then transmitted to the at least one mobile device. By the method, the first task can be dispatched to the unmanned aerial vehicle for processing, and the second task can be dispatched to the base station for processing, so that the problem of low scheduling optimization efficiency caused by the fact that in the prior art, tasks are all executed locally on the mobile equipment or are all dispatched to the unmanned aerial vehicle or the base station for remote execution is solved.

Description

Scheduling optimization method and device, electronic equipment and storage medium
Technical Field
The present application relates to the field of scheduling optimization technologies, and in particular, to a scheduling optimization method and apparatus, an electronic device, and a storage medium.
Background
In the field of drone-assisted mobile edge computing, appropriate decisions need to be made regarding how a drone schedules computational tasks in a mobile edge computing network (whether the computational tasks are executed locally at the mobile device or scheduled to be executed at the drone or base station) to achieve the desired performance.
However, the inventor researches and discovers that in the prior art, tasks are all executed locally on the mobile device or are all scheduled to the unmanned aerial vehicle or the base station for remote execution, so that the scheduling optimization has the problem of low efficiency.
Disclosure of Invention
In view of the above, an object of the present application is to provide a scheduling optimization method and apparatus, an electronic device, and a storage medium, so as to solve the problems in the prior art.
In order to achieve the above purpose, the embodiment of the present application adopts the following technical solutions:
in a first aspect, the present invention provides a scheduling optimization method, applied to an electronic device, where the electronic device is in communication connection with a mobile edge computing network system, where the mobile edge computing network system includes at least one base station, an unmanned aerial vehicle, and a mobile device, and the scheduling optimization method includes:
acquiring a task to be processed and current position information of the at least one mobile device, wherein the task to be processed comprises a first task and a second task;
inputting the task to be processed and the current position information into a preset scheduling optimization model to obtain a scheduling strategy, wherein the scheduling optimization model is obtained by training based on the established initial model;
and sending the scheduling policy to the at least one mobile device, so that the at least one mobile device sends the first task to the at least one unmanned aerial vehicle for processing based on the scheduling policy, and forwards the second task to the at least one base station for processing through the at least one unmanned aerial vehicle.
In an optional embodiment, the scheduling optimization method further includes a step of obtaining a scheduling optimization model, where the step includes:
establishing an initial model and an optimization objective function according to the initial parameters of the mobile edge computing network system;
and training the initial model according to the optimization objective function to obtain a scheduling optimization model.
In an optional embodiment, the step of establishing an initial model and optimizing an objective function according to initial parameters of the mobile edge computing network system includes:
establishing an initial model according to initial parameters of the at least one base station, the unmanned aerial vehicle and the mobile equipment;
and establishing an optimization objective function according to the initial model.
In an optional embodiment, the scheduling optimization model includes an unmanned aerial vehicle trajectory planning model, a calculation task joint scheduling model, and a resource allocation model, and the step of training the initial model according to the optimization objective function to obtain the scheduling optimization model includes:
splitting the optimization objective function to obtain a first optimization objective function, a second optimization objective function and a third optimization objective function;
training the initial model according to the first optimization objective function to obtain the unmanned aerial vehicle trajectory planning model, training the initial model according to the second optimization objective function to obtain the calculation task joint scheduling model, and training the initial model according to the third optimization objective function to obtain the resource allocation model.
In an optional embodiment, the step of inputting the to-be-processed task and the current location information into a preset scheduling optimization model to obtain a scheduling policy includes:
inputting the current position information into the unmanned aerial vehicle trajectory planning model, and calculating to obtain the predicted position information of the at least one mobile device;
inputting the task to be processed and the predicted position information into the task joint scheduling model, and calculating to obtain a task scheduling decision variable of the at least one mobile device;
and inputting the task to be processed and the task scheduling decision variable into the resource allocation model, and calculating to obtain a scheduling strategy.
In an optional embodiment, the step of inputting the current location information into the unmanned aerial vehicle trajectory planning model and calculating the predicted location information of the at least one mobile device includes:
performing motion prediction processing according to the current position information to obtain next position information of the at least one mobile device;
and clustering the next position information of the at least one mobile device to obtain the predicted position information.
In an optional implementation manner, the step of inputting the to-be-processed task and the predicted location information into the task joint scheduling model and calculating a task scheduling decision variable of the at least one mobile device includes:
performing task joint scheduling training processing according to the task to be processed and the predicted position information to obtain a decision action of the at least one mobile device;
and performing integrated processing on the decision action to obtain a task scheduling decision variable.
In a second aspect, the present invention provides a scheduling optimization apparatus, applied to an electronic device, where the electronic device is in communication connection with a mobile edge computing network system, where the mobile edge computing network system includes at least one base station, an unmanned aerial vehicle, and a mobile device, and the scheduling optimization apparatus includes:
the task obtaining module is used for obtaining a task to be processed and current position information of the at least one mobile device, wherein the task to be processed comprises a first task and a second task;
the strategy acquisition module is used for inputting the to-be-processed task and the current position information into a preset scheduling optimization model to obtain a scheduling strategy, wherein the scheduling optimization model is obtained by training based on the established initial model;
a policy sending module, configured to send the scheduling policy to the at least one mobile device, so that the at least one mobile device sends the first task to the at least one drone for processing based on the scheduling policy, and forwards the second task to the at least one base station through the at least one drone for processing.
In a third aspect, the present invention provides an electronic device comprising: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the schedule optimization method of any of the preceding embodiments when executing the program.
In a fourth aspect, the present invention provides a storage medium, where the storage medium includes a computer program, and the computer program controls, when running, an electronic device where the storage medium is located to execute the scheduling optimization method according to any of the foregoing embodiments.
The scheduling optimization method and device, the electronic device and the storage medium provided by the embodiment of the application obtain the scheduling policy by inputting the task to be processed and the current position information into the preset scheduling optimization model, and send the scheduling policy to the at least one mobile device, so that the at least one mobile device sends the first task to the at least one unmanned aerial vehicle for processing based on the scheduling policy, and forwards the second task to the at least one base station for processing through the at least one unmanned aerial vehicle, thereby realizing the purpose of scheduling the first task on the unmanned aerial vehicle for processing, and scheduling the second task on the base station for processing, and avoiding the problems that in the prior art, the tasks are all executed locally on the mobile device or are all executed remotely on the unmanned aerial vehicle or the base station, and the scheduling optimization efficiency is low.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 shows a block diagram of a data processing system according to an embodiment of the present application.
Fig. 2 shows a block diagram of a scheduling optimization system according to an embodiment of the present application.
Fig. 3 shows a block diagram of an electronic device according to an embodiment of the present application.
Fig. 4 is a flowchart illustrating a scheduling optimization method according to an embodiment of the present application.
Fig. 5 is another schematic flow chart of the scheduling optimization method according to the embodiment of the present application.
Fig. 6 is a schematic structural diagram of a scheduling optimization model according to an embodiment of the present application.
Fig. 7 is a schematic structural diagram of an LSTM network according to an embodiment of the present application.
Fig. 8 is a schematic structural diagram of a mobile device location prediction model based on an LSTM network according to an embodiment of the present application.
Fig. 9 is a schematic flowchart of a clustering algorithm for a mobile device based on FCM according to an embodiment of the present application.
Fig. 10 is a schematic structural diagram of an actor neural network and an evaluation family neural network provided in an embodiment of the present application.
Fig. 11 is a flowchart illustrating a DDPG-based calculation task scheduling algorithm according to an embodiment of the present application.
Fig. 12 is a schematic flowchart of a scheduling variable modeling integration algorithm provided in an embodiment of the present application.
Fig. 13 is a block diagram of a scheduling optimization apparatus according to an embodiment of the present application.
Icon: 10-a data processing system; 100-an electronic device; 110 — a first memory; 120-a first processor; 130-a communication module; 200-a scheduling optimization system; 1300-scheduling optimization means; 1310-a task obtaining module; 1320-policy acquisition module; 1330-policy sending module.
Detailed Description
Due to the high mobility and flexibility of Unmanned Aerial Vehicles (UAVs), researchers have recently proposed a technology for assisting Mobile Edge Computing (MEC) in various application scenarios using an Unmanned Aerial vehicle by deploying relevant wireless communication nodes in the Unmanned Aerial vehicle to establish a communication relationship with Mobile Devices (MDs) of users. When network infrastructure is unavailable (such as rescue scene where natural disaster occurs), network equipment is sparsely distributed (such as field operation environment) or mobile equipment facing temporary proliferation is far beyond network service capability (such as large competition or meeting), the unmanned aerial vehicle can be used as a communication relay station or an edge computing platform. After the unmanned aerial vehicle deploys the computing resources, the unmanned aerial vehicle-assisted mobile edge computing network will bring many advantages, such as reducing network overhead, reducing computing task execution delay, better quality of experience (QoE), prolonging the battery life of the mobile device, and the like.
In the field of drone-assisted mobile edge computing, appropriate decisions need to be made on the motion trajectory of a drone and the offloading of computing tasks in a mobile edge computing network (whether the computing tasks are executed locally on a mobile device or are offloaded to an edge server side) to achieve ideal performance. Specifically, the existing research and invention realizes the minimization of the computation delay or energy consumption of all mobile devices by optimizing the track, the task unloading proportion and the task scheduling condition of the unmanned aerial vehicle, and ensures the reliability of the whole edge computing network.
Existing drone-assisted edge computing systems often use only one or more drones as edge computing devices to ensure low latency and reliability of network system computing task transmissions. Due to the limitations of current unmanned aerial vehicle technology development and the relatively weak computing power of deploying computing devices in unmanned aerial vehicles, simply using an unmanned aerial vehicle-assisted edge computing network is not sufficient to provide satisfactory services for multiple mobile devices. Therefore, a more promising model is to implement the building of a mobile edge computing network among mobile devices, drones, and cellular Base Stations (BSs). The existing edge computing networks composed of mobile devices, unmanned aerial vehicles and base stations only comprise one unmanned aerial vehicle, and the unmanned aerial vehicle is used as a computing device of an edge service and a relay task forwarding device, so that the computing task requirements of a plurality of mobile devices cannot be met at the same time, and the task computing time delay of a network system is increased.
In order to improve at least one of the above technical problems proposed by the present application, embodiments of the present application provide a scheduling optimization method and apparatus, an electronic device, and a storage medium, and the following describes technical solutions of the present application through possible implementation manners.
The defects existing in the above solutions are the results obtained after the inventor has practiced and studied carefully, so the discovery process of the above problems and the solutions proposed by the embodiments of the present application in the following description to the above problems should be the contributions made by the inventor in the invention process.
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It is to be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
It should be noted that the features of the embodiments of the present application may be combined with each other without conflict.
Fig. 1 is a block diagram of a data processing system 10 according to an embodiment of the present application, which provides a possible implementation manner of the data processing system 10, and referring to fig. 1, the data processing system 10 may include one or more of an electronic device 100 and a scheduling optimization system 200.
The electronic device 100 is in communication connection with the scheduling optimization system 200, and the electronic device 100 obtains the task to be processed and the position of the scheduling optimization system 200 and obtains a scheduling policy according to the task to be processed and the position, so that the scheduling optimization system 200 performs scheduling optimization according to the scheduling policy.
Optionally, the specific composition of the scheduling optimization system 200 is not limited, and may be set according to the actual application requirement. For example, in one alternative example, the schedule optimization system 200 can include at least one base station, a drone, and a mobile device.
It should be noted that, in an alternative example, the electronic device 100 and the mobile device may be the same device; in another alternative example, the electronic device 100 and the drone may be the same device; in another alternative example, the electronic device 100 and the base station may be the same device.
Optionally, the number of the base stations is not limited, and may be set according to the actual application requirements. For example, in an alternative example, the number of base stations may be one.
That is to say, in order to solve the problem that the task computation delay of the edge computing network composed of the mobile device, the unmanned aerial vehicle and the base station is high and cannot simultaneously meet the requirements of a plurality of mobile devices with computing tasks, with reference to fig. 2, the present application establishes a mobile edge computing network composed of a single base station, a plurality of unmanned aerial vehicles and a large number of mobile devices. The computing tasks generated by the mobile devices in the network can be performed by the mobile devices themselves, can be offloaded to one of the drones for simple computation, or can be further transmitted to the base station for more intensive computation.
Referring to fig. 3, a block diagram of an electronic device 100 according to an embodiment of the present disclosure is shown, where the electronic device 100 in this embodiment may be a server, a processing device, a processing platform, and the like, which are capable of performing data interaction and processing. The electronic device 100 includes a first memory 110, a first processor 120, and a communication module 130. The elements of the first memory 110, the first processor 120 and the communication module 130 are electrically connected to each other directly or indirectly to realize data transmission or interaction. For example, the components may be electrically connected to each other via one or more communication buses or signal lines.
The first memory 110 is used for storing programs or data. The first Memory 110 may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like.
The first processor 120 is used to read/write data or programs stored in the first memory 110 and perform corresponding functions. The communication module 130 is used for establishing a communication connection between the electronic device 100 and another communication terminal through a network, and for transceiving data through the network.
It should be understood that the configuration shown in fig. 3 is merely a schematic diagram of the configuration of the electronic device 100, and that the electronic device 100 may also include more or fewer components than shown in fig. 3, or have a different configuration than shown in fig. 3. The components shown in fig. 3 may be implemented in hardware, software, or a combination thereof.
Fig. 4 shows one of flowcharts of a scheduling optimization method provided in an embodiment of the present application, where the method is applicable to the electronic device 100 shown in fig. 3 and is executed by the electronic device 100 in fig. 3. It should be understood that, in other embodiments, the order of some steps in the scheduling optimization method of this embodiment may be interchanged according to actual needs, or some steps may be omitted or deleted. The flow of the scheduling optimization method shown in fig. 4 is described in detail below.
Step S410, a task to be processed and current location information of at least one mobile device are obtained.
The tasks to be processed comprise a first task and a second task.
Step S420, inputting the task to be processed and the current position information into a preset scheduling optimization model to obtain a scheduling strategy.
And the scheduling optimization model is obtained by training based on the established initial model.
Step S430, sending the scheduling policy to at least one mobile device, so that the at least one mobile device sends the first task to the at least one drone for processing based on the scheduling policy, and forwards the second task to the at least one base station for processing through the at least one drone.
According to the method, the to-be-processed tasks and the current position information are input into a preset scheduling optimization model to obtain a scheduling strategy, the scheduling strategy is sent to at least one mobile device, so that the at least one mobile device sends the first tasks to the at least one unmanned aerial vehicle for processing based on the scheduling strategy, the second tasks are forwarded to the at least one base station through the at least one unmanned aerial vehicle for processing, the first tasks are scheduled to the unmanned aerial vehicle for processing, the second tasks are scheduled to the base station for processing, and the problem that in the prior art, the scheduling optimization efficiency is low due to the fact that the tasks are all executed locally on the mobile device or are all executed remotely on the unmanned aerial vehicle or the base station is solved.
It should be noted that, before step S410, the scheduling optimization method provided in the embodiment of the present application may further include a step of obtaining a scheduling optimization model, and with reference to fig. 5, the step may include the following sub-steps:
step S440, establishing an initial model and an optimization objective function according to the initial parameters of the mobile edge computing network system.
And S450, training the initial model according to the optimization objective function to obtain a scheduling optimization model.
For step S440, it should be noted that the specific way of establishing the initial model and optimizing the objective function is not limited, and may be set according to the actual application requirement. For example, in an alternative example, step S440 may include the following sub-steps:
establishing an initial model according to initial parameters of at least one base station, the unmanned aerial vehicle and the mobile equipment; and establishing an optimization objective function according to the initial model.
The initial model may include a system model, a computation model and a communication model of the mobile edge computing network system, and the step of establishing the initial model may include the following sub-steps:
1. establishing a system model:
the network architecture of the system model established by the application is mainly divided into three layers, namely a ground mobile device, an aerial unmanned aerial vehicle and a base station at a far end, and the positions of the three can be expressed by using a three-dimensional Cartesian coordinate system. The total execution time of the task to be processed is recorded asTWhich is divided intoNA slice, a set of slices may be represented as:
Figure P_210629160405645_645542001
wherein the length of each time sliceτSatisfy the following requirements
Figure P_210629160405692_692013001
And assuming that each time slice is small enough that the position of each drone within the time slice is unchanged, under the condition that the computing task is considered to be possibly blocked, the network system assumes that the mobile device cannot directly communicate with the base station and can only offload the task to the base station with the help of the drone.
In a network system, the set of mobile devices can be represented as:
Figure P_210629160405723_723674001
wherein the content of the first and second substances,Mindicating the number of mobile devices in a time slice
Figure P_210629160405771_771988001
Mobile device
Figure P_210629160405803_803235002
The position of (d) can be expressed as:
Figure P_210629160405849_849745001
wherein the content of the first and second substances,
Figure P_210629160405881_881062001
and
Figure P_210629160405912_912710002
representing mobile devices
Figure P_210629160405943_943903003
The coordinates of the horizontal plane in which it lies,
Figure P_210629160405976_976671004
Figure P_210629160406010_010381005
in time slice
Figure P_210629160406039_039637001
Each mobile device
Figure P_210629160406070_070874002
A computationally intensive task results, which can be expressed as:
Figure P_210629160406102_102107001
wherein the content of the first and second substances,
Figure P_210629160406149_149106001
representing a current task
Figure P_210629160406182_182629002
The size of the data (unit: bit),
Figure P_210629160406213_213981003
representing the number of cycles the CPU spends processing each bit,
Figure P_210629160406245_245202004
representing a current task
Figure P_210629160406260_260806005
Maximum time allowed for execution. Without loss of generality, the maximum allowed execution time of all tasks is the same. In addition to this, the present invention is,
Figure P_210629160406292_292072006
value less thanτTo ensure that each task can be executed in one time slice.
Each mobile device
Figure P_210629160406323_323264001
In which an on-board CPU is embedded, and its maximum computing frequencyRate of use can be
Figure P_210629160406355_355525002
And (4) showing. By dynamically adjusting the voltage and frequency of the CPU in time slices
Figure P_210629160406387_387306003
Moving device
Figure P_210629160406418_418498004
Actual CPU frequency
Figure P_210629160406449_449881005
Adaptive control can be realized to improve the utilization efficiency of energy, and therefore,
Figure P_210629160406497_497730006
it should satisfy:
Figure P_210629160406543_543538001
wherein it is assumed that all mobile devices have the same maximum computing power
Figure P_210629160406594_594797001
In this system, the set of drones can be represented as:
Figure P_210629160406626_626007001
wherein the content of the first and second substances,Uindicating number of drones, time slice
Figure P_210629160406688_688557001
Unmanned plane
Figure P_210629160406735_735464002
The position of (d) can be expressed as:
Figure P_210629160406784_784270001
wherein the content of the first and second substances,
Figure P_210629160406831_831098001
and
Figure P_210629160406846_846724002
indicating unmanned aerial vehicle
Figure P_210629160406877_877975003
The coordinates of the horizontal plane in which it lies,
Figure P_210629160406924_924847004
Figure P_210629160406940_940463005
Hindicating the altitude at which the drone is located.
Assuming that the maximum flight speed of each drone does not exceed
Figure P_210629160406973_973173001
I.e. can be expressed as:
Figure P_210629160407004_004440001
wherein the content of the first and second substances,
Figure P_210629160407035_035687001
is shown in time slice
Figure P_210629160407066_066937002
Unmanned plane
Figure P_210629160407098_098190003
The speed of (2). Furthermore, in order to ensure the flight safety of the drones, the distance between any two drones should be greater than the minimum allowable distance
Figure P_210629160407129_129445004
Namely:
Figure P_210629160407162_162133001
in time slice
Figure P_210629160407193_193934001
Unmanned plane
Figure P_210629160407240_240887002
The energy consumption generated can be expressed as:
Figure P_210629160407272_272031001
wherein the content of the first and second substances,
Figure P_210629160407318_318922001
Figure P_210629160407350_350191002
to represent
Figure P_210629160407382_382862003
The weight of (c).
Each drone may be deployed as an edge server with maximum computing power noted
Figure P_210629160407414_414103001
. In time slice
Figure P_210629160407445_445427002
For computing tasks that are decided to be uploaded to and executed by the drone, the drone
Figure P_210629160407477_477000003
The allocated CPU computing resources may be represented as
Figure P_210629160407507_507873004
And satisfies:
Figure P_210629160407539_539078001
assuming that all drones have the same maximum computing power
Figure P_210629160407592_592384001
The location of the base station can be expressed as:
Figure P_210629160407624_624094001
wherein the content of the first and second substances,
Figure P_210629160407672_672446001
and
Figure P_210629160407719_719334002
representing the coordinates of the horizontal plane in which the base station is located. Because the height that basic station and unmanned aerial vehicle were located is high, the basic station is connected through sight distance wireless transmission link with unmanned aerial vehicle and not directly connected with the mobile device. In this case, the drone acts as a relay forwarding device, forwarding the tasks offloaded by the mobile device to the base station for further computation. Since the base station has a powerful calculation server and energy supply, the execution time of the calculation tasks at the base station is negligible and the energy consumption of all tasks executed at the base station is not considered.
The unloading mode of all the computing tasks of the system follows the complete unloading mode, namely, each computing task is completely executed locally or completely unloaded to the unmanned aerial vehicle
Figure P_210629160407767_767233001
Up or further completely offloaded to base station execution. Using task scheduling decision variables
Figure P_210629160407798_798885002
Representing computational tasks
Figure P_210629160407845_845752003
The unloading situation of (1):
Figure P_210629160407877_877019001
wherein the content of the first and second substances,
Figure P_210629160407923_923851001
Figure P_210629160407956_956089002
representing computational tasks
Figure P_210629160407987_987894003
To be offloaded to a computing platformk
It is worth noting that when the task is executed
Figure P_210629160408019_019093001
In a mobile device
Figure P_210629160408050_050336002
Or only one when executed on the unmanned aerial vehicle
Figure P_210629160408097_097175003
Is 1, and the other values are all 0, i.e.
Figure P_210629160408128_128478004
Or
Figure P_210629160408160_160653005
Figure P_210629160408192_192518006
. When task
Figure P_210629160408223_223665007
When implemented at the base station, except
Figure P_210629160408254_254906008
In addition, the corresponding drone to which it is offloaded also needs to be 1, i.e. 1
Figure P_210629160408286_286146009
Since one of the drones should act as a relay from the mobile device to the base station. In summary, the variables
Figure P_210629160408317_317386010
The following constraints should be satisfied:
Figure P_210629160408348_348680001
in addition, it is assumed that each drone can offload at most one task to the BS for continuous execution in each time slice, and therefore,
Figure P_210629160408396_396984001
it should satisfy:
Figure P_210629160408428_428241001
wherein the content of the first and second substances,
Figure P_210629160408475_475130001
it is added that the variable is introduced
Figure P_210629160408506_506447001
The constraints of the computing resources allocated by the mobile device and the drone become:
Figure P_210629160408537_537650001
Figure P_210629160408575_575261001
2. establishing a calculation model:
the computational tasks may be performed in the mobile device, the drone and the base station and may therefore be referred to as local computation, drone-side computation and BS-side computation, respectively. If task
Figure P_210629160408606_606460001
Choosing to calculate locally, i.e.
Figure P_210629160408638_638276002
. Then, the computation time of the task is:
Figure P_210629160408684_684604001
the energy consumed was:
Figure P_210629160408715_715881001
wherein the content of the first and second substances,
Figure P_210629160408763_763694001
and
Figure P_210629160408795_795603002
is dependent on the mobile device
Figure P_210629160408826_826742003
The positive coefficient of the CPU.
If computing task
Figure P_210629160408857_857944001
Selecting for offloading to a drone
Figure P_210629160408889_889258002
Is executed upwards, i.e. is
Figure P_210629160408920_920482003
The calculation time of the task is as follows:
Figure P_210629160408952_952629001
wherein the content of the first and second substances,
Figure P_210629160409000_000068001
the corresponding consumed energy is:
Figure P_210629160409047_047065001
wherein the content of the first and second substances,
Figure P_210629160409078_078203001
wherein the content of the first and second substances,
Figure P_210629160409140_140688001
and
Figure P_210629160409174_174315002
is dependent on the unmanned plane
Figure P_210629160409205_205628003
Positive coefficient of CPU, it is noted that each calculation task
Figure P_210629160409236_236880004
Can only be unloaded into one of the drones.
If task
Figure P_210629160409268_268158001
Performed at the base station, i.e.
Figure P_210629160409299_299349002
According to the assumption of strong computing power and energy supply capability of the base station, the execution time of the task is approximately zero, and the energy consumption generated by the task is not considered.
3. Establishing a communication model:
the communication links of the whole network system are divided into two types: the communication link of the mobile device with the drone and the communication link of the drone with the base station. In order to avoid communication interference possibly existing between the unmanned aerial vehicles, each unmanned aerial vehicle is allocated with orthogonal communication frequency, and due to the fact that the height of each unmanned aerial vehicle is high, a wireless communication channel between each unmanned aerial vehicle and a mobile device or a base station mainly takes sight distance wireless transmission as main points.
In time slice
Figure P_210629160409330_330605001
Moving device
Figure P_210629160409362_362786002
And unmanned aerial vehicle
Figure P_210629160409394_394560003
The distance between them is:
Figure P_210629160409425_425831001
in time slice
Figure P_210629160409457_457063001
Unmanned plane
Figure P_210629160409488_488298002
The distance from the base station is:
Figure P_210629160409535_535244001
thus, the mobile device
Figure P_210629160409599_599617001
And unmanned aerial vehicle
Figure P_210629160409630_630890002
The wireless channel gain in between is:
Figure P_210629160409662_662166001
unmanned plane
Figure P_210629160409693_693384001
And the wireless channel gain between the base station is:
Figure P_210629160409724_724640001
wherein the content of the first and second substances,
Figure P_210629160409756_756813001
is the received power gain at a reference distance of 1 meter.
If computing task
Figure P_210629160409788_788601001
Selecting slave mobile devices
Figure P_210629160409819_819841002
Off-load to unmanned aerial vehicle
Figure P_210629160409851_851166003
The transmission rate of the task data is as follows:
Figure P_210629160409881_881884001
if computing task
Figure P_210629160409913_913666001
Selecting slave drones
Figure P_210629160409944_944844002
Unloading to a base station, wherein the transmission rate of task data is as follows:
Figure P_210629160409977_977544001
wherein the content of the first and second substances,Bwhich represents the bandwidth of the network system,
Figure P_210629160410008_008825001
and
Figure P_210629160410040_040074002
respectively expressed in time slices
Figure P_210629160410071_071301003
Mobile device
Figure P_210629160410118_118182004
With unmanned aerial vehicle
Figure P_210629160410149_149450005
The power of the wireless transmission of (a),
Figure P_210629160410169_169905006
which is indicative of the frequency of the communication noise,
Figure P_210629160410217_217312007
and
Figure P_210629160410264_264169008
the following conditions are respectively satisfied:
Figure P_210629160410279_279807001
wherein the content of the first and second substances,
Figure P_210629160410326_326674001
and
Figure P_210629160410358_358157002
respectively representing mobile devices
Figure P_210629160410389_389214003
With unmanned aerial vehicle
Figure P_210629160410420_420453004
The maximum available transmission power.
Mobile device
Figure P_210629160410467_467319001
Offloading computing tasks to unmanned aerial vehicles
Figure P_210629160410498_498612002
The time required and the energy consumed are respectively:
Figure P_210629160410529_529827001
Figure P_210629160410576_576726001
unmanned plane
Figure P_210629160410623_623616001
The time and energy consumed to offload the computation task to the base station are respectively:
Figure P_210629160410670_670507001
Figure P_210629160410716_716912001
order to
Figure P_210629160410781_781760001
And
Figure P_210629160410813_813397002
respectively representing mobile devices
Figure P_210629160410844_844282003
With unmanned aerial vehicle
Figure P_210629160410875_875514004
Energy budget of, and for
Figure P_210629160410922_922386005
The following constraints are satisfied:
Figure P_210629160410954_954692001
Figure P_210629160411002_002017001
the optimization goal of the network system is to minimize the total energy consumption of the mobile device and the drone under the task delay constraint and the system constraint (such as maximum speed of the drone, minimum distance between the drones, and maximum computing power). Computing tasks
Figure P_210629160411066_066008001
When the mobile device, the unmanned aerial vehicle or the base station executes, the corresponding task time delays are respectively expressed as follows:
Figure P_210629160411096_096357001
when task scheduling decision variables are introduced
Figure P_210629160411159_159704001
Then, computing task
Figure P_210629160411191_191938002
Can be uniformly expressed as:
Figure P_210629160411238_238351001
therefore, the corresponding task execution latency constraint is:
Figure P_210629160411285_285239001
in time slice
Figure P_210629160411332_332091001
To execute a task
Figure P_210629160411364_364834002
The energy consumption generated can be divided into two categories:
1) if task
Figure P_210629160411412_412173001
In a mobile device
Figure P_210629160411443_443414002
Execute locally, i.e.
Figure P_210629160411474_474729003
Then moving the device
Figure P_210629160411521_521617004
Is consumed as
Figure P_210629160411555_555657005
2) If task
Figure P_210629160411587_587486001
Is unloaded to the unmanned aerial vehicle
Figure P_210629160411618_618656002
Or performed by the base station, i.e.
Figure P_210629160411649_649565003
Then moving the device
Figure P_210629160411696_696821004
Is consumed as
Figure P_210629160411743_743188005
Thus, moveDevice
Figure P_210629160411776_776860001
In executing a computing task
Figure P_210629160411808_808146002
The energy consumed can be expressed collectively as:
Figure P_210629160411839_839470001
the energy consumption of all mobile devices during task execution can be expressed as:
Figure P_210629160411886_886272001
in summary, in order to minimize the total energy consumption of all tasks of the mobile device during the operation of the mobile edge computing network system, an optimization problem (optimization objective function) is defined as follows:
Figure P_210629160411933_933154001
wherein the content of the first and second substances,
Figure P_210629160411981_981952001
Figure P_210629160412013_013259002
Figure P_210629160412059_059648003
Figure P_210629160412090_090968004
is the variable to be optimized.
In question P, the constraint C1 indicates that the maximum speed of the drones and the minimum distance between drones should not violate the corresponding constraint. Constraint C2 ensures that the computation task generated by each time slice at a mobile device can only be executed at any one of the mobile device local, the drone or the base station, and that each drone can only send one task at most to the base station at each time slice. Constraint C3 ensures that the computational resources allocated to local computation and drone computation per time slice, respectively, should not exceed the maximum computational capacity of the mobile device and drone. The constraint C4 indicates that the mobile device and drone should not exceed their respective energy budgets during execution. The limit condition C5 indicates that the mobile device and the drone cannot allocate transmit power beyond the maximum allowed value. The constraint C6 ensures that each task execution should meet the latency requirements.
For step S450, it should be noted that the specific way of training the model is not limited, and the training mode may be set according to the actual application requirement. For example, in an alternative example in which the scheduling optimization model includes an unmanned aerial vehicle trajectory planning model, a computational task joint scheduling model, and a resource allocation model, step S450 may include the following sub-steps:
splitting the optimization objective function to obtain a first optimization objective function, a second optimization objective function and a third optimization objective function; training the initial model according to the first optimization objective function to obtain an unmanned aerial vehicle trajectory planning model, training the initial model according to the second optimization objective function to obtain a calculation task joint scheduling model, and training the initial model according to the third optimization objective function to obtain a resource allocation model.
In detail, the problem P is a problem that is difficult to solve, and the main reasons are the following: 1) because A is a discrete binary variable and L, P and F are continuous variables, the problem is a mixed nonlinear integer programming problem and belongs to an NP difficult problem; 2) due to the fast response requirement of a network system, each time slice scheduling optimization algorithm needs to perform real-time fast scheduling decision; 3) since the positions of the mobile device and the unmanned aerial vehicle both change, P needs to be solved in a dynamically changing environment. Based on the above reasons, the optimization objective function P is decomposed into three sub-problems, including unmanned aerial vehicle trajectory planning (P1, i.e., the first optimization objective function), calculation task joint scheduling (P2, i.e., the second optimization objective function), and calculation and transmission resource allocation (P3, i.e., the third optimization objective function), so that a high-efficiency scheduling strategy of the mobile edge computing network can be obtained, and the complexity of solving the optimization problem is greatly reduced.
In order to reduce the computational complexity of the original optimization problem, P is split into the following three sub-problems:
1. planning the unmanned aerial vehicle track:
in the optimized scheduling variables L, a, P, F in the problem P, the trajectory position L of the drone is less dependent on the other three variables, the optimization of the variables is mainly based on the position observation of the mobile device, the optimization target is as close as possible to the mobile device and the base station, therefore, the trajectory optimization of the drone can be expressed as:
Figure P_210629160412137_137741001
wherein the content of the first and second substances,
Figure P_210629160412186_186050001
is shown in unmanned plane
Figure P_210629160412217_217311002
Providing a cluster of mobile devices within a service range and satisfying a condition
Figure P_210629160412248_248543003
2. And (3) computing task joint scheduling:
once in the time slice
Figure P_210629160412279_279828001
After the position L of the unmanned aerial vehicle is determined, the task unloading decision variable A needs to be optimized before the variables P and F are optimized. Based on the current mobile device cluster (
Figure P_210629160412311_311064002
) To minimize the maximum computation delay of all tasks
Figure P_210629160412358_358122003
Optimizing a for the purpose of target, so that the constraint C6 in the original problem P is more easily satisfied, and therefore, the computation task joint scheduling sub-problem can be expressed as:
Figure P_210629160412390_390660001
3. calculating and transmitting resource allocation:
after solving problems P1 and P2, under the constraints of C3, C4, and C5, the remaining variables P, F are optimized as follows with the goal of minimizing the energy consumption in the system:
Figure P_210629160412421_421958001
based on the decomposition of the above problems, as shown in fig. 6, the optimization framework provided by the present application is composed of three models, namely, an unmanned aerial vehicle Trajectory Planning model (UAV Trajectory Planning, UTP), a Task Association Scheduling (TAS) and a Resource Allocation and transmission (RA) model, and corresponds to optimization sub-problems P1, P2 and P3, respectively. At the beginning of each time slice, the network system environment generates two state variables (
Figure P_210629160412483_483957001
And
Figure P_210629160412515_515653002
)。
Figure P_210629160412547_547034003
is the input to the UTP model and,
Figure P_210629160412581_581097004
are inputs to the TAS and RA models.
1) UTP model pair
Figure P_210629160412612_612407001
And processing, wherein the UTP model predicts the motion of the mobile device and guides the unmanned aerial vehicle to move to a proper position because the position of the mobile device is different in different time slices. Because the motion mode of the mobile equipment is not in accordance with Gaussian distribution or linear distribution, the motion distribution of the mobile equipment can be simulated by adopting the long-term and short-term memory network. After the prediction is completed, the drones need to be appropriately divided into U clusters according to the number of drones, so that each drone can serve the mobile devices in the cluster. In order to perform soft clustering, i.e., each mobile device can be served by different drones in different time slices (but not more than one drone in the same time slice), a fuzzy C-means clustering method is adopted in the UTP model, and clustering is performed according to similarity of channel power gains. After clustering, the center point of each cluster is used as the output of the motion position of the UAV in the UTP module, i.e.
Figure P_210629160412645_645318002
2) The TAS model receives from the UTP model and the network environment, respectively
Figure P_210629160412692_692448001
And
Figure P_210629160412726_726404002
. The TAS model generates task scheduling decision variables according to time-varying channel conditions and computing task requirements
Figure P_210629160412755_755835003
The value of (c). The present application may use an advanced Deep Reinforcement Learning (DRL) method: a Deep Deterministic Policy Gradient algorithm (DDPG) for obtaining experience according to interaction between an algorithm model and an environment and outputting an optimized decision action
Figure P_210629160412787_787653004
. At itIn alternative examples, other reinforcement learning algorithms (e.g., TD3 algorithm, PPO algorithm, etc.) suitable for continuous motion may be used. Action of output for each time slice
Figure P_210629160412818_818868005
Is a one-dimensional vector consisting of
Figure P_210629160412850_850137006
Term composition, where each term is set to a continuous variable relaxed between 0 and 1.
Figure P_210629160412880_880946007
Can be regarded as
Figure P_210629160412928_928353008
The probability of execution on computing device k (which is why each term is set to a continuous value between 0 and 1). Since the task scheduling decision variable should be a two-dimensional, binary value,
Figure P_210629160412960_960462009
is modeled and integrated as 1 or 0 according to the task-related constraints of the optimization problem and is taken as the output of the TAS model, i.e.
Figure P_210629160412992_992241010
3) Will be provided with
Figure P_210629160413023_023471001
And
Figure P_210629160413054_054734002
the final processing is performed as input to the RA model. According to the sub-problem P3, the optimization variables P and F can be solved directly through a CVXPY convex optimization toolkit, and P and F output by the RA model interact with the environment.
The environment receives the actions of the 3 model outputs, and the environment receives the actions and generates a reward
Figure P_210629160413101_101655001
(as inputs to the DDPG) and a new state (the corresponding component of the state is sent to the corresponding component of the algorithm framework). Thereafter, the algorithm proceeds to the next time slice and repeats the three steps described above.
It should be noted that the optimal position plan of the unmanned aerial vehicle can be calculated and obtained through a long-short term memory network and a fuzzy C-means clustering method, and the trajectory plan of the unmanned aerial vehicle can be divided into two parts, namely mobile device motion prediction and mobile device clustering.
In a network system, the distance between the drone and the mobile device is a main factor affecting other scheduling variables, so the ideal motion trajectory of the drone is to move gradually towards the mobile device and to be as close as possible to the mobile device. To this end, the algorithm proposed in the present application predicts the position of the mobile device
Figure P_210629160413148_148457001
To assist in the movement of the drone. Due to the fact that
Figure P_210629160413181_181881002
Is based primarily on the location of the previous time slice of the mobile device, the present invention utilizes a recurrent neural network LSTM to model
Figure P_210629160413213_213645003
The timing distribution of (2).
As shown in FIG. 7, the Long-Short Term Memory network (LSTM) is a recurrent neural network that accepts external inputs
Figure P_210629160413259_259792001
And a feedback input (
Figure P_210629160413291_291033002
And
Figure P_210629160413322_322278003
). The output of LSTM includes two terms (
Figure P_210629160413355_355446004
And
Figure P_210629160413387_387272005
) The two terms are input to the LSTM itself for processing in the next time slice. Among the two output items, the output items,
Figure P_210629160413418_418502006
obtained by the following operations:
Figure P_210629160413449_449772001
Figure P_210629160413481_481013001
Figure P_210629160413527_527900001
Figure P_210629160413574_574350001
wherein the content of the first and second substances,
Figure P_210629160413621_621654001
Figure P_210629160413668_668512002
and
Figure P_210629160413699_699272003
the output value of the neural network is represented,
Figure P_210629160413731_731002004
and
Figure P_210629160413764_764148005
respectively representing sigmoid and hyperbolic tangent activation functions,
Figure P_210629160413827_827153006
Figure P_210629160413858_858519007
and
Figure P_210629160413889_889706008
representing the network weights of the corresponding neural network layer,
Figure P_210629160413920_920925009
Figure P_210629160413953_953115010
and
Figure P_210629160413984_984875011
representing the offset vector of the corresponding neural network, and the two parts are parameters which need to be learned by the neural network.
Based on
Figure P_210629160414015_015750001
Figure P_210629160414047_047431002
Calculated from the following formula:
Figure P_210629160414078_078710001
Figure P_210629160414125_125523001
wherein the content of the first and second substances,
Figure P_210629160414156_156816001
and
Figure P_210629160414189_189545002
parameters that need to be learned for the neural network.
Based on the above formula, the present application proposes that the mobile device location is predicted based on the mobile device location observation model of LSTM, and the time series expansion is shown in fig. 8. At each time slice, the current mobile device location is input to the LSTM network and the LSTM output
Figure P_210629160414236_236382001
. To predict the mobile device location for the next time slice, a full connectivity layer is added to the output
Figure P_210629160414267_267214002
Fine tuning is performed, specifically as follows:
Figure P_210629160414314_314210001
wherein relu is a relu activation function,
Figure P_210629160414345_345434001
and
Figure P_210629160414378_378168002
learning variables need to be trained for neural networks.
Location prediction based on next time slice of mobile device
Figure P_210629160414409_409699001
The mobile devices need to be clustered into U groups, so that the unmanned aerial vehicle can provide services for the mobile devices in a load balancing manner. In order to complete the clustering of the mobile devices, the FCM method can be adopted to start from the fuzzy theory and carry out the clustering on each cluster
Figure P_210629160414456_456613002
Moving device
Figure P_210629160414487_487796003
In time slice
Figure P_210629160414519_519056004
Assigning a metric value
Figure P_210629160414568_568400005
The calculation method is as follows:
Figure P_210629160414600_600126001
wherein the content of the first and second substances,
Figure P_210629160414662_662683001
indicating the location of the nth slot drone,
Figure P_210629160414693_693923002
representing the centre point of the kth cluster, i.e.
Figure P_210629160414725_725191001
Iterative solution by minimizing the objective function O to be optimized
Figure P_210629160414774_774451001
And
Figure P_210629160414805_805714002
until the difference between two successively calculated metric values is less than a specified threshold value
Figure P_210629160414836_836936003
Figure P_210629160414884_884051001
Before performing the iteration, all
Figure P_210629160414915_915085001
Should be initialized, each
Figure P_210629160414946_946354002
Use of
Figure P_210629160414994_994251003
Because the mobile devices can only move within a small range, their new center points may be close to the previous center points (which are planned as the positions of the drone's movements)
Figure P_210629160415026_026011004
)。
After the iteration is over, each mobile device
Figure P_210629160415057_057204001
Is given a metric value
Figure P_210629160415104_104206002
On behalf of its membership in the u-th cluster, it may be further explored through an exploration strategy
Figure P_210629160415135_135289003
Tuning to binary clustering decisions can reduce the likelihood of trapping the optimization objective O into local minima. Use of
Figure P_210629160415167_167956004
Indicating a search threshold, mobile device
Figure P_210629160415199_199780005
To be provided with
Figure P_210629160415246_246745006
Is clustered to the cluster having the largest metric value and
Figure P_210629160415277_277978007
cluster to other clusters. The algorithm of FIG. 9 details the clustering process of the FCM-based mobile device in the nth time slice, algorithm 1Output of
Figure P_210629160415309_309426008
Guiding the unmanned aerial vehicle to move to
Figure P_210629160415357_357520009
It should be noted that the deep deterministic strategy gradient algorithm based on reinforcement learning can be used to find the task scheduling decision variable of each mobile device, and the joint scheduling of the computing task includes two parts, namely task scheduling decision variable optimization based on DDPG and integration of the scheduling variables. After the motion track of the unmanned aerial vehicle is known, the algorithm framework learns the scheduling strategy of the calculation task by using a reinforcement learning algorithm of the DDPG, namely:
Figure P_210629160415404_404821001
policy
Figure P_210629160415451_451746001
Is a mapping function from the environment state to the decision-making action, and the state of the network environment is:
Figure P_210629160415482_482944001
policy
Figure P_210629160415529_529819001
The output decision actions are:
Figure P_210629160415562_562543001
Figure P_210629160415594_594284001
is a continuous variable from 0 to 1, of size:
Figure P_210629160415625_625501002
by reinforcement learning, a near-optimal solution for policy π can be obtained by maximizing the total utility value (also called Q-value):
Figure P_210629160415672_672397001
wherein the content of the first and second substances,
Figure P_210629160415719_719271001
is that
Figure P_210629160415750_750512002
Taking decision actions in state
Figure P_210629160415783_783223003
The new state of the back-end environment,
Figure P_210629160415814_814482004
is a time slice
Figure P_210629160415845_845729005
γ is the discount coefficient for future rewards. Since the state and the action space of the environment are high-dimensional, two neural networks are employed: actor neural network (Actor) pi (parameter is
Figure P_210629160415876_876978006
) And evaluate the home neural network (Critic) Q (parameter θ), as shown in fig. 10. In order to make the learning process more stable, a target network (a target strategy network body and a target evaluation network respectively) can be adopted
Figure P_210629160415923_923862007
And
Figure P_210629160415956_956048008
is a parameter) is periodically updated.
In time slice
Figure P_210629160415987_987808001
Actions of the environment that accept the output of the algorithmic model
Figure P_210629160416019_019091002
Then, from state
Figure P_210629160416065_065648003
Transition to a State
Figure P_210629160416096_096846004
And a prize is generated
Figure P_210629160416128_128440005
Packing the four items into a tuple
Figure P_210629160416161_161122006
And stored in an experience playback pool. During algorithm training, a batch of samples is randomly selected from an empirical replay pool, and the evaluation neural network (i.e., parameter θ) is trained according to the following loss function.
Figure P_210629160416208_208124001
The actor network is trained to minimize the following gradient function:
Figure P_210629160416255_255578001
wherein the content of the first and second substances,
Figure P_210629160416333_333570001
is the state sampled from the state distribution under the current strategy,
Figure P_210629160416383_383354002
is the number of a batch of samples in the network back propagation training,the task joint scheduling training algorithm based on the DDPG is shown in detail in figure 11.
Decision-making actions due to output of actor networks
Figure P_210629160416414_414677001
Is a one-dimensional vector, and
Figure P_210629160416477_477169002
is a continuous value in the range of 0 to 1, so it is desirable that
Figure P_210629160416508_508404003
Reshaping (reshape) is performed in a two-dimensional manner and is integrated to 0 or 1 for further task scheduling. As shown in FIG. 12, is
Figure P_210629160416555_555420004
The modeling and integration algorithm has the time complexity of
Figure P_210629160416604_604559005
. After the modeling and integration of the task scheduling variables, the output a [ m ] of the algorithm 3][k]And transmitting the data to the RA module for resource optimization allocation.
It should be noted that, the convex optimization-based method can be used to determine the allocation of the computation and transmission resources of the network system,
Figure P_210629160416651_651743001
and
Figure P_210629160416698_698262002
the final processing is performed as input to the RA module. According to the sub-problem P3, the optimization variables P and F can be solved directly by a CVXPY tool using a convex optimization method.
For step S420, it should be noted that the specific manner of obtaining the scheduling policy is not limited, and may be set according to the actual application requirement. For example, in an alternative example, step S420 may include the following sub-steps:
inputting the current position information into an unmanned aerial vehicle trajectory planning model, and calculating to obtain the predicted position information of at least one mobile device; inputting the task to be processed and the predicted position information into a task joint scheduling model, and calculating to obtain a task scheduling decision variable of at least one mobile device; and inputting the tasks to be processed and the task scheduling decision variables into a resource allocation model, and calculating to obtain a scheduling strategy.
The current position information is input into the unmanned aerial vehicle trajectory planning model, the specific mode of calculating the predicted position information of the at least one mobile device is not limited, and the predicted position information can be set according to actual application requirements. For example, in one alternative example, the step may include the following sub-steps:
performing motion prediction processing according to the current position information to obtain next position information of at least one mobile device; and clustering the next position information of at least one mobile device to obtain the predicted position information.
It should be noted that, the steps of performing the prediction processing and the clustering processing may refer to the process of training to obtain the trajectory planning model of the unmanned aerial vehicle.
The specific mode of inputting the task to be processed and the predicted position information into the task joint scheduling model and calculating to obtain the task scheduling decision variable of at least one mobile device is not limited and can be set according to the actual application requirements. For example, in one alternative example, the step may include the following sub-steps:
performing task joint scheduling training processing according to the task to be processed and the predicted position information to obtain a decision action of at least one mobile device; and performing integrated processing on the decision action to obtain a task scheduling decision variable.
It should be noted that, the steps of performing the training process and the integrating process may refer to the process of training to obtain the computation task joint scheduling model.
By the method, a mobile edge computing network consisting of a single base station, a plurality of unmanned aerial vehicles and a large number of mobile devices is deployed, each computing task can be executed on the mobile devices, can be unloaded to the unmanned aerial vehicles for computing, or can be further unloaded to the base station by using the unmanned aerial vehicles as relays for more intensive computing. Under the goal of minimizing the energy consumption of a network system, the joint optimization problem of unmanned aerial vehicle track, task association, calculation and transmission resource allocation is determined. In view of the high complexity of the problem, the invention decomposes the optimization problem into three sub-problems, greatly reduces the energy consumption of the whole network system, prolongs the service life of the network, simultaneously reduces the computation delay of all mobile devices in the communication network, and improves the service quality of the computation-intensive application.
With reference to fig. 13, an embodiment of the present application further provides a scheduling optimization apparatus 1300, where functions implemented by the scheduling optimization apparatus 1300 correspond to steps executed by the foregoing method. The schedule optimization apparatus 1300 may be understood as a processor of the electronic device 100, or may be understood as a component that is independent from the electronic device 100 or the processor and implements the functions of the present application under the control of the electronic device 100. The scheduling optimization apparatus 1300 may include a task obtaining module 1310, a policy obtaining module 1320, and a policy sending module 1330.
The task obtaining module 1310 is configured to obtain a to-be-processed task and current location information of at least one mobile device, where the to-be-processed task includes a first task and a second task. In this embodiment of the application, the task obtaining module 1310 may be configured to perform step S410 shown in fig. 4, and reference may be made to the foregoing description of step S410 for relevant contents of the task obtaining module 1310.
A policy obtaining module 1320, configured to input the to-be-processed task and the current position information into a preset scheduling optimization model to obtain a scheduling policy, where the scheduling optimization model is obtained by training based on the established initial model. In this embodiment of the application, the policy obtaining module 1320 may be configured to perform step S420 shown in fig. 4, and reference may be made to the foregoing description of step S420 for relevant content of the policy obtaining module 1320.
The policy sending module 1330 is configured to send the scheduling policy to the at least one mobile device, so that the at least one mobile device sends the first task to the at least one drone for processing based on the scheduling policy, and forwards the second task to the at least one base station for processing through the at least one drone. In the embodiment of the present application, the policy sending module 1330 may be configured to perform step S430 shown in fig. 4, and reference may be made to the foregoing description of step S430 regarding the relevant content of the policy sending module 1330.
In addition, an embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program performs the steps of the scheduling optimization method.
The computer program product of the scheduling optimization method provided in the embodiment of the present application includes a computer-readable storage medium storing a program code, where instructions included in the program code may be used to execute steps of the scheduling optimization method in the foregoing method embodiment, which may be referred to specifically in the foregoing method embodiment, and details are not described here again.
To sum up, according to the scheduling optimization method and apparatus, the electronic device, and the storage medium provided in the embodiments of the present application, the scheduling policy is obtained by inputting the task to be processed and the current location information into the preset scheduling optimization model, and the scheduling policy is sent to the at least one mobile device, so that the at least one mobile device sends the first task to the at least one unmanned aerial vehicle for processing based on the scheduling policy, and forwards the second task to the at least one base station for processing through the at least one unmanned aerial vehicle, thereby achieving the purpose of scheduling the first task to the unmanned aerial vehicle for processing, and scheduling the second task to the base station for processing, and avoiding the problem in the prior art that the tasks are either all executed locally on the mobile device or all executed remotely on the unmanned aerial vehicle or the base station, which results in low efficiency of scheduling optimization.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims (10)

1. A scheduling optimization method is applied to an electronic device which is in communication connection with a mobile edge computing network system, wherein the mobile edge computing network system comprises at least one base station, a unmanned aerial vehicle and a mobile device, and the scheduling optimization method comprises the following steps:
acquiring a task to be processed and current position information of the at least one mobile device, wherein the task to be processed comprises a first task and a second task;
inputting the task to be processed and the current position information into a preset scheduling optimization model to obtain a scheduling strategy, wherein the scheduling optimization model is obtained by training based on the established initial model;
and sending the scheduling policy to the at least one mobile device, so that the at least one mobile device sends the first task to the at least one unmanned aerial vehicle for processing based on the scheduling policy, and forwards the second task to the at least one base station for processing through the at least one unmanned aerial vehicle.
2. The method of scheduling optimization of claim 1 further comprising the step of obtaining a scheduling optimization model comprising:
establishing an initial model and an optimization objective function according to the initial parameters of the mobile edge computing network system;
and training the initial model according to the optimization objective function to obtain a scheduling optimization model.
3. The method for scheduling optimization of claim 2 wherein the step of building an initial model and optimizing an objective function based on initial parameters of the mobile edge computing network system comprises:
establishing an initial model according to initial parameters of the at least one base station, the unmanned aerial vehicle and the mobile equipment;
and establishing an optimization objective function according to the initial model.
4. The scheduling optimization method of claim 2, wherein the scheduling optimization model comprises an unmanned aerial vehicle trajectory planning model, a computational task joint scheduling model and a resource allocation model, and the step of training the initial model according to the optimization objective function to obtain the scheduling optimization model comprises:
splitting the optimization objective function to obtain a first optimization objective function, a second optimization objective function and a third optimization objective function;
training the initial model according to the first optimization objective function to obtain the unmanned aerial vehicle trajectory planning model, training the initial model according to the second optimization objective function to obtain the calculation task joint scheduling model, and training the initial model according to the third optimization objective function to obtain the resource allocation model.
5. The scheduling optimization method of claim 4, wherein the step of inputting the to-be-processed task and the current location information into a preset scheduling optimization model to obtain the scheduling policy comprises:
inputting the current position information into the unmanned aerial vehicle trajectory planning model, and calculating to obtain the predicted position information of the at least one mobile device;
inputting the task to be processed and the predicted position information into the task joint scheduling model, and calculating to obtain a task scheduling decision variable of the at least one mobile device;
and inputting the task to be processed and the task scheduling decision variable into the resource allocation model, and calculating to obtain a scheduling strategy.
6. The method of claim 5, wherein the step of inputting the current location information into the unmanned aerial vehicle trajectory planning model to calculate the predicted location information for the at least one mobile device comprises:
performing motion prediction processing according to the current position information to obtain next position information of the at least one mobile device;
and clustering the next position information of the at least one mobile device to obtain the predicted position information.
7. The method of claim 5, wherein the step of inputting the to-be-processed task and the predicted location information into the task joint scheduling model and calculating the task scheduling decision variable of the at least one mobile device comprises:
performing task joint scheduling training processing according to the task to be processed and the predicted position information to obtain a decision action of the at least one mobile device;
and performing integrated processing on the decision action to obtain a task scheduling decision variable.
8. A scheduling optimization device applied to an electronic device, wherein the electronic device is in communication connection with a mobile edge computing network system, the mobile edge computing network system comprises at least one base station, a drone and a mobile device, and the scheduling optimization device comprises:
the task obtaining module is used for obtaining a task to be processed and current position information of the at least one mobile device, wherein the task to be processed comprises a first task and a second task;
the strategy acquisition module is used for inputting the to-be-processed task and the current position information into a preset scheduling optimization model to obtain a scheduling strategy, wherein the scheduling optimization model is obtained by training based on the established initial model;
a policy sending module, configured to send the scheduling policy to the at least one mobile device, so that the at least one mobile device sends the first task to the at least one drone for processing based on the scheduling policy, and forwards the second task to the at least one base station through the at least one drone for processing.
9. An electronic device, comprising: memory, processor and computer program stored on the memory and executable on the processor, the processor implementing the method of schedule optimization of any of claims 1 to 7 when executing the program.
10. A storage medium, comprising a computer program, which when executed controls an electronic device in which the storage medium is located to perform the schedule optimization method of any of claims 1 to 7.
CN202110765005.3A 2021-05-18 2021-07-07 Scheduling optimization method and device, electronic equipment and storage medium Active CN113254188B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202110765005.3A CN113254188B (en) 2021-07-07 2021-07-07 Scheduling optimization method and device, electronic equipment and storage medium
PCT/CN2022/091260 WO2022242468A1 (en) 2021-05-18 2022-05-06 Task offloading method and apparatus, scheduling optimization method and apparatus, electronic device, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110765005.3A CN113254188B (en) 2021-07-07 2021-07-07 Scheduling optimization method and device, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN113254188A true CN113254188A (en) 2021-08-13
CN113254188B CN113254188B (en) 2021-11-19

Family

ID=77190937

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110765005.3A Active CN113254188B (en) 2021-05-18 2021-07-07 Scheduling optimization method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN113254188B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114007231A (en) * 2021-11-26 2022-02-01 中国人民解放军国防科技大学 Heterogeneous unmanned aerial vehicle data unloading method and device, electronic equipment and storage medium
CN114217881A (en) * 2022-02-23 2022-03-22 北京航空航天大学杭州创新研究院 Task unloading method and related device
CN114245288A (en) * 2021-10-29 2022-03-25 重庆惠科金渝光电科技有限公司 Task scheduling method of service equipment, service equipment and storage medium
CN114594793A (en) * 2022-03-07 2022-06-07 四川大学 Path planning method for base station unmanned aerial vehicle

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110429973A (en) * 2019-08-05 2019-11-08 西北工业大学 A kind of unmanned plane and ground base station cooperated computing unloads and optimization method
US20210165405A1 (en) * 2019-12-03 2021-06-03 University-Industry Cooperation Group Of Kyung Hee University Multiple unmanned aerial vehicles navigation optimization method and multiple unmanned aerial vehicles system using the same

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110429973A (en) * 2019-08-05 2019-11-08 西北工业大学 A kind of unmanned plane and ground base station cooperated computing unloads and optimization method
US20210165405A1 (en) * 2019-12-03 2021-06-03 University-Industry Cooperation Group Of Kyung Hee University Multiple unmanned aerial vehicles navigation optimization method and multiple unmanned aerial vehicles system using the same

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
XIAOYAN HU 等: "Task and Bandwidth Allocation for UAV-Assisted Mobile Edge Computing with Trajectory Design", 《IEEE》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114245288A (en) * 2021-10-29 2022-03-25 重庆惠科金渝光电科技有限公司 Task scheduling method of service equipment, service equipment and storage medium
CN114007231A (en) * 2021-11-26 2022-02-01 中国人民解放军国防科技大学 Heterogeneous unmanned aerial vehicle data unloading method and device, electronic equipment and storage medium
CN114007231B (en) * 2021-11-26 2024-02-20 中国人民解放军国防科技大学 Heterogeneous unmanned aerial vehicle data unloading method and device, electronic equipment and storage medium
CN114217881A (en) * 2022-02-23 2022-03-22 北京航空航天大学杭州创新研究院 Task unloading method and related device
CN114217881B (en) * 2022-02-23 2022-06-21 北京航空航天大学杭州创新研究院 Task unloading method and related device
CN114594793A (en) * 2022-03-07 2022-06-07 四川大学 Path planning method for base station unmanned aerial vehicle

Also Published As

Publication number Publication date
CN113254188B (en) 2021-11-19

Similar Documents

Publication Publication Date Title
CN112351503B (en) Task prediction-based multi-unmanned aerial vehicle auxiliary edge computing resource allocation method
CN113254188B (en) Scheduling optimization method and device, electronic equipment and storage medium
Seid et al. Collaborative computation offloading and resource allocation in multi-UAV-assisted IoT networks: A deep reinforcement learning approach
Zhang et al. Deep learning empowered task offloading for mobile edge computing in urban informatics
Dai et al. Towards energy-efficient scheduling of UAV and base station hybrid enabled mobile edge computing
CN113032904B (en) Model construction method, task allocation method, device, equipment and medium
CN113346944A (en) Time delay minimization calculation task unloading method and system in air-space-ground integrated network
WO2022242468A1 (en) Task offloading method and apparatus, scheduling optimization method and apparatus, electronic device, and storage medium
CN113543074A (en) Joint computing migration and resource allocation method based on vehicle-road cloud cooperation
CN112511614B (en) Intelligent networking vehicle task unloading method under vehicle-mounted edge environment based on reinforcement learning
CN112929849B (en) Reliable vehicle-mounted edge calculation unloading method based on reinforcement learning
CN115640131A (en) Unmanned aerial vehicle auxiliary computing migration method based on depth certainty strategy gradient
Ebrahim et al. A deep learning approach for task offloading in multi-UAV aided mobile edge computing
CN115037751B (en) Unmanned aerial vehicle-assisted heterogeneous Internet of vehicles task migration and resource allocation method
Hu et al. Distributed trajectory design for cooperative internet of UAVs using deep reinforcement learning
CN115002123A (en) Fast adaptive task unloading system and method based on mobile edge calculation
Wang et al. Digital twin-enabled computation offloading in UAV-assisted MEC emergency networks
CN116208968B (en) Track planning method and device based on federal learning
Zeng et al. Periodic Collaboration and Real-Time Dispatch Using an Actor–Critic Framework for UAV Movement in Mobile Edge Computing
CN116737391A (en) Edge computing cooperation method based on mixing strategy in federal mode
CN114916013B (en) Edge task unloading delay optimization method, system and medium based on vehicle track prediction
CN115314904B (en) Communication coverage method based on multi-agent maximum entropy reinforcement learning and related equipment
CN116249202A (en) Combined positioning and computing support method for Internet of things equipment
CN115766478A (en) Unloading method of air-ground cooperative edge computing server
CN115988543A (en) Unmanned aerial vehicle number energy calculation joint resource allocation method based on digital twinning

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
GR01 Patent grant
GR01 Patent grant