IP Library › Granted Patent US 12,512,003
Granted Patent B2
US 12,512,003 · App. 18/592,149 · Granted Dec 30, 2025

Real-time service provider progress monitoring

Inventors: Ashley Quitoriano (San Francisco, CA); Kevin Spieser (San Francisco, CA); Parijat Mazumdar (San Francisco, CA); Rei Chiang (San Francisco, CA); Shicong Meng (San Francisco, CA); Zhi Li (San Francisco, CA)
Assignee: Uber Technologies, Inc.
G08G1/205H04W4/029G08G1/202
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,512,003
App. No.
18/592,149
Filed
Feb 29, 2024
Granted
Dec 30, 2025
Kind
B2
Art Unit
2689
USPC
340/989
Abstract

A system can receive a request for transport from a computing device of a user and select a service provider to provide transport for the user to a destination location. The system can receive location data from the computing device of the service provider. After the service provider picks up the user, the system can determine whether the service provider progresses toward the destination location in accordance with a set of progress conditions. Based at least in part on determining that the service provider has not progressed toward the destination location in accordance with the set of progress conditions, the system can adjust a fare for providing transport for the user to the destination location.

Claims (52)

1 . A network computer system comprising:

one or more processors; and

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

receive, over one or more networks, a request for transport from a computing device of a user, the request including a pickup location;

select a service provider to provide transport to the user from the pickup location;

update a state of the service provider to indicate that the request has been accepted;

determine a current location of the service provider, based in part on location data transmitted from a computing device of the service provider;

based at least in part on the service provider's current location, an initial estimated time of arrival (ETA) of the service provider to the pickup location;

at multiple instances, determine each of (i) a duration of time that has elapsed since the determination of the initial ETA; and (ii) a remaining ETA from the current location of the service provider to the pickup location;

making a determination as to whether the service provider is intentionally not progressing towards the pickup location, based on a comparison of the remaining ETA, the duration of time elapsed, and the initial ETA with a predetermined threshold; and

based at least in part on the determination that the service provider is intentionally not progressing towards the pickup location, transmit, over the one or more networks, content data to the computing device of the service provider to cause a warning to be displayed on a user interface of the computing device of the service provider.

2 . The network computer system of claim 1 , wherein the warning notifies the service provider that a set of progress conditions are not being met.

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

transmit, over the one or more networks, a set of recommendations to the computing device of the service provider to encourage the service provider to meet the set of progress conditions.

4 . The network computer system of claim 3 , wherein the executed instructions cause the network computer system to:

make a determination as to whether the user has no intention of progressing towards the pickup location based in part on a response of the service provider to the notification.

5 . The network computer system of claim 3 , wherein the set of recommendations comprise at least one of a route recommendation or one or more movement recommendations.

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

determine the remaining ETA in any of the multiple instances in which it is determined based in part on the current location of the service provider that the service provider has crossed from one sub-region to another.

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

determine the remaining ETA in any of the multiple instances in which it is determined based in part on the current location of the service provider that the service provider has remained in a sub-region for an elapsed period of time.

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

receive, over one or more networks, a request for transport from a computing device of a user, the request including a pickup location;

select a service provider to provide transport to the user from the pickup location;

update a state of the service provider to indicate that the request has been accepted;

determine a current location of the service provider, based in part on location data transmitted from a computing device of the service provider;

based at least in part on the service provider's current location, determine an initial estimated time of arrival (ETA) of the service provider to the pickup location;

at multiple instances, determine each of (i) a duration of time that has elapsed since the determination of the initial ETA; and (ii) a remaining ETA from the current location of the service provider to the pickup location;

making a determination as to whether the service provider is intentionally not progressing towards the pickup location, based on a comparison of the remaining ETA, the duration of time elapsed, and the initial ETA with a predetermined threshold; and

based at least in part on the determination that the service provider is intentionally not progressing towards the pickup location, transmitting, over the one or more networks, content data to the computing device of the service provider to cause a warning to be displayed on a user interface of the computing device of the service provider.

9 . The non-transitory computer readable medium of claim 8 , wherein the warning notifies the service provider that a set of progress conditions are not being met.

10 . The non-transitory computer readable medium of claim 9 , wherein the executed instructions further cause the network computer system to:

transmit, over the one or more networks, a set of recommendations to the computing device of the service provider to encourage the service provider to meet the set of progress conditions.

