Casual driver ride sharing
US-10634510-B2 · Apr 28, 2020 · US
US11549818B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11549818-B2 |
| Application number | US-202016859773-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 27, 2020 |
| Priority date | Mar 29, 2016 |
| Publication date | Jan 10, 2023 |
| Grant date | Jan 10, 2023 |
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 for casual driver ride sharing includes an interface and processor. The interface is to receive a request for a ride from a user, wherein the request includes GPS information for the user. The processor is to determine compatibility between the typical route information and the request for the ride; determine a ranked list based at least in part on the compatibility; and provide a ride offer to a driver of the one or more casual drivers based at least in part on the ranked list.
Opening claim text (preview).
We claim: 1. A method, comprising: receiving, by a ride matching system, a transportation request comprising a pickup location and a destination location; determining a route associated with a driver system based on stored location information generated by a location device of the driver system over time; determining a compatibility between the transportation request and the determined route associated with the driver system, wherein determining the compatibility comprises: determining an extra distance added to the determined route as a result of the transportation request; comparing the extra distance added to the determined route as a result of the transportation request to an extra distance threshold; determining an extra time added to the determined route as a result of the transportation request; and comparing the extra time added to the determined route as a result of the transportation request to an extra time threshold; ranking the driver system based at least in part on the compatibility between the transportation request and the determined route associated with the driver system; and matching, by the ride matching system, the transportation request to the driver system based at least in part on the ranking to connect a rider of the transportation request to a driver of the driver system. 2. The method of claim 1 , wherein the ranking comprises ranking a plurality of driver systems comprising the driver system. 3. The method of claim 2 , wherein ranking the plurality of driver systems comprises prioritizing at least one newly-activated driver system. 4. The method of claim 2 , wherein ranking the plurality of driver systems comprises: determining that at least one driver system is associated with an area or employer having a threshold number of drivers; and prioritizing the at least one driver system based on the at least one driver system being associated with the area or employer having a threshold number of drivers. 5. The method of claim 2 , wherein ranking the plurality of driver systems comprises: determining that at least one driver system is associated with a route having a threshold number of drivers; and prioritizing the at least one driver system based on the at least one driver system being associated with the route having a threshold number of drivers. 6. The method of claim 1 , further comprising causing the driver system to display a user interface comprising information associated with the extra distance and the extra time. 7. The method of claim 6 , wherein the user interface further comprises a map indicating the determined route and an additional route between the pickup location and the destination location. 8. A non-transitory computer readable storage medium comprising instructions that, when executed by at least one processor, cause a computing device to: receive a transportation request comprising a pickup location and a destination location; determine a route associated with a driver system based on stored location information generated by a location device of the driver system over time; determine a compatibility between the transportation request and the determined route associated with a driver system, wherein determining the compatibility comprises: determining an extra distance added to the determined route as a result of the transportation request; comparing the extra distance added to the determined route as a result of the transportation request to an extra distance threshold; determining an extra time added to the determined route as a result of the transportation request; and comparing the extra time added to the determined route as a result of the transportation request to an extra time threshold; rank the driver system based at least in part on the compatibility between the transportation request and the determined route associated with the driver system; and match the transportation request to the driver system based at least in part on the ranking to connect a rider of the transportation request to a driver of the driver system. 9. The non-transitory computer readable storage medium of claim 8 , wherein the ranking comprises ranking a plurality of driver systems comprising the driver system. 10. The non-transitory computer readable storage medium of claim 9 , wherein ranking the plurality of driver systems comprises prioritizing at least one newly- activated driver system. 11. The non-transitory computer readable storage medium of claim 9 , wherein ranking the plurality of driver systems comprises: determining that at least one driver system is associated with an area or employer having a threshold number of drivers; and prioritizing the at least one driver system based on the at least one driver system being associated with the area or employer having a threshold number of drivers. 12. The non-transitory computer readable storage medium of claim 9 , wherein ranking the plurality of driver systems comprises: determining that at least one driver system is associated with a route having a threshold number of drivers; and prioritizing the at least one driver system based on the at least one driver system being associated with the route having a threshold number of drivers. 13. The non-transitory computer readable storage medium of claim 8 , further comprising causing the driver system to display a user interface comprising information associated with the extra distance and the extra time. 14. The non-transitory computer readable storage medium of claim 13 , wherein the user interface further comprises a map indicating the determined route and an additional route between the pickup location and the destination location. 15. A system comprising: one or more memory devices; and one or more computing devices configured to: receive a transportation request comprising a pickup location and a destination location; determine a route associated with a driver system based on stored location information generated by a location device of the driver system over time; determine a compatibility between the transportation request and the determined route associated with a driver system, wherein determining the compatibility comprises: determining an extra distance added to the determined route as a result of the transportation request; comparing the extra distance added to the determined route as a result of the transportation request to an extra distance threshold; determining an extra time added to the determined route as a result of the transportation request; and comparing the extra time added to the determined route as a result of the transportation request to an extra time threshold; rank the driver system based at least in part on the compatibility between the transportation request and the determined route associated with the driver system; and match the transportation request to the driver system based at least in part on the ranking to connect a rider of the transportation request to a driver of the driver system. 16. The system of claim 15 , wherein the ranking comprises ranking a plurality of driver systems comprising the driver system. 17. The system of claim 16 , wherein the one or more computing devices are further configured to rank the plurality of driver systems by prioritizing at least one newly-activated driver system. 18. The system of claim 16 , wherein the one or more computing devices are further configured to rank the plurality of driver systems by: determining that at least one driver system is associated with an area or employer having a threshol
Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD] · CPC title
Determining position · CPC title
taking into account a variable factor such as distance or time, e.g. for passenger transport, parking systems or car rental systems (G07B15/06 takes precedence; taximeters G07B13/00; parking meters per se G07F17/24) · CPC title
Rendezvous; Ride sharing · CPC title
Dispatching vehicles on the basis of a location, e.g. taxi dispatching · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.