IP Library Granted Patent US 12,293,428
Granted Patent B2
US 12,293,428 · App. 18/418,947 · Granted May 6, 2025

Computer system arranging transport services for users based on the estimated time of arrival information

Inventors: Nuri Kim (San Francisco, CA); Christopher Haugli (San Francisco, CA); Rachel Lin (San Francisco, CA); Hasrat Godil (San Francisco, CA); Jeffrey Wolski (San Francisco, CA); Amos Barreto (San Francisco, CA)
Assignee: Uber Technologies, Inc.
G06Q50/40G06Q10/04
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,293,428
App. No.
18/418,947
Granted
May 6, 2025
Kind
B2
Abstract

A system can receive a request for transport from a computing device of a user while the user is riding a transit vehicle of a transit service, the request specifying a start location and a destination for the user. The system can determine an estimated time of arrival (ETA) of the transit vehicle to an arrival location that corresponds to the start location. The system can determine an ETA of a vehicle to the start location based on location data of the vehicle, and determine that the ETA of the vehicle to the start location is within a threshold amount of time of the ETA of the transit vehicle to the arrival location. The system can select the vehicle to service the request for the user, and transmit a transport invitation indicating the start location to the computing device associated with the vehicle.

Claims (46)

1. A computer system comprising:

one or more processors;

memory resources storing a set of instructions that, when executed by the one or more processors, cause the computer system to:

receive, over one or more networks, a request for transport from a computing device of a user while the user is riding a transit vehicle of a transit service, the request specifying a start location and a destination for the user;

based at least in part on a location of the transit vehicle, determine an estimated time of arrival (ETA) of the transit vehicle to an arrival location that corresponds to the start location;

receive, over the one or more networks, location data from a computing devices associated with a plurality of vehicles that is are available to transport the user from the start location to the destination;

for each vehicle of the plurality of vehicles, determine an ETA of the vehicle to the start location based on the location data of the vehicle;

initiate a request proxy module to optimize ETA matching between the plurality of vehicles and the transit vehicle by (i) determining that the ETA of a specified vehicle from the plurality of vehicles to the start location is within a threshold amount of time of the ETA of the transit vehicle to the arrival location, and (ii)

based at least in part on determining that the ETA of the specified vehicle to the start location is within a threshold amount of time of the ETA of the transit vehicle to the arrival location, automatically selecting the specified vehicle to service the request for the user; and

transmit, over the one or more networks, a transport invitation indicating the start location to the computing device associated with the specified vehicle.

2. The computer system of claim 1 , wherein the executed set of instructions further cause the computer system to:

receive a transit selection from the computing device of the user, the transit selection indicating a mode of transport for transporting the user to the arrival location that corresponds to the start location.

3. The computer system of claim 2 , wherein the executed set of instructions causes the computer system to further determine the ETA of the transit vehicle to the arrival location based on the transit selection.

4. The computer system of claim 1 , wherein the transit service comprises one of a train or a bus service, and wherein the arrival location comprises one of a train station or a bus station.

5. The computer system of claim 1 , wherein the executed set of instructions cause the computer system to repeatedly compare the ETA of the transit vehicle to the arrival location with the ETA of the specified vehicle to the start location based in part on a position of the specified vehicle relative to the start location.

6. The computer system of claim 5 , wherein the executed set of instructions causes the computer system to repeatedly compare the ETA of the transit vehicle to the arrival location and the ETA of the specified vehicle to the start location at decreasing time intervals, while a difference between the ETA of the transit vehicle to the arrival location and the ETA of the specified vehicle to the start location decreases as the transit vehicle travels towards the arrival location.

7. The computer system of claim 1 , wherein the executed set of instructions causes the computer system to further determine the ETA of the transit vehicle to the arrival location based on a schedule corresponding to the transit service.

8. The computer system of claim 1 , wherein the executed set of instructions causes the computer system to determine the ETA of the transit vehicle to the arrival location based, at least in part, on a route of the transit vehicle.

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

