A graph theory-based collaborative delivery method and system for drones and logistics lockers.

By constructing a directed graph based on graph theory and optimizing the empty flight segment, the problem of high cost in the collaborative delivery of drones and logistics cabinets was solved, and low-cost delivery was achieved under the massive customer demand.

CN117709657BActive Publication Date: 2026-11-10HEFEI UNIV OF TECH
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202311739163.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-12-15
Publication Date
2026-11-10
Estimated Expiration
2043-12-15

AI Technical Summary

Technical Problem

Existing technologies fail to effectively consider delivery costs in the collaborative delivery of drones and logistics lockers, resulting in excessively high costs when facing massive customer demand.

Method used

A directed graph is constructed using graph theory-based methods to generate path sets and cycle sets. The unloaded flight segments are optimized to reduce the unloaded flight of drones. The directed graph is updated using the principle of the shortest unloaded flight distance to output a feasible delivery plan.

Benefits of technology

Minimize the unloaded flight segments of drones and significantly reduce mission delivery costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117709657B_ABST
    Figure CN117709657B_ABST
Patent Text Reader

Abstract

This invention provides a graph theory-based method, system, storage medium, and electronic device for collaborative delivery between drones and logistics lockers, relating to the field of drone delivery technology. The invention first reads delivery scenario information and constructs a corresponding directed graph. Next, it obtains a first set of paths and a first set of inactive cycles from the directed graph to obtain a first set of unexecutable paths, a first set of inactive cycles, and a first set of executable path endpoints. Further, based on the principle of minimizing the empty flight distance, it adds appropriate empty flight segments to adjust and update the directed graph. It then obtains a second set of paths, a second set of inactive cycles, and a second set of active cycles from the updated directed graph. Finally, it calls a scheme generation method to output a feasible delivery scheme. This can minimize the empty flight segments of the drone. Since the electrical energy consumed by the drone during transportation is roughly proportional to its flight distance, it can significantly reduce the cost of the delivery task.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of drone delivery technology, specifically to a graph theory-based method, system, storage medium, and electronic device for collaborative delivery between drones and logistics lockers. Background Technology

[0002] In recent years, the application of logistics drones in the commercial sector has received widespread attention globally. Drone delivery based on logistics lockers is a novel and efficient delivery model, in which the top of the locker serves as a landing platform for the drone, allowing it to automatically pick up and deliver packages from the top of the locker.

[0003] With the increasing deployment scale of logistics locker and drone collaborative delivery systems, how to efficiently coordinate drones and logistics lockers to complete a large number of delivery tasks has become a new problem to be solved. The drone-logistic locker collaborative delivery problem is a complex combinatorial optimization problem. It includes two sub-problems: drone path planning and drone docking. The former corresponds to the vehicle routing problem, and the latter to the machine scheduling problem. Therefore, constructing a rigorous mathematical model for the drone-logistic locker collaborative delivery problem and designing an accurate algorithm to solve it is extremely difficult.

[0004] The collaborative delivery model using logistics lockers and drones is currently in its early stages, with limited task scale and a relatively small number of lockers and drones. Therefore, current methods primarily rely on manual design of delivery plans. However, as the related technologies mature, customer demand will increase, and the number of logistics lockers and drones will also grow. There is an urgent need to design intelligent drone-logistic locker collaborative delivery systems to assist managers in developing feasible delivery plans. Existing logistics lockers and drones only consider the maximum completion time of all tasks in their delivery technology, aiming to fulfill users' various delivery needs as quickly as possible. However, this technology is only suitable for high-urgency needs because it does not consider delivery costs. Drone transportation consumes electricity. Given the future massive customer demand and the large-scale deployment of drones and logistics lockers in delivery systems, fulfilling customer needs at a lower cost is often the preferred goal for businesses. Summary of the Invention

[0005] (a) Technical problems to be solved

[0006] To address the shortcomings of existing technologies, this invention provides a graph theory-based method, system, storage medium, and electronic device for collaborative delivery of drones and logistics lockers. This solves the technical problem of how to meet customer needs with lower costs in the face of massive future customer demands and large-scale drone and logistics locker deployments in delivery systems.

[0007] (II) Technical Solution

[0008] To achieve the above objectives, the present invention provides the following technical solution:

[0009] A graph theory-based method for collaborative delivery between drones and logistics lockers includes:

[0010] Read the delivery scenario, including the task set and the initial status information of the drone and logistics cabinet collaborative delivery system;

[0011] Based on the delivery scenario, construct the corresponding directed graph using graph theory;

[0012] Based on the directed graph, generate a first set of paths and a first set of inactive cycles;

[0013] Based on the first path set and the first inactive ring set, obtain the first non-executable path set, the first non-executable inactive ring set, and the first executable path endpoint set;

[0014] Based on the first set of non-executable paths, the first set of non-executable inactive cycles, and the first set of executable path endpoints, corresponding empty flight segments are added based on the principle of minimizing the empty flight distance, so as to update the directed graph;

[0015] Based on the updated directed graph, generate a second set of paths, a second set of active cycles, and a second set of inactive cycles;

[0016] Based on the second set of paths, the second set of active rings, and the second set of inactive rings, output a feasible delivery plan.

[0017] Preferably, the step of constructing a corresponding directed graph based on graph theory according to the delivery scenario includes:

[0018] Step 201: Read the delivery scenario

[0019] Step 202, Corresponding For each station v∈V, a vertex is created;

[0020] Step 203: Determine whether the task set T is empty. If yes, proceed to step 207; otherwise, proceed to step 204.

[0021] Step 204: Obtain the first task t in the task set T;

[0022] Step 205: Create directed edges for the flight segment of task t. The tail vertex of the directed edge corresponds to the take-off station of the flight segment, and the head vertex of the directed edge corresponds to the arrival station of the flight segment.

[0023] Step 206: Delete task t from task set T, then proceed to step 203;

[0024] Step 207: Output the directed graph in, This represents the set of directed edges corresponding to all tasks.

[0025] Preferably, generating the first path set and the first inactive cycle set based on the directed graph includes:

[0026] Step 301: Read the directed graph

[0027] Step 302: Initialize the first path set First active ring set First inactive ring set

[0028] Step 303: Calculate the degree difference of all vertices.

