-
公开(公告)号：US11441914B2
公开(公告)日：2022-09-13
申请号：US16531897
申请日：2019-08-05
Applicant: Lyft, Inc.
Inventor： Austin Broyles , Robert Anthony Farmer , Krishna Kumar Selvam
Abstract: Embodiments provide techniques, including systems and methods, for determining matches of requestors and providers based on a dynamic provider eligibility model. For example, a request matching model uses an estimated arrival time for a requestor and estimated travel times for available providers to a pickup location to determine eligible providers for matching to a ride request. The matching model determines those providers that are far enough away from the request location to allow the requestor time to arrive at the pickup location without matching providers that are too far away, causing delay for the requestor and lowering the efficiency of the system by taking provider system resources from other service areas and increasing provider downtime upon matching. Additionally, embodiments provide more efficient matching processing leading to fewer canceled matched requests, fewer requests for a successful match, and fewer system resources necessary to meet requestor demand.
-
公开(公告)号：US20200072622A1
公开(公告)日：2020-03-05
申请号：US16531897
申请日：2019-08-05
Applicant: Lyft, Inc.
Inventor： Austin Broyles , Robert Anthony Farmer , Krishna Kumar Selvam
Abstract: Embodiments provide techniques, including systems and methods, for determining matches of requestors and providers based on a dynamic provider eligibility model. For example, a request matching model uses an estimated arrival time for a requestor and estimated travel times for available providers to a pickup location to determine eligible providers for matching to a ride request. The matching model determines those providers that are far enough away from the request location to allow the requestor time to arrive at the pickup location without matching providers that are too far away, causing delay for the requestor and lowering the efficiency of the system by taking provider system resources from other service areas and increasing provider downtime upon matching. Additionally, embodiments provide more efficient matching processing leading to fewer canceled matched requests, fewer requests for a successful match, and fewer system resources necessary to meet requestor demand.
-
13.发明申请公开(公告)号：US20200005205A1
公开(公告)日：2020-01-02
申请号：US16024349
申请日：2018-06-29
Applicant: Lyft, Inc.
Inventor： Orit Balicer Tsur , Vincent Chih-jye Chang , Dor Levi , Molly Angelica Ingles Lorenzo , Keshav Puranmalka , Krishna Kumar Selvam
IPC: G06Q10/06
Abstract: The disclosed computer-implemented method may include matching transportation requests. By collecting and batching match requests over an extended period, a dynamic transportation matching system may identify more efficient matches (e.g., may match transportation requests with greater overlaps). In addition, by dynamically setting and/or extending the upper bound of time that a transportation request may remain batched with other transportation requests, the dynamic transportation matching system may account for contextual information thereby situationally improving matching efficiencies made possible with higher upper bounds while avoiding requestor dissatisfaction, lost conversions, or other inefficiencies that may result from upper bounds that are too high. Furthermore, by providing a notification interface for a transportation requestor device that notifies the requestor when to be ready, a transportation matching application may provide a positive requestor experience while allowing for longer match windows. Various other methods, systems, and computer-readable media are also disclosed.
-
公开(公告)号：US20180259351A1
公开(公告)日：2018-09-13
申请号：US15454906
申请日：2017-03-09
Applicant: Lyft, Inc.
Inventor： Austin Broyles , Robert Anthony Farmer , Krishna Kumar Selvam
CPC classification number: G01C21/3438 , G01C21/362 , G01C21/3691 , G06Q2240/00 , H04W4/02 , H04W4/023 , H04W4/029
Abstract: Embodiments provide techniques, including systems and methods, for determining matches of requestors and providers based on a dynamic provider eligibility model. For example, a request matching model uses an estimated arrival time for a requestor and estimated travel times for available providers to a pickup location to determine eligible providers for matching to a ride request. The matching model determines those providers that are far enough away from the request location to allow the requestor time to arrive at the pickup location without matching providers that are too far away, causing delay for the requestor and lowering the efficiency of the system by taking provider system resources from other service areas and increasing provider downtime upon matching. Additionally, embodiments provide more efficient matching processing leading to fewer canceled matched requests, fewer requests for a successful match, and fewer system resources necessary to meet requestor demand.
-
-
-
Search Results
14
records
(took 0.017 seconds)
