IP Library Granted Patent US 12,669,339
Granted Patent B2
US 12,669,339 · App. 18/222,167 · Granted Jun 30, 2026

Network system for preselecting a service provider based on predictive information

Inventors: John Mark Nickels (San Francisco, CA); Eoin O'Mahony (San Francisco, CA)
Assignee: Uber Technologies, Inc.
G01C21/3438G01C21/20G06Q50/40G08G1/202H04L41/5019H04L41/5051H04L41/5058H04L67/306H04L67/52H04W4/023
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,669,339
App. No.
18/222,167
Filed
Jul 14, 2023
Granted
Jun 30, 2026
Kind
B2
Art Unit
2454
USPC
709/223
Abstract

A computing system detects activation of a service application on a computing device of a user and performs a selection process to select a service provider to provide service for the user before receiving a request for service from the computing device of the user. Before receiving the request for service from the computing device of the user, the system transmits service provider information corresponding to the selected service provider to the computing device of the user. Subsequent to performing the selection process, the system receives the request for service, and transmits an invitation for providing service for the user to a provider device of the selected service provider.

Claims (41)

1 . A network computer system comprising:

one or more processors; and

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

communicate with a plurality of service provider devices to determine a location of each service provider device;

determine, based at least in part on the location of each service provider device, a set of service providers that are available to fulfill service requests;

before receiving a potential service request from a computing device of a user, (i) determine a destination location for the potential service request, (ii) predict an estimated time for the user to arrive at the destination location based at least in part on the set of available service providers and the location of the plurality of service provider devices, (iii) transmit information corresponding to the estimated time to arrive at the destination location to the computing device of the user for display via a service application, (iv) determine a likelihood of one or more of the available service providers accepting the potential service request of the user based on the destination location for the request, and (v) perform a selection process to preselect, based on the determined likelihood, one of the available service providers to provide service for the user based at least in part on the location of the service provider;

subsequent to performing the selection process, receive, from the computing device of the user, a request for service; and

transmit, to a provider device of a preselected service provider, an invitation for providing service for the user.

2 . The network computer system of claim 1 , wherein the executed instructions cause the one or more processors to periodically determine a likelihood of the user requesting service while the service application on the computing device of the user is active.

3 . The network computer system of claim 2 , wherein the executed instructions further cause the one or more processors to:

determine service provider liquidity for an area proximate to a current location of the user, wherein the service provider liquidity is determined based in part on the set of available service providers within the area proximate to the current location of the user;

wherein determining a likelihood of the user requesting service is further based on the service provider liquidity for the area proximate to the current location of the user.

4 . The network computer system of claim 3 , wherein the executed instructions cause the one or more processors to determine the service provider liquidity for the area proximate to the current location of the user by determining that one or more service providers are predicted, based on historical data for the area, to activate a service provider application.

5 . The network computer system of claim 1 , wherein the executed instructions cause the one or more processors to repeatedly perform the selection process prior to receiving the request for service from the computing device of the user.

6 . The network computer system of claim 1 , wherein the request for service comprises an on-demand transport service for transporting the user to a destination location indicated in the request for service.

7 . A non-transitory computer readable medium storing instructions that, when executed by one or more processors of a network computer system, cause the one or more processors to:

communicate with a plurality of service provider devices to determine a location of each service provider device;

determine, based at least in part on the location of each service provider device, a set of service providers that are available to fulfill service requests;

before receiving a potential service request from a computing device of a user, (i) determine a destination location for the potential service request, (ii) predict an estimated time for the user to arrive at the destination location based at least in part on the set of available service providers and the location of the plurality of service provider devices, (iii) transmit information corresponding to the estimated time to arrive at the destination location to the computing device of the user for display via a service application, (iv) determine a likelihood of one or more of the available service providers accepting the potential service request of the user based on the destination location for the request, and (v) perform a selection process to preselect, based on the determined likelihood, one of the available service providers to provide service for the user based at least in part on the location of the service provider;

subsequent to performing the selection process, receive, from the computing device of the user, a request for service; and

transmit, to a provider device of a preselected service provider, an invitation for providing service for the user.