[0029] Step 304, Judgment Does there exist degree differences for vertices v∈V? If yes, proceed to step 305; otherwise, proceed to step 308.

[0030] Step 305: Find a path Degree difference of the starting vertex u∈V of the path Degree difference of the terminating vertex w∈V of the path

[0031] Step 306: Add path p to the first path set P;

[0032] Step 307, in Remove the edges contained in path p, and proceed to step 303;

[0033] Step 308, Judgment Is it an empty set? If yes, go to step 314; otherwise, go to step 309.

[0034] Step 309, in Find a ring o in the middle;

[0035] Step 310: Determine if ring o is active. If yes, proceed to step 311; otherwise, proceed to step 312.

[0036] Step 311: Add ring o to the first active ring set O A Proceed to step 313;

[0037] Step 312: Add ring o to the first set of inactive rings O I middle;

[0038] Step 313, in Remove the edges contained in the ring o, and proceed to step 308;

[0039] Step 314: Output the first path set P and the first active ring set O. A and the first inactive ring set O I ;

[0040] If there is at least one drone at a station v∈V, then station v is called an active station; if the station corresponding to a vertex is an active station, then that vertex is an active vertex.

[0041] In directed graphs In, respectively using and To represent the out-degree and in-degree of a vertex v∈V, use express The degree difference;

[0042] use subgraph To represent a ring, if If one vertex in the cycle is active, then the cycle is considered active. An active cycle; active cycles are all executable cycles, and when the cycle... After the flight segment is completed, the number of drones and the degree difference on all vertices remain unchanged.

[0043] Preferably, obtaining the first set of non-executable paths, the first set of non-executable inactive loops, and the first set of executable path endpoints based on the first set of paths and the first set of inactive loops includes:

[0044] Step 401: Read the first path set P and the first inactive cycle set O. I ;

[0045] Step 402: Initialize i = 1, the first set of inactive non-executable cycles. First set of non-executable paths First set of executable path endpoints

[0046] Step 403: Determine whether i ≤ |P| is true. If yes, go to step 404; otherwise, go to step 414. Where |P| is the total number of paths in P.

[0047] Step 404: Obtain the i-th path p in P. i ;

[0048] Step 405: Determine path p i Does the set of directed edges contain executable edges? If yes, go to step 406; otherwise, go to step 412.

[0049] Step 406: Obtain path p i The first executable edge e∈p i ;

[0050] Step 407: Execute the flight segment corresponding to the first executable edge e, and update the number of drones at the corresponding station;

[0051] Step 408, Determine O I Does there exist a cycle o that contains the head vertex of edge e? If yes, go to step 409; otherwise, go to step 411.

[0052] Step 409: Execute the flight segment of loop o and update the number of drones at the corresponding stations;

[0053] Step 410, in O I Delete the ring o, and proceed to step 408;

[0054] Step 411, in path p i Delete edge e and proceed to step 405;

[0055] Step 412, change path p i Add the head vertex of the last executable edge to middle;

[0056] Step 413: Update i = i + 1, then proceed to step 403;

[0057] Step 414, O I All rings in the set are added to the first set of inactive, non-executable rings. middle;

[0058] Step 415: Add all paths in P to middle;

[0059] Step 416: Output the first set of non-executable paths. First set of inactive non-executable rings and the first executable path endpoint set

[0060] Specifically, a delivery task is executable if there is a drone at the departure station u and an available helipad at the arrival station v; correspondingly, if the tail vertex u of an edge e = (u, v) is an active vertex and the number of available helipads r at the head vertex v is [not specified in the original text]. v If the value is greater than 0, then this edge is an executable edge; after the flight segment of edge e is completed, the number of drones and the degree difference on vertex u will decrease by 1, and the number of drones and the degree difference on vertex v will increase by 1.

[0061] use subgraph Indicates a path. and They represent The tail vertices and head vertices, if It is active, and at the same time If there is at least one available parking apron, then the route... For executable paths; when the path After the flight segment was completed, The number of drones and the degree difference will decrease by 1. The number of drones and the degree difference on each vertex will increase by 1, while the number of drones and the degree difference on other vertices will remain unchanged.

[0062] Preferably, the step of adding corresponding empty flight segments based on the principle of minimizing empty flight distance according to the first set of unexecutable paths, the first set of unexecutable inactive cycles, and the first set of executable path endpoints to update the directed graph includes:

[0063] Step 501: Read the directed graph First set of non-executable paths First set of inactive non-executable rings and the first executable path endpoint set

[0064] Step 502: Initialize i = 1;

[0065] Step 503, Judgment If the condition is true, proceed to step 504; otherwise, proceed to step 511. for The total number of paths in;

[0066] Step 504, Obtain The i-th path p i ;

[0067] Step 505, determine p i Is the set of edges in the middle an empty set? If yes, go to step 510; otherwise, go to step 506.

[0068] Step 506: Find a path Degree difference d of the starting vertex u of the path u >0, the degree difference d of the path's terminating vertex w w <0;

[0069] Step 507: Create an empty flight segment f, with the terminal vertex w of the path p corresponding to the takeoff station and the starting vertex u of the path p corresponding to the arrival station.

[0070] Step 508, in the directed graph Create an edge e corresponding to flight segment f, where the head vertex and tail vertex of e correspond to the takeoff station and arrival station of flight segment f, respectively.

[0071] Step 509, in p i Delete the vertices and edges of path p, then proceed to step 505;

[0072] Step 510: Update i = i + 1, then proceed to step 503;

[0073] Step 511, Judgment Is it an empty set? If yes, go to step 519; otherwise, go to step 512.

[0074] Step 512: Determine the set of path endpoints Is it an empty set? If yes, go to step 519; otherwise, go to step 513.

[0075] Step 513, Obtain The first ring o in;

[0076] Step 514, in Find a vertex v in the cycle o such that the shortest distance from v to all vertices in the cycle o is less than 1 / 2. The shortest distance from other vertices in the circle to all vertices in the ring o;

[0077] Step 515: Create an empty flight segment f′, with the takeoff station corresponding to vertex v and the arrival station corresponding to the vertex v′ in the ring o that is closest to vertex v;

[0078] Step 516, in the directed graph Create an edge e′ corresponding to flight segment f′, where the head vertex and tail vertex of e′ correspond to the takeoff station and arrival station of flight segment f′, respectively.

