IP Library Granted Patent US 12,299,608
Granted Patent B2
US 12,299,608 · App. 17/733,788 · Granted May 13, 2025

Generation of navigational route networks

Inventors: Kristian Henrickson (San Francisco, CA); Zijian Li (San Francisco, CA); Kazumori Haruna (San Francisco, CA); Aaron Chazhoor (San Francisco, CA); Philippe Sekine (San Francisco, CA); Ashwin Prabhu (San Francisco, CA); Hoang Ly (San Francisco, CA); David O'Neil (San Francisco, CA)
Assignee: Uber Technologies, Inc.
G06Q10/047G01C21/3438G06Q30/0205
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,299,608
App. No.
17/733,788
Granted
May 13, 2025
Kind
B2
Abstract

A system can arrange a plurality of transport services in a geographic region by matching received transport requests from requesters with standard vehicles to facilitate transport of the requesters to destinations indicated in the transport requests. The transport requests can comprise both requests for standard vehicles and high-capacity vehicle (HCV) requests from HCV requesters. Based on a set of transport services for HCV requesters, from the plurality of transport services, the system can determine over a specified duration of time, a set of demand data for HCV transport services in the geographic region. The system can then execute a route design model using the set of demand data to generate an HCV route network for the geographic region.

Claims (35)

1. A computing system implementing a transport service, comprising:

one or more processors;

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

receive requests for standard vehicles from computing devices of requesters in a geographic region;

receive requests for high-capacity vehicles (HCVs) from computing devices of HCV requesters in the geographic region;

for both the requests for standard vehicles and the requests for HCVs, match the received requests with standard vehicles to facilitate transport of the requesters and HCV requesters to destinations indicated in the requests;

based on transport arranged for the HCV requesters in the geographic region over a specified duration of time, generate a set of demand data for HCV transport services in the geographic region; and

execute a route design model using the set of demand data to generate an HCV route network for the geographic region, the HCV route network comprising a set of HCV routes and an HCV schedule for each HCV route in the set of HCV routes.

2. The computing system of claim 1 , wherein the set of demand data comprise spatial and temporal aspects of the transport requests serviced for the HCV requesters over the specified duration of time.

3. The computing system of claim 2 , wherein the spatial and temporal aspects correspond to a plurality of: a time for each of the HCV transport requests, start locations of the HCV requesters, and destinations of the HCV requesters.

4. The computing system of claim 1 , wherein the standard vehicles comprise one or more of sedans, coupes, hatchbacks, station wagons, sport utility vehicles (SUVs), minivans, or luxury vehicles, and wherein the HCVs comprise at least one of vans, trucks, or buses having a seat capacity that exceeds seat capacities of the standard vehicles.

5. The computing system of claim 1 , wherein the route design model further determines respective seat capacities for HCVs that are to operate on each respective HCV route of the set of HCV routes in accordance with the HCV schedule for the respective HCV route.

6. The computing system of claim 1 , wherein the executed instructions cause the computing system to compute fares for the HCV requests at a different fare rate than fares for the requests for standard vehicles.

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

receive requests for standard vehicles from computing devices of requesters in a geographic region;

receive requests for high-capacity vehicles (HCVs) from computing devices of HCV requesters in the geographic region;

for both the requests for standard vehicles and the requests for HCVs, match the received requests with standard vehicles to facilitate transport of the requesters and the HCV requesters to destinations indicated in the requests;

based on transport arranged for the HCV requesters in the geographic region over a specified duration of time, generate a set of demand data for HCV transport services in the geographic region; and

execute a route design model using the set of demand data to generate an HCV route network for the geographic region, the HCV route network comprising a set of HCV routes and an HCV schedule for each HCV route in the set of HCV routes.

8. The non-transitory computer readable medium of claim 7 , wherein the set of demand data comprise spatial and temporal aspects of the transport requests serviced for the HCV requesters over the specified duration of time.

9. The non-transitory computer readable medium of claim 8 , wherein the spatial and temporal aspects correspond to a plurality of: a time for each of the HCV transport requests, start locations of the HCV requesters, and destinations of the HCV requesters.

10. The non-transitory computer readable medium of claim 7 , wherein the standard vehicles comprise one or more of sedans, coupes, hatchbacks, station wagons, sport utility vehicles (SUVs), minivans, or luxury vehicles, and wherein the HCVs comprise at least one of vans, trucks, or buses having a seat capacity that exceeds seat capacities of the standard vehicles.

11. The non-transitory computer readable medium of claim 7 , wherein the route design model further determines respective seat capacities for HCVs that are to operate on each respective HCV route of the set of HCV routes in accordance with the HCV schedule for the respective HCV route.

12. The non-transitory computer readable medium of claim 7 , wherein the executed instructions cause the computing system to compute fares for the HCV requests at a different fare rate than fares for the requests for standard vehicles.

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

receiving requests for standard vehicles from computing devices of requesters in a geographic region;

receiving requests for high-capacity vehicles (HCVs) from computing devices of HCV requesters in the geographic region;

for both the requests for standard vehicles and the requests for HCVs, matching the received requests with standard vehicles to facilitate transport of the requesters and HCV requesters to destinations indicated in the requests;