8 . The non-transitory computer readable medium of claim 7 , wherein the executed instructions cause the one or more processors to periodically determine a likelihood of the user requesting service while the service application on the computing device of the user is active.

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

determine service provider liquidity for an area proximate to a current location of the user, wherein the service provider liquidity is determined based in part on the set of available service providers within the area proximate to the current location of the user;

wherein determining a likelihood of the user requesting service is further based on the service provider liquidity for the area proximate to the current location of the user.

10 . The non-transitory computer readable medium of claim 9 , wherein the executed instructions cause the one or more processors to determine the service provider liquidity for the area proximate to the current location of the user by determining that one or more service providers are predicted, based on historical data for the area, to activate a service provider application.

11 . The non-transitory computer readable medium of claim 7 , wherein the executed instructions cause the one or more processors to repeatedly perform the selection process prior to receiving the request for service from the computing device of the user.

12 . The non-transitory computer readable medium of claim 7 , wherein the request for service comprises an on-demand transport service for transporting the user to a destination location indicated in the request for service.

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

communicating with a plurality of service provider devices to determine a location of each service provider device;

determining, based at least in part on the location of each service provider device, a set of service providers that are available to fulfill service requests;

before receiving a potential service request from a computing device of a user, (i) determining a destination location for the potential service request, (ii) predicting an estimated time for the user to arrive at the destination location based at least in part on the set of available service providers and the location of the plurality of service provider devices, (iii) transmitting information corresponding to the estimated time to arrive at the destination location to the computing device of the user for display via a service application, (iv) determining a likelihood of one or more of the available service providers accepting the potential service request of the user based on the destination location for the request, and (v) performing a selection process to preselect, based on the determined likelihood, one of the available service providers to provide service for the user based at least in part on the location of the service provider;

subsequent to performing the selection process, receiving, from the computing device of the user, a request for service; and

transmitting, to a provider device of a preselected service provider, an invitation for providing service for the user.

14 . The computer-implemented method of claim 13 , wherein the one or more processors periodically determine a likelihood of the user requesting service while the service application on the computing device of the user is active.

15 . The computer-implemented method of claim 14 , further comprising:

determining service provider liquidity for an area proximate to a current location of the user, wherein the service provider liquidity is determined based in part on the set of available service providers within the area proximate to the current location of the user;

wherein determining a likelihood of the user requesting service is further based on the service provider liquidity for the area proximate to the current location of the user.

16 . The computer-implemented method of claim 15 , wherein the one or more processors determine the service provider liquidity for the area proximate to the current location of the user by determining that one or more service providers are predicted, based on historical data for the area, to activate a service provider application.

17 . The computer-implemented method of claim 13 , wherein the one or more processors repeatedly perform the selection process prior to receiving the request for service from the computing device of the user.

18 . The computer-implemented method of claim 13 , wherein the request for service comprises an on-demand transport service for transporting the user to a destination location indicated in the request for service.