[0079] Step 517, in Delete vertex v;

[0080] Step 518, in Delete the ring o, and proceed to step 511;

[0081] Step 519: Output the updated directed graph

[0082] Preferably, based on the second path set, the second active ring set, and the second inactive ring set, a feasible delivery plan is output, including:

[0083] Step 701: Read the second active ring set Second inactive ring set Second path set

[0084] Step 702: Initialize the delivery plan

[0085] Step 703, Judgment Is it an empty set? If yes, go to step 707; otherwise, go to step 704.

[0086] Step 704, Obtain The first ring o in;

[0087] Step 705: Execute all flight segments on ring o, update the number of drones at the corresponding stations, and add the execution plan to the delivery scheme. middle;

[0088] Step 706, place ring o in Delete it, proceed to step 703;

[0089] Step 707, Judgment Is it an empty set? If yes, go to step 717; otherwise, go to step 708.

[0090] Step 708, Obtain The first path p in;

[0091] Step 709: Determine whether the set of directed edges in path p contains executable edges. If yes, proceed to step 710; otherwise, proceed to step 716.

[0092] Step 710: Obtain the first executable edge e∈p in path p;

[0093] Step 711: Execute the flight segment corresponding to the first executable edge e, update the number of drones at the corresponding station, and add the execution plan to the delivery scheme. middle;

[0094] Step 712, Judgment Does there exist a cycle o that contains the head vertex of edge e? If yes, go to step 713; otherwise, go to step 715.

[0095] Step 713: Execute the flight segment of loop o, update the number of drones at the corresponding stations, and add the execution plan to the delivery scheme. middle;

[0096] Step 714, in Delete the ring o, and proceed to step 712;

[0097] Step 715: Delete edge e in path p, then go to step 709;

[0098] Step 716, in Delete path p, proceed to step 707;

[0099] Step 717, Judgment Is it an empty set? If yes, go to step 724; otherwise, go to step 718.

[0100] Step 718, Obtain The first ring o in;

[0101] Step 719: Find the active vertex v in V that has the minimum shortest distance to all vertices in the cycle o;

[0102] Step 720: Create an empty flight segment f, with the takeoff station corresponding to the active vertex v and the arrival station corresponding to the vertex v′ in the ring o that is closest to vertex v;

[0103] Step 721: Execute flight segment f, update the number of drones at the corresponding stations, and add the execution plan to the delivery program. middle;

[0104] Step 722: Execute all flight segments on ring o, update the number of drones at the corresponding stations, and add the execution plan to the delivery scheme. middle;

[0105] Step 723, place ring o in Delete it, proceed to step 717;

[0106] Step 724: Output a feasible delivery plan

[0107] A graph theory-based drone and logistics locker collaborative delivery system includes:

[0108] The reading module is used to read the delivery scenario, including the task set and the initial status information of the drone and logistics cabinet collaborative delivery system;

[0109] The construction module is used to construct a corresponding directed graph based on graph theory according to the delivery scenario.

[0110] The first generation module is used to generate a first path set and a first inactive cycle set based on the directed graph.

[0111] The acquisition module is used to acquire a first set of non-executable paths, a first set of non-executable inactive rings, and a first set of executable path endpoints based on the first set of paths and the first set of inactive rings.

[0112] The update module is used to add corresponding empty flight segments based on the principle of the shortest empty flight distance, according to the first set of non-executable paths, the first set of non-executable inactive rings, and the first set of executable path endpoints, so as to update the directed graph;

[0113] The second generation module is used to generate a second set of paths, a second set of active cycles, and a second set of inactive cycles based on the updated directed graph.

[0114] The output module is used to output a feasible delivery plan based on the second path set, the second active ring set, and the second inactive ring set.

[0115] A storage medium storing a computer program for graph theory-based drone-logistics locker collaborative delivery, wherein the computer program causes a computer to execute the drone-logistics locker collaborative delivery method as described above.

[0116] An electronic device, comprising:

[0117] One or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs including methods for performing the drone and logistics locker collaborative delivery method as described above.

[0118] (III) Beneficial Effects

[0119] This invention provides a graph theory-based method, system, storage medium, and electronic device for collaborative delivery between drones and logistics lockers. Compared with existing technologies, it has the following advantages:

[0120] This invention first reads delivery scenario information and constructs a corresponding directed graph based on the scenario. Next, it obtains the first path set and the first inactive cycle set of the directed graph to obtain the first non-executable path set, the first non-executable inactive cycle set, and the first executable path endpoint set. Further, based on the principle of minimizing the empty flight distance, it adds appropriate empty flight segments to adjust and update the directed graph. Then, it obtains the second path set, the second inactive cycle set, and the second active cycle set of the updated directed graph. Finally, it calls a solution generation method to output a feasible delivery solution. This method can minimize the empty flight segments of the drone. Since the electrical energy consumed by the drone during transportation is roughly proportional to its flight distance, it can significantly reduce the cost of delivery tasks. Attached Figure Description

[0121] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0122] Figure 1A block diagram illustrating a graph theory-based collaborative delivery method between drones and logistics lockers, provided in an embodiment of the present invention.

[0123] Figure 2 A flowchart of a graph theory-based collaborative delivery method between drones and logistics lockers is provided for an embodiment of the present invention;

[0124] Figure 3 This is an example diagram of a directed graph for a delivery scenario provided by an embodiment of the present invention;

[0125] Figure 4 A flowchart for obtaining a first path set, a first active ring set, and a first inactive ring set is provided in an embodiment of the present invention;

[0126] Figure 5 A flowchart for obtaining a first set of non-executable paths, a first set of non-executable inactive rings, and a first set of executable path endpoints is provided in an embodiment of the present invention.

[0127] Figure 6 This is a schematic diagram of a directed graph update provided in an embodiment of the present invention;

[0128] Figure 7 This is a flowchart illustrating a solution generation process provided in an embodiment of the present invention. Detailed Implementation

[0129] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention are described clearly and completely. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0130] This application provides a graph theory-based method, system, storage medium, and electronic device for collaborative delivery of drones and logistics lockers. It addresses the technical challenge of fulfilling customer needs with minimal cost in the face of massive future customer demands and large-scale drone and logistics locker deployments in delivery systems.