11 . The non-transitory computer readable medium of claim 10 , wherein the executed instructions cause the network computer system to:

make a determination as to whether the user has no intention of progressing towards the pickup location based in part on a response of the service provider to the notification.

12 . The non-transitory computer readable medium of claim 10 , wherein the set of recommendations comprise at least one of a route recommendation or one or more movement recommendations.

13 . The non-transitory computer readable medium of claim 8 , wherein the executed instructions further cause the network computer system to:

determine the remaining ETA in any of the multiple instances in which it is determined based in part on the current location of the service provider that the service provider has crossed from one sub-region to another.

14 . The non-transitory computer readable medium of claim 8 , wherein the executed instructions further cause the network computer system to:

determine the remaining ETA in any of the multiple instances in which it is determined based in part on the current location of the service provider that the service provider has remained in a sub-region for an elapsed period of time.

15 . A computer-implemented method of real-time transport provider progress monitoring, 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, the request including a pickup location;

selecting a service provider to provide transport to the user from the pickup location;

updating a state of the service provider to indicate that the request has been accepted;

determining a current location of the service provider, based in part on location data transmitted from a computing device of the service provider;

based at least in part on the service provider's current location, determining an initial estimated time of arrival (ETA) of the service provider to the pickup location;

at multiple instances, determine each of (i) a duration of time that has elapsed since the determination of the initial ETA; and (ii) a remaining ETA from the current location of the service provider to the pickup location;

making a determination as to whether the service provider is intentionally not progressing towards the pickup location, based on a comparison of the remaining ETA, the duration of time elapsed, and the initial ETA with a predetermined threshold; and

based at least in part on the determination that the service provider is intentionally not progressing towards the pickup location, transmitting, over the one or more networks, content data to the computing device of the service provider to cause a warning to be displayed on a user interface of the computing device of the service provider.

16 . The method of claim 15 , wherein the warning notifies the service provider that a set of progress conditions are not being met.

17 . The method of claim 16 , further comprising:

transmitting, over the one or more networks, a set of recommendations to the computing device of the service provider to encourage the service provider to meet the set of progress conditions.