Continuity (6)
Continuation 17394841 · Aug 5, 2021
Continuation 16787601 · Feb 11, 2020
Continuation 15707482 · Sep 18, 2017
Continuation 15395818 · Dec 30, 2016
Provisional Application 62399793 · Sep 26, 2016
Related Publication 20230358552A1 · Nov 9, 2023
References Cited (344)
US 4023753A · Dobler · 1977 [cited by applicant]
US 5168451A · Bolger · 1992 [cited by applicant]
US 5604676A · Penzias · 1997 [cited by applicant]
US 5880958A · Helms · 1999 [cited by applicant]
US 5945919A · Trask · 1999 [cited by applicant]
US 5953706A · Patel · 1999 [cited by applicant]
US 6212393B1 · Suarez · 2001 [cited by applicant]
US 6356838B1 · Paul · 2002 [cited by applicant]
US 6456207B1 · Yen · 2002 [cited by applicant]
US 6516056B1 · Justice et al. · 2003 [cited by applicant]
US 6618593B1 · Drutman · 2003 [cited by applicant]
US 6756913B1 · Ayed · 2004 [cited by applicant]
US 6925381B2 · Adamcyzk · 2005 [cited by applicant]
US 6950745B2 · Agnew · 2005 [cited by applicant]
US 6989765B2 · Gueziec · 2006 [cited by applicant]
US 7062376B2 · Oesterling · 2006 [cited by applicant]
US 7080019B1 · Hurzeler · 2006 [cited by applicant]
US 7610145B2 · Kantarjiev · 2009 [cited by applicant]
US 7822426B1 · Wuersch · 2010 [cited by applicant]
US 7840427B2 · O'Sullivan · 2010 [cited by applicant]
US 7886019B2 · Srinivasachar · 2011 [cited by applicant]
US 8140256B1 · dos-Santos · 2012 [cited by applicant]
US 8285571B2 · Demirdjian · 2012 [cited by applicant]
US 8362894B2 · Shah · 2013 [cited by applicant]
US 8554608B1 · O'Connor · 2013 [cited by applicant]
US 8799038B2 · Chen et al. · 2014 [cited by applicant]
US 9483744B2 · Lord · 2016 [cited by applicant]
US 9488484B2 · Lord · 2016 [cited by applicant]
US 9552559B2 · Lord · 2017 [cited by applicant]
US 9558469B2 · Lord · 2017 [cited by applicant]
US 9569740B2 · Lord · 2017 [cited by applicant]
US 9599481B2 · Lord · 2017 [cited by applicant]
US 9671239B2 · Lord · 2017 [cited by applicant]
US 9689694B2 · Lord · 2017 [cited by applicant]
US 9715667B2 · Lord · 2017 [cited by applicant]
US 9939279B2 · Pan · 2018 [cited by applicant]
US 10282681B2 · Wang · 2019 [cited by applicant]
US 10467561B2 · Haparnas · 2019 [cited by applicant]
US 11099019B2 · Nickels · 2021 [cited by examiner]
US 11153395B2 · Sweeney · 2021 [cited by applicant]
US 11605246B2 · Brinig · 2023 [cited by applicant]
US 11622018B2 · Sweeney · 2023 [cited by applicant]
US 11747154B2 · Nickels · 2023 [cited by examiner]
US 11754407B2 · Pan · 2023 [cited by applicant]
US 20010037174A1 · Dickerson · 2001 [cited by applicant]
US 20010056363A1 · Gantz · 2001 [cited by applicant]
US 20020034292A1 · Tuoriniemi et al. · 2002 [cited by applicant]
US 20020044186A1 · Tochihara · 2002 [cited by applicant]
US 20020194129A1 · Furuya et al. · 2002 [cited by applicant]
US 20030030666A1 · Najmi · 2003 [cited by applicant]
US 20040024789A1 · Ditcharo et al. · 2004 [cited by applicant]
US 20040049424A1 · Murray · 2004 [cited by applicant]
US 20040106399A1 · Ki · 2004 [cited by applicant]
US 20040107110A1 · Gottlieb et al. · 2004 [cited by applicant]
US 20040148347A1 · Appelman · 2004 [cited by applicant]
US 20040219933A1 · Faith · 2004 [cited by applicant]
US 20040225520A1 · Aoki et al. · 2004 [cited by applicant]
US 20040260470A1 · Rast · 2004 [cited by applicant]
US 20050153707A1 · Ledyard · 2005 [cited by applicant]
US 20050251333A1 · Adamzyk · 2005 [cited by applicant]
US 20050278192A1 · Cantini et al. · 2005 [cited by applicant]
US 20060004590A1 · Khoo · 2006 [cited by applicant]
US 20060034201A1 · Umeda et al. · 2006 [cited by applicant]
US 20060059023A1 · Mashinsky · 2006 [cited by applicant]
US 20060200306A1 · Adamcyzk · 2006 [cited by applicant]
US 20060217885A1 · Crady et al. · 2006 [cited by applicant]
US 20060224437A1 · Gupta · 2006 [cited by applicant]
US 20060235739A1 · Levis · 2006 [cited by applicant]
US 20060242154A1 · Rawat · 2006 [cited by applicant]
US 20060293937A1 · Sohm · 2006 [cited by applicant]
US 20070011324A1 · Mehr · 2007 [cited by applicant]
US 20070130156A1 · Tenhunen · 2007 [cited by applicant]
US 20070150375A1 · Yang · 2007 [cited by applicant]
US 20070167182A1 · Tenhunen · 2007 [cited by applicant]
US 20070255627A1 · Hallowell · 2007 [cited by applicant]
US 20070276595A1 · Lewinson · 2007 [cited by applicant]
US 20080055049A1 · Weill · 2008 [cited by applicant]
US 20080091342A1 · Assael · 2008 [cited by applicant]
US 20080177584A1 · Altaf et al. · 2008 [cited by applicant]
US 20080195428A1 · O'Sullivan · 2008 [cited by applicant]
US 20080270204A1 · Poykko · 2008 [cited by applicant]
US 20080277183A1 · Huang · 2008 [cited by applicant]
US 20090030885A1 · DePasquale · 2009 [cited by applicant]
US 20090083111A1 · Carr · 2009 [cited by applicant]
US 20090143965A1 · Chang · 2009 [cited by examiner]
US 20090172009A1 · Schmith · 2009 [cited by applicant]
US 20090176508A1 · Lubeck et al. · 2009 [cited by applicant]
US 20090192851A1 · Bishop · 2009 [cited by applicant]
US 20090216600A1 · Hill · 2009 [cited by applicant]
US 20090254270A1 · Yu · 2009 [cited by applicant]
US 20090281844A1 · Probst · 2009 [cited by applicant]
US 20090313077A1 · Wheeler, IV · 2009 [cited by applicant]
US 20090326991A1 · Wei · 2009 [cited by applicant]
US 20100017275A1 · Carlson · 2010 [cited by applicant]
US 20100042549A1 · Adamcyzk · 2010 [cited by applicant]
US 20100153279A1 · Zahn · 2010 [cited by applicant]
US 20100205017A1 · Sichelman et al. · 2010 [cited by applicant]
US 20100207812A1 · Demirdjian · 2010 [cited by applicant]
US 20100211425A1 · Govindarajan · 2010 [cited by examiner]
US 20100211498A1 · Aabye et al. · 2010 [cited by applicant]
US 20100292914A1 · Vepsalinen · 2010 [cited by applicant]
US 20110000747A1 · Wu · 2011 [cited by applicant]
US 20110009098A1 · Kong · 2011 [cited by applicant]
US 20110099040A1 · Felt et al. · 2011 [cited by applicant]
US 20110118981A1 · Chamlou · 2011 [cited by applicant]
US 20110145089A1 · Khunger · 2011 [cited by applicant]
US 20110153495A1 · Dixon · 2011 [cited by applicant]
US 20110153629A1 · Lehmann et al. · 2011 [cited by applicant]
US 20110225257A1 · Tilden et al. · 2011 [cited by applicant]
US 20110225269A1 · Yap et al. · 2011 [cited by applicant]
US 20110243553A1 · Russell · 2011 [cited by applicant]
US 20110251951A1 · Kolkowitz et al. · 2011 [cited by applicant]
US 20110301985A1 · Camp et al. · 2011 [cited by applicant]
US 20110301997A1 · Gale et al. · 2011 [cited by applicant]
US 20110320230A1 · Podgumy · 2011 [cited by applicant]
US 20120041675A1 · Juliver · 2012 [cited by applicant]
US 20120059693A1 · Colodny et al. · 2012 [cited by applicant]
US 20120072249A1 · Weir et al. · 2012 [cited by applicant]
US 20120078671A1 · Mohebbi · 2012 [cited by applicant]
US 20120078672A1 · Mohebbi · 2012 [cited by applicant]
US 20120131170A1 · Spat · 2012 [cited by applicant]
US 20120203599A1 · Choi · 2012 [cited by applicant]
US 20120232943A1 · Myr · 2012 [cited by applicant]
US 20130018795A1 · Kolhatkar et al. · 2013 [cited by applicant]
US 20130024249A1 · Zohar · 2013 [cited by applicant]
US 20130054139A1 · Bodin · 2013 [cited by applicant]
US 20130054281A1 · Thakkar · 2013 [cited by applicant]
US 20130073327A1 · Edelberg · 2013 [cited by applicant]
US 20130090963A1 · Sharma · 2013 [cited by applicant]
US 20130102333A1 · Dam · 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 et al. · 2013 [cited by applicant]
US 20130179205A1 · Slinin · 2013 [cited by applicant]
US 20130179215A1 · Slinin · 2013 [cited by applicant]
US 20130268406A1 · Radhakrishnan · 2013 [cited by examiner]
US 20130295963A1 · Sen · 2013 [cited by applicant]
US 20140011522A1 · Lin · 2014 [cited by applicant]
US 20140025410A1 · Churchman et al. · 2014 [cited by applicant]
US 20140038640A1 · Wesselius · 2014 [cited by applicant]
US 20140051465A1 · Ruys et al. · 2014 [cited by applicant]
US 20140056526A1 · Scipioni · 2014 [cited by applicant]
US 20140067488A1 · James · 2014 [cited by applicant]
US 20140073300A1 · Leeder · 2014 [cited by applicant]
US 20140082069A1 · Varoglu et al. · 2014 [cited by applicant]
US 20140129135A1 · Holden et al. · 2014 [cited by applicant]
US 20140129951A1 · Amin · 2014 [cited by applicant]
US 20140149157A1 · Shaam et al. · 2014 [cited by applicant]
US 20140156556A1 · Lavian · 2014 [cited by applicant]
US 20140172727A1 · Abhayanker, V · 2014 [cited by applicant]
US 20140258894A1 · Brown · 2014 [cited by applicant]
US 20140279668A1 · Lievens · 2014 [cited by applicant]
US 20150032485A1 · Nelson · 2015 [cited by applicant]
US 20150046080A1 · Wesselius · 2015 [cited by applicant]
US 20150081362A1 · Chadwick · 2015 [cited by examiner]
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 20150161752A1 · Barreto · 2015 [cited by applicant]
US 20150176997A1 · Pursche · 2015 [cited by applicant]
US 20150185020A1 · Gimpl et al. · 2015 [cited by applicant]
US 20150204684A1 · Rostamian · 2015 [cited by applicant]
US 20150206267A1 · Khanna · 2015 [cited by applicant]
US 20150248689A1 · Paul · 2015 [cited by applicant]
US 20150254581A1 · Brahme · 2015 [cited by applicant]
US 20150279217A1 · Chen · 2015 [cited by applicant]
US 20150323327A1 · Lord · 2015 [cited by applicant]
US 20150323329A1 · 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 20150324334A1 · 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 20150324734A1 · Lord · 2015 [cited by applicant]
US 20150324945A1 · Lord et al. · 2015 [cited by applicant]
US 20150325128A1 · Lord · 2015 [cited by applicant]
US 20150339923A1 · Konig · 2015 [cited by applicant]
US 20150345951A1 · Dutta · 2015 [cited by applicant]
US 20150356803A1 · Ellis · 2015 [cited by applicant]
US 20160019728A1 · Petrie · 2016 [cited by applicant]
US 20160026935A1 · Botea · 2016 [cited by applicant]
US 20160026936A1 · Richardson · 2016 [cited by examiner]
US 20160027306A1 · Lambert · 2016 [cited by applicant]
US 20160034828A1 · Sarawgi · 2016 [cited by applicant]
US 20160034845A1 · Hayama · 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 20160180346A1 · Cheng · 2016 [cited by examiner]
US 20160300318A1 · Godil · 2016 [cited by applicant]
US 20160334232A1 · Zhuang · 2016 [cited by applicant]
US 20160335568A1 · Bailey · 2016 [cited by applicant]
US 20160364678A1 · Cao · 2016 [cited by applicant]
US 20160364812A1 · Cao · 2016 [cited by examiner]
US 20160364824A1 · Bryant · 2016 [cited by applicant]
US 20170011324A1 · Truong · 2017 [cited by applicant]
US 20170132540A1 · Haparnas · 2017 [cited by examiner]
US 20170138749A1 · Pan · 2017 [cited by applicant]
US 20170169366A1 · Klein · 2017 [cited by applicant]
US 20170186126A1 · Marco · 2017 [cited by examiner]
US 20170192437A1 · Bier · 2017 [cited by applicant]
US 20170193404A1 · Yoo · 2017 [cited by applicant]
US 20170220966A1 · Wang · 2017 [cited by examiner]
US 20170293925A1 · Marueli · 2017 [cited by applicant]
US 20170300848A1 · Shoval · 2017 [cited by applicant]
US 20170308824A1 · Lord · 2017 [cited by applicant]
US 20180003843A1 · Hori · 2018 [cited by applicant]
US 20180012151A1 · Wang · 2018 [cited by examiner]
US 20180032928A1 · Li · 2018 [cited by applicant]
US 20180071634A1 · Carvallo · 2018 [cited by applicant]
US 20180081496A1 · Bhardwaj · 2018 [cited by applicant]
US 20180091603A1 · Nickels · 2018 [cited by applicant]
US 20180101925A1 · Brinig · 2018 [cited by applicant]
US 20180102017A1 · Brinig · 2018 [cited by applicant]
US 20180180426A1 · Pan · 2018 [cited by applicant]
US 20180268329A1 · Lord · 2018 [cited by applicant]
US 20180293521A1 · Akselrod · 2018 [cited by applicant]
US 20190035202A1 · Brinig · 2019 [cited by applicant]
US 20190052728A1 · Cheng · 2019 [cited by applicant]
US 20190095849A1 · Sweeney · 2019 [cited by applicant]
US 20190109910A1 · Sweeney · 2019 [cited by applicant]
US 20190205812A1 · Afzal · 2019 [cited by applicant]
US 20190206009A1 · Gibson · 2019 [cited by applicant]
US 20190221069A1 · Brinig · 2019 [cited by applicant]
US 20190244318A1 · Rajcok · 2019 [cited by applicant]
US 20190340554A1 · Jaffe · 2019 [cited by applicant]
US 20190347754A1 · Dicker · 2019 [cited by applicant]
US 20190392368A1 · Raghunathan · 2019 [cited by applicant]
US 20200013020A1 · Yang · 2020 [cited by applicant]
US 20200145503A1 · Sweeney · 2020 [cited by applicant]
US 20200173979A1 · Nickels · 2020 [cited by applicant]
US 20200175429A1 · Beaurepaire · 2020 [cited by applicant]
US 20200272954A1 · Serra · 2020 [cited by applicant]
US 20210097452A1 · Niemiec · 2021 [cited by applicant]
US 20210121446A1 · Desai · 2021 [cited by applicant]
US 20210152652A1 · Barreto · 2021 [cited by applicant]
US 20210223051A1 · Hochberg · 2021 [cited by applicant]
US 20210227049A1 · Demiralp · 2021 [cited by applicant]
US 20210256649A1 · Stumpf · 2021 [cited by applicant]
US 20210256794A1 · Brinig · 2021 [cited by applicant]
US 20210319380A1 · Camp · 2021 [cited by applicant]
US 20210364302A1 · Nickels · 2021 [cited by applicant]
US 20220006870A1 · Sweeney · 2022 [cited by applicant]
US 20220215499A1 · Dicker · 2022 [cited by applicant]
US 20220329670A1 · Barreto · 2022 [cited by applicant]
US 20230005363A1 · Knoepfle · 2023 [cited by applicant]
US 20230120345A1 · Demiralp · 2023 [cited by applicant]
US 20230215276A1 · Kuncl · 2023 [cited by applicant]
US 20230267565A1 · Levi · 2023 [cited by applicant]
CA 2889853 · 2014 [cited by applicant]
CN 102495541 · 2012 [cited by applicant]
CN 105575103 · 2016 [cited by applicant]
CN 111832788 · 2020 [cited by applicant]
JP 2002133592 · 2002 [cited by applicant]
JP 2004302941 · 2004 [cited by applicant]
JP 2004362271 · 2004 [cited by applicant]
JP 2005107942 · 2005 [cited by applicant]
JP 2006339810 · 2006 [cited by applicant]
JP 3934985 · 2007 [cited by applicant]
JP 2014130552 · 2014 [cited by applicant]
JP 2014238831 · 2014 [cited by applicant]
JP 2004073639 · 2015 [cited by applicant]
KR 1020100053717 · 2010 [cited by applicant]
KR 1020140124137 · 2014 [cited by applicant]
KR 1020150045962 · 2015 [cited by applicant]
WO WO1999044186 · 1999 [cited by applicant]
WO WO2005013588 · 2005 [cited by applicant]
WO WO2011067741 · 2011 [cited by applicant]
WO WO2011069170 · 2011 [cited by applicant]
WO WO2014106617 · 2014 [cited by applicant]
Gargiulo, Eleonora, et al. “Dynamic ride sharing service: are users ready to adopt it?.” Procedia Manufacturing 3: 777-784. (Year: 2015). [cited by examiner]
Hai Yang et al. “Equilibria of bilateral taxi-customer searching and meeting on networks”, Transportation Research Part B., 2010, vol. 44, pp. 1067-1083. [cited by applicant]
International Search report in PCT/US2016/016858 dated May 19, 2016. [cited by applicant]
Alfred Round, et al.: Future Ride: Adapting New Technologies to Paratransit in the United States, UC Transportation Center Berkeley, CA, UCTC No. 306 (1996). [cited by applicant]
Kikuchi, et al., “Advanced Traveler Aid Systems for Public Transportation”, US Department of Transportation, Sep. 1994. [cited by applicant]
Fu, et al., “On-Line and Off-Line Routing and Scheduling of Dial-a-Ride Paratransit Vehicles”, Computer-Aided Civil and Infrastructure Engineering 14 (1999). [cited by applicant]
International Search Report and Written Opinion issued in PCT/US2016/062344 dated Jan. 31, 2017. [cited by applicant]
Robert Kuhlthau and Ira D. Jacobson, The Development of a Model for Predicting Passenger Acceptance of Short Haul Air Transportation Systems, NASA, Sep. 1977. [cited by applicant]
Xing Wang, Optimizing Ride Matches for Dynamic Ride Sharing Systems, GIT, May 2013. [cited by applicant]
International Search Report issued in PCT/US2017/053065 dated Dec. 13, 2017. [cited by applicant]
Aloizio P. Silva, A Mobile Location-Based Vehicle Fleet Management Service Application, 0-7803-78482/03 2003, IEEE. [cited by applicant]
Andersson, Magnus, Peer-to-Peer Service Sharing Platforms: Driving Share and Share Alike on a Mass-Scale, Thirty Fourth International Conference on Information Systems, Milan 2013, pp. 1-15 (2013). [cited by applicant]
ISR and Written Opinion in PCT/US2017/023350 dated Jun. 29, 2017. [cited by applicant]
Rosenblat, Alex, “Algorithmic labor and information asymmetries: A case study of Uber's drivers”, International journal of communication 10: Jul. 2016. [cited by applicant]
Name of author, title 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]
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]
Mukai, Dynamic Location Management for On-Demand Car Sharing System, 2005, In: Khosia R., Howlett R.J., Jain L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems, KES 2005. Lecture Notes in Compute… [cited by applicant]
How does Uber Work? available at https://help.uber.com/h/738d1ff7- 5fe0-4383-b34c-4a2480efd71e (Year: 2016). [cited by applicant]
How to request multiple Uber vehicles, Aug. 15, 2013 (https://www.wikihow.com/ Request-Multiple-Uber-Vehicles. [cited by applicant]
Is it possible to order 2 Ubers at the same time, Jul. 13, 2015 (https://web.archive.org/web/20150801000000*/https://android. Stackexchange.com/questions/114027/is-it- possible-to-order-2-ubers-at-the-same-time. [cited by applicant]
International Search Report in PCT/US2015/034831 dated Sep. 24, 2015. [cited by applicant]
International Search Report in PCT/US2015/043654 dated Nov. 26, 2015. [cited by applicant]
IPRP in PCT/US2014/069602 dated Jun. 14, 2016. [cited by applicant]
Extended Search Report issued in EP 14869805.3 dated May 10, 2017. [cited by applicant]
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]
ISR and Written Opinion in PCT/US2017/023343 dated Jul. 6, 2017. [cited by applicant]
International Search Report in PCT/US2017/053065 dated Sep. 22, 2017. [cited by applicant]
Extended Search Report issued in EP 15826507.1 dated Nov. 10, 2017. [cited by applicant]
Written Opinion issued in SG 11201700669R dated Dec. 5, 2017. [cited by applicant]
First Examination Report in EP 14869806.3 dated May 4, 2018. [cited by applicant]
ISR and Written Opinion in PCT/US2018/055256 dated Jan. 30, 2019. [cited by applicant]
First Office Action in CN 2014800731753 dated Feb. 3, 2019. [cited by applicant]
EESR in EP 17771000.1 dated Mar. 21, 2019. [cited by applicant]
Examination Reported in AU 2017342747 dated Apr. 8, 2019. [cited by applicant]
ISR and Written Opinion dated Apr. 30, 2019 in PCT/US2019/012902. [cited by applicant]
Office Action in EP 15826501.7 dated May 14, 2019. [cited by applicant]
Written Opinion in PCT/US2018/055256 dated Jul. 19, 2019. [cited by applicant]
EESR in EP 17859424.8 dated Aug. 5, 2019. [cited by applicant]
Exam Report No. 2 in AU 2017/342747 dated Aug. 27, 2019. [cited by applicant]
Examination Report No. 1 in AU 2014362392 dated Sep. 10, 2019. [cited by applicant]
Examination Report No. 1 in AU 2014362378 dated Sep. 18, 2019. [cited by applicant]
Second Office Action in CN 2014800731753 dated Sep. 27, 2019. [cited by applicant]
Office Action in JP 2018-524399 dated Apr. 8, 2020. [cited by applicant]
Office Action dated Apr. 16, 2020 in EP 1670690.0. [cited by applicant]
Exam Report No. 1 in AU 2015296265 dated Apr. 21, 2020. [cited by applicant]
Office Action in BR 1120170017768 dated May 6, 2020. [cited by applicant]
Exam Report No. 2 in AU 2014362378 dated May 7, 2020. [cited by applicant]
Exam Report No. 2 in AU 2015296265 dated Aug. 13, 2020. [cited by applicant]
Office Action in BR 1120180097799 dated Aug. 27, 2020. [cited by applicant]
Office Action in BR 1220200245654 dated Feb. 4, 2021. [cited by applicant]
Office Action in CA 2,932,828 dated Feb. 8, 2021. [cited by applicant]
Office Action in CA 2,956,631 dated May 7, 2021. [cited by applicant]
ISR and Written Opinion in PCT/US2021/013677 dated Jun. 16, 2021. [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, Cognitive, Adaptive, Content, Patterns, Nov. 15-20, 2009 (Year 2009). [cited by applicant]
Office Action in CA 2,932,828 dated Jul. 23, 2021, 3 pages. [cited by applicant]
Office Action in AU 2021/202417 mailed Aug. 1, 2022, 5 pages. [cited by applicant]
Constine, John, “Uber is Now Testing ‘Suggested Pickup Points’”, https://techcrunch.com/2015/07/08/ uber-suggested-pickup-points/ (Jul. 8, 2015), 3 pages. [cited by applicant]
Grimm, Nicholas Justin “A Low-Cost Contactless Micro-Payment Framework” University of Johannesburg (South Africa), pp. 1-234, 2014. [cited by applicant]
W. He, “Intelligent Carpool Routing for Urban Ridesharing by Mining GPS Trajectories” IEEE Transactions on Intelligent Transportation Systems, V. 15, No. 5, pp. 2286-2296, Oct. 2014. [cited by applicant]
Office Action dated Feb. 5, 2024 in CA 3,059,762, 4 pages. [cited by applicant]
Office Action dated Mar. 28, 2024 in CA 3,164,726, 3 pages. [cited by applicant]
Office Action in BR 112019007435-0 dated Jun. 17, 2025, 7 pages. [cited by applicant]
Office Action dated Apr. 28, 2020 in EP 17859424.8, 4 pages. [cited by applicant]
Decision to Refuse dated Aug. 4, 2021 in EP 17859424.8, 17 pages. [cited by applicant]
Notice of Allowance dated Mar. 31, 2022 in CA 2932828, 1 page. [cited by applicant]
Notice of Allowance dated Jun. 19, 2023 in CA 2932828, 1 page. [cited by applicant]