Abstract: The disclosed computer-implemented method may include (i) receiving, from a transportation requestor device, a request for transportation that comprises a transportation stop at a location next to a street, (ii) matching, by a dynamic transportation matching system, the transportation requestor device with a transportation provider, and (iii) improving, by the dynamic transportation matching system, a value of fulfilling the request by (a) determining that a near side of the street is closer to the location of the transportation stop than a far side of the street, (b) mapping, based on the determination that the near side of the street is closer to the location of the transportation stop, a driving route that traverses the street, and (c) directing the transportation provider to fulfill the request for transportation by traversing the driving route. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method may include receiving an indication that a transportation application has been initialized on a computing device and analyzing current dispatch conditions affecting the dispatch of transportation provider devices to the computing device. The method may also include determining, based on the analysis, that the current dispatch conditions allow for an ephemeral ride mode to be offered on the transportation application. The method may further include instructing, based on the determination, the computing device to at least temporarily present the ephemeral ride mode within the transportation application as a selectable option. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method may include (i) receiving, by a dynamic transportation matching system, a request for transportation between initial waypoints, (ii) calculating, by the dynamic transportation matching system, a value metric for an initial driving route between the initial waypoints (iii) calculating a value metric for a walk-enabled driving route that comprises at least one alternate waypoint that is within a predetermined walking range of one of the initial waypoints, and (iv) improving, by the dynamic transportation matching system, a value of fulfilling the request for transportation by determining that a difference between the value metric of the walk-enabled driving route and the value metric of the initial driving route satisfies a walking-value threshold and selecting, based on the determination that the difference satisfies the walking-value threshold, the walk-enabled driving route for fulfilling the request for transportation.

Abstract: The disclosed computer-implemented method may include (i) receiving, by a dynamic transportation matching system, a request for transportation between initial waypoints, (ii) calculating, by the dynamic transportation matching system, a value metric for an initial driving route between the initial waypoints (iii) calculating a value metric for a walk-enabled driving route that comprises at least one alternate waypoint that is within a predetermined walking range of one of the initial waypoints, and (iv) improving, by the dynamic transportation matching system, a value of fulfilling the request for transportation by determining that a difference between the value metric of the walk-enabled driving route and the value metric of the initial driving route satisfies a walking-value threshold and selecting, based on the determination that the difference satisfies the walking-value threshold, the walk-enabled driving route for fulfilling the request for transportation.

Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for, within a transportation matching system, identifying a threshold deviation angle or a threshold deviation radius, determining a directional filter, and providing a transportation match probability indicator based on the directional filter. In particular, in one or more embodiments, the disclosed systems provide a deviation angle control element or a dispatch radius control element for selectively designating the threshold deviation angle or the threshold deviation radius. In one or more embodiments, the disclosed systems update the transportation match probability indicator based on user manipulation of the deviation angle control element or the dispatch radius control element.

Abstract: This disclosure describes an airport priority matching system that can utilize computer implemented models to dynamically match provider devices and priority requester devices in response to time priority airport transportation requests. In particular, in one or more embodiments the airport priority matching system identifies, utilizing global positioning data, provider devices within an airport boundary region and determines time metrics relative to an airport pickup location and/or a ranking order corresponding to an airport provider device tiered staging location. Moreover, prior to receiving a time priority airport transportation request, the airport priority matching system reserves a set of provider devices for airport time priority services based on the plurality of time metrics and/or the ranking order.

