Heterogeneous platform collaborative path planning method under dynamic demand

By establishing a multi-drone and multi-truck collaborative delivery route planning model under dynamic demand, the collaborative delivery routes of drones and trucks are optimized, solving the problem of collaborative delivery route planning of drones and trucks under dynamic demand, and realizing efficient and low-cost last-mile delivery.

CN118913290APending Publication Date: 2024-11-08BEIHANG UNIV
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411208549.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-30
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

Existing drone and truck collaborative delivery route planning methods are difficult to adapt to dynamic new demands, resulting in low delivery efficiency and high costs, and failing to effectively solve the last-mile delivery problem.

Method used

A collaborative delivery route planning model for multiple drones and trucks under dynamic demand is established. By using a mixed-integer linear programming model and a time-domain rolling algorithm framework, the collaborative delivery routes of drones and trucks are optimized to achieve efficient delivery under dynamic demand.

Benefits of technology

It improves the adaptability and responsiveness of the delivery system, reduces delivery costs, and enhances delivery efficiency and customer service satisfaction. It is suitable for drone and truck collaborative delivery scenarios under dynamic demands.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118913290A_ABST
    Figure CN118913290A_ABST
Patent Text Reader

Abstract

The invention relates to a heterogeneous platform collaborative path planning method under a dynamic demand, and belongs to the technical field of path planning, and the method comprises the steps: firstly, building a mixed integer linear programming model which depicts a multi-unmanned aerial vehicle and multi-truck collaborative distribution path planning problem under the dynamic demand of a customer; a truck and unmanned aerial vehicle distribution path under the determined demand is obtained; and finally, introducing new demands under the dynamic demands in each distribution stage to obtain an updated demand set under the dynamic demands in each distribution stage. Obtaining an initial position of the truck and a space-time position of the unmanned aerial vehicle under the dynamic demand in each distribution stage based on the determined demand truck and unmanned aerial vehicle cooperative distribution path; a complete truck and unmanned aerial vehicle cooperative distribution route under dynamic demands is obtained and generated based on the updated demand set under the dynamic demands of all distribution stages, the initial position of the truck and the space-time position of the unmanned aerial vehicle, the defects of an existing route planning model and method are overcome, and a high-efficiency and multi-stage unmanned aerial vehicle and truck cooperative distribution scheme is generated.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of path planning technology, and specifically to a method for collaborative path planning of heterogeneous platforms under dynamic demand, and in particular to a method for planning a collaborative delivery path of drones and trucks under dynamic demand. Background Art

[0002] With the improvement of residents' consumption level and the change of consumption habits, my country's logistics and express delivery industry has experienced rapid growth. However, as a key link in the express delivery business, terminal delivery is facing increasingly severe challenges, especially the "last mile" problem of express delivery, which has become a key problem that the express delivery industry urgently needs to solve. At the same time, unmanned aerial vehicle technology has made significant progress, and drone logistics delivery has been focused on as a typical application scenario to help build a strong transportation country. Adding drones to the delivery mode of express trucks has the advantages of improving delivery efficiency, reducing delivery labor costs, and reducing delivery contacts. It provides an innovative solution to the problem of terminal delivery and has been widely explored by industry and academia.

[0003] When conducting joint delivery by drones and trucks, it is necessary to plan the delivery order and delivery method for the customers to be served, that is, drone and truck collaborative delivery path planning. Path planning is the core link in realizing multi-drone and multi-truck collaborative delivery, and the quality of the path planning solution is directly related to the efficiency of last-mile delivery. However, the drone and truck collaborative delivery path planning problem has complex coupling constraints and a huge search space, making it extremely difficult to solve the collaborative delivery path. In addition, in the actual delivery process, the complete customer demand is usually not known in advance, and the delivery demand of new customers may appear at any time. Most of the existing planning methods design drone and truck collaborative delivery solutions based on static and deterministic customer demand, and the generated collaborative delivery routes are difficult to adapt to dynamic new demand.

[0004] In view of this, there is an urgent need for a multi-UAV and multi-truck collaborative delivery path planning method under dynamic demand to improve the adaptability and responsiveness of the delivery system. Summary of the invention

[0005] In view of the above problems, the present invention provides a heterogeneous platform collaborative path planning method under dynamic demand. The present invention first establishes a mixed integer linear programming model that can characterize the multi-UAV and multi-truck collaborative delivery path planning problem under customer dynamic demand. Secondly, the truck and UAV delivery paths under determined demand are obtained; finally, new demands under dynamic demand are introduced in each delivery stage to obtain an updated demand set under dynamic demand in each delivery stage; based on the truck and UAV collaborative delivery path with determined demand, the initial position of the truck and the spatiotemporal position of the UAV under dynamic demand in each delivery stage are obtained; based on the updated demand set under dynamic demand in each delivery stage, the initial position of the truck and the spatiotemporal position of the UAV are obtained to generate a complete truck and UAV collaborative delivery route under dynamic demand; a multi-distribution stage solution algorithm framework based on time domain rolling is proposed to make up for the shortcomings of existing path planning models and methods, and generate a high-efficiency, multi-stage UAV and truck collaborative delivery solution.

[0006] The present invention provides a heterogeneous platform collaborative path planning method under dynamic demand, and in particular provides a path planning method for collaborative delivery of drones and trucks under dynamic demand, comprising:

[0007] Step 1: Set up a collaborative distribution scenario of heterogeneous platforms under dynamic demand; establish collaborative distribution path constraints based on the collaborative distribution scenario of heterogeneous platforms; use the collaborative distribution path constraints to establish a planning model for the collaborative distribution path of heterogeneous platforms under dynamic demand; the heterogeneous platforms include platform one and platform two;

[0008] Preferably, the specific steps of setting up the collaborative delivery scenario of heterogeneous platforms under dynamic demand in step 1 include:

[0009] The heterogeneous platforms were identified as trucks and drones;

[0010] A preset truck delivery route; the truck delivery route includes multiple delivery stages and their corresponding delivery paths and replenishment routes;

[0011] It can be understood that the replenishment is to use idle drones to replenish new demands when new demands arise during the distribution stage;

[0012] Designing a drone delivery route based on a truck delivery route; the drone delivery route includes multiple delivery stages and their corresponding drone delivery paths and replenishment routes;

[0013] Obtain the customer demand set for each delivery stage; the truck departs from the warehouse and enters each delivery stage according to the delivery route; the drone follows the truck along the drone delivery route; the drone and the truck visit the customer points in turn for delivery at each delivery stage according to the corresponding delivery route and customer demand set;

[0014] The drone takes off from the truck to serve the customer or lands on the truck after serving the customer; after completing all deliveries for all stages of customer needs, the drone and truck return to the warehouse.

[0015] Furthermore, the customer demand set at each distribution stage includes the demand at each distribution stage and the new demand supplemented dynamically;

[0016] Furthermore, customers can make new demands at any delivery stage, but each customer can make a new demand at most once;

[0017] The truck can carry multiple drones; the drones can take off and land on different trucks;

[0018] The truck may carry multiple goods corresponding to known demands when it departs from the warehouse and deliver them one by one; the drone must land on the truck after leaving the truck to serve a customer;

[0019] After new demand is generated in each delivery phase, if it is necessary to use trucks or drones that have not yet returned to the warehouse for delivery, drones should be used to replenish the trucks with the goods required for the new demand;

[0020] After the truck or drone returns to the warehouse, it can set out again to participate in the delivery of new needs in the subsequent stage.

