Route planning for multi-unmanned aerial vehicle-based package delivery
First Claim
Patent Images
1. A method, comprising:
- receiving, at a computer processor, data for each of a plurality of unmanned aerial vehicles (UAVs), the data including a UAV identifier, current geographic location, and final destination of each UAV;
calculating a plurality of permutations of travel routes for each of the UAVs, the proposed travel routes calculated as a function of the current geographic location of each of the plurality of UAVs and the final destinations of the plurality of UAVs;
applying a selected variable to the plurality of calculated permutations to produce proposed travel routes for the plurality of UAVs, wherein the selected variable is configured to minimize an idle time for the plurality of UAVs, wherein the idle time is time that each of the plurality of UAVs are not actively engaged in a package delivery or pick-up service; and
generating a routing plan from the proposed travel routes, wherein at least one of the proposed travel routes includes an interchange location at which a first UAV of the plurality of UAVs exchanges a package with a second UAV of the plurality of UAVs.
2 Assignments
0 Petitions
Accused Products
Abstract
An aspect includes receiving data for each of a plurality of unmanned aerial vehicles (UAVs) that includes a current location and final destination of each UAV. An aspect also includes calculating permutations of travel routes for each of the UAVs, which permutations are calculated as a function of the current locations of the UAVs and final destinations of each UAV. An aspect also includes applying a selected variable to the calculated permutations to produce proposed travel routes for the UAVs. An aspect further includes generating a routing plan from the proposed travel routes.
-
Citations
16 Claims
-
1. A method, comprising:
-
receiving, at a computer processor, data for each of a plurality of unmanned aerial vehicles (UAVs), the data including a UAV identifier, current geographic location, and final destination of each UAV; calculating a plurality of permutations of travel routes for each of the UAVs, the proposed travel routes calculated as a function of the current geographic location of each of the plurality of UAVs and the final destinations of the plurality of UAVs; applying a selected variable to the plurality of calculated permutations to produce proposed travel routes for the plurality of UAVs, wherein the selected variable is configured to minimize an idle time for the plurality of UAVs, wherein the idle time is time that each of the plurality of UAVs are not actively engaged in a package delivery or pick-up service; and generating a routing plan from the proposed travel routes, wherein at least one of the proposed travel routes includes an interchange location at which a first UAV of the plurality of UAVs exchanges a package with a second UAV of the plurality of UAVs. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A system, comprising:
-
a memory having computer readable instructions; and a processing unit for executing the computer readable instructions, the computer readable instructions including; receiving data for each of a plurality of unmanned aerial vehicles (UAVs), the data including a UAV identifier, current geographic location, and final destination of each UAV; calculating a plurality of permutations of travel routes for each of the UAVs, the proposed travel routes calculated as a function of the current geographic location of each of the plurality of UAVs and the final destinations of the plurality of UAVs; applying a selected variable to the plurality of calculated permutations to produce proposed travel routes for the plurality of UAVs, wherein the selected variable is configured to minimize an idle time for the plurality of UAVs, wherein the idle time is time that each of the plurality of UAVs are not actively engaged in a package delivery or pick-up service; and generating a routing plan from the proposed travel routes, wherein at least one of the proposed travel routes includes an interchange location at which a first UAV of the plurality of UAVs exchanges a package with a second UAV of the plurality of UAVs. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a computer processor to cause the computer processor to perform a method comprising:
-
receiving data for each of a plurality of unmanned aerial vehicles (UAVs), the data including a UAV identifier, current geographic location, and final destination of each UAV; calculating a plurality of permutations of travel routes for each of the UAVs, the proposed travel routes calculated as a function of the current geographic location of each of the plurality of UAVs and the final destinations of the plurality of UAVs; applying a selected variable to the calculated a-plurality of permutations to produce proposed travel routes for the plurality of UAVs, wherein the selected variable is configured to minimize an idle time for the plurality of UAVs, wherein the idle time is time that each of the plurality of UAVs are not actively engaged in a package delivery or pick-up service; and generating a routing plan from the proposed travel routes, wherein at least one of the proposed travel routes includes an interchange location at which a first UAV of the plurality of UAVs exchanges a package with a second UAV of the plurality of UAVs. - View Dependent Claims (16)
-
Specification