Continuity (6)
Continuation 18076043 · Dec 6, 2022
Continuation 17341761 · Jun 8, 2021
Continuation 16775085 · Jan 28, 2020
Continuation 16196827 · Nov 20, 2018
Provisional Application 62591037 · Nov 27, 2017
Related Publication 20240203263A1 · Jun 20, 2024
References Cited (136)
US 4858120A · Samuelson · 1989 [cited by applicant]
US 8458041B1 · Jakobsson · 2013 [cited by applicant]
US 9967750B1 · Fernandez · 2018 [cited by applicant]
US 10304027B1 · Haque · 2019 [cited by applicant]
US 10359783B2 · Williams · 2019 [cited by applicant]
US 10425490B2 · Yamashita · 2019 [cited by applicant]
US 10697784B1 · Li · 2020 [cited by applicant]
US 11122255B2 · Rahematpura · 2021 [cited by applicant]
US 11482111B2 · Kuhn · 2022 [cited by applicant]
US 20020196415A1 · Shiratani · 2002 [cited by applicant]
US 20030195699A1 · Jones · 2003 [cited by applicant]
US 20060178812A1 · Affleck · 2006 [cited by applicant]
US 20080195428A1 · O'Sullivan · 2008 [cited by applicant]
US 20080255722A1 · McClellan · 2008 [cited by applicant]
US 20090192851A1 · Bishop · 2009 [cited by applicant]
US 20090248587A1 · Van Buskirk · 2009 [cited by applicant]
US 20090326991A1 · Wei · 2009 [cited by examiner]
US 20100036606A1 · Jones · 2010 [cited by applicant]
US 20100325719A1 · Etchegoyen · 2010 [cited by applicant]
US 20110099040A1 · Felt · 2011 [cited by applicant]
US 20120040692A1 · Baba · 2012 [cited by applicant]
US 20120130627A1 · Islam · 2012 [cited by applicant]
US 20120211498A1 · Cognard · 2012 [cited by applicant]
US 20120232943A1 · Myr · 2012 [cited by applicant]
US 20120283893A1 · Lee · 2012 [cited by applicant]
US 20120292388A1 · Hernandez · 2012 [cited by applicant]
US 20130018795A1 · Kolhatkar · 2013 [cited by applicant]
US 20130090086A1 · Lopez · 2013 [cited by applicant]
US 20130158846A1 · Zhang · 2013 [cited by applicant]
US 20130214898A1 · Pineau · 2013 [cited by applicant]
US 20130214902A1 · Pineau · 2013 [cited by applicant]
US 20130226627A1 · Kubovcik · 2013 [cited by applicant]
US 20130340052A1 · Jakobsson · 2013 [cited by applicant]
US 20140037184A1 · Gorski · 2014 [cited by applicant]
US 20140051465A1 · Ruys · 2014 [cited by applicant]
US 20140270411A1 · Shu · 2014 [cited by applicant]
US 20150065166A1 · Ward · 2015 [cited by applicant]
US 20150206437A1 · Fowler · 2015 [cited by applicant]
US 20150228000A1 · Bijor · 2015 [cited by applicant]
US 20150271290A1 · Tao · 2015 [cited by applicant]
US 20150307107A1 · Tamari · 2015 [cited by applicant]
US 20150324708A1 · Skipp · 2015 [cited by applicant]
US 20150348221A1 · Pedersen · 2015 [cited by applicant]
US 20150369621A1 · Abhyanker · 2015 [cited by applicant]
US 20160048837A1 · Jin · 2016 [cited by applicant]
US 20160055605A1 · Kim · 2016 [cited by applicant]
US 20160129787A1 · Netzer · 2016 [cited by applicant]
US 20160209220A1 · Laetz · 2016 [cited by applicant]
US 20160210691A9 · LaFrance · 2016 [cited by applicant]
US 20160232719A1 · Brinig · 2016 [cited by applicant]
US 20160247247A1 · Scicluna · 2016 [cited by applicant]
US 20160307287A1 · Jat · 2016 [cited by applicant]
US 20160307289A1 · Choksi · 2016 [cited by applicant]
US 20160373473A1 · Truong · 2016 [cited by applicant]
US 20170039890A1 · Truong · 2017 [cited by applicant]
US 20170052034A1 · Magazinik · 2017 [cited by applicant]
US 20170111364A1 · Rawat · 2017 [cited by applicant]
US 20170169366A1 · Klein · 2017 [cited by applicant]
US 20170193458A1 · Marco · 2017 [cited by applicant]
US 20170200061A1 · Julian · 2017 [cited by applicant]
US 20170236411A1 · Sumers · 2017 [cited by applicant]
US 20170309552A1 · Singleton · 2017 [cited by applicant]
US 20170314948A1 · Racah · 2017 [cited by applicant]
US 20180025407A1 · Zhang · 2018 [cited by applicant]
US 20180032964A1 · Gkiotsalitis · 2018 [cited by applicant]
US 20180060988A1 · Klenk · 2018 [cited by applicant]
US 20180091604A1 · Yamashita · 2018 [cited by applicant]
US 20180101877A1 · Song · 2018 [cited by applicant]
US 20180121994A1 · Matsunaga · 2018 [cited by examiner]
US 20180124207A1 · Marueli · 2018 [cited by applicant]
US 20180143027A1 · Schlesinger · 2018 [cited by applicant]
US 20180188049A1 · Shi · 2018 [cited by applicant]
US 20180281803A1 · Mukai · 2018 [cited by applicant]
US 20180302743A1 · Bai · 2018 [cited by applicant]
US 20180310135A1 · Cirit · 2018 [cited by applicant]
US 20180339712A1 · Kislovskiy · 2018 [cited by applicant]
US 20180352376A1 · Shuman · 2018 [cited by applicant]
US 20190102873A1 · Wang · 2019 [cited by applicant]
US 20190139450A1 · Truong · 2019 [cited by applicant]
US 20190146508A1 · Dean · 2019 [cited by applicant]
US 20190146509A1 · Dean · 2019 [cited by applicant]
US 20190154454A1 · Verma · 2019 [cited by applicant]
US 20190156254A1 · Hansen · 2019 [cited by applicant]
US 20190164432A1 · Quitoriano · 2019 [cited by applicant]
US 20190205785A1 · Volk · 2019 [cited by applicant]
US 20190212149A1 · Ho · 2019 [cited by applicant]
US 20200042019A1 · Marczuk · 2020 [cited by applicant]
US 20200112570A1 · Yang · 2020 [cited by applicant]
US 20200168100A1 · Quitoriano · 2020 [cited by applicant]
US 20200192366A1 · Levinson · 2020 [cited by applicant]
US 20200292346A1 · Turner · 2020 [cited by applicant]
US 20200356911A1 · Sahin · 2020 [cited by applicant]
US 20200393256A1 · Sahin · 2020 [cited by applicant]
US 20200402392A1 · Robinson · 2020 [cited by applicant]
US 20210020047A1 · Kuhn · 2021 [cited by applicant]
US 20210108931A1 · Liu · 2021 [cited by applicant]
US 20210203672A1 · Yang · 2021 [cited by applicant]
US 20210295707A1 · Quitoriano · 2021 [cited by applicant]
US 20220170753A1 · Verma · 2022 [cited by applicant]
US 20220355834A1 · Taylor · 2022 [cited by applicant]
US 20230114253A1 · Quitoriano · 2023 [cited by applicant]
US 20230351274A1 · Henrickson · 2023 [cited by applicant]
US 20230388318A1 · Yang · 2023 [cited by applicant]
CN 202443493 · 2002 [cited by applicant]
CN 104021668 · 2014 [cited by applicant]
CN 104537831 · 2015 [cited by applicant]
CN 103136933 · 2015 [cited by applicant]
CN 10585148 · 2015 [cited by applicant]
CN 105679076 · 2016 [cited by applicant]
CN 106408099 · 2017 [cited by applicant]
CN 107451690 · 2017 [cited by applicant]
CN 109034566 · 2018 [cited by applicant]
CN 109493588 · 2019 [cited by applicant]
EP 2333582 · 2011 [cited by applicant]
EP 3355028 · 2018 [cited by applicant]
KR 102019007627 · 2019 [cited by applicant]
WO WO20120167319 · 2012 [cited by applicant]
WO WO20160127109 · 2016 [cited by applicant]
WO WO20170114125 · 2017 [cited by applicant]
WO WO20170132447 · 2017 [cited by applicant]
“Advanced Technologies for Detecting and Preventing Fraud at Uber”, Jun. 14, 2018 [Retrieved on Jan. 29, 2020 from https:// eng.uber.com/advanced-technologies-detecting-preventing-fraud-uber/]. [cited by applicant]
IPRP in PCT/2018/062084 dated Jun. 4, 2020. [cited by applicant]
IPRP In PCT/2018/062297 dated Jun. 11, 2020. [cited by applicant]
IPRP in PCT/US2020/032041 dated Jul. 29, 2021. [cited by applicant]
ISR and Written Opinion in PCT/US2018/062084 dated Feb. 22, 2019. [cited by applicant]
ISR and Written Opinion in PCT/US2018/062297 dated Feb. 13, 2019. [cited by applicant]
ISR and Written Opinion in PCT/US2020/032041 dated Oct. 1, 2020. [cited by applicant]
ISR and Written Opinion in PCT/US2020/037562 dated Sep. 24, 2020. [cited by applicant]
ISR and Written Opinion in PCT/US2020/037604 dated Sep. 24, 2020. [cited by applicant]
Liang, Rerouting Buses using Data Science—Part 1, Open Government Products, Jan. 15, 2019, https://blog.data.gov.sg/ rerouting-buses-using-data-science-part-i-4d6c9d4f1f. [cited by applicant]
Luo, Shuyu, Loss Function (Part III) Support Vector Machine, Oct. 15, 2018, Medium.com (2018). [cited by applicant]
Luo, Shuyu: Loss Function (Part II): Logistic Regression, Oct. 13, 2018, Medium.com (2018). [cited by applicant]
Luo, Shuyu: Optimization: Loss Function under the Hood (Part I), Sep. 24, 2018, Towards Data Science (2018). [cited by applicant]
Pan Juan; Proactive Vehicle re-routing strategies for congestion avoidance, 2017, NJIT.edu, https://web.njit.edu/ borcea/ papers/dcross 12.pdf (2017). [cited by applicant]
WRO in PCT/US2020/032041 dated Apr. 26, 2021. [cited by applicant]
Zhao B. and Chen, Q., “Location Spoofing in a Location-Based Game: A Case Study of Pokemon Go.” International Cartographic Conference, May 31, 2017, pp. 21-32 (Abstract Only). [cited by applicant]