US 11,928,713 B2
Systems and methods for performing constraint space partitioning
Mayank Gulati, San Francisco, CA (US); and Charles Parker Spielman, San Francisco, CA (US)
Assigned to Lyft, Inc., San Francisco, CA (US)
Filed by Lyft, Inc., San Francisco, CA (US)
Filed on Dec. 19, 2019, as Appl. No. 16/721,437.
Prior Publication US 2021/0192585 A1, Jun. 24, 2021
Int. Cl. G06Q 30/0283 (2023.01); G01C 21/34 (2006.01); G06Q 10/02 (2012.01); G06Q 10/047 (2023.01); G06Q 10/063 (2023.01); G06Q 50/30 (2012.01)
CPC G06Q 30/0284 (2013.01) [G01C 21/3438 (2013.01); G01C 21/3453 (2013.01); G06Q 10/02 (2013.01); G06Q 10/047 (2013.01); G06Q 10/063 (2013.01); G06Q 50/30 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A system comprising:
a non-transitory memory; and
one or more hardware processors configured to execute instructions from the non-transitory memory to perform operations comprising:
determining that a transportation requestor device has instantiated a transportation application that provides access to a transportation network;
prior to receiving a request for transportation via the transportation application, generating, based on real-time information about a current state of the transportation network, a set of pre-request matches between a transportation requestor device and transportation provider devices;
determining, from the set of pre-request matches, a subset of pareto-optimal pre-request matches, wherein pareto-optimality of the subset of pareto-optimal pre-request matches is according to a set of attributes of the matches, the subset of pareto-optimal pre-request matches being defined by one or more user-related data that are associated with the transportation requestor device;
generating, based on the subset of pareto-optimal pre-request matches, a list of pre-request matches; and
presenting the list of pre-request matches for display to the transportation requestor device via the transportation application.