[0131] The technical solution in this application is to solve the above-mentioned technical problems, and the general idea is as follows:

[0132] As mentioned in the background section, existing logistics lockers and drones only consider the maximum completion time of all tasks in delivery technology, that is, aiming to complete users' various delivery needs as quickly as possible. However, this technology is only suitable for needs with a high degree of urgency and does not take delivery costs into account.

[0133] In contrast, this embodiment of the invention first reads delivery scenario information and constructs a corresponding directed graph based on the scenario; secondly, it obtains the first path set and the first inactive cycle set of the directed graph to obtain the first non-executable path set, the first non-executable inactive cycle set, and the first executable path endpoint set; further, based on the principle of minimizing the empty flight distance, it adds appropriate empty flight segments to adjust and update the directed graph; then, it obtains the second path set, the second inactive cycle set, and the second active cycle set of the updated directed graph; finally, it calls the scheme generation method to output a feasible delivery scheme. This method can minimize the empty flight segments of the UAV, significantly reducing the cost of task delivery.

[0134] To better understand the above technical solutions, the following will provide a detailed explanation of the technical solutions in conjunction with the accompanying drawings and specific implementation methods.

[0135] Example:

[0136] like Figure 1 As shown, this embodiment of the invention provides a graph theory-based collaborative delivery method for drones and logistics lockers, including:

[0137] Step 1: Read the delivery scenario, including the task set and the initial status information of the drone and logistics cabinet collaborative delivery system;

[0138] Step 2: Based on the delivery scenario, construct the corresponding directed graph using graph theory;

[0139] Step 3: Based on the directed graph, generate a first set of paths and a first set of inactive cycles;

[0140] Step 4: Based on the first path set and the first inactive ring set, obtain the first non-executable path set, the first non-executable inactive ring set, and the first executable path endpoint set;

[0141] Step 5: Based on the first set of non-executable paths, the first set of non-executable inactive cycles, and the first set of executable path endpoints, add corresponding empty flight segments based on the principle of minimizing empty flight distance to update the directed graph;

[0142] Step 6: Based on the updated directed graph, generate the second path set, the second active cycle set, and the second inactive cycle set;

[0143] Step 7: Based on the second path set, the second active ring set, and the second inactive ring set, output a feasible delivery plan.

[0144] The method provided by the embodiments of the present invention can minimize the unloaded flight segments of drones, thereby significantly reducing the cost of mission delivery.

[0145] Next, we will combine the appendix Figure 2 The following details each step of the above solution:

[0146] In step 1, the delivery scenario is read, including the task set and the initial status information of the drone and logistics cabinet collaborative delivery system.

[0147] In the delivery scenario defined in the embodiments of the present invention middle;

[0148] The delivery scenario comprises a set V of multiple logistics stations scattered throughout the city, and each station v∈V is equipped with c. v Each logistics locker automatically collects and distributes packages.

[0149] The top of the logistics locker also serves as a landing pad for drones, but due to space limitations, each locker can only accommodate one drone at a time. Initially, there is s at site v∈V. v A drone.

[0150] All delivery tasks constitute the set T of tasks. Each task t∈T corresponds to a departure station, a destination station, and an indivisible package. Due to the limited payload capacity of drones, each drone can transport at most one package at a time. Delivery task t involves assigning a drone to load the package at the departure station, fly to the destination station, and unload the package.

[0151] Each time the drone lands on a logistics container, it can automatically replace its battery, and each battery has enough energy to support the drone in completing any delivery task.

[0152] In particular, for ease of understanding the following text, the following definitions are also provided here:

[0153] Flight segment: The action of a drone flying from one station to another along a route is called a flight segment. Depending on whether it is carrying packages, it is divided into fully loaded flight segments and empty flight segments.

[0154] Fully loaded flight segment: The flight segment in which the drone carries the package is called a fully loaded flight segment. Since each mission requires one fully loaded flight segment, the number of fully loaded flight segments equals the number of missions |T|.

[0155] Empty flight segment: A flight segment in which the drone does not carry a package is called an empty flight segment. The purpose of scheduling empty flight segments is to connect with fully loaded flight segments. For example, if there is no drone at the departure point of a mission, a drone needs to be retrieved from other logistics lockers before the mission is carried out; conversely, if there is no available parking space at the logistics locker, at least one drone needs to be transferred from the arrival point.

[0156] Active site: If there is at least one drone on site v∈V, then site v is called an active site.

[0157] In step 2, based on the delivery scenario, a corresponding directed graph is constructed using graph theory, including:

[0158] Step 201: Read the delivery scenario

[0159] Step 202, Corresponding For each station v∈V, a vertex is created;

[0160] Step 203: Determine whether the task set T is empty. If yes, proceed to step 207; otherwise, proceed to step 204.

[0161] Step 204: Obtain the first task t in the task set T;

[0162] Step 205: Create directed edges for the flight segment of task t. The tail vertex of the directed edge corresponds to the take-off station of the flight segment, and the head vertex of the directed edge corresponds to the arrival station of the flight segment.

[0163] Step 206: Delete task t from task set T, then proceed to step 203;

[0164] Step 207, Output as follows Figure 3 The directed graph shown in, This represents the set of directed edges corresponding to all tasks.

[0165] In step 3, a first set of paths and a first set of inactive cycles are generated based on the directed graph.

[0166] First, it should be noted that:

[0167] In directed graphs In, respectively using and To represent the out-degree and in-degree of a vertex v∈V, use express The degree difference;

[0168] use subgraph To represent a ring, if If one vertex in the cycle is active, then the cycle is considered active. An active cycle; active cycles are all executable cycles, and when the cycle... After the flight segment is completed, the number of drones and the degree difference on all vertices remain unchanged.

[0169] Correspondingly, such as Figure 4 As shown, this step includes:

[0170] Step 301: Read the directed graph

[0171] Step 302: Initialize the first path set First active ring set First inactive ring set

[0172] Step 303: Calculate the degree difference of all vertices.

[0173] Step 304, Judgment Does there exist degree differences for vertices v∈V? If yes, proceed to step 305; otherwise, proceed to step 308.

[0174] Step 305: Find a path Degree difference of the starting vertex u∈V of the path Degree difference of the terminating vertex w∈V of the path

[0175] Step 306: Add path p to the first path set P;

