Systems and methods for individualized routing and transportation of parcels
US-9619776-B1 · Apr 11, 2017 · US
US9792576B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-9792576-B1 |
| Application number | US-201615331989-A |
| Country | US |
| Kind code | B1 |
| Filing date | Oct 24, 2016 |
| Priority date | Oct 24, 2016 |
| Publication date | Oct 17, 2017 |
| Grant date | Oct 17, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Controlling drones and vehicles in package delivery, in one aspect, may include routing a delivery vehicle loaded with packages to a dropoff location based on executing on a hardware processor a spatial clustering of package destinations. A set of drones may be dispatched. A drone-to-package assignment is determined for the drones and the packages in the delivery vehicle. The drone is controlled to travel from the vehicle's dropoff location to transport the assigned package to a destination point and return to the dropoff location to meet the vehicle. The delivery vehicle may be alerted to speed up or slow down to meet the drone at the return location, for example, without the delivery vehicle having to stop and wait at the dropoff location while the drone is making its delivery.
Opening claim text (preview).
We claim: 1. A method of controlling drones and vehicles in package delivery, comprising: routing a delivery vehicle loaded with drones and packages to a dropoff location based on executing on a hardware processor a spatial clustering of package destinations; configuring a drone to package assignment for the drones in the vehicle and the packages in the delivery vehicle, the configuring performed based on executing on the hardware processor an optimization function that maximizes a number of the packages delivered by the drones subject to a plurality of constraints, the optimization function given as input at least the dropoff location and the plurality of constraints, the plurality of constraints comprising: at least that a given package can only be delivered one time by one drone, that weight of the given package must not exceed capacity of the drone, and that for a single drone, a combined distance from the delivery vehicle to a first delivery plus a distance between each delivery, must not exceed a battery life of the drone subject to current wind conditions in drone's delivery path, wherein the optimization function comprises maximizing Σ ∀dεD,pεP w p ·A(d,p), subject to: A(d, p)ε{0,1} ∀d 0 ,d 1 εD,pεP:A(d o ,p)=1 A(d 1 ,p)=0; ∀dεD,pεP: A(d,p)=1 Capacity (d)≧Weight (p); and ∀dεD: Let K={∀pεP|A(d,p)=1}s. t. ∃ Permuation(K)| Distance(Start( d ), k 0 )+Σ iε1 . . . |K|−2 Distance( k i ,k i+1 )+Distance( k |K|−1 ,End( d ))≦Range( d ), wherein D represents a set of the drones, P represents a set of the packages, w p represents a weight factor given to a package p being delivered to its destination, Weight(p) represents a weight given to a package p, Capacity(d) represents the maximum weight of a package that a drone can carry for delivery, Range(d) represents a maximum distance a drone can travel based on a power source of the drone, Start(d) represents a geographic location from where a drone is dispatched, End(d) represents a geographic location where the drone returns after completing delivery of a package, A(d, p)=1 represents that drone d will deliver package, A(d, p)=0 represents that drone d will not deliver package p, K represents a delivery order of packages, k represents each stop along a drone's delivery assignment of a package, wherein A(d,p) and K are decision variables solved in the optimization function; and controlling the drone to travel from the dropoff location to transport the assigned package to a destination point and return to the dropoff location to meet the vehicle. 2. The method of claim 1 , further comprising controlling the delivery vehicle to speed up or slow down to meet the drone at the dropoff location without the delivery vehicle having to stop and wait at the dropoff location while the drone is making a delivery. 3. The method of claim 2 , wherein the controlling the delivery vehicle further comprises tracking a current position of the delivery vehicle via a global positioning system. 4. The method of claim 1 , wherein the delivery vehicles comprises a plurality of delivery vehicles each carrying a set of packages and a set of drones for assignment. 5. The method of claim 4 , wherein the plurality of delivery vehicles have different dropoff locations from one another for dispatching and meeting with the set of drones. 6. The method of claim 1 , wherein the optimization problem further outputs an assignment of delivery path comprising multiple delivery stops for the drone. 7. The method of claim 1 , wherein the configuring a drone to package assignment and controlling the drone to travel from the dropoff location to transport the assigned package to a destination point and return to the dropoff location to meet the vehicle are repeated until all packages in the delivery vehicle are assigned for delivery. 8. A computer readable storage device storing a program of instructions executable by a machine to perform a method of controlling drones and vehicles in package delivery, the method comprising: routing a delivery vehicle loaded with drones and packages to a dropoff location based on executing on a hardware processor a spatial clustering of package destinations; configuring a drone to package assignment for the drones in the vehicle and the packages in the delivery vehicle, the configuring performed based on executing on the hardware processor an optimization function that maximizes a number of the packages delivered by the drones subject to a plurality of constraints, the optimization function given as input at least the dropoff location, the plurality of constraints comprising: at least that a given package can only be delivered one time by one drone, that weight of the given package must not exceed capacity of the drone, and that for a single drone, a combined distance from the delivery vehicle to a first delivery plus a distance between each delivery, must not exceed a battery life of the drone subject to current wind conditions in drone's delivery path, wherein the optimization function comprises maximizing Σ ∀dεD,pεP w p ·A(d,p), subject to: A(d,p)ε{0,1} ∀d 0 ,d 1 εD,pεP:A(d o ,p)=1 A(d 1 ,p)=0; ∀dεD,pεP:A(d,p)=1 Capacity (d)≧Weight (p); and ∀dεD: Let K={∀pεP|A(d,p)=1}s. t. ∃ Permuation(K)| Distance(Start( d ), k 0 )+Σ iε1 . . . |K|−2 Distance( k i ,k i+1 )+Distance( k |K|−1 ,End( d ))≦Range( d ), wherein D represents a set of the drones, P represents a set of the packages, w p represents a weight factor given to a package p being delivered to its destination, Weight(p) represents a weight given to a package p, Capacity(d) represents the maximum weight of a package that a drone can carry for delivery, Range(d) represents a maximum distance a drone can travel based on a power source of the drone, Start(d) represents a geographic location from where a drone is dispatched, End(d) represents a geographic location where the drone returns after completing delivery of a package, A(d, p)=1 represents that drone d will deliver package, A(d, p)=0 represents that drone d will not deliver package p, K represents a delivery order of packages, k represents each stop along a drone's delivery assignment of a package, wherein A(d,p) and K are decision variables solved in the optimization function; and controlling the drone to travel from the dropoff location to transport the assigned package to a destination point and return to the dropoff location to meet the vehicle. 9. The computer readable storage device of claim 8 , further comprising controlling the delivery vehicle to speed up or slow down to meet the drone at the dropoff location without the delivery vehicle having to stop and wait at the dropoff location while the drone is making a delivery. 10. The computer readable storage device of claim 9 , wherein the controlling the delivery vehicle further comprises tracking a current position of the delivery vehicle via a global positioning system. 11. The computer readable storage device of claim 8 , wherein the delivery vehicles comprises a plurality of delivery vehicles each carrying a set of packages and a set of drones for assignment. 12. The computer readable storage device of claim 11 , wherein the plurality of delivery vehicles have different dropoff locations from one another for dispatching and meeting with the set of drones. 13. The computer readable storage device of claim 8 , wherein the configuring a drone to package assignment and controlling the drone to travel from the dropoff location to transport the assigned package to a destination point and return to the dropoff location to meet the vehicle are repeated until a
Information retrieval; Database structures therefor; File system structures therefor · CPC title
Special goods or special handling procedures, e.g. handling of hazardous or fragile goods · CPC title
Operations & Transport · mapped topic
of the remote controlled vehicle type, i.e. RPV · CPC title
involving a plurality of aircrafts, e.g. formation flying (traffic control systems for aircraft G08G5/00) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.