[0021] It can be understood that the planning model of the collaborative delivery path of drones and trucks under dynamic demand is an integer linear programming model of the collaborative delivery path planning problem of multiple drones and multiple trucks under dynamic demand.

[0022] Furthermore, the planning model of the UAV and truck collaborative delivery path is expressed as:

[0023]

[0024] Among them, B is the objective function value of the planning model of the coordinated delivery path of drones and trucks, τ is the delivery stage, represents the number of delivery stages, A1 represents the set of space-time arcs that the truck can travel; represents the travel cost of the truck between delivery point i and delivery point j; x w,i,j,t,s (τ) represents the space-time arc of the w-th truck starting from the delivery point i at time t and arriving at the delivery point j at time s in the τ-th delivery stage, W represents the number of trucks; A2 represents the set of space-time arcs that the drone can travel, represents the travel cost of the drone between delivery point i and delivery point j; y v,i,j,t,s,a,b (τ) represents the space-time arc of whether drone v starts from delivery point i at time t in state a and arrives at delivery point j at time s in state b in the τth delivery stage, and V represents the number of drones.

[0025] Preferably, the collaborative delivery path constraints include: flow balance constraints, drone and truck coupling constraints, and customer service constraints;

[0026] Furthermore, the flow balance constraint includes:

[0027]

[0028] Among them, (j,s)∈N1, N1 represents the set of distribution points;

[0029] Furthermore, the coupling constraints between the drone and the truck include:

[0030]

[0031] Among them, y v,i,j,t,s,w,w (τ) represents the space-time arc of whether the drone v follows the truck w from the delivery point i at time t and arrives at the delivery point j at time s in the τth delivery stage; y v,i,j,t,s,w,m′ (τ) represents the space-time arc in which the drone v takes off from the truck m′ for delivery in the τth delivery stage, departs from the delivery point i at time t, arrives at the delivery point j at time s, and lands on the truck w; x w,i,k,t,r (τ) represents the space-time arc of the w-th truck starting from the distribution point i at time t and arriving at the distribution point k at time r in the τ-th distribution stage, (k,r)∈N1, N1 represents the set of distribution points, (i,k,t,r)∈A1, A1 represents the set of space-time arcs that the truck can travel; y v,i,j,t,s,m′,w (τ) represents the space-time arc of whether the drone v takes off from the truck m′ for delivery in the τth delivery stage, departs from the delivery point i at time t, arrives at the delivery point j at time s, and lands on the truck w;

[0032] x w,k,j,r,s (τ) represents the space-time arc of the w-th truck starting from the distribution point k at time r and arriving at the distribution point j at time s in the τ-th distribution stage, (k, j, r, s) ∈ A1; represents the set of space-time arcs of truck services for new demand points in the τth distribution stage; represents the set of spatiotemporal state arcs of drone services for new demand points in the τth distribution stage; represents the set of space-time state arcs of the new demand point drone service starting from the warehouse in the τth distribution stage; (0, j, t, s, 0, w) represents the space-time arc starting from the warehouse at time t and arriving at the distribution point j at time s to replenish the truck w; y v,0,j,t,s,0,w (τ) represents the space-time arc of whether drone v departs from warehouse 0 at time t and arrives at delivery point j at time s to replenish truck w in the τth delivery stage.

[0033] The expression of the customer service constraint is:

[0034]

[0035] Among them, (i, t, a) represents the time-space state point, that is, a is the truck, t is the time, i is the delivery point, y v,i,j,t,s,a,m′ (τ) represents the space-time arc of whether drone v takes off from truck a for delivery in the τth delivery stage and departs from delivery point i at time t and arrives at delivery point j at time s, d j (τ) indicates whether the demand of customer j in the delivery stage τ is met.

[0036] Step 2: Based on the planning model of the collaborative delivery path of heterogeneous platforms under the dynamic demand, a distribution path planning model of platform one and a distribution path planning model of platform two under the determined demand are obtained;

[0037] Processing the platform one distribution path planning model and the platform two distribution path planning model under the determined demand to obtain heterogeneous platform distribution paths under the determined demand;

[0038] Preferably, the specific steps of obtaining the heterogeneous platform delivery path under the determined demand include:

[0039] Step 21. Determine that the heterogeneous platform includes a truck and a drone; based on the planning model of the drone and truck collaborative delivery path under the dynamic demand, obtain a truck delivery path planning model and a drone delivery path planning model under the determined demand;

[0040] Step 22. Obtain the identified needs and generate multiple customer service allocation methods;

[0041] Based on the truck delivery path planning model under certain demand and the drone delivery path planning model under certain demand, the truck and drone collaborative delivery paths corresponding to various customer service allocation methods are obtained;

[0042] Compare the objective function values ​​of the truck and drone delivery paths corresponding to various customer service allocation methods, and obtain the truck and drone collaborative delivery path with the optimal objective function value as the truck and drone delivery path under the determined demand;

[0043] Furthermore, the specific steps of obtaining the truck delivery path planning model and the drone delivery path planning model under the determined demand in step 21 include:

[0044] Step 211 relaxes the collaborative delivery path constraint conditions in the planning model of the collaborative delivery path of drones and trucks under dynamic demand to obtain the truck delivery path constraint conditions under determined demand, and obtains the truck delivery path planning model under determined demand based on the truck delivery path constraint conditions under determined demand;

[0045] Step 212 converts the collaborative delivery path constraint conditions in the planning model of the collaborative delivery path of drones and trucks under dynamic demand to obtain the drone delivery path constraint conditions under determined demand; and obtains the drone delivery path planning model under determined demand based on the drone delivery path constraint conditions;

[0046] Specifically, the specific steps of obtaining the truck delivery path planning model in step 211 include:

[0047] The coupling constraint between drones and trucks in the collaborative delivery path constraint condition in the planning model of the collaborative delivery path between drones and trucks under dynamic demand is converted into a constraint condition with only truck path variables, and the truck constraint condition 1 is obtained;

[0048] Convert the customer service constraint into a constraint with only truck route variables to obtain truck constraint 2;

[0049] Convert the flow balance constraint into a constraint condition with only truck path variables, and obtain truck constraint condition three;

[0050] Based on the first truck constraint condition, the second truck constraint condition and the third truck constraint condition, a truck delivery path constraint condition under a certain demand is obtained;

[0051] Obtaining a truck delivery path planning model based on the truck delivery path constraint conditions;

[0052] Specifically, the specific steps of obtaining the drone delivery path planning model in step 212 include:

[0053] The truck path variables in the planning model of the coordinated delivery path of drones and trucks are regarded as fixed values, and the initial truck delivery path planning model under fixed demand is obtained;

[0054] The coupling constraint between drone and truck in the collaborative delivery path constraint is converted into the constraint with only drone path variables, and the truck constraint one is obtained;

[0055] Convert the customer service constraint into a constraint with only drone path variables, and get the truck constraint two;

[0056] Convert the flow balance constraint into a constraint with only the UAV road strength variable, and get the truck constraint three;

[0057] Based on the first truck constraint condition, the second truck constraint condition and the third truck constraint condition, the UAV delivery path constraint condition under the determined demand is obtained; based on the UAV delivery path constraint condition under the determined demand and the initial truck delivery path planning model under the determined demand, the UAV delivery path planning model under the determined demand is obtained;

[0058] Specifically, the specific steps of obtaining the truck and drone delivery paths under the determined demand in step 22 include:

[0059] Step 221. Obtaining confirmed needs and generating multiple customer service allocation methods;

