IP Library Granted Patent US 12,282,872
Granted Patent B2
US 12,282,872 · App. 17/386,332 · Granted Apr 22, 2025

Real-time carpool coordinating system

Inventors: Richard T. Lord (Gig Harbor, WA); Robert W. Lord (Seattle, WA); Nathan P. Myhrvold (Medina, WA); Clarence T. Tegreene (Mercer Island, WA)
Assignee: Uber Technologies, Inc.
G06Q10/047G06Q10/06311G06Q50/40
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,282,872
App. No.
17/386,332
Granted
Apr 22, 2025
Kind
B2
Abstract

A computing system determines that a transportation vehicle is transporting a first end user to a first destination location. Based on a set of factors, the system determines that a driver of the transportation vehicle is able to travel to a rendezvous location to rendezvous with a second end user while the transportation vehicle is progressing to the first destination location along an original route. The system determines an alternate route for the transportation vehicle to travel to the rendezvous location that satisfies the set of factors, and directs the driver of the transportation vehicle to the rendezvous location to rendezvous with the second end user along the alternate route.

Claims (37)

1. A computing system comprising:

one or more processors; and

a memory storing instructions that, when executed by the one or more processors, cause the computing system to:

determine that a transportation vehicle is transporting a first end user to a first destination location;

while the transportation vehicle is transporting the first end user to the first destination location, determine, based on a set of factors, that the transportation vehicle is able to (i) travel to a rendezvous location along an alternative route to rendezvous with a second end user, and (ii) transport the second end user to a second destination location;

wherein the set of factors including an estimated delay time incurred in transporting the first end user to the first destination location and resulting from transporting the second end user; and

direct the transportation vehicle to the rendezvous location to rendezvous with the second end user along the alternate route.

2. The computing system of claim 1 , wherein the processor includes circuity associated with each operation and the computer system is a smartphone, table computer, or other personal computer.

3. The computing system of claim 1 , wherein the set of factors include:

a carpooling preference of either the first end user or of a driver of the transportation vehicle.

4. The computing system of claim 1 , wherein the set of factors include a requirement that the transportation vehicle is more than a predefined distance or travel time from the first destination location.

5. The computing system of claim 1 , wherein the set of factors include a travel time or distance for traveling to the rendezvous location to rendezvous with the second end user using the alternative route.

6. The computing system of claim 5 , wherein the travel time or distance is based on (i) a first travel time from a current location of the transportation vehicle to the rendezvous location, and (ii) a second travel time from the rendezvous location to the first destination location, and wherein the executed instructions cause the computing system to determine that the first and second travel times do not exceed the maximum time delay.

7. The computing system of claim 1 , wherein the executed instructions further cause the computing system to:

provide a discounted transport rate for first end user for allowing the transportation vehicle to transport the second end user while also transporting the first end user.

8. A non-transitory computer readable medium storing instructions that, when executed by one or more processors, cause the one or more processors to:

determine that a transportation vehicle is transporting a first end user to a first destination location;

while the transportation vehicle is transporting the first end user to the first destination location, determine, based on a set of factors, that the transportation vehicle is able to (i) travel to a rendezvous location along an alternative route to rendezvous with a second end user, and (ii) transport the second end user to a second destination location;

wherein the set of factors including an estimated delay time incurred in transporting the first end user to the first destination location and resulting from transporting the second end user; and

direct the transportation vehicle to the rendezvous location to rendezvous with the second end user along the alternate route.

9. The non-transitory computer readable medium of claim 8 , wherein the one or more processors include circuity associated with each operation and are included in a smartphone, table computer, or other personal computer.

10. The non-transitory computer readable medium of claim 8 , wherein the set of factors include a carpooling preference of either the first end user or of a driver of transportation vehicle.

11. The non-transitory computer readable medium of claim 8 , wherein the set of factors include a requirement that the transportation vehicle is more than a predefined distance or travel time from the first destination location.