[0176] Step 307, in Remove the edges contained in path p, and proceed to step 303;

[0177] Step 308, Judgment Is it an empty set? If yes, go to step 314; otherwise, go to step 309.

[0178] Step 309, in Find a ring o in the middle;

[0179] Step 310: Determine if ring o is active. If yes, proceed to step 311; otherwise, proceed to step 312.

[0180] Step 311: Add ring o to the first active ring set O A Proceed to step 313;

[0181] Step 312: Add ring o to the first set of inactive rings O I middle;

[0182] Step 313, in Remove the edges contained in ring i, and proceed to step 308;

[0183] Step 314: Output the first path set P and the first active ring set O. A and the first inactive ring set O I .

[0184] In step 4, based on the first path set and the first inactive ring set, the first non-executable path set, the first non-executable inactive ring set, and the first executable path endpoint set are obtained.

[0185] First, it should be noted that:

[0186] A delivery task is feasible if there is a drone at the departure station u and an available helipad at the arrival station v; correspondingly, if the tail vertex u of an edge e = (u, v) is an active vertex and the head vertex v has an available helipad number r, then the task is feasible. v If the value is greater than 0, then this edge is an executable edge; after the flight segment of edge e is completed, the number of drones and the degree difference on vertex u will decrease by 1, and the number of drones and the degree difference on vertex v will increase by 1.

[0187] use subgraph Indicates a path. and They represent The tail vertices and head vertices, if It is active, and at the same time If there is at least one available parking apron, then the route... For executable paths; when the path After the flight segment was completed, The number of drones and the degree difference will decrease by 1. The number of drones and the degree difference on each vertex will increase by 1, while the number of drones and the degree difference on other vertices will remain unchanged.

[0188] Correspondingly, such as Figure 5 As shown, this step includes:

[0189] Step 401: Read the first path set P and the first inactive cycle set O. I ;

[0190] Step 402: Initialize i = 1, the first set of inactive non-executable cycles. First set of non-executable paths First set of executable path endpoints

[0191] Step 403: Determine whether i ≤ |P| is true. If yes, go to step 404; otherwise, go to step 414. Where |P| is the total number of paths in P.

[0192] Step 404: Obtain the i-th path p in P. i ;

[0193] Step 405: Determine path p iDoes the set of directed edges contain executable edges? If yes, go to step 406; otherwise, go to step 412.

[0194] Step 406: Obtain path p i The first executable edge e∈p i ;

[0195] Step 407: Execute the flight segment corresponding to the first executable edge e, and update the number of drones at the corresponding station;

[0196] Step 408, Determine O I Does there exist a cycle o that contains the head vertex of edge e? If yes, go to step 409; otherwise, go to step 411.

[0197] Step 409: Execute the flight segment of loop o and update the number of drones at the corresponding stations;

[0198] Step 410, in O I Delete the ring o, and proceed to step 408;

[0199] Step 411, in path p i Delete edge e and proceed to step 405;

[0200] Step 412, change path p i Add the head vertex of the last executable edge to middle;

[0201] Step 413: Update i = i + 1, then proceed to step 403;

[0202] Step 414, O I All rings in the set are added to the first set of inactive, non-executable rings. middle;

[0203] Step 415: Add all paths in P to middle;

[0204] Step 416: Output the first set of non-executable paths. First set of inactive non-executable rings and the first executable path endpoint set

[0205] In step 5, based on the first set of non-executable paths, the first set of non-executable inactive cycles, and the first set of executable path endpoints, corresponding empty flight segments are added according to the principle of minimizing the empty flight distance, so as to update the directed graph.

[0206] It should be noted that, since the first set of non-executable paths is obtained in step 4... During the process, some edges of the path were deleted, therefore the first path set The path in the path may no longer be a single path in the strict sense, but rather a combination of multiple paths. A subgraph.

[0207] Accordingly, this step includes:

[0208] Step 501: Read the directed graph First set of non-executable paths First set of inactive non-executable rings and the first executable path endpoint set

[0209] Step 502: Initialize i = 1;

[0210] Step 503, Judgment If the condition is true, proceed to step 504; otherwise, proceed to step 511. for The total number of paths in;

[0211] Step 504, Obtain The i-th path p i ;

[0212] Step 505, determine p i Is the set of edges in the middle an empty set? If yes, go to step 510; otherwise, go to step 506.

[0213] Step 506: Find a path Degree difference d of the starting vertex u of the path u >0, the degree difference d of the path's terminating vertex w w <0;

[0214] Step 507, as follows Figure 6 As shown in part (a), create an empty flight segment f, with w as the terminating vertex of path p corresponding to the takeoff station and u as the starting vertex of path p corresponding to the arrival station.

[0215] Step 508, in the directed graph Create an edge e corresponding to flight segment f, where the head vertex and tail vertex of e correspond to the takeoff station and arrival station of flight segment f, respectively.

[0216] Step 509, in p i Delete the vertices and edges of path p, then proceed to step 505;

[0217] Step 510: Update i = i + 1, then proceed to step 503;

[0218] Step 511, Judgment Is it an empty set? If yes, go to step 519; otherwise, go to step 512.

[0219] Step 512: Determine the set of path endpoints Is it an empty set? If yes, go to step 519; otherwise, go to step 513.

[0220] Step 513, Obtain The first ring o in;

[0221] Step 514, in Find a vertex v in the cycle o such that the shortest distance from v to all vertices in the cycle o is less than 1 / 2. The shortest distance from other vertices in the circle to all vertices in the ring o;

[0222] Step 515, as follows Figure 6 As shown in part (b), an empty flight segment f′ is created, with the takeoff station corresponding to vertex v and the arrival station corresponding to the vertex v′ in the ring o that is closest to vertex v.

[0223] Step 516: In the directed graph G x Create an edge e′ corresponding to flight segment f′, where the head vertex and tail vertex of e′ correspond to the takeoff station and arrival station of flight segment f′, respectively.

[0224] Step 517, in Delete vertex v;

[0225] Step 518, in Delete the ring o, and proceed to step 511;

[0226] Step 519: Output the updated directed graph

[0227] In step 6, a second set of paths, a second set of active cycles, and a second set of inactive cycles are generated based on the updated directed graph.