[0060] When n=1, it is the first customer service allocation method; n=1,2,3...N; N represents the number of customer service allocation methods;

[0061] Determine the trucks available in the warehouse for the nth customer service allocation method, and obtain the set of trucks for the nth customer service allocation method;

[0062] Step 222. Input the trucks in the n-th customer service allocation mode truck set into the truck delivery path planning model under the determined demand in sequence, and output the alternative delivery path corresponding to each truck based on the improved alternating direction multiplier method;

[0063] Step 223. Call the greedy search method to screen the candidate delivery paths corresponding to each truck, and select the candidate delivery path corresponding to the optimal objective function value as the truck delivery path corresponding to the nth customer service allocation method;

[0064] Step 224. Repeat steps 221-223, traverse multiple customer service allocation methods, and obtain truck delivery routes corresponding to various customer service allocation methods;

[0065] Step 225. Determine the drones available in the warehouse for the nth customer service allocation method, and obtain the set of drones for the nth customer service allocation method; generate a drone delivery network in combination with the truck delivery paths corresponding to the nth customer service allocation method;

[0066] Step 226. The drone delivery road network and the drone set are used as inputs of the drone delivery path planning model; based on the improved alternating direction multiplier method, the drone set is traversed to obtain the alternative delivery path corresponding to each drone;

[0067] Step 227. Use a greedy search method to obtain a drone alternative delivery path corresponding to the optimal objective function value among multiple drone alternative delivery paths as the drone delivery path corresponding to the nth customer service allocation method;

[0068] Step 228. Repeat steps 225-227, traverse multiple customer service allocation methods, and obtain the drone delivery paths corresponding to the truck delivery paths in various customer service allocation methods; obtain the truck and drone collaborative delivery paths of various customer service allocation methods based on the truck delivery paths corresponding to various customer service allocation methods and the drone delivery paths corresponding to the truck delivery paths in various customer service allocation methods;

[0069] Step 229. Input the truck and drone collaborative delivery paths corresponding to various customer service allocation methods into the planning model of the collaborative delivery paths of heterogeneous platforms under dynamic demand, and output the objective function values ​​corresponding to the truck and drone collaborative delivery paths corresponding to various customer service allocation methods;

[0070] Compare the objective function values ​​of the truck and drone collaborative delivery paths corresponding to various customer service allocation methods, and select the truck and drone collaborative delivery path with the optimal objective function value as the truck and drone delivery path under the determined demand;

[0071] Furthermore, step 22 also includes: among the alternative delivery routes of each truck, selecting the truck route with repeated delivery customers, increasing the overall cost of the vehicle route with repeated delivery customers to reduce the possibility of selection; selecting the vehicle route of unserved customers, reducing the delivery cost of the vehicle route of unserved customers to encourage subsequent vehicles to serve them.

[0072] Furthermore, the drone delivery road network includes a first type of edge set and a second type of edge set;

[0073] The first type of edge set is composed of the delivery paths of trucks in each delivery stage; when the drone passes through the first type of edge, it indicates the state of following the truck;

[0074] The vertices of the second type of edge set are truck service customers and drone service customers, that is, the second type of edge represents the independent flight path in drone delivery; the second type of edge represents the drone taking off for delivery and landing for return;

[0075] Set the UAV road network travel cost matrix; the cost of the UAV passing through the first type of edge is 0; the cost of the UAV passing through the second type of edge is the actual travel cost of the UAV; the UAV delivery road network will ensure that the generated UAV path meets the coupling constraints of the UAV and truck in the model.

[0076] Step 3: obtaining new demands under dynamic demands in each distribution stage; obtaining an updated demand set under dynamic demands in each distribution stage based on the new demands under dynamic demands in each distribution stage;

[0077] Based on the coordinated delivery path of heterogeneous platforms with certain demands, the initial position of platform one under dynamic demands in each delivery stage is obtained;

[0078] Based on the updated demand set under the dynamic demand of each distribution stage, the spatiotemporal position of platform two is obtained; based on the updated demand set under the dynamic demand of each distribution stage, the initial position of platform one and the spatiotemporal position of platform two, the heterogeneous platform collaborative distribution path under the dynamic demand of each distribution stage is obtained;

[0079] The collaborative delivery paths of heterogeneous platforms under dynamic demand in each delivery stage are used to generate a complete collaborative delivery route of heterogeneous platforms under dynamic demand.

[0080] Specifically, the specific steps of generating a complete heterogeneous platform collaborative delivery route under dynamic demand in step 3 include:

[0081] Step 31. Obtain and process the delivery space-time arcs of multiple trucks and drones under the determined demand described in step 221, and obtain the unfinished demand set 1 and the unfinished demand set 2 of the delivery stage τ respectively;

[0082] Obtain new demands in the distribution phase τ, merge the unfinished demand set 1 of the current distribution phase with the unfinished demand set 1 and the new demands, and obtain the updated demand set under dynamic demands; when τ = 1, it is the initial distribution phase, in which trucks and drones only have new demands; obtain the new demands in the initial distribution phase, the initial position of the truck, and the spatiotemporal position of the drone; determine the accident location of the truck and the spatiotemporal position of the drone in the initial distribution phase based on the coordinated distribution path of trucks and drones with determined demands;

[0083] Step 32. Obtain the position of the truck arriving at the delivery destination in the previous delivery phase τ-1, and determine the initial position of the truck in the delivery phase τ based on the position of the truck arriving at the delivery destination in the previous delivery phase; when τ is the initial delivery phase, the position of the truck and / or drone in the previous delivery phase τ-1 is the warehouse, which belongs to the waiting delivery phase;

[0084] Step 33. Based on the initial position of the truck in the distribution stage τ and the updated demand set, design a truck distribution route for multiple customer service allocation modes under the dynamic demand of the current distribution stage;

[0085] Step 34. Obtain the customer location and the spatiotemporal location of each drone corresponding to each new demand in the update demand set;

[0086] Step 35. Based on the drone delivery network in step 2, the customer locations corresponding to each new demand, and the spatiotemporal locations of each drone, the truck and drone collaborative delivery model under dynamic demand designed in step 1 is input to obtain the truck and drone collaborative delivery paths for various customer service allocation methods under dynamic demand;

[0087] Step 36. Evaluate and compare the truck and drone collaborative delivery paths of various allocation modes under dynamic demand, and select the collaborative delivery path with the optimal objective function value as the truck and drone collaborative delivery path under the dynamic demand of the current delivery stage;

[0088] Step 37. Repeat steps 31 to 36, traverse multiple delivery stages, and obtain the truck and drone collaborative delivery path under the dynamic demand of each delivery stage;

[0089] Step 38. The truck and drone collaborative delivery paths under dynamic demand in each delivery stage form a complete truck and drone collaborative delivery route under dynamic demand.

[0090] It is understandable that drones are used to replenish stocks when new demands arise at each delivery stage;

[0091] The initial position of the truck in each delivery stage includes: when the truck and the drone are in the warehouse, it means that the truck has not left or has returned to the warehouse, and the initial position of the truck in the current delivery stage is the warehouse; if it is not in the warehouse, the position where the truck arrived at the delivery destination in the previous delivery stage is obtained as the initial position of the current delivery stage.

[0092] When the drone is in the warehouse, it means that the drone has not left or has returned to the warehouse, and the drone's spatial position in the current delivery phase is the warehouse; if it is not in the warehouse, the drone's spatial position after completing the delivery task in the previous delivery phase is used as the initial spatial position of the current delivery phase;

[0093] Preferably, obtaining the update requirement set of each distribution stage includes the following specific steps:

[0094] Step 311. Design the delivery space-time arc of the truck under the determined demand based on the multiple determined demands in step 221, and obtain the delivery space-time arc of multiple trucks under the determined demand;

[0095] Sorting the delivery space-time arcs of multiple trucks under the determined demand to obtain sorted truck delivery space-time arcs;

[0096] Searching for a truck delivery time-space arc that meets the search condition in the sorted truck delivery time-space arcs to obtain a search time-space arc 1; the search condition is that the departure time of the delivery time arc does not reach the current delivery stage time, and the arrival time exceeds the current delivery stage time;

[0097] It can be understood that the space-time arc starts at customer i at time t and arrives at customer j at time s; the truck carries multiple demands according to the determined demand, and the multiple demands correspond to multiple delivery stages; after entering the delivery stage, the customer's demand is delivered, and after the current delivery stage is delivered, the truck still carries multiple demands of unfinished delivery stages;

[0098] Step 312: retain the truck delivery space-time arcs that are greater than or equal to the search space-time arc one in the sorted truck delivery space-time arcs to obtain a filtered truck delivery space-time arc set;

[0099] Step 313. Traverse the filtered truck delivery space-time arc set, generate an uncompleted demand set 1 for the current delivery stage, and record the truck numbers corresponding to the uncompleted demands;

[0100] Step 314. Design the delivery space-time arc of the drone under the determined demand to obtain the delivery space-time arcs of multiple drones under the determined demand; sort the delivery space-time arcs of the multiple drones under the determined demand to obtain sorted delivery space-time arcs of drones;

[0101] Searching for a drone delivery space-time arc that meets the search conditions in the sorted drone delivery space-time arcs to obtain the search space-time arc 2;

[0102] Step 315. Retain the drone delivery space-time arcs that are greater than or equal to the search space-time arc 2 in the sorted drone delivery space-time arcs to obtain a filtered drone delivery space-time arc set;

[0103] Step 316. Traverse the filtered UAV delivery space-time arc set to generate the uncompleted demand set 2 of the current delivery stage, and record the truck number corresponding to the uncompleted demand set 2; the truck number corresponding to the uncompleted demand set 2 is the truck number from which the UAV takes off;

[0104] Step 317. Obtain new demands in the current distribution stage; combine the new demands of customers to be served in the current distribution stage with uncompleted demands 1 and 2 in the current stage to obtain an updated demand set under the dynamic demands of the current distribution stage.

[0105] Compared with the prior art, the present invention has at least the following beneficial effects:

[0106] (1) This paper aims at the problem of multi-UAV-multi-truck collaborative logistics distribution path planning under dynamic demand, considers various influencing factors involved in actual distribution, and establishes a combinatorial optimization mathematical model that accurately describes the UAV-truck collaborative distribution;

[0107] (2) The present invention proposes a multi-stage time domain rolling algorithm framework, which effectively solves the above-mentioned multi-UAV-multi-truck collaborative path planning mathematical model by means of model decomposition, initial path solution, new and old demand merging, spatiotemporal position update and rolling optimization framework, realizes the coordinated and orderly operation of UAVs and trucks in the delivery task, and ensures the efficient completion of the delivery task;

[0108] (3) The time domain rolling path planning method for multi-drone-multi-truck collaborative delivery under dynamic demand proposed in the present invention comprehensively considers the actual situation of new customer demand during the delivery process and is closer to the "last mile delivery" application scenario. Compared with the traditional delivery model, the delivery solution provided by the present invention reduces delivery costs, improves delivery efficiency, and further improves customer service satisfaction, and has a relatively broad development and application potential. BRIEF DESCRIPTION OF THE DRAWINGS

[0109] The drawings are only for the purpose of illustrating particular embodiments and are not to be construed as limiting the invention.

[0110] Figure 1 It is a schematic diagram of the collaborative delivery path of drones and trucks under dynamic demand of the present invention;

[0111] Figure 2 It is a flow chart of the implementation of the method for planning the collaborative delivery path of drones and trucks under dynamic demand of the present invention;

[0112] Figure 3 It is a schematic diagram of the process of step 2 of a specific embodiment of the present invention;

[0113] Figure 4 It is a schematic diagram of the process of step three of a specific embodiment of the present invention. DETAILED DESCRIPTION

[0114] In order to more clearly understand the above-mentioned purpose, features and advantages of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be noted that, in the absence of conflict, the embodiments of the present invention and the features in the embodiments can be combined with each other. In addition, the present invention can also be implemented in other ways different from those described herein, and therefore, the protection scope of the present invention is not limited by the specific embodiments disclosed below.

[0115] A specific embodiment of the present invention, as Figure 1-4 , discloses a heterogeneous platform collaborative path planning method under dynamic demand. In order to illustrate the effectiveness of the method proposed in the present invention, the above technical solution of the present invention is described in detail through a specific embodiment below. The specific implementation steps are as follows:

[0116] The present invention provides a heterogeneous platform collaborative path planning method under dynamic demand, and in particular provides a path planning method for collaborative delivery of drones and trucks under dynamic demand, comprising:

[0117] Step 1: Set up a collaborative distribution scenario of heterogeneous platforms under dynamic demand; establish collaborative distribution path constraints based on the collaborative distribution scenario of heterogeneous platforms; use the collaborative distribution path constraints to establish a planning model for the collaborative distribution path of heterogeneous platforms under dynamic demand; the heterogeneous platforms include platform one and platform two;

[0118] Preferably, the specific steps of setting up the collaborative delivery scenario of heterogeneous platforms under dynamic demand in step 1 include:

[0119] The heterogeneous platforms were identified as trucks and drones;

[0120] A preset truck delivery route; the truck delivery route includes multiple delivery stages and their corresponding delivery paths and replenishment routes;

[0121] It can be understood that the replenishment is to use idle drones to replenish new demands when new demands arise during the distribution stage;

[0122] Designing a drone delivery route based on a truck delivery route; the drone delivery route includes multiple delivery stages and their corresponding drone delivery paths and replenishment routes;

[0123] Obtain the customer demand set for each delivery stage; the truck departs from the warehouse and enters each delivery stage according to the delivery route; the drone follows the truck along the drone delivery route; the drone and the truck visit the customer points in turn for delivery at each delivery stage according to the corresponding delivery route and customer demand set;

[0124] The drone takes off from the truck to serve the customer or lands on the truck after serving the customer; after completing all deliveries for all stages of customer needs, the drone and truck return to the warehouse.

[0125] Furthermore, the customer demand set at each distribution stage includes the demand at each distribution stage and the new demand supplemented dynamically;

[0126] Furthermore, customers can make new demands at any delivery stage, but each customer can make a new demand at most once;

[0127] The truck can carry multiple drones; the drones can take off and land on different trucks;

[0128] The truck may carry multiple goods corresponding to known demands when it departs from the warehouse and deliver them one by one; the drone must land on the truck after leaving the truck to serve a customer;

[0129] After new demand is generated in each delivery phase, if it is necessary to use trucks or drones that have not yet returned to the warehouse for delivery, drones should be used to replenish the trucks with the goods required for the new demand;

[0130] After the truck or drone returns to the warehouse, it can set out again to participate in the delivery of new needs in the subsequent stage.

[0131] It can be understood that the planning model of the collaborative delivery path of drones and trucks under dynamic demand is an integer linear programming model of the collaborative delivery path planning problem of multiple drones and multiple trucks under dynamic demand.

[0132] Furthermore, the planning model of the UAV and truck collaborative delivery path is expressed as:

[0133]

[0134] Among them, B is the objective function value of the planning model of the coordinated delivery path of drones and trucks, τ is the delivery stage, represents the number of delivery stages, A1 represents the set of space-time arcs that the truck can travel; represents the travel cost of the truck between delivery point i and delivery point j; x w,i,j,t,s (τ) represents the space-time arc of the w-th truck starting from the delivery point i at time t and arriving at the delivery point j at time s in the τ-th delivery stage, W is the number of trucks; A2 represents the set of space-time arcs that the drone can travel, represents the travel cost of the drone between delivery point i and delivery point j; y v,i,j,t,s,a,b (τ) represents the space-time arc of whether drone v starts from delivery point i at time t in state a and arrives at delivery point j at time s in state b in the τth delivery stage, and V represents the number of drones.

[0135] Preferably, the collaborative delivery path constraints include: flow balance constraints, drone and truck coupling constraints, and customer service constraints;

[0136] Furthermore, the flow balance constraint includes:

[0137]

[0138] Among them, (j,s)∈N1, N1 represents the set of distribution points;

[0139] Furthermore, the coupling constraints between the drone and the truck include:

[0140]

[0141] Among them, y v,i,j,t,s,w,w (τ) represents the space-time arc of whether the drone v follows the truck w from the delivery point i at time t and arrives at the delivery point j at time s in the τth delivery stage; y v,i,j,t,s,w,m′ (τ) represents the space-time arc in which the drone v takes off from the truck m′ for delivery in the τth delivery stage, departs from the delivery point i at time t, arrives at the delivery point j at time s, and lands on the truck w; x w,i,k,t,r (τ) represents the space-time arc of the w-th truck starting from the distribution point i at time t and arriving at the distribution point k at time r in the τ-th distribution stage, (k,r)∈N1, N1 represents the set of distribution points, (i,k,t,r)∈A1, A1 represents the set of space-time arcs that the truck can travel; y v,i,j,t,s,m′,w (τ) represents the space-time arc of whether the drone v takes off from the truck m′ for delivery in the τth delivery stage, departs from the delivery point i at time t, arrives at the delivery point j at time s, and lands on the truck w;

[0142] x w,k,j,r,s(τ) represents the space-time arc of the w-th truck starting from the distribution point k at time r and arriving at the distribution point j at time s in the τ-th distribution stage, (k, j, r, s) ∈ A1; represents the set of space-time arcs of truck services for new demand points in the τth distribution stage; represents the set of spatiotemporal state arcs of drone services for new demand points in the τth distribution stage; represents the set of space-time state arcs of the new demand point drone service starting from the warehouse in the τth distribution stage; (0, j, t, s, 0, w) represents the space-time arc starting from the warehouse at time t and arriving at the distribution point j at time s to replenish the truck w; y v,0,j,t,s,0,w (τ) represents the space-time arc of whether drone v departs from warehouse 0 at time t and arrives at delivery point j at time s to replenish truck w in the τth delivery stage.

[0143] The expression of the customer service constraint is:

[0144]

[0145] Among them, (i, t, a) represents the time-space state point, that is, a is the truck, t is the time, i is the delivery point, y v,i,j,t,s,a,m′ (τ) represents the space-time arc of whether drone v takes off from truck a for delivery in the τth delivery stage and departs from delivery point i at time t and arrives at delivery point j at time s, d j (τ) indicates whether the demand of customer j in the delivery stage τ is met.

[0146] Step 2: Based on the planning model of the collaborative delivery path of heterogeneous platforms under the dynamic demand, a distribution path planning model of platform one and a distribution path planning model of platform two under the determined demand are obtained;

[0147] Processing the platform one distribution path planning model and the platform two distribution path planning model under the determined demand to obtain heterogeneous platform distribution paths under the determined demand;

[0148] Preferably, the specific steps of obtaining the heterogeneous platform delivery path under the determined demand include:

[0149] Step 21. Determine that the heterogeneous platform includes a truck and a drone; based on the planning model of the drone and truck collaborative delivery path under the dynamic demand, obtain a truck delivery path planning model and a drone delivery path planning model under the determined demand;

[0150] Step 22. Obtain the identified needs and generate multiple customer service allocation methods;

[0151] Based on the truck delivery path planning model under certain demand and the drone delivery path planning model under certain demand, the truck and drone collaborative delivery paths corresponding to various customer service allocation methods are obtained;

[0152] Compare the objective function values ​​of the truck and drone delivery paths corresponding to various customer service allocation methods, and obtain the truck and drone collaborative delivery path with the optimal objective function value as the truck and drone delivery path under the determined demand;

[0153] Furthermore, the specific steps of obtaining the truck delivery path planning model and the drone delivery path planning model under the determined demand in step 21 include:

[0154] Step 211. Relax the collaborative delivery path constraint conditions in the planning model of the collaborative delivery path of drones and trucks under dynamic demand to obtain the truck delivery path constraint conditions under determined demand, and obtain the truck delivery path planning model under determined demand based on the truck delivery path constraint conditions under determined demand;

[0155] Step 212: Convert the collaborative delivery path constraint conditions in the planning model of the collaborative delivery path of drones and trucks under dynamic demand to obtain the drone delivery path constraint conditions under determined demand; obtain the drone delivery path planning model under determined demand based on the drone delivery path constraint conditions;

[0156] Specifically, the specific steps of obtaining the truck delivery path planning model in step 211 include:

[0157] The coupling constraint between drones and trucks in the collaborative delivery path constraint condition in the planning model of the collaborative delivery path between drones and trucks under dynamic demand is converted into a constraint condition with only truck path variables, and the truck constraint condition 1 is obtained;

[0158] Convert the customer service constraint into a constraint with only truck route variables to obtain truck constraint 2;

[0159] Convert the flow balance constraint into a constraint condition with only truck path variables, and obtain truck constraint condition three;

[0160] Based on the first truck constraint condition, the second truck constraint condition and the third truck constraint condition, a truck delivery path constraint condition under a certain demand is obtained;

[0161] Obtaining a truck delivery path planning model based on the truck delivery path constraint conditions;

[0162] Specifically, the specific steps of obtaining the drone delivery path planning model in step 212 include:

[0163] The truck path variables in the planning model of the coordinated delivery path of drones and trucks are regarded as fixed values, and the initial truck delivery path planning model under fixed demand is obtained;

[0164] The coupling constraint between drone and truck in the collaborative delivery path constraint is converted into the constraint with only drone path variables, and the truck constraint one is obtained;

[0165] Convert the customer service constraint into a constraint with only drone path variables, and get the truck constraint two;

[0166] Convert the flow balance constraint into a constraint with only the UAV road strength variable, and get the truck constraint three;

[0167] Based on the first truck constraint condition, the second truck constraint condition and the third truck constraint condition, the UAV delivery path constraint condition under the determined demand is obtained; based on the UAV delivery path constraint condition under the determined demand and the initial truck delivery path planning model under the determined demand, the UAV delivery path planning model under the determined demand is obtained;

[0168] Specifically, the specific steps of obtaining the truck and drone delivery paths under the determined demand in step 22 include:

[0169] Step 221. Obtaining confirmed needs and generating multiple customer service allocation methods;

[0170] When n=1, it is the first customer service allocation method; n=1,2,3...N; N represents the number of customer service allocation methods;

[0171] Determine the trucks available in the warehouse for the nth customer service allocation method, and obtain the set of trucks for the nth customer service allocation method;