receive, over one or more networks, a request for transport from a computing device of a user while the user is riding a transit vehicle of a transit service, the request specifying a start location and a destination for the user;

based at least in part on a location of the transit vehicle, determine an estimated time of arrival (ETA) of the transit vehicle to an arrival location that corresponds to the start location;

receive, over the one or more networks, location data from computing devices associated with a plurality of vehicles that are available to transport the user from the start location to the destination;

for each vehicle of the plurality of vehicles, determine an ETA of the vehicle to the start location based on the location data of the vehicle;

initiate a request proxy module to optimize ETA matching between the plurality of vehicles and the transit vehicle by (i) determining that the ETA of the vehicle to the start location is within a threshold amount of time of the ETA of the transit vehicle to the arrival location, and (ii)

based at least in part on determining that the ETA of the specified vehicle to the start location is within a threshold amount of time of the ETA of the transit vehicle to the arrival location, automatically selecting the specified vehicle to service the request for the user; and

transmit, over the one or more networks, a transport invitation indicating the start location to the computing device associated with the specified vehicle.

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

receive a transit selection from the computing device of the user, the transit selection indicating a mode of transport for transporting the user to the arrival location that corresponds to the start location.

11. The non-transitory computer readable medium of claim 10 , wherein the executed instructions cause the one or more processors to further determine the ETA of the transit vehicle to the arrival location based on the transit selection.

12. The non-transitory computer readable medium of claim 9 , wherein the transit service comprises one of a train or a bus service, and wherein the arrival location comprises one of a train station or a bus station.

13. The non-transitory computer readable medium of claim 9 , wherein the executed instructions cause the one or more processors to repeatedly compare the ETA of the transit vehicle to the arrival location with the ETA of the specified vehicle to the start location based in part on a position of the specified vehicle relative to the start location.

14. The non-transitory computer readable medium of claim 13 , wherein the executed instructions cause the one or more processors to repeatedly compare the ETA of the transit vehicle to the arrival location and the ETA of the specified vehicle to the start location at decreasing time intervals, while a difference between the ETA of the transit vehicle to the arrival location and the ETA of the specified vehicle to the start location decreases as the transit vehicle travels towards the arrival location.

15. The non-transitory computer readable medium of claim 9 , wherein the executed instructions cause the one or more processors to further determine the ETA of the transit vehicle to the arrival location based on a schedule corresponding to the transit service.

16. The non-transitory computer readable medium of claim 9 , wherein the executed instructions cause the one or more processors to determine the ETA of the transit vehicle to the arrival location based, at least in part, on a route of the transit vehicle.

17. A computer-implemented method of managing a transport service, the method being performed by one or more processors and comprising:

receiving, over one or more networks, a request for transport from a computing device of a user while the user is riding a transit vehicle of a transit service, the request specifying a start location and a destination for the user;

based at least in part on a location of the transit vehicle, determining an estimated time of arrival (ETA) of the transit vehicle to an arrival location that corresponds to the start location;

receiving, over the one or more networks, location data from a-computing devices associated with a plurality of vehicles that are available to transport the user from the start location to the destination;

for each vehicle of the plurality of vehicles, determining an ETA of the vehicle to the start location based on the location data of the vehicle;

initiating a request proxy module to optimize ETA matching between the plurality of vehicles and the transit vehicle by (i) determining that the ETA of a specified vehicle of the plurality of vehicles to the start location is within a threshold amount of time of the ETA of the transit vehicle to the arrival location, and (ii);

based at least in part on determining that the ETA of the specified vehicle to the start location is within a threshold amount of time of the ETA of the transit vehicle to the arrival location, automatically selecting the specified vehicle to service the request for the user; and

transmitting, over the one or more networks, a transport invitation indicating the start location to the computing device associated with the specified vehicle.

18. The method of claim 17 , further comprising:

receiving a transit selection from the computing device of the user, the transit selection indicating a mode of transport for transporting the user to the arrival location that corresponds to the start location.

19. The method of claim 18 , wherein the one or more processors further determine the ETA of the transit vehicle to the arrival location based on the transit selection.

20. The method of claim 17 , wherein the transit service comprises one of a train or a bus service, and wherein the arrival location comprises one of a train station or a bus station.

Continuity (6)
Continuation 17474261 · Sep 14, 2021
Continuation 16736520 · Jan 7, 2020
Continuation 15874143 · Jan 18, 2018
Continuation 14832782 · Aug 21, 2015
Provisional Application 62040347 · Aug 21, 2014
Related Publication 20240169461A1 · May 23, 2024
References Cited (400)
US 4023753A · Dobler · 1977 [cited by applicant]
US 5557522A · Nakayama · 1996 [cited by applicant]
US 5948040A · DeLorme · 1999 [cited by applicant]
US 5953706A · Patel · 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 7522995B2 · Nortrup · 2009 [cited by applicant]
US 7840427B2 · O'Sullivan · 2010 [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 8762048B2 · Kosseifi · 2014 [cited by applicant]
US 8775070B1 · Bhatia · 2014 [cited by applicant]
US 8843307B1 · Kolodziej · 2014 [cited by applicant]
US 8954094B1 · Mishra · 2015 [cited by examiner]
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 9534912B2 · Lord · 2017 [cited by applicant]
US 9610893B2 · Lopez-Hinojosa · 2017 [cited by applicant]
US 9886667B2 · Lord · 2018 [cited by applicant]
US 9911170B2 · Kim · 2018 [cited by examiner]
US 9939279B2 · Pan · 2018 [cited by applicant]
US 10002333B2 · Lord · 2018 [cited by applicant]
US 10074065B2 · Jones · 2018 [cited by applicant]
US 10082793B1 · Glaser · 2018 [cited by applicant]
US 10152053B1 · Smith · 2018 [cited by applicant]
US 10178890B1 · Andon · 2019 [cited by applicant]
US 10197410B2 · Guo · 2019 [cited by applicant]
US 10203212B2 · Mazzella · 2019 [cited by applicant]
US 10328855B2 · Lopez-Hinojosa · 2019 [cited by applicant]
US 10458801B2 · Lord · 2019 [cited by applicant]
US 10535271B1 · Dyer · 2020 [cited by applicant]
US 10572964B2 · Kim · 2020 [cited by applicant]
US 10721327B2 · Cheng · 2020 [cited by applicant]
US 11196838B2 · Cheng · 2021 [cited by applicant]
US 11441921B2 · Vereshshagin · 2022 [cited by applicant]
US 11551325B2 · Tolkin · 2023 [cited by examiner]
US 11924308B2 · Cheng · 2024 [cited by applicant]
US 20010037174A1 · Dickerson · 2001 [cited by applicant]
US 20020099599A1 · Minassian · 2002 [cited by applicant]
US 20030040944A1 · Hileman · 2003 [cited by applicant]
US 20030058082A1 · Mallick · 2003 [cited by applicant]
US 20040158483A1 · Lecouturier · 2004 [cited by applicant]
US 20040225520A1 · Aoki · 2004 [cited by applicant]
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 20050278192A1 · Cantini · 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 20060235739A1 · Levis · 2006 [cited by applicant]
US 20060276960A1 · Adamczyk · 2006 [cited by applicant]
US 20060293937A1 · Sohm · 2006 [cited by applicant]
US 20070011324A1 · Mehr · 2007 [cited by applicant]
US 20070150375A1 · Yang · 2007 [cited by applicant]
US 20080014908A1 · Vasant · 2008 [cited by applicant]
US 20080027772A1 · Gernega · 2008 [cited by applicant]
US 20080033633A1 · Akiyoshi · 2008 [cited by applicant]
US 20080177584A1 · Altaf · 2008 [cited by applicant]
US 20080195428A1 · O'Sullivan · 2008 [cited by applicant]
US 20080208441A1 · Cheung · 2008 [cited by applicant]
US 20080270019A1 · Anderson · 2008 [cited by applicant]
US 20080277183A1 · Huang · 2008 [cited by applicant]
US 20080319644A1 · Zehler · 2008 [cited by applicant]
US 20090005963A1 · Jarvinen · 2009 [cited by applicant]
US 20090030885A1 · DePasquale · 2009 [cited by applicant]
US 20090083111A1 · Carr · 2009 [cited by applicant]
US 20090119006A1 · Silver · 2009 [cited by applicant]
US 20090150514A1 · Davis · 2009 [cited by applicant]
US 20090156241A1 · Staffaroni · 2009 [cited by examiner]
US 20090172009A1 · Schmith · 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 20100153279A1 · Zahn · 2010 [cited by applicant]
US 20100207812A1 · Demirdjian · 2010 [cited by applicant]
US 20100211498A1 · Aabye · 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 20110153628A1 · Lehmann · 2011 [cited by applicant]
US 20110153629A1 · Lehmann · 2011 [cited by applicant]
US 20110225257A1 · Tilden · 2011 [cited by applicant]
US 20110238755A1 · Khan · 2011 [cited by applicant]
US 20110246246A1 · Johnson · 2011 [cited by applicant]
US 20110251951A1 · Kolkowitz · 2011 [cited by applicant]
US 20110301997A1 · Gale · 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 20120072249A1 · Weir · 2012 [cited by applicant]
US 20120078672A1 · Mohebbi · 2012 [cited by applicant]
US 20120203599A1 · Choi · 2012 [cited by applicant]
US 20120232943A1 · Myr · 2012 [cited by applicant]
US 20120233246A1 · Guernez · 2012 [cited by applicant]
US 20120239289A1 · Gontmakher · 2012 [cited by applicant]
US 20120239452A1 · Trivedi · 2012 [cited by applicant]
US 20120253548A1 · Davidson · 2012 [cited by applicant]
US 20120265580A1 · Kobayashi · 2012 [cited by examiner]
US 20120253654A1 · Sun · 2012 [cited by applicant]
US 20120290337A1 · Helmy · 2012 [cited by applicant]
US 20120290950A1 · Rapaport · 2012 [cited by applicant]
US 20120311584A1 · Gruber · 2012 [cited by applicant]
US 20130018795A1 · Kolhatka · 2013 [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 20130124404A1 · Horstemeyer · 2013 [cited by applicant]
US 20130132140A1 · Amin · 2013 [cited by applicant]
US 20130144831A1 · Atlas · 2013 [cited by applicant]
US 20130158861A1 · Lerenc · 2013 [cited by applicant]
US 20130158869A1 · Lerenc · 2013 [cited by applicant]
US 20130159028A1 · Lerenc · 2013 [cited by applicant]
US 20130215843A1 · Diachina · 2013 [cited by applicant]
US 20130218455A1 · Clark · 2013 [cited by applicant]
US 20130226365A1 · Brozovich · 2013 [cited by applicant]
US 20130262222A1 · Gibson · 2013 [cited by applicant]
US 20130311997A1 · Gruber · 2013 [cited by applicant]
US 20140025410A1 · Churchman · 2014 [cited by applicant]
US 20140074536A1 · Meushar · 2014 [cited by applicant]
US 20140082069A1 · Varoglu · 2014 [cited by applicant]
US 20140095221A1 · Lore · 2014 [cited by applicant]
US 20140114562A1 · Zhou · 2014 [cited by applicant]
US 20140129302A1 · Amin · 2014 [cited by applicant]
US 20140129951A1 · Amin · 2014 [cited by applicant]
US 20140149157A1 · Shaam · 2014 [cited by applicant]
US 20140149441A1 · Wang · 2014 [cited by applicant]
US 20140156556A1 · Lavian · 2014 [cited by applicant]
US 20140172727A1 · Abhyanker · 2014 [cited by applicant]
US 20140173511A1 · Lehmann · 2014 [cited by applicant]
US 20140207375A1 · Lerenc · 2014 [cited by applicant]
US 20140378118A1 · Mohebbi · 2014 [cited by applicant]
US 20140378159A1 · Dolbakian · 2014 [cited by applicant]
US 20150006072A1 · Goldberg · 2015 [cited by applicant]
US 20150032485A1 · Nelson · 2015 [cited by applicant]
US 20150045068A1 · Soffer · 2015 [cited by applicant]
US 20150051833A1 · Geelen · 2015 [cited by applicant]
US 20150055178A1 · Ishibashi · 2015 [cited by applicant]
US 20150073645A1 · Davidsson · 2015 [cited by applicant]
US 20150081581A1 · Gishen · 2015 [cited by applicant]
US 20150100238A1 · Cai · 2015 [cited by applicant]
US 20150123818A1 · Sellschopp · 2015 [cited by applicant]
US 20150154810A1 · Tew · 2015 [cited by applicant]
US 20150161554A1 · Sweeney · 2015 [cited by applicant]
US 20150161563A1 · Mehrabi · 2015 [cited by applicant]
US 20150161564A1 · Sweeney · 2015 [cited by applicant]
US 20150161698A1 · Jones · 2015 [cited by examiner]
US 20150176997A1 · Pursche · 2015 [cited by applicant]
US 20150178698A1 · Schulz · 2015 [cited by applicant]
US 20150185020A1 · Gimpl · 2015 [cited by applicant]
US 20150204684A1 · Rostamian · 2015 [cited by applicant]
US 20150206267A1 · Khanna · 2015 [cited by applicant]
US 20150219464A1 · Beaurepaire · 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 20150294238A1 · Benque · 2015 [cited by applicant]
US 20150317568A1 · Grasso · 2015 [cited by applicant]
US 20150323327A1 · Lord · 2015 [cited by applicant]
US 20150323330A1 · Lord · 2015 [cited by applicant]
US 20150323331A1 · Lord · 2015 [cited by applicant]
US 20150323335A1 · Lord · 2015 [cited by applicant]
US 20150323336A1 · Lord · 2015 [cited by applicant]
US 20150324717A1 · Lord · 2015 [cited by applicant]
US 20150324718A1 · Lord · 2015 [cited by applicant]
US 20150324729A1 · Lord · 2015 [cited by applicant]
US 20150325128A1 · Lord · 2015 [cited by applicant]
US 20150338226A1 · Mason · 2015 [cited by applicant]
US 20150339923A1 · König · 2015 [cited by applicant]
US 20150339928A1 · Ramanujam · 2015 [cited by applicant]
US 20150345951A1 · Dutta · 2015 [cited by applicant]
US 20150352128A1 · Villa · 2015 [cited by applicant]
US 20150371157A1 · Jaffe · 2015 [cited by applicant]
US 20150373482A1 · Barnard · 2015 [cited by applicant]
US 20150379437A1 · Reich · 2015 [cited by applicant]
US 20160013987A1 · George · 2016 [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 20160027307A1 · Abhyanker · 2016 [cited by applicant]
US 20160034845A1 · Hiyama · 2016 [cited by applicant]
US 20160055605A1 · Kim · 2016 [cited by applicant]
US 20160066004A1 · Lieu · 2016 [cited by applicant]
US 20160104122A1 · Gorlin · 2016 [cited by applicant]
US 20160117610A1 · Ikeda · 2016 [cited by applicant]
US 20160132792A1 · Rosnow · 2016 [cited by applicant]
US 20160138928A1 · Guo · 2016 [cited by applicant]
US 20160148167A1 · Li · 2016 [cited by applicant]
US 20160231129A1 · Erez · 2016 [cited by applicant]
US 20160301698A1 · Katara · 2016 [cited by applicant]
US 20160320195A1 · Liu · 2016 [cited by applicant]
US 20160321771A1 · Liu · 2016 [cited by applicant]
US 20160334232A1 · Zhuang · 2016 [cited by applicant]
US 20160356615A1 · Arata · 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 20170059347A1 · Flier · 2017 [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 20170132540A1 · Haparnas · 2017 [cited by applicant]
US 20170147951A1 · Meyer · 2017 [cited by applicant]
US 20170147959A1 · Sweeney · 2017 [cited by applicant]
US 20170169366A1 · Klein · 2017 [cited by applicant]
US 20170169535A1 · Tolkin · 2017 [cited by applicant]
US 20170191841A1 · Marueli · 2017 [cited by applicant]
US 20170191845A1 · Marueli · 2017 [cited by applicant]
US 20170193404A1 · Yoo · 2017 [cited by applicant]
US 20170200249A1 · Ullrich · 2017 [cited by applicant]
US 20170220966A1 · Wang · 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 20170272901A1 · Sweeney · 2017 [cited by applicant]
US 20170308824A1 · Lord · 2017 [cited by applicant]
US 20170314948A1 · Racah · 2017 [cited by applicant]
US 20170344643A1 · Ramesan · 2017 [cited by applicant]
US 20170351987A1 · Liu · 2017 [cited by applicant]
US 20170365030A1 · Shoham · 2017 [cited by applicant]
US 20180005145A1 · Lo · 2018 [cited by applicant]
US 20180012151A1 · Wang · 2018 [cited by applicant]
US 20180060838A1 · Agrawal · 2018 [cited by examiner]
US 20180071634A1 · Carvallo · 2018 [cited by applicant]
US 20180081496A1 · Bhardwaj · 2018 [cited by applicant]
US 20180091604A1 · Yamashita · 2018 [cited by applicant]
US 20180101925A1 · Brinig · 2018 [cited by applicant]
US 20180121835A1 · Salonen · 2018 [cited by applicant]
US 20180121847A1 · Zhao · 2018 [cited by applicant]
US 20180156623A1 · West · 2018 [cited by applicant]
US 20180189717A1 · Cao · 2018 [cited by applicant]
US 20180211351A1 · Kim · 2018 [cited by applicant]
US 20180268329A1 · Lord · 2018 [cited by applicant]
US 20180285846A1 · Oesterling · 2018 [cited by applicant]
US 20180306595A1 · Marueli · 2018 [cited by applicant]
US 20180315148A1 · Luo · 2018 [cited by applicant]
US 20180321049A1 · Lim · 2018 [cited by applicant]
US 20180339714A1 · Smid · 2018 [cited by applicant]
US 20180342035A1 · Sweeney · 2018 [cited by applicant]
US 20180349825A1 · Yamamoto · 2018 [cited by applicant]
US 20180356239A1 · Marco · 2018 [cited by applicant]
US 20180374350A1 · Sweeney · 2018 [cited by applicant]
US 20190052728A1 · Cheng · 2019 [cited by applicant]
US 20190109910A1 · Sweeney · 2019 [cited by applicant]
US 20190130764A1 · Karani · 2019 [cited by applicant]
US 20190137288A1 · Rahematpura · 2019 [cited by applicant]
US 20190172353A1 · Chen · 2019 [cited by applicant]
US 20190205812A1 · Afzal · 2019 [cited by applicant]
US 20190206009A1 · Gibson · 2019 [cited by applicant]
US 20190212157A1 · Wu · 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 20190311629A1 · Sierra · 2019 [cited by applicant]
US 20190340554A1 · Jaffe · 2019 [cited by applicant]
US 20190347754A1 · Dicker · 2019 [cited by applicant]
US 20200013020A1 · Yang · 2020 [cited by applicant]
US 20200041286A1 · Lord · 2020 [cited by applicant]
US 20200041291A1 · Dunnette · 2020 [cited by applicant]
US 20200104761A1 · Aich · 2020 [cited by applicant]
US 20200211070A1 · Singh · 2020 [cited by applicant]
US 20200027368A1 · Bhattacharyya · 2020 [cited by applicant]
US 20200258344A1 · Brinig · 2020 [cited by applicant]
US 20200258386A1 · Lu · 2020 [cited by applicant]
US 20200272957A1 · Lord · 2020 [cited by applicant]
US 20200272965A1 · Tanabe · 2020 [cited by applicant]
US 20200273337A1 · Sweeney · 2020 [cited by applicant]
US 20200322451A1 · Cheng · 2020 [cited by applicant]
US 20200334987A1 · Shoval · 2020 [cited by applicant]
US 20200105140A1 · Wang · 2020 [cited by applicant]
US 20210010817A1 · Wu · 2021 [cited by applicant]
US 20210048300A1 · Roman · 2021 [cited by applicant]
US 20210121446A1 · Pan · 2021 [cited by applicant]
US 20210227049A1 · Demilrap · 2021 [cited by applicant]
US 20210248520A1 · Krishnamurthy · 2021 [cited by applicant]
US 20210256437A1 · Stayner · 2021 [cited by applicant]
US 20210256649A1 · Stumpf · 2021 [cited by applicant]
US 20210312338A1 · Stayner · 2021 [cited by applicant]
US 20210337047A1 · Cheng · 2021 [cited by applicant]
US 20210364300A1 · Rahematpura · 2021 [cited by applicant]
US 20210365848A1 · Lord · 2021 [cited by applicant]
US 20210407032A1 · Kim · 2021 [cited by applicant]
US 20220044186A1 · Hayama · 2022 [cited by applicant]
US 20220114501A1 · Colon · 2022 [cited by applicant]
US 20220223043A1 · Sweeney · 2022 [cited by applicant]
US 20220412748A1 · Lord · 2022 [cited by applicant]
US 20230044882A1 · Lord · 2023 [cited by applicant]
US 20230120345A1 · Demiralp · 2023 [cited by applicant]
US 20230147033A1 · Cheng · 2023 [cited by applicant]
US 20230306326A1 · Stayner · 2023 [cited by applicant]
US 20230334988A1 · Sweeney · 2023 [cited by applicant]
US 20240163349A1 · Cheng · 2024 [cited by applicant]
US 20240169461A1 · Kim · 2024 [cited by applicant]
CA 2604321 · 2006 [cited by applicant]
CN 103856532 · 2014 [cited by applicant]
CN 105575103 · 2016 [cited by applicant]
CN 106651728 · 2017 [cited by applicant]
CN 111832788 · 2020 [cited by applicant]
DE 10201607712 · 2016 [cited by applicant]
EP 2293523 · 2011 [cited by applicant]
EP 2708850 · 2014 [cited by applicant]
EP 3046058 · 2016 [cited by applicant]
GB 2367979 · 2002 [cited by applicant]
GB 2501075 · 2013 [cited by applicant]
JP 2001188996 · 2001 [cited by applicant]
JP 2002133592 · 2002 [cited by applicant]
JP 2004192366 · 2004 [cited by applicant]
JP 2004302941 · 2004 [cited by applicant]
JP 2004302942 · 2004 [cited by applicant]
JP 2004362271 · 2004 [cited by applicant]
JP 2006339810 · 2006 [cited by applicant]
JP 2010286908 · 2010 [cited by applicant]
JP 2012194687 · 2012 [cited by applicant]
JP 2013175144 · 2013 [cited by applicant]
JP 2014238831 · 2014 [cited by applicant]
KR 1020060081193 · 2006 [cited by applicant]
KR 1020110132765 · 2011 [cited by applicant]
KR 1020120079549 · 2012 [cited by applicant]
KR 1020130130978 · 2013 [cited by applicant]
KR 1020140023541 · 2014 [cited by applicant]
WO WO2002006994 · 2002 [cited by applicant]
WO WO2011069170 · 2011 [cited by applicant]
WO WO2011120161 · 2011 [cited by applicant]
WO WO2014100584 · 2014 [cited by applicant]
WO WO2017079222 · 2017 [cited by applicant]
NPL, 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. https://doi.org… [cited by examiner]
ISR/Written Opinion in International Application No. PCT/US2015/046388, dated Nov. 17, 2015. [cited by applicant]
EESR in EP Application No. 15833693.3 dated Jan. 18, 2018. [cited by applicant]
Office Action dated Sep. 20, 2018 in EP 15833693.3. [cited by applicant]
EESR in EP 19165275.9 dated Apr. 18, 2019. [cited by applicant]
International Search Report and Written Opinion issued in PCT/US2016/062344 dated Jan. 31, 2017. [cited by applicant]
Office Action in BR 1120180097799 dated Aug. 27, 2020. [cited by applicant]
ISR and Written Opinion in PCT/US2018/017941 dated Apr. 27, 2018. [cited by applicant]
Furuhata, M., “Ridesharing” The State-of-the-Art and Future Directions, Apr. 15, 2013, Elsevier Ltd., Transportation Research Part B 57, pp. 28-46 (2013). [cited by applicant]
Aug. 7, 2024 Huang, Y., Large Scale Real-time Ridesharing with Service Guarantee on Road Networks, Sep. 1-5, 2014, VLDB Endowment, vol. 7, No. 14, pp. 2017-2018 (2014). [cited by applicant]
ISR and Written Opinion issued in PCT/US2018/023887 dated Jun. 8, 2018. [cited by applicant]
IPRP in PCT/US2018/023887 dated Mar. 19, 2019. [cited by applicant]
OA in CN 201880030237.0 dated Jul. 28, 2020. [cited by applicant]
Examination Report No. 2 in AU 2016355549 dated Jun. 29, 2021. [cited by applicant]
Search Report in BR112018009779-9 dated Aug. 27, 2020. [cited by applicant]
Technical Exam Report in BR112018009779-9 dated Dec. 2, 2020. [cited by applicant]
Examination Report No. 1 in AU 2018221432 dated Jan. 31, 2022. [cited by applicant]
Introducing Scheduled Rides: Plan Your Trip in Advance—Lyft Blog; https://blog.lyft.com/posts/introducing-scheduled-rides, May 23, 2016. [cited by applicant]
How does Uber Work? available at https://help.uber.com/h/738d1ff7- 5fe0-4383-b34c-4a2480efd71e (Year: 2016). [cited by applicant]
ISR and Written Opinion dated Sep. 14, 2017 in PCT/US2017/036430. [cited by applicant]
EESR in 15809070.4 dated Nov. 8, 2017. [cited by applicant]
ISR and Written Opinion dated Nov. 21, 2018 in PCT/2018/046257. [cited by applicant]
Office Action in EP 15809070.4 dated Sep. 27, 2018. [cited by applicant]
Written Opinion dated Jul. 26, 2019 in PCT/US2018/046257. [cited by applicant]
How to request multiple Uber vehicles, Aug. 15, 2013 (https://www.wikihow.com/Request-Multiple-Uber-Vehicles. [cited by applicant]
Fast and Clean, How to book two cabs at the same time in Uber, Jun. 30, 2017 (https://fastandclean.org/ book-two-cabs-time-uber). [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 transportation 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 5th International Conference on Intelligent Transportation Systems, Sep. 3-6, 2002, Singapore. [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. 1 in AU 2016366687 dated Oct. 6, 2021. [cited by applicant]
Office Action in EP 17771000.1 dated Aug. 23, 2021. [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]
Fawcett, Supporting human interaction with the Sentinent Vehicle, 2002, IEEE. pp. 307-312 (2002). [cited by applicant]
Koscher, Experimental Security Analysis of a Modern Automobile, 2010, IEEE, pp. 447-462 (2010). [cited by applicant]