[0228] Understandably, this step generates a second set of paths, a second set of active cycles, and a second set of inactive cycles for the updated directed graph. This process can be completely referenced from step 3, which generates the first set of paths, the first set of active cycles, and the first set of inactive cycles for the directed graph before the update. Therefore, it will not be repeated here.

[0229] In step 7, a feasible delivery plan is output based on the second path set, the second active ring set, and the second inactive ring set.

[0230] like Figure 7 As shown, this step includes:

[0231] Step 701: Read the second active ring set Second inactive ring set Second path set

[0232] Step 702: Initialize the delivery plan

[0233] Step 703, Judgment Is it an empty set? If yes, go to step 707; otherwise, go to step 704.

[0234] Step 704, Obtain The first ring o in;

[0235] Step 705: Execute all flight segments on ring o, update the number of drones at the corresponding stations, and add the execution plan to the delivery scheme. middle;

[0236] Step 706, place ring o in Delete it, proceed to step 703;

[0237] Step 707, Judgment Is it an empty set? If yes, go to step 717; otherwise, go to step 708.

[0238] Step 708, Obtain The first path p in;

[0239] Step 709: Determine whether the set of directed edges in path p contains executable edges. If yes, proceed to step 710; otherwise, proceed to step 716.

[0240] Step 710: Obtain the first executable edge e∈p in path p;

[0241] Step 711: Execute the flight segment corresponding to the first executable edge e, update the number of drones at the corresponding station, and add the execution plan to the delivery scheme. middle;

[0242] Step 712, Judgment Does there exist a cycle o that contains the head vertex of edge e? If yes, go to step 713; otherwise, go to step 715.

[0243] Step 713: Execute the flight segment of loop o, update the number of drones at the corresponding stations, and add the execution plan to the delivery scheme. middle;

[0244] Step 714, in Delete the ring o, and proceed to step 712;

[0245] Step 715: Delete edge e in path p, then go to step 709;

[0246] Step 716, in Delete path p, proceed to step 707;

[0247] Step 717, Judgment Is it an empty set? If yes, go to step 724; otherwise, go to step 718.

[0248] Step 718, Obtain The first ring o in;

[0249] Step 719: Find the active vertex v in V that has the minimum shortest distance to all vertices in the cycle o;

[0250] Step 720: Create an empty flight segment f, with the takeoff station corresponding to the active vertex v and the arrival station corresponding to the vertex v′ in the ring o that is closest to vertex v;

[0251] Step 721: Execute flight segment f, update the number of drones at the corresponding stations, and add the execution plan to the delivery program. middle;

[0252] Step 722: Execute all flight segments on ring o, update the number of drones at the corresponding stations, and add the execution plan to the delivery scheme. middle;

[0253] Step 723, place ring o in Delete it, proceed to step 717;

[0254] Step 724: Output a feasible delivery plan

[0255] This invention provides a graph theory-based collaborative delivery system for drones and logistics lockers, comprising:

[0256] The reading module is used to read the delivery scenario, including the task set and the initial status information of the drone and logistics cabinet collaborative delivery system;

[0257] The construction module is used to construct a corresponding directed graph based on graph theory according to the delivery scenario.

[0258] The first generation module is used to generate a first path set and a first inactive cycle set based on the directed graph.

[0259] The acquisition module is used to acquire a first set of non-executable paths, a first set of non-executable inactive rings, and a first set of executable path endpoints based on the first set of paths and the first set of inactive rings.

[0260] The update module is used to add corresponding empty flight segments based on the principle of the shortest empty flight distance, according to the first set of non-executable paths, the first set of non-executable inactive rings, and the first set of executable path endpoints, so as to update the directed graph;

[0261] The second generation module is used to generate a second set of paths, a second set of active cycles, and a second set of inactive cycles based on the updated directed graph.

[0262] The output module is used to output a feasible delivery plan based on the second path set, the second active ring set, and the second inactive ring set.

[0263] This invention provides a storage medium storing a computer program for graph theory-based drone and logistics locker collaborative delivery, wherein the computer program causes a computer to execute the drone and logistics locker collaborative delivery method as described above.

[0264] This invention provides an electronic device, comprising:

[0265] One or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs including methods for performing the drone and logistics locker collaborative delivery method as described above.

[0266] In summary, compared with existing technologies, it has the following beneficial effects:

[0267] 1. This embodiment of the invention first reads delivery scenario information and constructs a corresponding directed graph based on the scenario. Then, it obtains the first path set and the first inactive cycle set of the directed graph to obtain the first non-executable path set, the first non-executable inactive cycle set, and the first executable path endpoint set. Further, based on the principle of minimizing the empty flight distance, it adds appropriate empty flight segments to adjust and update the directed graph. Then, it obtains the updated second path set, the second inactive cycle set, and the second active cycle set of the directed graph. Finally, it calls the scheme generation method to output a feasible delivery scheme. This method can minimize the empty flight segments of the drone. Since the electrical energy consumed by the drone during transportation is roughly proportional to its flight distance, it can significantly reduce the cost of the delivery task.

[0268] 2. The method for constructing a directed graph in this embodiment of the invention can read the delivery scenario, convert each logistics station into a node in the directed graph, and construct directed edges according to the task to be executed. This method can quickly and efficiently abstract the delivery scenario into a directed graph, thus facilitating the subsequent application of graph theory to solve the delivery problem.

[0269] 3. The method for generating path sets, active cycle sets, and inactive cycle sets provided in this embodiment of the invention first reads the directed graph, then defines active and inactive cycles based on the characteristics of the delivery problem, and finally sequentially obtains the paths, active cycles, and inactive cycles in the graph. This method is based on graph theory and fully utilizes the characteristics of the delivery scenario, enabling the rapid acquisition of subgraphs with three different attributes, providing effective support for subsequently obtaining a complete delivery solution.

[0270] 4. The method for obtaining the set of unexecutable paths, the set of unexecutable inactive cycles, and the set of executable path endpoints provided in this embodiment of the invention first reads the path set and the inactive cycle set. Then, based on the characteristics of the delivery problem, executable paths, unexecutable paths, executable inactive cycles, and unexecutable inactive cycles are defined. Further, the endpoints of all executable paths are obtained. Finally, the unexecutable paths and unexecutable inactive cycles are obtained. This method fully utilizes the characteristics of the delivery scenario and incorporates graph theory knowledge for relevant definitions, enabling rapid acquisition of unexecutable task information and providing effective support for subsequent directed graph updates and solution generation.