[0172] Step 222. Input the trucks in the n-th customer service allocation mode truck set into the truck delivery path planning model under the determined demand in sequence, and output the alternative delivery path corresponding to each truck based on the improved alternating direction multiplier method;

[0173] Step 223. Call the greedy search method to screen the candidate delivery paths corresponding to each truck, and select the candidate delivery path corresponding to the optimal objective function value as the truck delivery path corresponding to the nth customer service allocation method;

[0174] Step 224. Repeat steps 221-223, traverse multiple customer service allocation methods, and obtain truck delivery routes corresponding to various customer service allocation methods;

[0175] Step 225. Determine the drones available in the warehouse for the nth customer service allocation method, and obtain the set of drones for the nth customer service allocation method; generate a drone delivery network in combination with the truck delivery paths corresponding to the nth customer service allocation method;

[0176] Step 226. The drone delivery road network and the drone set are used as inputs of the drone delivery path planning model; based on the improved alternating direction multiplier method, the drone set is traversed to obtain the alternative delivery path corresponding to each drone;

[0177] Step 227. Use a greedy search method to obtain a drone alternative delivery path corresponding to the optimal objective function value among multiple drone alternative delivery paths as the drone delivery path corresponding to the nth customer service allocation method;

[0178] Step 228. Repeat steps 225-227, traverse multiple customer service allocation methods, and obtain the drone delivery paths corresponding to the truck delivery paths in various customer service allocation methods; obtain the truck and drone collaborative delivery paths of various customer service allocation methods based on the truck delivery paths corresponding to various customer service allocation methods and the drone delivery paths corresponding to the truck delivery paths in various customer service allocation methods;

[0179] Step 229. Input the truck and drone collaborative delivery paths corresponding to various customer service allocation methods into the planning model of the collaborative delivery paths of heterogeneous platforms under dynamic demand, and output the objective function values ​​corresponding to the truck and drone collaborative delivery paths corresponding to various customer service allocation methods;

[0180] Compare the objective function values ​​of the truck and drone collaborative delivery paths corresponding to various customer service allocation methods, and select the truck and drone collaborative delivery path with the optimal objective function value as the truck and drone delivery path under the determined demand;

[0181] Furthermore, step 22 also includes: among the alternative delivery routes of each truck, selecting the truck route with repeated delivery customers, increasing the overall cost of the vehicle route with repeated delivery customers to reduce the possibility of selection; selecting the vehicle route of unserved customers, reducing the delivery cost of the vehicle route of unserved customers to encourage subsequent vehicles to serve them.

[0182] Furthermore, the drone delivery road network includes a first type of edge set and a second type of edge set;

[0183] The first type of edge set is composed of the delivery paths of trucks in each delivery stage; when the drone passes through the first type of edge, it indicates the state of following the truck;

[0184] The vertices of the second type of edge set are truck service customers and drone service customers, that is, the second type of edge represents the independent flight path in drone delivery; the second type of edge represents the drone taking off for delivery and landing for return;

[0185] Set the UAV road network travel cost matrix; the cost of the UAV passing through the first type of edge is 0; the cost of the UAV passing through the second type of edge is the actual travel cost of the UAV; the UAV delivery road network will ensure that the generated UAV path meets the coupling constraints of the UAV and truck in the model.

[0186] Step 3: obtaining new demands under dynamic demands in each distribution stage; obtaining an updated demand set under dynamic demands in each distribution stage based on the new demands under dynamic demands in each distribution stage;

[0187] Based on the coordinated delivery path of heterogeneous platforms with certain demands, the initial position of platform one under dynamic demands in each delivery stage is obtained;

[0188] Based on the updated demand set under the dynamic demand of each distribution stage, the spatiotemporal position of platform two is obtained; based on the updated demand set under the dynamic demand of each distribution stage, the initial position of platform one and the spatiotemporal position of platform two, the heterogeneous platform collaborative distribution path under the dynamic demand of each distribution stage is obtained;

[0189] The collaborative delivery paths of heterogeneous platforms under dynamic demand in each delivery stage are used to generate a complete collaborative delivery route of heterogeneous platforms under dynamic demand.

[0190] Specifically, the specific steps of generating a complete heterogeneous platform collaborative delivery route under dynamic demand in step 3 include:

[0191] Step 31. Obtain and process the delivery space-time arcs of multiple trucks and drones under the determined demand described in step 221, and obtain an uncompleted demand set 1 and an uncompleted demand set 2 of the delivery stage τ, respectively;

[0192] Get the new demand of the distribution stage τ, merge the unfinished demand set 1 and unfinished demand set 2 of the current distribution stage with the new demand, and get the updated demand set under dynamic demand; when τ = 1, it is the initial distribution stage, in which trucks and drones only have new demands; determine the accident location of the truck and the spatiotemporal location of the drone in the initial distribution stage based on the coordinated distribution path of trucks and drones with determined demands;

[0193] Step 32. Obtain the position of the truck at the delivery destination in the previous delivery phase τ-1, and determine the initial position of the truck in the delivery phase τ based on the position of the truck at the delivery destination in the previous delivery phase; when τ is the initial delivery phase, the position of the truck and / or drone in the previous delivery phase τ-1 is the warehouse, which belongs to the waiting delivery phase;

[0194] Step 33. Based on the initial position of the truck in the distribution stage τ and the updated demand set, design a truck distribution route for multiple customer service allocation modes under the dynamic demand of the current distribution stage;

[0195] Step 34. Obtain the customer location and the spatiotemporal location of each drone corresponding to each new demand in the update demand set;

[0196] Step 35. Based on the drone delivery network in step 2, the customer locations corresponding to each new demand, and the spatiotemporal locations of each drone, the truck and drone collaborative delivery model under dynamic demand designed in step 1 is input to obtain the truck and drone collaborative delivery paths for various customer service allocation methods under dynamic demand;

[0197] Step 36. Evaluate and compare the truck and drone collaborative delivery paths of various allocation modes under dynamic demand, and select the collaborative delivery path with the optimal objective function value as the truck and drone collaborative delivery path under the dynamic demand of the current delivery stage;

[0198] Step 37. Repeat steps 31 to 36, traverse multiple delivery stages, and obtain the truck and drone collaborative delivery path under the dynamic demand of each delivery stage;

[0199] Step 38. The truck and drone collaborative delivery paths under dynamic demand in each delivery stage form a complete truck and drone collaborative delivery route under dynamic demand.

[0200] It is understandable that drones are used to replenish stocks when new demands arise at each delivery stage;

[0201] The initial position of the truck in each delivery stage includes: when the truck and the drone are in the warehouse, it means that the truck has not left or has returned to the warehouse, and the initial position of the truck in the current delivery stage is the warehouse; if it is not in the warehouse, the position where the truck arrived at the delivery destination in the previous delivery stage is obtained as the initial position of the current delivery stage.

[0202] When the drone is in the warehouse, it means that the drone has not left or has returned to the warehouse, and the drone's spatial position in the current delivery phase is the warehouse; if it is not in the warehouse, the drone's spatial position after completing the delivery task in the previous delivery phase is used as the initial spatial position of the current delivery phase;

[0203] Preferably, obtaining the update requirement set of each distribution stage includes the following specific steps:

[0204] Step 311. Based on the multiple determined demands in step 221, the delivery time-space arcs of the trucks under the determined demands are designed to obtain the delivery time-space arcs of the multiple trucks under the determined demands;

[0205] Sorting the delivery space-time arcs of multiple trucks under the determined demand to obtain sorted truck delivery space-time arcs;

