-
公开(公告)号：US12265928B1
公开(公告)日：2025-04-01
申请号：US18491579
申请日：2023-10-20
Applicant: Lyft, Inc.
Inventor： Orit Balicer Tsur , Vincent Chih-jye Chang , Dor Levi , Molly Angelica Ingles Lorenzo , Keshav Eva Klementine Puranmalka , Krishna Kumar Selvam
IPC: G06Q10/0631
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.
-
公开(公告)号：US11829910B1
公开(公告)日：2023-11-28
申请号：US18179933
申请日：2023-03-07
Applicant: Lyft, Inc.
Inventor： Orit Balicer Tsur , Vincent Chih-jye Chang , Dor Levi , Molly Angelica Ingles Lorenzo , Keshav Eva Klementine Puranmalka , Krishna Kumar Selvam
IPC: G06Q10/0631
CPC classification number: G06Q10/0631 , G06Q2240/00
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.
-
公开(公告)号：US20220164910A1
公开(公告)日：2022-05-26
申请号：US16953899
申请日：2020-11-20
Applicant: Lyft, Inc.
Inventor： Janie Jia Gu , Arman Jabbari , Krishna Kumar Selvam
Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for identifying provider devices and corresponding vehicles as candidates to transport time-sensitive (or otherwise prioritized) requestors and providing prioritized transportation options as fast passes for display on such requestors' devices. To provide such a prioritized transportation option, the disclosed systems can identify provider devices either matched or unmatched with requestors as candidates for prioritized transport based on estimated times of arrivals (ETAs) of vehicles for the candidate provider devices at the requestor's pickup location. Based on the ETAs at the pickup location, the disclosed systems can select a closest provider device from among the candidate provider devices to transport a prioritized requestor. After matching the prioritized requestor to the closest provider device, the disclosed systems can further search for providers with sooner ETAs.
-
公开(公告)号：US20210082076A1
公开(公告)日：2021-03-18
申请号：US16718130
申请日：2019-12-17
Applicant: Lyft, Inc
Inventor： Mayank Gulati , Peter Bansuk Lee , Guy-Baptiste Richard de Capele d'Hautpoul , Krishna Kumar Selvam , Charles Parker Sielman , Aleksandr Zamoshchin
Abstract: The disclosed computer-implemented method may calculate individual utility metrics for each combination of potential transportation requestors and cancellations to arrive at a more accurate total expected utility for shared transportation. In one embodiment, the method may reduce computation resource requirements by calculating each cancellation probability independently. In some examples, the method may only calculate utility metrics for some fixed number and/or percentage of the most probable combinations. In some embodiments, the method may account for travel time and/or distance when calculating utility metrics. By making matching decisions for shared transportation that account for the possibility of cancellation, the method may improve the efficiency of the transportation network. Various other methods, systems, and computer-readable media are also disclosed.
-
公开(公告)号：US11625652B2
公开(公告)日：2023-04-11
申请号：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 , G06Q10/0631
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.
-
Patent Agency Ranking
公开(公告)号：US10371539B2
公开(公告)日：2019-08-06
申请号：US15454906
申请日：2017-03-09
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.
-
公开(公告)号：US20240230347A1
公开(公告)日：2024-07-11
申请号：US18616784
申请日：2024-03-26
Applicant: Lyft, Inc.
Inventor： Austin Broyles , Robert Anthony Farmer , Krishna Kumar Selvam
CPC classification number: G01C21/3438 , G01C21/362 , G01C21/3691 , H04W4/02 , H04W4/023 , H04W4/029 , G06Q2240/00
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.
-
公开(公告)号：US11946756B2
公开(公告)日：2024-04-02
申请号：US17822660
申请日：2022-08-26
Applicant: Lyft, Inc.
Inventor： Austin Broyles , Robert Anthony Farmer , Krishna Kumar Selvam
CPC classification number: G01C21/3438 , G01C21/362 , G01C21/3691 , H04W4/02 , H04W4/023 , H04W4/029 , G06Q2240/00
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.
-
公开(公告)号：US20230075585A1
公开(公告)日：2023-03-09
申请号：US17822660
申请日：2022-08-26
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.
-
公开(公告)号：US20210082075A1
公开(公告)日：2021-03-18
申请号：US16718129
申请日：2019-12-17
Applicant: Lyft, Inc.
Inventor： Charles Parker Spielman , Mayank Gulati , Guy-Baptiste Richard de Capele d'Hautpoul , Krishna Kumar Selvam , Aleksandr Zamoshchin
Abstract: The disclosed computer-implemented method may include implementing factors and conversion probabilities when matching a transportation requestor to a transportation provider. Matches between transportation requestors and transportation providers that rely solely on an estimation of arrival time may not give requestors or providers the best transportation options. Lacking these optimal transportation options, requestors and providers may move to other platforms. By looking at a various transportation factors and conversion probabilities, the method may provide optimal transportation options to both requestors and providers. Various other methods, systems, and computer-readable media are also disclosed.
-
-
-
-
-
-
-
-
-
Search Results
14
records
(took 0.018 seconds)