12. The non-transitory computer readable medium of claim 8 , wherein the set of factors include a travel time or distance for traveling to the rendezvous location to rendezvous with the second end user using the alternative route.

13. The non-transitory computer readable medium of claim 12 , wherein the travel time or distance is based on (i) a first travel time from a current location of the transportation vehicle to the rendezvous location, and (ii) a second travel time from the rendezvous location to the first destination location, and wherein the executed instructions cause the one or more processors to determine that the first and second travel times do not exceed the maximum time delay.

14. The non-transitory computer readable medium of claim 8 , wherein the executed instructions further cause the one or more processors to:

provide a discounted transport rate for first end user for allowing the transportation vehicle to transport the second end user while also transporting the first end user.

15. A computer-implemented method of facilitating transport, the method being performed by one or more processors and comprising:

determining that a transportation vehicle is transporting a first end user to a first destination location;

while the transportation vehicle is transporting the first end user to the first destination location, determining, based on a set of factors, that the transportation vehicle is able to (i) travel to a rendezvous location along an alternative route to rendezvous with a second end user, and (ii) transport the second end user to a second destination location; while the transportation vehicle is progressing to the first destination location along an original route;

wherein the set of factors including an estimated delay time incurred in transporting the first end user to the first destination location and resulting from transporting the second end user; and

directing the transportation vehicle to the rendezvous location to rendezvous with the second end user along the alternate route.

16. The method of claim 15 , wherein the one or more processors include circuity associated with each operation and are included in a smartphone, table computer, or other personal computer.

17. The method of claim 15 , wherein the set of factors include a carpooling preference of either the first end user or of a driver of the transportation vehicle.

18. The method of claim 15 , wherein the set of factors include a requirement that the transportation vehicle is more than a predefined distance or travel time from the first destination location.

19. The method of claim 15 , wherein the set of factors include a travel time or distance for traveling to the rendezvous location to rendezvous with the second end user using the alternative route.

20. The method of claim 19 , wherein the travel time or distance is based on (i) a first travel time from a current location of the transportation vehicle to the rendezvous location, and (ii) a second travel time from the rendezvous location to the first destination location, and further comprising determining that the first and second travel times do not exceed the maximum time delay.

