Uber Technologies, Inc.

Vishnu Srinivasan Sundaresan

Eoin O'Mahony

Danhua Guo

Lior Seeman

Meisam Vosoughpour

John Mark Nickels

Miraj Rahematpura

Philippe Sekine

Mustafa Sahin

Kenneth Kuhn

Miraj Ramhematpura

Robert Paine

Emre Demiralp

Ameya Tayade

Bin Wu

Robert Louis Cornacchia

Cinar Kilcioglu

Yuehai Xu

Kevin A Rowe

Khang Tran

Ruiyan Zhou

Zhengyun Sun

Justin Wie

Anurag Gupta

Meisam Vosoughpour Yazdchi

Yawen Wei

Systems and method for dynamically managing add-on orders within a delivery service application. For example, a computer-implemented method includes obtaining data indicative of a primary order request. The method includes selecting, ranking, and displaying menu items for add-on orders associated with a primary order. The method includes obtaining user data provided by a user through a user interface associated with a delivery service application. The method includes determining, in response to obtaining the user data, that the primary order request is eligible for an add-on order. The method includes determining merchants for the add-on order. The selected merchants can be determined from a plurality of candidate merchants based at least in part on analysis of merchant-specific data relative to the user data indicative of the primary order request. The method includes updating the user interface to display data associated with the one or more selected merchants for the add-on order.

Merchant selection model for dynamic management of add-ons for delivery service orders

A system computes a timing interval between high-capacity vehicles (HCVs) for each of a plurality of HCV corridors within a geographic region, each respective HCV corridor of the plurality of HCV corridors including a start area. For each respective HCV corridor, the system transmits, via a network communication interface, (i) first data to a first computing device associated with a first HCV, the first data indicating the start area of the respective HCV corridor, and a first start time for the first HCV, and (ii) second data to a second computing device associated with a second HCV, the second data indicating the start area of the respective HCV corridor and a second start time for the second HCV, wherein the first start time for the first HCV and the second start time for the second HCV are based on the computed timing interval for the respective HCV corridor.

Computing timing intervals for vehicles through directional route corridor

A network computer system operates to receive service requests from requesters. Based at least in part on a proximity between the current locations of a first and a second requester, the system can match the first service request and the second service request by (i) selecting pickup locations for the first and second requesters, (ii) transmitting rendezvous information to the computing devices of the first and second requesters, (iii) determining an estimated time interval for each of the first requester and the second requester to arrive at their pickup locations, and (iv) selecting a transport provider to service both the first transport request and the second transport request.

Network computer system to arrange pooled transport services

A computing system computes a timing interval between high-capacity vehicles (HCVs) for each HCV corridor within a geographic region to control rates of HCVs entering and exiting each of the HCV corridors. For each of the HCV corridors, the computing system schedules a first HCV to provide a transport service along the corridor beginning at a first starting time, transmits first schedule data for the corridor to the first HCV, schedules a second HCV to provide the transport service along the corridor beginning at a second starting time after the first starting time according to the timing interval for the corridor, and transmits second schedule data for the corridor to the second HCV.

Computing timing intervals for vehicles through directional route corridors

A network computer system operates to receive service requests from multiple requesters. Based at least in part on a proximity between the current locations of a first and a second requester, the system can match the first service request and the second service request by (i) selecting a pickup location for the first and second requesters, (ii) transmitting rendezvous information to the computing devices of the first and second requesters, (iii) determining an estimated time interval for each of the first requester and the second requester to arrive at the pickup location, and (iv) selecting a transport provider to service both the first transport request and the second transport request, based at least in part on the pickup location, a current location of the transport provider, and the estimated time interval for each of the first requester and the second requester.

A multi-leg transport system receives a transport request and determines a number of transfer locations between the origin location and the destination. The system selects a first provider to transport the user from the origin location to a transfer location and remotely monitors the position of the user as the user travels to the transfer location. In response to determining that the travel time to the transfer location is within a threshold, the system selects a second provider to transport the user from the transfer location to either the next transfer location or the destination for the transport request.

Network system for multi-leg transport

A network computer system operates to receive a plurality of service requests over a given time interval, where individual service requests specify a respective target destination and a current location of a respective requester device. For each service request, the network computer system arranges a pooled transport service for the corresponding requester by selecting a service start location, and instructions for enabling the requester to travel to the service start location. The network computer system may select the service provider based on a variety of considerations, including the service start location, the current location of the corresponding service provider, and the determined time interval.

Growing community of inventors

San Francisco, CA, United States of America

Vishnu Srinivasan Sundaresan