Abstract: Methods, systems, and non-transitory computer readable storage media are disclosed for generating transportation matches for transportation requests utilizing one or more efficiency metrics based on network coverage in a region. For example, the systems utilize regional and sub-regional network coverage features to generate a predicted network coverage improvement metric resulting from not assigning a particular provider device to a transportation request according to the regional network coverage features. Additionally, the systems utilize regional network coverage features to determine possible request states for a transportation request. The systems then utilize a Markov decision model policy based on the request states to generate an unmatched requester device efficiency metric associated with leaving the request unassigned for a time period.

Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for determining data collection values for enhanced sensor provider vehicles in a provider vehicle pool and utilizing the data collection values to select and dispatch a provider vehicle for a transportation request. In particular, in one or more embodiments, the disclosed systems determine data collection values based on various route features for a particular enhanced sensor provider vehicle. Additionally, in one or more embodiments, the disclosed systems can utilize the data collection values in conjunction with a device matching algorithm and transportation values to select and dispatch a provider vehicle. Further, in some embodiments, the disclosed systems utilize collected sensory data to train one or more computer implemented machine learning models, such as an autonomous vehicle driving model.

Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods that improve efficiency and flexibility of implementing computer devices by providing efficient user interfaces to provider devices that include optimal digital routes selected based on dynamic route efficiency metrics. In particular, the disclosed systems can identify and surface an optimal alternative route from a pickup location to a drop-off location associated with a transportation match based on a variety of dynamic non-temporal factors. The disclosed systems can utilize a variety of computer implemented models to determine non-temporal factors, such as distance efficiency metrics, route-segment access efficiency metrics, congestion efficiency metrics, risk efficiency metrics, and match-based efficiency metrics. The disclosed systems can then combine these non-temporal factors utilizing a common efficiency framework to determine and surface an optimal alternative route.

Abstract: This disclosure describes an intersection-location system that can identify a street intersection indicated by a transportation request and select an event location at the street intersection based on intersection-location attributes. For example, the disclosed systems can receive a transportation request identifying a requested location at a street intersection and compare various candidate designated locations at the intersection as potential pickup, drop-off, or waypoint locations. The disclosed systems can compare intersection-location attributes for the different candidate designated locations by comparing predicted arrival times or predicted routes of different transportation providers at (or from) the candidate designated locations. The disclosed systems can further select a designated pickup, drop-off, or waypoint location from among the candidate designated locations for a transportation route based on the transportation request.

Abstract: The disclosed computer-implemented method may include (i) receiving, from a transportation requestor device, a request for transportation that comprises a transportation stop at a location next to a street, (ii) matching, by a dynamic transportation matching system, the transportation requestor device with a transportation provider, and (iii) improving, by the dynamic transportation matching system, a value of fulfilling the request by (a) determining that a near side of the street is closer to the location of the transportation stop than a far side of the street, (b) mapping, based on the determination that the near side of the street is closer to the location of the transportation stop, a driving route that traverses the street, and (c) directing the transportation provider to fulfill the request for transportation by traversing the driving route. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method may include (i) receiving, by a dynamic transportation matching system, a request for transportation between initial waypoints, (ii) calculating, by the dynamic transportation matching system, a value metric for an initial driving route between the initial waypoints (iii) calculating a value metric for a walk-enabled driving route that comprises at least one alternate waypoint that is within a predetermined walking range of one of the initial waypoints, and (iv) improving, by the dynamic transportation matching system, a value of fulfilling the request for transportation by determining that a difference between the value metric of the walk-enabled driving route and the value metric of the initial driving route satisfies a walking-value threshold and selecting, based on the determination that the difference satisfies the walking-value threshold, the walk-enabled driving route for fulfilling the request for transportation.

Abstract: The disclosed computer-implemented method may include receiving an indication that a transportation application has been initialized on a computing device and analyzing current dispatch conditions affecting the dispatch of transportation provider devices to the computing device. The method may also include determining, based on the analysis, that the current dispatch conditions allow for an ephemeral ride mode to be offered on the transportation application. The method may further include instructing, based on the determination, the computing device to at least temporarily present the ephemeral ride mode within the transportation application as a selectable option. Various other methods, systems, and computer-readable media are also disclosed.

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.

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.

Abstract: A radial guide device for a power saw apparatus to accommodate the radius of the circular pattern to be cut from a hard relatively smooth surfaced planar material. The present invention also contemplates a slidably movable pivot means to adjust a selectively adjustable radius on a fixed guide arm to provide the desired circular pattern in a selected planar material. More particularly, the invention relates to a guide device which allows for a portable electric circular saw to be mounted therein and as an insert to be guided at a desirable fixed radial direction as it transverses the material to be cut.