Estimating wait times for requests
US-2018217855-A1 · Aug 2, 2018 · US
US10922635B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10922635-B2 |
| Application number | US-201615563582-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 27, 2016 |
| Priority date | Sep 29, 2015 |
| Publication date | Feb 16, 2021 |
| Grant date | Feb 16, 2021 |
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.
A system ( 100 ) may include a computer-readable storage medium ( 220 ) configured to store a first set of instructions for determining one or more candidate driver terminals ( 140 ) to accept a service request; and a processor ( 210 ) in communication with the computer-readable storage medium ( 220 ), wherein when executing the first set of instructions, the processor ( 210 ) is directed to: establish a communication with a passenger terminal ( 130 ); obtain a service request including a position of the passenger terminal ( 130 ) from the passenger terminal ( 410 ); determine a wireless fidelity (WiFi) station based on the position of the passenger terminal ( 420 ); determine one or more driver terminals ( 140 ) that access the WiFi station ( 430 ); determine an access instance of each of the one or more driver terminals ( 440 ); and determine one or more candidate driver terminals ( 140 ) among the one or more driver terminals ( 140 ) based on the one or more access instances of the one or more driver terminals ( 450 ).
Opening claim text (preview).
The invention claimed is: 1. A system for scheduling vehicles, comprising: at least one computer-readable storage medium including a first set of instructions for determining one or more candidate driver terminal to accept a service request; and at least one processor in communication with the computer-readable storage medium, wherein when executing the first set of instructions, the processor is directed to: establish a communication with a passenger terminal; receive first electrical signals encoding a service request including a position of the passenger terminal from the passenger terminal; determine a wireless fidelity (WiFi) station based on the position of the passenger terminal; determine one or more driver terminals that access the WiFi station wherein the one or more driver terminals have difficulty in accessing mobile data and communicate with the system via the WiFi station; determine a waiting duration of each of the one or more driver terminals, wherein the waiting duration of a driver is a time interval between a current time point and a WiFi access time point that the driver accesses the WiFi station; and determine one or more candidate driver terminals among the one or more driver terminals and a scheduling priority for each of the one or more candidate driver terminal based on the one or more waiting duration of the one or more driver terminals, wherein the longer of a waiting duration of a candidate driver terminal, the higher scheduling priority of the candidate driver terminal. 2. The system of claim 1 , wherein the service request includes at least one of a starting point, a destination, or an identifier of the passenger terminal. 3. The system of claim 1 , wherein to determine the WiFi station based on the position of the passenger terminal, the at least one processor is further directed to: determine one or more local WiFi stations within a range around the position of the passenger terminal; determine one or more positions of the one or ore local WiFi stations, wherein each position corresponds to a local WiFi station; for each of the one or more local WiFi stations, determine a distance between the local WiFi station and the passenger terminal based on the position of the passenger terminal and the position of the local WiFi station; and determine the WiFi station among the one or more local WiFi stations, wherein the WiFi station is at a shortest distance from the passenger terminal. 4. The system of claim 1 , wherein to determine the one or more driver terminals that access the WiFi station, the at least one processor is further directed to: obtain an identifier for each of a plurality of registered driver terminals; determine a white list of the plurality of registered driver terminals based on the plurality of identifiers of the plurality of registered driver terminals; and determine the one or more driver terminals that access the WiFi station based on the white list. 5. The system of claim 1 , wherein to determine the waiting duration of each of the one or more driver terminals, the at least one processor is further directed to: obtain an identifier for each of the one or more driver terminals that access the WiFi station; determine the WiFi access time point that each of the one or more driver terminals accesses the WiFi station; and determine the waiting duration of each of the one or more driver terminal based on the WiFi access time point thereof and the current time point. 6. The system of claim 1 , wherein to determine the one or more candidate driver terminals, the at least one processor is further directed to: determine one or more rankings of the one or more driver terminals based on the one or more waiting durations, wherein each ranking is associated with a driver terminal; and determine the one or more candidate driver terminals based on the one or more rankings. 7. The system of claim 1 , wherein to determine the one or more candidate driver terminals, the at least one processor is further directed to, for each of the one or more driver terminals, determine whether the waiting duration is greater than a threshold; and when the waiting duration is greater than the threshold, determine the driver terminal as the candidate driver terminal. 8. The system of claim 7 , wherein when there are a plurality of driver terminals having waiting durations larger than the threshold, the at least one processor is further directed to: determine a ranking of the plurality of driver terminals that have the waiting duration greater than the threshold; and select top-ranked driver terminals from the plurality of driver terminals as the one or more candidate driver terminals. 9. The system of claim 1 , wherein the computer-readable storage medium further includes a second set of instructions for broadcasting a current service request, wherein when the at least one processor executes the second set of instructions, the at least one processor is further directed to: generate and send second electrical signals encoding the service request to the one or more candidate driver terminals; and receive third electrical signals encoding at least one acceptance of the service request from the one or more candidate driver terminals. 10. The system of claim 9 , wherein the at least one processor is further directed to: generate fourth electrical signals encoding the at least one acceptance of the service request from the one or more candidate driver terminals to the passenger terminal. 11. A method for scheduling vehicles, implemented on a computing device having at least one processor, at least one computer-readable storage medium, and a communication platform connected to a network, comprising: establishing a communication between the computing device and a passenger terminal; receiving first electrical signals encoding a service request including a position of the passenger terminal from the passenger terminal; determining a wireless fidelity (WiFi) station based on the position of the passenger terminal; determining one or more driver terminals that access the WiFi station, wherein the one or more driver terminals have difficulty in accessing mobile data and communicate with the system via the WiFi station; determining a waiting duration for each of the one or more driver terminals, wherein the waiting duration of a driver is a time interval between a current time point and a WiFi access time point that the driver accesses the WiFi station; and determining one or more candidate driver terminals among the one or more driver terminals and a scheduling priority for each of the one or more candidate driver terminal based on the one or more waiting duration of the one or more driver terminals, wherein the longer of a waiting duration of a candidate driver terminal, the higher scheduling priority of the candidate driver terminal. 12. The method of claim 11 , wherein the service request includes at least one of a starting point, a destination, or an identifier of the passenger terminal. 13. The method of claim 11 , wherein determining the WiFi station based on the position of the passenger terminal includes: determining one or more local WiFi stations within a range around the position of the passenger terminal; determining position of the one or more local WiFi stations, wherein each position corresponds to a local WiFi station; for each of the one or more local WiFi stations, determining a distance between the local WiFi station and the passenger terminal based on the position of the passenger terminal and the local WiFi station; and determining the WiFi station among the one or more local WiFi
Government or public services (business processes related to the transportation industry G06Q50/40) · CPC title
Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling · CPC title
Dispatching vehicles on the basis of a location, e.g. taxi dispatching · CPC title
including pedestrian guidance indicator · CPC title
using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.