based on transport arranged for the HCV requesters over a specified duration of time, generate a set of demand data for HCV transport services in the geographic region; and

executing a route design model using the set of demand data to generate an HCV route network for the geographic region, the HCV route network comprising a set of HCV routes and an HCV schedule for each HCV route in the set of HCV routes.

14. The method of claim 13 , wherein the set of demand data comprise spatial and temporal aspects of the transport requests serviced for the HCV requesters over the specified duration of time.

15. The method of claim 14 , wherein the spatial and temporal aspects correspond to a plurality of: a time for each of the HCV transport requests, start locations of the HCV requesters, and destinations of the HCV requesters.

16. The method of claim 13 , wherein the standard vehicles comprise one or more of sedans, coupes, hatchbacks, station wagons, sport utility vehicles (SUVs), minivans, or luxury vehicles, and wherein the HCVs comprise at least one of vans, trucks, or buses having a seat capacity that exceeds seat capacities of the standard vehicles.

17. The method of claim 13 , wherein the route design model further determines respective seat capacities for HCVs that are to operate on each respective HCV route of the set of HCV routes in accordance with the HCV schedule for the respective HCV route.

18. The method of claim 13 , wherein the one or more processors compute fares for the HCV requests at a different rate than fares for the requests for standard vehicles.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 13, 2025
From: HENRICKSON, KRISTIAN; LY, HOANG; PRABHU, ASHWIN; CHAZHOOR, AARON; HARUNA, KAZUMORI; LI, ZIJIAN; O'NEIL, DAVID; SEKINE, PHILIPPE
To: UBER TECHNOLOGIES, INC.
Reel/Frame 070208/0429 →
Continuity (1)
Related Publication 20230351274A1 · Nov 2, 2023
References Cited (86)
US 4858120A · Samuelson · 1989 [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 20030195699A1 · Jones · 2003 [cited by applicant]
US 20060178812A1 · Affleck · 2006 [cited by applicant]
US 20090192851A1 · Bishop · 2009 [cited by applicant]
US 20100036606A1 · Jones · 2010 [cited by applicant]
US 20100185486A1 · Barker · 2010 [cited by examiner]
US 20100325719A1 · Etchegoyen · 2010 [cited by applicant]
US 20110099040A1 · Felt · 2011 [cited by applicant]
US 20120130627A1 · Islam · 2012 [cited by applicant]
US 20120232943A1 · Myr · 2012 [cited by applicant]
US 20130158846A1 · Zhang · 2013 [cited by applicant]
US 20130226627A1 · Kubovcik · 2013 [cited by applicant]
US 20140051465A1 · Ruys · 2014 [cited by applicant]
US 20150142497A1 · Osumi · 2015 [cited by examiner]
US 20150206437A1 · Fowler · 2015 [cited by applicant]
US 20150271290A1 · Tao · 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 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 20170052034A1 · Magazinik · 2017 [cited by applicant]
US 20170169366A1 · Klein · 2017 [cited by applicant]
US 20170193458A1 · Marco · 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 20180143027A1 · Schlesinger · 2018 [cited by applicant]
US 20180188049A1 · Shi · 2018 [cited by examiner]
US 20180281803A1 · Mukai · 2018 [cited by applicant]
US 20180302743A1 · Bai · 2018 [cited by applicant]
US 20180339712A1 · Kislovskiy · 2018 [cited by applicant]
US 20190146508A1 · Dean · 2019 [cited by examiner]
US 20190146509A1 · Dean · 2019 [cited by applicant]
US 20190154454A1 · Verma · 2019 [cited by applicant]
US 20190156254A1 · Hansen · 2019 [cited by examiner]
US 20190164432A1 · Quitoriano · 2019 [cited by applicant]
US 20190212149A1 · Ho · 2019 [cited by applicant]
US 20200042019A1 · Marczuk · 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 examiner]
US 20200393256A1 · Sahin · 2020 [cited by examiner]
US 20200402392A1 · Robinson · 2020 [cited by applicant]
US 20210020047A1 · Kuhn · 2021 [cited by applicant]
US 20210108931A1 · Liu · 2021 [cited by applicant]
US 20210295707A1 · Quitoriano · 2021 [cited by applicant]
US 20220170753A1 · Verma · 2022 [cited by applicant]
US 20220355834A1 · Kuhn · 2022 [cited by applicant]
US 20230114253A1 · Quitoriano · 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 3355028 · 2018 [cited by applicant]
KR 102019007627 · 2019 [cited by applicant]
WO WO20120167319 · 2012 [cited by applicant]
WO WO20160127109 · 2016 [cited by applicant]
WO WO20170132447 · 2017 [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]
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]
Luo, Shuyu: Optimization: Loss Function under the Hood (Part I), Sep. 24, 2018, Towards Data Science (2018). [cited by applicant]
Luo, Shuyu: Loss Function (Part II): Logistic Regression, Oct. 13, 2018, Medium.com (2018). [cited by applicant]
Luo, Shuyu, Loss Function (Part III) Support Vector Machine, Oct. 15, 2018, Medium.com (2018). [cited by applicant]