Continuity (19)
Continuation 16414711 · May 16, 2019
Continuation 15889117 · Feb 5, 2018
Continuation 14597631 · Jan 15, 2015
Continuation 14596904 · Jan 14, 2015
Continuation In Part 14318182 · Jun 27, 2014
Continuation In Part 14329451 · Jul 11, 2014
Continuation 14328002 · Jul 10, 2014
Continuation In Part 14456627 · Aug 11, 2014
Continuation 14455534 · Aug 8, 2014
Continuation In Part 14476042 · Sep 3, 2014
Continuation 14474587 · Sep 2, 2014
Continuation In Part 14511706 · Oct 10, 2014
Continuation 14510383 · Oct 9, 2014
Continuation In Part 14537313 · Nov 10, 2014
Continuation 14536967 · Nov 10, 2014
Continuation In Part 14564358 · Dec 9, 2014
Continuation 14563134 · Dec 8, 2014
Provisional Application 61989394 · May 6, 2014
Related Publication 20210365848A1 · Nov 25, 2021
References Cited (201)
US 5557522A · Nakayama · 1996 [cited by applicant]
US 5948040A · DeLorme · 1999 [cited by applicant]
US 6058339A · Takiguchi · 2000 [cited by applicant]
US 6233517B1 · Froeberg · 2001 [cited by applicant]
US 6321158B1 · DeLorme · 2001 [cited by applicant]
US 6608566B1 · Davis · 2003 [cited by applicant]
US 6756913B1 · Ayed · 2004 [cited by applicant]
US 6832092B1 · Suarez · 2004 [cited by applicant]
US 7062376B2 · Oesterling · 2006 [cited by applicant]
US 7263437B2 · Hirose · 2007 [cited by applicant]
US 7957871B1 · Echeruo · 2011 [cited by applicant]
US 7970749B2 · Uhlir · 2011 [cited by applicant]
US 8412667B2 · Zhang · 2013 [cited by applicant]
US 8630987B2 · Dhuse · 2014 [cited by applicant]
US 8843307B1 · Kolodziej · 2014 [cited by applicant]
US 8954094B1 · Mishra · 2015 [cited by applicant]
US 9070101B2 · Abhayanker · 2015 [cited by applicant]
US 9075136B1 · Joao · 2015 [cited by applicant]
US 9127946B1 · Menon · 2015 [cited by applicant]
US 9172738B1 · daCosta · 2015 [cited by applicant]
US 9244147B1 · Soundararajan · 2016 [cited by applicant]
US 9610893B2 · Lopez-Hinojosa · 2017 [cited by examiner]
US 9886667B2 · Lord · 2018 [cited by applicant]
US 9911170B2 · Kim · 2018 [cited by applicant]
US 10002333B2 · Lord · 2018 [cited by applicant]
US 10074065B2 · Jones · 2018 [cited by applicant]
US 10152053B1 · Smith · 2018 [cited by applicant]
US 10178890B1 · Andon · 2019 [cited by applicant]
US 10328855B2 · Lopez-Hinojosa · 2019 [cited by examiner]
US 10572964B2 · Kim · 2020 [cited by applicant]
US 10721327B2 · Cheng · 2020 [cited by applicant]
US 11196838B2 · Cheng · 2021 [cited by applicant]
US 11441921B2 · Vereshchagin · 2022 [cited by applicant]
US 11551325B2 · Tolkin · 2023 [cited by applicant]
US 11924308B2 · Cheng · 2024 [cited by applicant]
US 20020044186A1 · Tochihara · 2002 [cited by applicant]
US 20030040944A1 · Hileman · 2003 [cited by applicant]
US 20030058082A1 · Mallick · 2003 [cited by applicant]
US 20040158483A1 · Lecouturier · 2004 [cited by examiner]
US 20040249818A1 · Isaac · 2004 [cited by applicant]
US 20050004757A1 · Neeman · 2005 [cited by applicant]
US 20050021227A1 · Matsumoto · 2005 [cited by applicant]
US 20050227704A1 · Ferra · 2005 [cited by applicant]
US 20050278063A1 · Hersh · 2005 [cited by applicant]
US 20060023569A1 · Agullo · 2006 [cited by applicant]
US 20060034201A1 · Umeda · 2006 [cited by applicant]
US 20060059023A1 · Mashinsky · 2006 [cited by applicant]
US 20060155460A1 · Raney · 2006 [cited by applicant]
US 20060173841A1 · Bill · 2006 [cited by applicant]
US 20060184341A1 · Couckuyt · 2006 [cited by applicant]
US 20070150375A1 · Yang · 2007 [cited by applicant]
US 20080033633A1 · Akiyoshi · 2008 [cited by applicant]
US 20080195428A1 · O'Sullivan · 2008 [cited by applicant]
US 20080270019A1 · Anderson · 2008 [cited by applicant]
US 20080277183A1 · Huang · 2008 [cited by applicant]
US 20090156241A1 · Staffaroni · 2009 [cited by applicant]
US 20090176508A1 · Lubeck · 2009 [cited by applicant]
US 20090192851A1 · Bishop · 2009 [cited by applicant]
US 20090216600A1 · Hill · 2009 [cited by applicant]
US 20090235176A1 · Jayanthi · 2009 [cited by applicant]
US 20090248587A1 · Van Buskirk · 2009 [cited by applicant]
US 20090296990A1 · Holland · 2009 [cited by applicant]
US 20100070168A1 · Sumcad · 2010 [cited by applicant]
US 20100074383A1 · Lee · 2010 [cited by applicant]
US 20100207812A1 · Demirdjian · 2010 [cited by applicant]
US 20100280853A1 · Petralia · 2010 [cited by applicant]
US 20110099040A1 · Felt · 2011 [cited by applicant]
US 20110145089A1 · Khunger · 2011 [cited by applicant]
US 20110153629A1 · Lehmann et al. · 2011 [cited by applicant]
US 20110238755A1 · Khan · 2011 [cited by applicant]
US 20110301997A1 · Gale et al. · 2011 [cited by applicant]
US 20120004840A1 · Lee · 2012 [cited by applicant]
US 20120023294A1 · Resnick · 2012 [cited by applicant]
US 20120041675A1 · Juliver · 2012 [cited by applicant]
US 20120239289A1 · Gontmakher · 2012 [cited by applicant]
US 20120253548A1 · Davidson · 2012 [cited by applicant]
US 20120265580A1 · Kobayashi · 2012 [cited by applicant]
US 20120253654A1 · Sun · 2012 [cited by applicant]
US 20120290950A1 · Rapaport · 2012 [cited by applicant]
US 20130024249A1 · Zohar · 2013 [cited by applicant]
US 20130046456A1 · Scofield · 2013 [cited by applicant]
US 20130054281A1 · Thakkar · 2013 [cited by applicant]
US 20130073327A1 · Edelberg · 2013 [cited by applicant]
US 20130110392A1 · Kosseifi · 2013 [cited by applicant]
US 20130132140A1 · Amin · 2013 [cited by applicant]
US 20130144831A1 · Atlas · 2013 [cited by applicant]
US 20130159028A1 · Lerenc · 2013 [cited by examiner]
US 20130215843A1 · Diachina · 2013 [cited by applicant]
US 20140074536A1 · Meushar · 2014 [cited by applicant]
US 20140082069A1 · Varoglu et al. · 2014 [cited by applicant]
US 20140129951A1 · Amin · 2014 [cited by applicant]
US 20140149441A1 · Wang · 2014 [cited by applicant]
US 20140172727A1 · Abhayanker · 2014 [cited by applicant]
US 20140378159A1 · Dolbakian · 2014 [cited by applicant]
US 20150006072A1 · Goldberg · 2015 [cited by applicant]
US 20150045068A1 · Soffer · 2015 [cited by applicant]
US 20150055178A1 · Ishibashi · 2015 [cited by applicant]
US 20150073645A1 · Davidsson · 2015 [cited by applicant]
US 20150161564A1 · Sweeney · 2015 [cited by applicant]
US 20150161698A1 · Jones · 2015 [cited by applicant]
US 20150204684A1 · Rostamian · 2015 [cited by applicant]
US 20150248689A1 · Paul · 2015 [cited by applicant]
US 20150254581A1 · Brahme · 2015 [cited by applicant]
US 20150262430A1 · Farrelly · 2015 [cited by applicant]
US 20150323330A1 · Lord · 2015 [cited by applicant]
US 20150324718A1 · Lord · 2015 [cited by applicant]
US 20150325128A1 · Lord · 2015 [cited by applicant]
US 20150339923A1 · Godafoss · 2015 [cited by applicant]
US 20150339928A1 · Ramanujam · 2015 [cited by applicant]
US 20160019496A1 · Gorlin · 2016 [cited by applicant]
US 20160026936A1 · Richardson · 2016 [cited by applicant]
US 20160027306A1 · Lambert · 2016 [cited by applicant]
US 20160132792A1 · Rosnow · 2016 [cited by applicant]
US 20160320195A1 · Liu · 2016 [cited by applicant]
US 20160321771A1 · Liu · 2016 [cited by applicant]
US 20160364678A1 · Cao · 2016 [cited by applicant]
US 20160364679A1 · Cao · 2016 [cited by applicant]
US 20160364812A1 · Cao · 2016 [cited by applicant]
US 20160364823A1 · Cao · 2016 [cited by applicant]
US 20160370194A1 · Colijn · 2016 [cited by applicant]
US 20170083832A1 · Williams · 2017 [cited by applicant]
US 20170115125A1 · Outwater · 2017 [cited by applicant]
US 20170126837A1 · Wang · 2017 [cited by applicant]
US 20170147959A1 · Sweeney · 2017 [cited by applicant]
US 20170169535A1 · Tolkin · 2017 [cited by applicant]
US 20170193404A1 · Yoo · 2017 [cited by applicant]
US 20170240098A1 · Sweeney · 2017 [cited by applicant]
US 20170255881A1 · Ritch · 2017 [cited by applicant]
US 20170263120A1 · Durie, Jr. · 2017 [cited by applicant]
US 20170270794A1 · Sweeney · 2017 [cited by applicant]
US 20170308824A1 · Lord · 2017 [cited by applicant]
US 20170314948A1 · Tsuneyama et al. · 2017 [cited by applicant]
US 20170365030A1 · Shoham · 2017 [cited by applicant]
US 20180005145A1 · Lo · 2018 [cited by applicant]
US 20180060838A1 · Agrawal · 2018 [cited by applicant]
US 20180091604A1 · Yamashita · 2018 [cited by applicant]
US 20180101925A1 · Brinig · 2018 [cited by applicant]
US 20180156623A1 · West · 2018 [cited by applicant]
US 20180211351A1 · Kim · 2018 [cited by applicant]
US 20180285846A1 · Oesterling · 2018 [cited by applicant]
US 20180339714A1 · Smid · 2018 [cited by applicant]
US 20180342035A1 · Sweeney · 2018 [cited by applicant]
US 20180356239A1 · Marco · 2018 [cited by applicant]
US 20180374350A1 · Sweeney · 2018 [cited by applicant]
US 20190130764A1 · Karani · 2019 [cited by applicant]
US 20190137288A1 · Rahematpura · 2019 [cited by applicant]
US 20190244318A1 · Rajcok · 2019 [cited by applicant]
US 20190265703A1 · Hicok · 2019 [cited by applicant]
US 20190272486A1 · Lord · 2019 [cited by applicant]
US 20200105140A1 · Wang · 2020 [cited by applicant]
US 20200211070A1 · Singh · 2020 [cited by applicant]
US 20200258344A1 · Brinig · 2020 [cited by applicant]
US 20200258386A1 · Lu · 2020 [cited by applicant]
US 20200273337A1 · Sweeney · 2020 [cited by applicant]
US 20200322451A1 · Cheng · 2020 [cited by applicant]
US 20210337047A1 · Cheng · 2021 [cited by applicant]
US 20210364300A1 · Rahematpura · 2021 [cited by applicant]
US 20210365848A1 · Lord · 2021 [cited by examiner]
US 20210407032A1 · Kim · 2021 [cited by applicant]
US 20220223043A1 · Sweeney · 2022 [cited by applicant]
US 20220412748A1 · Lord · 2022 [cited by applicant]
US 20230044882A1 · Lord · 2023 [cited by applicant]
CA 2604321 · 2006 [cited by applicant]
DE 10201607712 · 2016 [cited by applicant]
EP 2708850 · 2014 [cited by applicant]
GB 2501075 · 2013 [cited by applicant]
JP 2004302941 · 2004 [cited by applicant]
JP 2004362271 · 2004 [cited by applicant]
KR 1020060081193 · 2006 [cited by applicant]
KR 1020110132765 · 2011 [cited by applicant]
KR 1020130130978 · 2013 [cited by applicant]
KR 1020140023541 · 2014 [cited by applicant]
WO WO2002000694 · 2002 [cited by applicant]
WO WO20020006994 · 2002 [cited by applicant]
WO WO2011120161 · 2011 [cited by applicant]
Fawcett, Supporting human interaction with the Sentient vehicle, 2002, IEEE, p. 307-312 (Year: 2002). [cited by examiner]
Koscher et al., Experimental Security Analysis of a Modern Automobile, 2010, IEEE, p. 447-462 (Year: 2010). [cited by examiner]
Müter et al., A structured approach to anomaly detection for in-vehicle networks, 2010, IEEE, p. 92-98 (Year: 2010). [cited by examiner]
Rathore et al., Integrating biometric sensors into automotive Internet of Things, 2014, IEEE, p. 178-181 (Year: 2014). [cited by examiner]
Exam Report No. 1 in AU 2016366687 dated Oct. 6, 2021. [cited by applicant]
Office Action in EP 17771000.1 dated Aug. 23, 2021. [cited by applicant]
Fay et al., Decentralizing routing control for guided transportation systems, 2008 IEEE. [cited by applicant]
Vaqar et al, Smart Protocol for Communication in Mobile Ad Hoc Networks of Vehicles, 2007, IEEE, p. 1-6. [cited by applicant]
Fay et al, Decentralized control strategies for transpotation systems, 2005, IEEE p. 898-903. [cited by applicant]
Dessouky, et al, Real-time scheduling rules for demand responsive transit systems, 1998 IEEE pp. 2956-2961. [cited by applicant]
Pelzer, et al., “A Partition-Based Match Making Algorithm for Dynamic Ridesharing”, IEEE Transactions on Intelligent Transportation Systems, vol. 16, Issue: 5, pp. 2587-2596 (2015). [cited by applicant]
Andrew J. Hawkins, Lyft is now suggesting more convenient pickup locations, because a little walking won't kill you. Jun. 26, 2017 The Verge (www.theverge.com). [cited by applicant]
Amey, Utilizing Mobile Phone Technology to Improve Rideshare Services, 2011 Transportation Research Board Annual Meeting. [cited by applicant]
Fougeres, A push service for carpooling, 2012 IEEE International Conference on Green Computing and Communications, Conference on Internet of Things, and on Cubler, Physical and Social Computing, 2012. [cited by applicant]
Megalingam, Automated Wireless Carpooing System for an Eco-Friendly Travel, 2011 IEEE. [cited by applicant]
Dillenburg, The Intelligent Travel Assistant, IEEE 5 [cited by applicant]
Guc, Real-time, Scalable Route Planning using a Stream-Processing Infrastructure, 2010 13th International IEEE, Annual Conference on Intelligent Transport Systems, Madeira Island, Portugal ,Sep. 19-22, 2010. [cited by applicant]
Lalos, A Framework for dynamic car and taxi pools with the use of Positioning Systems, 2009 Computation World: Future Computing, Service Computation, Congitive, Adaptive, Content, Patterns 2009. [cited by applicant]
Shahzada, Dynamic Vehicle Navigation: an A* Algorithm Based Approach Using Traffic and Road Information, 2011 International Conference on Computer Applications and Industrial Electronics, (ICCAIE 2011). [cited by applicant]
Boufaied, A Diagnostic Approach for Advanced Tracking of Commercial Vehicles with Time Window Constraints, IEEE Transactions on Intelligent Systems, vol. 14, No. 3, Sep. 2013. [cited by applicant]
Vaughan-Nichols, Will Mobile Computing's Future be Location, Location, Location? Industry Trends, IEEE Computer Society, 2009 IEEE. [cited by applicant]
Exam Report No. 2 in AU 2017328067 dated Jan. 20, 2022. [cited by applicant]
Office Action in KR 10-2016-7034177 dated Mar. 30, 2022. [cited by applicant]
Office Action in CA 3017638 dated Jun. 22, 2022. [cited by applicant]
Office Action in CA 3017822 dated Jun. 1, 2022. [cited by applicant]
Fang, Zhihan, MAC: Measuring the Impacts of Anomalies on Travel Time of Multiple Transportation Systems, Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. 3, 2, Article 42 (Jun. 2019), 24 pages. [cited by applicant]