[0271] 5. The directed graph update method provided in this embodiment of the invention first reads the directed graph, inexecutable paths, inexecutable inactive cycles, and the endpoints of executable paths. Then, according to a given strategy, it creates empty flight segments based on the inexecutable paths and inexecutable inactive cycles. Furthermore, it converts the newly created flight segments into directed edges in the directed graph. This method can efficiently add as few empty flight segments as possible, thereby turning originally unexecutable tasks into executable ones at minimal cost, providing effective support for subsequent solution generation.

[0272] 5. The solution generation method provided in this embodiment of the invention first reads the active ring set, the inactive ring set, and the path set. Then, it plans the delivery tasks corresponding to all active ring sets. Further, it plans the delivery tasks corresponding to each edge in the path sequentially, and determines whether any inactive rings are converted into active rings. If so, it plans the delivery tasks corresponding to the active rings; otherwise, it continues to plan the delivery tasks corresponding to the edges on the path. Finally, it connects the remaining inactive rings and active vertices sequentially and plans the corresponding delivery tasks. This method can efficiently generate delivery solutions and minimize the empty flight of drones, thereby reducing delivery costs.

[0273] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0274] The above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A graph theory-based method for collaborative delivery between drones and logistics lockers, characterized in that, include: Read the delivery scenario, including the task set and the initial status information of the drone and logistics cabinet collaborative delivery system; Based on the delivery scenario, construct the corresponding directed graph using graph theory; Based on the directed graph, generate a first set of paths and a first set of inactive cycles; Based on the first path set and the first inactive ring set, obtain the first non-executable path set, the first non-executable inactive ring set, and the first executable path endpoint set; Based on the first set of non-executable paths, the first set of non-executable inactive cycles, and the first set of executable path endpoints, corresponding empty flight segments are added based on the principle of minimizing the empty flight distance, so as to update the directed graph; Based on the updated directed graph, generate a second set of paths, a second set of active cycles, and a second set of inactive cycles; Based on the second path set, the second active ring set, and the second inactive ring set, output a feasible delivery plan; The step of constructing a corresponding directed graph based on graph theory according to the delivery scenario includes: Step 201: Read the delivery scenario ; Step 202, Corresponding Each site in Create a vertex; Step 203: Determine the task set Is it an empty set? If yes, go to step 207; otherwise, go to step 204. Step 204: Obtain the task set The first task ; Step 205, for the task The flight segment is created by a directed edge, with the tail vertex of the directed edge corresponding to the take-off station of the flight segment and the head vertex of the directed edge corresponding to the arrival station of the flight segment. Step 206, in the task set Delete task Proceed to step 203; Step 207: Output the directed graph ;in, This represents the set of directed edges corresponding to all tasks; The step of generating a first path set and a first inactive cycle set based on the directed graph includes: Step 301: Read the directed graph ; Step 302: Initialize the first path set The first active ring set The first inactive ring set ; Step 303: Calculate the degree difference of all vertices. ; Step 304, Judgment Does a vertex exist in it? degree difference If yes, proceed to step 305; otherwise, proceed to step 308. Step 305: Find a path Path starting vertex degree difference Path termination vertex degree difference ; Step 306, Path Add to the first path set middle; Step 307, in Remove path For the included edges, proceed to step 303; Step 308, Judgment Is it an empty set? If yes, go to step 314; otherwise, go to step 309. Step 309, in Find a ring ; Step 310: Determine the ring Is it active? If yes, proceed to step 311; otherwise, proceed to step 312. Step 311, put the ring Add to the first active ring set Proceed to step 313; Step 312, put the ring Add to the first inactive ring set middle; Step 313, in Remove ring For the included edges, proceed to step 308; Step 314: Output the first path set First active ring set and the first inactive ring set ; Among them, if the site If there is at least one drone on the site, then the site A vertex is called an active site; if the site corresponding to a vertex is an active site, then that vertex is an active vertex. In directed graphs In, respectively using and Represents vertices out-degree and in-degree, using express The degree difference; use subgraph To represent a ring, if If one vertex in the cycle is active, then the cycle is considered active. An active cycle; active cycles are all executable cycles, and when the cycle... After the flight segment is completed, the number of drones and the degree difference on all vertices remain unchanged.

2. The method for collaborative delivery of drones and logistics lockers as described in claim 1, characterized in that, The step of obtaining the first set of non-executable paths, the first set of non-executable inactive cycles, and the first set of executable path endpoints based on the first set of paths and the first set of inactive cycles includes: Step 401: Read the first path set and the first inactive ring set ; Step 402, Initialization The first set of inactive non-executable rings The first set of non-executable paths The first executable path endpoint set ; Step 403, Judgment If the condition is true, proceed to step 404; otherwise, proceed to step 414. for The total number of paths in; Step 404, Obtain The first in Path ; Step 405: Determine the path Does the set of directed edges contain executable edges? If yes, go to step 406; otherwise, go to step 412. Step 406: Obtain the path The first executable edge in ; Step 407: Execute the first executable edge. The corresponding flight segments are updated, and the number of drones at the corresponding stations is updated accordingly; Step 408, Judgment Does a ring exist in it? Includes edges If the head vertex is the vertex, proceed to step 409; otherwise, proceed to step 411. Step 409, Execution Ring The flight segments are determined, and the number of drones at the corresponding stations is updated. Step 410, in Delete the ring Proceed to step 408; Step 411, in the path Deleting edges Proceed to step 405; Step 412, Path Add the head vertex of the last executable edge to middle; Step 413, Update Proceed to step 403; Step 414, All rings in the set are added to the first set of inactive, non-executable rings. middle; Step 415, Add all paths to middle; Step 416: Output the first set of non-executable paths. The first set of inactive non-executable rings and the first executable path endpoint set ; Among them, if the starting point of a delivery task There is a drone on board, arriving at the station. If there is an available helipad, then the task is executable; conversely, if an edge... Tail tip It is an active vertex, the head vertex. Number of available parking spaces If the edge is not valid, then it is an executable edge; when the edge is valid... After the flight segment was completed, the apex The number of drones and the degree difference will decrease by 1 at the vertex. The number of drones and the degree difference will both increase by 1. use subgraph Indicates a path. and They represent The tail vertices and head vertices, if It is active, and at the same time If there is at least one available parking apron, then the route... For executable paths; when the path After the flight segment was completed, The number of drones and the degree difference will decrease by 1. The number of drones and the degree difference on each vertex will increase by 1, while the number of drones and the degree difference on other vertices will remain unchanged.

