US2021142281A1PendingUtilityA1

Logistical Management System

Assignee: AIRSPACE TECH INCPriority: Nov 12, 2019Filed: Mar 27, 2020Published: May 13, 2021
Est. expiryNov 12, 2039(~13.3 yrs left)· nominal 20-yr term from priority
G01C 21/3461G06Q 10/063114G06Q 10/0834G06Q 10/06315G06Q 10/06312G06Q 10/087G06Q 10/0833G06Q 10/08355G06Q 10/08345G01C 21/3446G06Q 50/30G06Q 50/40
66
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Disclosed herein are system, method, and computer program product embodiments for managing a user request for a transport of good. An embodiment operates by receiving a user request for the transport of the good from a pickup location to a destination location. After receiving the user request, a pickup and destination node is identified from a pre-generated graph of nodes. Subsequently, a transit cost for the pickup location or the destination location is determined. Based on the lowest transit cost, a preferred route among possible routes from the pickup location is generated. Thereafter, a transporter arrival time related to the pickup location and/or an intermediate location is determined based on the preferred route, and a transporter to pick up the good from the pickup location or the intermediate location is assigned and tracked during the transporting of the good.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A computer-implemented method for managing a user request for a transport of a good, comprising:
 receiving the user request for the transporting of the good from a pickup location to a destination location, wherein the user request corresponds to a job for the transporting of the good;   identifying a pickup node and a destination node on a pre-generated graph representing the pickup location and the destination location, respectively;   determine a transit cost of at least one of the pickup location and the destination location;   generating a preferred route from a plurality of possible routes from the pickup location to the destination location having a lowest transit cost of transporting the good based on the pickup node, the destination node, and the transportation cost;   deriving a transporter arrival time related to at least one of the pickup location or an intermediate location based on the preferred route;   assigning a transporter to pick up the good from the pickup location or the intermediate location; and   after the transporter is assigned to pick up the good, tracking the tracking transporter in picking up the good from the pickup location or the intermediate location based on the transporter arrival time.   
     
     
         2 . The computer-implemented method of  claim 1 , further comprising:
 receiving a user-selected transport type for the transport of the good,   wherein at least one of the preferred route and the transporter arrival time is based on the user-selected transport type.   
     
     
         3 . The computer-implemented method of  claim 2 , further comprising:
 assigning the job to a group of authorized users based on the user-selected transport type.   
     
     
         4 . The computer-implemented method of  claim 1 , further comprising:
 assigning the job to a group of authorized users based on a type of the good.   
     
     
         5 . The computer-implemented method of  claim 1 , further comprising:
 receiving a selection of the job from a particular authorized user of a group of authorized users; and   assigning the job to the particular authorized user.   
     
     
         6 . The computer-implemented method of  claim 5 , further comprising:
 receiving a selection of the job from a second authorized user of the group of authorized such that the particular authorized and the second authorized can both work on the job.   
     
     
         7 . The computer-implemented method of  claim 5 , further comprising:
 receiving a transporter arrival time modification from the particular authorized user; and   modifying the transporter arrival time based on the transporter arrival time modification.   
     
     
         8 . The computer-implemented method of  claim 5 , further comprising:
 receiving a new transporter selection for the job from the particular authorized user; and   assigning the new transporter to the job.   
     
     
         9 . The computer-implemented method of  claim 5 , further comprising:
 receiving a task assignment for the transporter from the particular authorized user; and   sending the task assignment to the transporter.   
     
     
         10 . The computer-implemented method of  claim 9 , further comprising:
 receiving a specified reward for completing the task assignment from the particular authorized user; and   presenting the specified reward to the transporter after completion of the job.   
     
     
         11 . A system, comprising:
 a memory; and   a processor in communication with the memory and configured to:
 receive a user request for a transporting of a good from a pickup location to a destination location, wherein the user request corresponds to a job for the transporting of the good; 
 identify a pickup node and a destination node on a pre-generated graph representing the pickup location and the destination location, respectively; 
 determine a transit cost of at least one of the pickup location and the destination location; 
 generate a preferred route from a plurality of possible routes from the pickup location to the destination location having a lowest transit cost of transporting the good based on the pickup node, the destination node, and the transit cost; 
 derive a transporter arrival time related to at least one of the pickup location and the destination location based on the preferred route; 
 assign a transporter to pick up the good from the pickup location or the intermediate location; and 
 after the transporter is assigned to pick up the good, track the tracking transporter in picking up the good from the pickup location or the intermediate location based on the transporter arrival time. 
   
     
     
         12 . The system of  claim 11 , the processor further configured to:
 receive a user-selected transport type for the good; and   assign the job to a group of authorized users based on the user-selected type of delivery,   wherein at least one of the preferred route and the transporter arrival time is based on the user-selected transport type.   
     
     
         13 . The system of  claim 11 , the processor further configured to:
 assign the job to a group of authorized users based on a type of the good.   
     
     
         14 . The system of  claim 11 , the processor further configured to:
 receive a selection of the job from a particular authorized user of a group of authorized users; and   assign the job to the particular authorized user.   
     
     
         15 . The system of  claim 14 , the processor further configured to:
 receive a selection of the job from a second authorized user of the group of authorized users such that the particular authorized user and the second authorized user are each assigned the job.   
     
     
         16 . The system of  claim 15 , the processor further configured to:
 receiving a transporter arrival time modification from the particular authorized user; and   modifying the transporter arrival time based on the transporter arrival time modification.   
     
     
         17 . The system of  claim 15 , the processor further configured to:
 receiving a new transporter selection for the job from the particular authorized user; and   assigning the new transporter to the job.   
     
     
         18 . The system of  claim 15 , the processor further configured to:
 receiving a task assignment for the transporter from the particular authorized user; and   sending the task assignment to the transporter.   
     
     
         19 . The system of  claim 18 , the processor further configured to:
 receiving a specified reward for completing the task assignment from the particular authorized user; and   presenting the specified reward to the transporter after completion of the job.   
     
     
         20 . A computer-readable storage device having instructions stored thereon, execution of which, by a processing device, causes the processing device to perform operations comprising:
 receiving a user request for a transporting of a good from a pickup location to a destination location, wherein the user request corresponds to a job for the transporting of the good;   identifying a pickup node and a destination node on a pre-generated graph representing the pickup location and the destination location, respectively;   determining a transit cost relating to at least one of the pickup location and the destination location;   generating a preferred route from a plurality of possible routes from the pickup location to the destination location having a lowest transit cost of transporting the good based on the pickup node, the destination node, and the transportation cost;   deriving a transporter arrival time related to at least one of the pickup location and the destination location based on the preferred route;   assigning a transporter to pick up the good from the pickup location or the intermediate location; and   after the transporter is assigned to pick up the good, tracking the tracking transporter in picking up the good from the pickup location or the intermediate location based on the transporter arrival time.

Join the waitlist — get patent alerts

Track US2021142281A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.