[0206] Searching for a truck delivery time-space arc that meets the search condition in the sorted truck delivery time-space arcs to obtain a search time-space arc 1; the search condition is that the departure time of the delivery time arc does not reach the current delivery stage time, and the arrival time exceeds the current delivery stage time;

[0207] It can be understood that the space-time arc starts at customer i at time t and arrives at customer j at time s; the truck carries multiple demands according to the determined demand, and the multiple demands correspond to multiple delivery stages; after entering the delivery stage, the customer's demand is delivered, and after the current delivery stage is delivered, the truck still carries multiple demands of unfinished delivery stages;

[0208] Step 312: retain the truck delivery space-time arcs that are greater than or equal to the search space-time arc one in the sorted truck delivery space-time arcs to obtain a filtered truck delivery space-time arc set;

[0209] Step 313. Traverse the filtered truck delivery space-time arc set, generate an uncompleted demand set 1 for the current delivery stage, and record the truck numbers corresponding to the uncompleted demands;

[0210] Step 314. Design the delivery space-time arc of the drone under the determined demand to obtain the delivery space-time arcs of multiple drones under the determined demand; sort the delivery space-time arcs of the multiple drones under the determined demand to obtain sorted delivery space-time arcs of drones;

[0211] Searching for a drone delivery space-time arc that meets the search conditions in the sorted drone delivery space-time arcs to obtain the search space-time arc 2;

[0212] Step 315. Retain the drone delivery space-time arcs that are greater than or equal to the search space-time arc 2 in the sorted drone delivery space-time arcs to obtain a filtered drone delivery space-time arc set;

[0213] Step 316. Traverse the filtered UAV delivery space-time arc set to generate the uncompleted demand set 2 of the current delivery stage, and record the truck number corresponding to the uncompleted demand set 2; the truck number corresponding to the uncompleted demand set 2 is the truck number from which the UAV takes off;

[0214] Step 317. Obtain new demands in the current distribution stage; combine the new demands of customers to be served in the current distribution stage with uncompleted demands 1 and 2 in the current stage to obtain an updated demand set under the dynamic demands of the current distribution stage.

[0215] The above description is only a preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily conceived by any technician familiar with the technical field within the technical scope disclosed by the present invention should be covered within the protection scope of the present invention.

Claims

1. A method for collaborative path planning of heterogeneous platforms under dynamic demand, characterized in that: include: Step 1: Set up a collaborative delivery scenario for heterogeneous platforms under dynamic demand; Establish collaborative delivery path constraints based on collaborative delivery scenarios on heterogeneous platforms; A planning model for collaborative delivery paths of heterogeneous platforms under dynamic demand is established by using the collaborative delivery path constraint conditions; the heterogeneous platforms include platform one and platform two; Step 2: Based on the planning model of the collaborative delivery path of heterogeneous platforms under the dynamic demand, a distribution path planning model of platform one and a distribution path planning model of platform two under the determined demand are obtained; Processing the platform one distribution path planning model and the platform two distribution path planning model under the determined demand to obtain heterogeneous platform distribution paths under the determined demand; Step 3: obtaining new demands under dynamic demands in each distribution stage; obtaining an updated demand set under dynamic demands in each distribution stage based on the new demands under dynamic demands in each distribution stage; Based on the collaborative delivery path of heterogeneous platforms under determined demand, the initial position of platform one under dynamic demand in each delivery stage is obtained; Based on the updated demand set under the dynamic demand of each distribution stage, the spatiotemporal position of platform two is obtained; based on the updated demand set under the dynamic demand of each distribution stage, the initial position of platform one and the spatiotemporal position of platform two, the heterogeneous platform collaborative distribution path under the dynamic demand of each distribution stage is obtained; The collaborative delivery paths of heterogeneous platforms under dynamic demand in each delivery stage are used to generate a complete collaborative delivery route of heterogeneous platforms under dynamic demand.

2. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 1 is characterized in that: The specific steps of setting up the collaborative delivery scenario of heterogeneous platforms under dynamic demand in step 1 include: The heterogeneous platforms were identified as trucks and drones; A preset truck delivery route; the truck delivery route includes multiple delivery stages and their corresponding delivery paths and replenishment routes; Designing a drone delivery route based on a truck delivery route; the drone delivery route includes multiple delivery stages and their corresponding drone delivery paths and replenishment routes; Obtain the customer demand set for each delivery stage; the truck departs from the warehouse and enters each delivery stage according to the delivery route; the drone follows the truck along the drone delivery route; the drone and the truck visit the customer points in turn for delivery at each delivery stage according to the corresponding delivery route and customer demand set; The drone takes off from the truck to serve the customer or lands on the truck after serving the customer; after completing all deliveries for all stages of customer needs, the drone and truck return to the warehouse.

3. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 2 is characterized in that: The customer demand set at each distribution stage includes the demand at each distribution stage and the new demand supplemented dynamically; The truck can carry multiple drones; the drones can take off and land on different trucks; The truck may carry multiple goods corresponding to known demands when departing from the warehouse and deliver them one by one; the drone may return to the corresponding truck after leaving the truck to serve a customer; After new demand is generated in each delivery stage, if delivery is required using trucks or drones that have not yet returned to the warehouse, drones are used to replenish the trucks with the goods required for the new demand.

4. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 2 is characterized in that: The planning model of the UAV and truck collaborative delivery path is expressed as: Among them, B is the objective function value of the planning model of the coordinated delivery path of drones and trucks, represents the number of delivery stages, A1 represents the set of space-time arcs that the truck can travel; represents the travel cost of the truck between delivery point i and delivery point j; x w,i,j,t,s (τ) represents the space-time arc of the w-th truck starting from the delivery point i at time t and arriving at the delivery point j at time s in the τ-th delivery stage, W represents the number of trucks; A2 represents the set of space-time arcs that the drone can travel, represents the travel cost of the drone between delivery point i and delivery point j; y v,i,j,t,s,a,b (τ) represents the space-time arc of whether the drone v starts from the delivery point i at time t in state a and arrives at the delivery point at time s in state b in the τth delivery stage, and V represents the number of drones.

5. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 1, characterized in that: The specific steps of obtaining the heterogeneous platform distribution path under the determined demand described in step 2 include: Step 21. Determine that the heterogeneous platform includes a truck and a drone; based on the planning model of the drone and truck collaborative delivery path under the dynamic demand, obtain a truck delivery path planning model and a drone delivery path planning model under the determined demand; Step 22. Obtain the identified needs and generate multiple customer service allocation methods; Based on the truck delivery path planning model under certain demand and the drone delivery path planning model under certain demand, the truck and drone collaborative delivery paths corresponding to various customer service allocation methods are obtained; The objective function values ​​of the truck and drone delivery paths corresponding to various customer service allocation methods are compared, and the truck and drone collaborative delivery path with the optimal objective function value is obtained as the truck and drone delivery path under certain demand.

6. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 5 is characterized in that: The specific steps of obtaining the truck delivery path planning model and the drone delivery path planning model under the determined demand in step 21 include: Step 211. Relax the collaborative delivery path constraint conditions in the planning model of the collaborative delivery path of drones and trucks under dynamic demand to obtain the truck delivery path constraint conditions under determined demand, and obtain the truck delivery path planning model under determined demand based on the truck delivery path constraint conditions under determined demand; Step 212. Convert the collaborative delivery path constraints in the planning model of the collaborative delivery path of drones and trucks under dynamic demand to obtain the drone delivery path constraints under determined demand; and obtain the drone delivery path planning model under determined demand based on the drone delivery path constraints.

7. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 5 is characterized in that: The specific steps of obtaining the truck and drone delivery paths under the determined demand described in step 22 include: Step 221. Obtaining confirmed needs and generating multiple customer service allocation methods; When n=1, it is the first customer service allocation method; n=1,2,3...N; N represents the number of customer service allocation methods; Determine the trucks available in the warehouse for the nth customer service allocation method, and obtain the set of trucks for the nth customer service allocation method; Step 222. Input the trucks in the n-th customer service allocation mode truck set into the truck delivery path planning model under the determined demand in sequence, and output the alternative delivery path corresponding to each truck based on the improved alternating direction multiplier method; Step 223. Call the greedy search method to screen the candidate delivery paths corresponding to each truck, and select the candidate delivery path corresponding to the optimal objective function value as the truck delivery path corresponding to the nth customer service allocation method; Step 224. Repeat steps 221-223, traverse multiple customer service allocation methods, and obtain truck delivery routes corresponding to various customer service allocation methods; Step 225. Determine the drones available in the warehouse for the nth customer service allocation method, and obtain the set of drones for the nth customer service allocation method; generate a drone delivery network in combination with the truck delivery paths corresponding to the nth customer service allocation method; Step 226. The drone delivery road network and the drone set are used as inputs of the drone delivery path planning model; based on the improved alternating direction multiplier method, the drone set is traversed to obtain the alternative delivery path corresponding to each drone; Step 227. Use a greedy search method to obtain a drone alternative delivery path corresponding to the optimal objective function value among multiple drone alternative delivery paths as the drone delivery path corresponding to the nth customer service allocation method; Step 228. Repeat steps 225-227, traverse multiple customer service allocation methods, and obtain the drone delivery paths corresponding to the truck delivery paths in various customer service allocation methods; obtain the truck and drone collaborative delivery paths of various customer service allocation methods based on the truck delivery paths corresponding to various customer service allocation methods and the drone delivery paths corresponding to the truck delivery paths in various customer service allocation methods; Step 229. Input the truck and drone collaborative delivery paths corresponding to various customer service allocation methods into the planning model of the collaborative delivery paths of heterogeneous platforms under dynamic demand, and output the objective function values ​​corresponding to the truck and drone collaborative delivery paths corresponding to various customer service allocation methods; Compare the objective function values ​​of the truck and drone collaborative delivery paths corresponding to various customer service allocation methods, and select the truck and drone collaborative delivery path with the optimal objective function value as the truck and drone delivery path under the determined demand.

8. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 7 is characterized in that: The drone delivery road network includes a first type of edge set and a second type of edge set; The first type of edge set is composed of the delivery paths of trucks in each delivery stage; when the drone passes through the first type of edge, it indicates the state of following the truck; The vertices of the second type of edge set are truck service customers and drone service customers, that is, the second type of edge represents the independent flight path in drone delivery; the second type of edge represents the drone taking off for delivery and landing for return; Set the UAV road network travel cost matrix; the cost of the UAV passing through the first type of edge is 0; the cost of the UAV passing through the second type of edge is the actual travel cost of the UAV; the UAV delivery road network will ensure that the generated UAV path meets the coupling constraints of the UAV and truck in the model.

9. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 7, characterized in that: The specific steps of generating a complete heterogeneous platform collaborative delivery route under dynamic demand in step 3 include: Step 31. Obtain and process the delivery space-time arcs of multiple trucks and drones under the determined demand described in step 221, and obtain an uncompleted demand set 1 and an uncompleted demand set 2 of the delivery stage τ, respectively; Get the new demand in the distribution phase τ, merge the unfinished demand set 1 and unfinished demand set 2 of the current distribution phase with the new demand, and get the updated demand set under dynamic demand; when τ = 1, it is the initial distribution phase, in which trucks and drones only have new demands; Step 32. Obtain the position of the truck at the delivery destination in the previous delivery phase τ-1, and determine the initial position of the truck in the delivery phase τ based on the position of the truck at the delivery destination in the previous delivery phase; when τ is the initial delivery phase, in the previous delivery phase τ-1, the position of the truck and / or drone is in the warehouse, which belongs to the waiting delivery phase; Step 33. Based on the initial position of the truck in the distribution stage τ and the updated demand set, design a truck distribution route for multiple customer service allocation modes under the dynamic demand of the current distribution stage; Step 34. Obtain the customer location and the spatiotemporal location of each drone corresponding to each new demand in the update demand set; Step 35. Based on the drone delivery network in step 2, the customer locations corresponding to each new demand, and the spatiotemporal locations of each drone, the truck and drone collaborative delivery model under dynamic demand designed in step 1 is input to obtain the truck and drone collaborative delivery paths for various customer service allocation methods under dynamic demand; Step 36. Evaluate and compare the truck and drone collaborative delivery paths of various allocation modes under dynamic demand, and select the collaborative delivery path with the optimal objective function value as the truck and drone collaborative delivery path under the dynamic demand of the current delivery stage; Step 37. Repeat steps 31-36, traverse multiple delivery stages, and obtain the truck and drone collaborative delivery path under the dynamic demand of each delivery stage; Step 38. The truck and drone collaborative delivery paths under dynamic demand in each delivery stage form a complete truck and drone collaborative delivery route under dynamic demand.

10. The method for planning a collaborative delivery path for heterogeneous platforms according to claim 1, characterized in that: Get the updated demand set for each distribution stage. The specific steps include: Step 311. Design the delivery space-time arc of the truck under the determined demand based on the multiple determined demands in step 221, and obtain the delivery space-time arc of multiple trucks under the determined demand; Sorting the delivery space-time arcs of multiple trucks under the determined demand to obtain sorted truck delivery space-time arcs; Searching for a truck delivery time-space arc that meets the search condition in the sorted truck delivery time-space arcs to obtain a search time-space arc 1; the search condition is that the departure time of the delivery time arc does not reach the current delivery stage time, and the arrival time exceeds the current delivery stage time; Step 312: retain the truck delivery space-time arcs that are greater than or equal to the search space-time arc one in the sorted truck delivery space-time arcs to obtain a filtered truck delivery space-time arc set; Step 313. Traverse the filtered truck delivery space-time arc set, generate an uncompleted demand set 1 for the current delivery stage, and record the truck numbers corresponding to the uncompleted demands; Step 314. Design the delivery space-time arc of the drone under the determined demand to obtain the delivery space-time arcs of multiple drones under the determined demand; sort the delivery space-time arcs of the multiple drones under the determined demand to obtain sorted delivery space-time arcs of drones; Searching for a drone delivery space-time arc that meets the search conditions in the sorted drone delivery space-time arcs to obtain the search space-time arc 2; Step 315. Retain the drone delivery space-time arcs that are greater than or equal to the search space-time arc 2 in the sorted drone delivery space-time arcs to obtain a filtered drone delivery space-time arc set; Step 316. Traverse the filtered UAV delivery space-time arc set to generate the uncompleted demand set 2 of the current delivery stage, and record the truck number corresponding to the uncompleted demand set 2; the truck number corresponding to the uncompleted demand set 2 is the truck number from which the UAV takes off; Step 317. Obtain new demands in the current distribution stage; combine the new demands of customers to be served in the current distribution stage with uncompleted demands 1 and 2 in the current stage to obtain an updated demand set under the dynamic demands of the current distribution stage.

Citation Information

Cited By

  • Unmanned aircraft logistics distribution receiving management system based on Internet of Things

    CN120031223A