3. The method for collaborative delivery of drones and logistics lockers as described in claim 2, characterized in that, The step of adding corresponding empty flight segments based on the principle of minimizing empty flight distance, according to the first set of non-executable paths, the first set of non-executable inactive cycles, and the first set of executable path endpoints, to update the directed graph includes: Step 501: Read the directed graph First set of non-executable paths The first set of inactive non-executable rings and the first executable path endpoint set ; Step 502, Initialization ; Step 503, Judgment If the condition is true, proceed to step 504; otherwise, proceed to step 511. for The total number of paths in; Step 504, Obtain The Middle Path ; Step 505, Judgment Is the set of edges in the middle an empty set? If yes, go to step 510; otherwise, go to step 506. Step 506: Find a path Path starting vertex degree difference Path termination vertex degree difference ; Step 507: Create an empty flight segment Path corresponding to departure station Terminating vertex Path to the station starting vertex ; Step 508, in the directed graph Corresponding flight segment Create an edge , The head apex and tail apex correspond to the flight segments respectively. Departure and arrival stations; Step 509, in Delete path Given the vertices and edges, proceed to step 505; Step 510, Update Proceed to step 503; Step 511, Judgment Is it an empty set? If yes, go to step 519; otherwise, go to step 512. Step 512: Determine the set of path endpoints Is it an empty set? If yes, go to step 519; otherwise, go to step 513. Step 513, Obtain The first ring in ; Step 514, in Find a vertex in , To the ring The shortest distance between all vertices in the interval is less than Other vertices to the ring The shortest distance to all vertices in the middle; Step 515: Create an empty flight segment The vertex corresponding to the departure station The corresponding loop at the arrival station Mid-distance vertex Recent Vertex ; Step 516, in the directed graph Corresponding flight segment Create an edge , The head apex and tail apex correspond to the flight segments respectively. Departure and arrival stations; Step 517, in Delete vertex ; Step 518, in Delete the ring Proceed to step 511; Step 519: Output the updated directed graph .

4. The method for collaborative delivery of drones and logistics lockers as described in claim 3, characterized in that, Based on the second path set, the second active ring set, and the second inactive ring set, output feasible delivery solutions, including: Step 701: Read the second active ring set Second inactive ring set Second path set ; Step 702: Initialize the delivery plan ; Step 703, Judgment Is it an empty set? If yes, go to step 707; otherwise, go to step 704. Step 704, Obtain The first ring in ; Step 705, Execution Ring The system will update the number of drones at each of the flight segments and the corresponding stations, and then add the execution plan to the delivery program. middle; Step 706, put the ring exist Delete it, proceed to step 703; Step 707, Judgment Is it an empty set? If yes, go to step 717; otherwise, go to step 708. Step 708, Obtain The first path in ; Step 709: Determine the path Does the set of directed edges contain executable edges? If yes, go to step 710; otherwise, go to step 716. Step 710: Obtain the path The first executable edge in ; Step 711: Execute the first executable edge. The corresponding flight segments are determined, the number of drones at the corresponding stations is updated, and the execution plan is added to the delivery program. middle; Step 712, Judgment Does a ring exist in it? Includes edges If the head vertex is the vertex, proceed to step 713; otherwise, proceed to step 715. Step 713, Execution Ring The flight segments were determined, the number of drones at the corresponding stations was updated, and the execution plan was added to the delivery program. middle; Step 714, in Delete the ring Proceed to step 712; Step 715, in the path Deleting edges Proceed to step 709; Step 716, in Delete path Proceed to step 707; Step 717, Judgment Is it an empty set? If yes, go to step 724; otherwise, go to step 718. Step 718, Obtain The first ring in ; Step 719, in Get a ring from The active vertex with the minimum shortest distance to all vertices. ; Step 720: Create an empty flight segment The active vertex corresponding to the takeoff station The corresponding loop at the arrival station Mid-distance vertex Recent Vertex ; Step 721: Execute the flight segment The system will update the number of drones at the corresponding stations and add the execution plan to the delivery program. middle; Step 722, Execution Ring The system will update the number of drones at each of the flight segments and the corresponding stations, and then add the execution plan to the delivery program. middle; Step 723, put the ring exist Delete it, proceed to step 717; Step 724: Output a feasible delivery plan .

5. A graph theory-based collaborative delivery system for drones and logistics lockers, characterized in that, The method for performing the collaborative delivery method of drones and logistics lockers as described in any one of claims 1 to 4 includes: The reading module is used to read the delivery scenario, including the task set and the initial status information of the drone and logistics cabinet collaborative delivery system; The construction module is used to construct a corresponding directed graph based on graph theory according to the delivery scenario. The first generation module is used to generate a first path set and a first inactive cycle set based on the directed graph. The acquisition module is used to acquire a first set of non-executable paths, a first set of non-executable inactive rings, and a first set of executable path endpoints based on the first set of paths and the first set of inactive rings. The update module is used to add corresponding empty flight segments based on the principle of the shortest empty flight distance, according to the first set of non-executable paths, the first set of non-executable inactive rings, and the first set of executable path endpoints, so as to update the directed graph; The second generation module is used to generate a second set of paths, a second set of active cycles, and a second set of inactive cycles based on the updated directed graph. The output module is used to output a feasible delivery plan based on the second path set, the second active ring set, and the second inactive ring set.

6. A storage medium, characterized in that, It stores a computer program for graph theory-based drone and logistics locker collaborative delivery, wherein the computer program causes the computer to execute the drone and logistics locker collaborative delivery method as described in any one of claims 1 to 4.

7. An electronic device, characterized in that, include: One or more processors; Memory; And one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the programs including methods for performing the drone and logistics cabinet collaborative delivery method as described in any one of claims 1 to 4.

Citation Information

Patent Citations

  • Cooperative distribution path optimization method based on branch pricing cutting algorithm

    CN114037180A

  • Unmanned aerial vehicle path planning method based on two charging modes

    WO2022077954A1