Multimodal Transportation Service Planning and Implementation

A computing system plans and executes multi-modal transportation itineraries using multiple transportation means to address inefficiencies in densely populated areas, ensuring timely and flexible travel by dynamically adjusting to real-time conditions.

JP7588190B2Active Publication Date: 2024-11-21JOBY AERO INC
View PDF 9 Cites 0 Cited by

Patent Information

Application Number
JP2023141011
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2020-02-10
Filing Date
2023-08-31
Publication Date
2024-11-21
Estimated Expiration
2040-03-18

AI Technical Summary

Technical Problem

Current transportation services are limited to single modes of travel, which can be inadequate in densely populated areas with constrained land infrastructure, leading to inefficiencies and increased congestion.

Method used

A computing system that plans and executes multi-modal transportation itineraries using multiple transportation means, such as aircraft and land-based vehicles, by interacting with rideshare networks to match users with service providers and dynamically adjust to real-time changes.

Benefits of technology

Facilitates seamless and timely multi-modal transportation experiences by optimizing routes and service provider matching, addressing delays and constraints in real-time, and providing flexible itinerary adjustments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007588190000001
    Figure 0007588190000001
  • Figure 0007588190000002
    Figure 0007588190000002
  • Figure 0007588190000003
    Figure 0007588190000003
Patent Text Reader

Abstract

To provide preferred multi-modal transportation service planning and fulfillment.SOLUTION: The present disclosure provides a system and a method for real-time planning and fulfillment of multi-modal transportation services in a multi-modal ride sharing network. In particular, aspects of the present disclosure are directed to a computing system that creates an end-to-end multi-modal itinerary responsive to a user request for transportation service between an origin and a destination. The multi-modal itinerary can include two or more transportation legs that include travel via two or more different transportation modalities such as, as examples, via a car and via an aircraft.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] (CROSS REFERENCE TO RELATED APPLICATIONS) This application claims priority to and the benefit of U.S. Provisional Patent Application No. 62 / 820,011, filed March 18, 2019, which is hereby incorporated by reference in its entirety.

[0002] FIELD OF THE DISCLOSURE The present disclosure relates generally to facilitating multi-modal transportation services for riders. More specifically, the present disclosure relates to systems and methods for real-time planning and fulfillment of multi-modal transportation services over a multi-modal rideshare network. [Background technology]

[0003] Transportation service applications exist that allow individual users to request transportation on demand. For example, transportation services currently exist to allow operators of land-based vehicles (e.g., "cars") to provide transportation services for potential passengers and deliver luggage, goods, and / or prepared food. In addition, users of the transportation application may be able to book connecting tickets or even drive themselves using electric bicycles or scooters.

[0004] However, some current services are limited to transportation via a single mode: car, bicycle, or scooter. As metropolitan areas become increasingly densified, land infrastructure such as roads becomes increasingly constrained and congested, and as a result, land-based transportation may not adequately serve the transportation needs of a significant number of users. Summary of the Invention [Means for solving the problem]

[0005] Aspects and advantages of embodiments of the disclosure will be set forth in part in the description that follows, or may be learned from the description, or may be learned through practice of the embodiments.

[0006] An exemplary aspect of the present disclosure is directed to a computing system configured to plan and fulfill a multi-modal transportation service itinerary. The computing system includes one or more processors and one or more non-transitory computer-readable media that store instructions that, collectively, when executed by the one or more processors, cause the computing system to perform operations. The operations include receiving a request from a user requesting transportation from a current location to a destination. The operations include generating an end-to-end itinerary that includes a plurality of transportation legs that include transportation via a plurality of different transportation modes. The operations include matching the user with a plurality of different service providers that offer transportation via a plurality of different transportation modes through interaction with one or more rideshare networks.

[0007] Other aspects of the present disclosure are directed to various systems, apparatus, non-transitory computer readable media, user interfaces, and electronic devices.

[0008] These and other features, aspects, and advantages of various embodiments of the present disclosure will become better understood with reference to the following description and appended claims. The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the present disclosure and, together with the description, serve to explain relevant principles. The present invention provides, for example, the following: (Item 1) 1. A computing system configured to plan and execute a multi-modal transportation service itinerary, the computing system comprising: one or more processors; One or more non-transitory computer-readable media that collectively store instructions that, when executed by the one or more processors, cause the computing system to perform operations, including: receiving a request from a user for transportation from a current location to a destination; Generating an end-to-end journey including a plurality of transportation legs including transportation via a plurality of different transportation means, the generating of the end-to-end journey including the plurality of transportation legs comprising: identifying one or more candidate transportation plans associated with a first transportation means of the plurality of different transportation means; connecting one or more additional transportation legs on each of the one or more candidate transportation plans to generate a plurality of candidate itineraries; generating an individual score for each of the plurality of candidate journeys using an objective function; selecting one or more of the candidate journeys for presentation to the user based on the individual scores; and and matching said users with a plurality of different service providers that provide transportation via said plurality of different transportation means through interaction with one or more ride sharing networks; one or more non-transitory computer readable media, A computing system comprising: (Item 2) The plurality of transportation segments including transportation via the plurality of different transportation means includes at least a first transportation segment including transportation via an aircraft and a second transportation segment including transportation via a car; Matching the user with the plurality of different service providers through interaction with the one or more rideshare networks includes: Matching the user with a first service provider that provides transportation via the aircraft through interaction with a first ride-sharing network; matching said user with a second service provider providing transportation via said vehicle through interaction with a second ride-sharing network; 2. The computing system of claim 1, (Item 3) Item 3. The computing system of item 2, wherein the aircraft comprises a vertical take-off and landing aircraft. (Item 4) The request specifies an arrival time; generating the end-to-end journey includes generating the end-to-end journey including transporting the user to the destination at or before the arrival time; 2. A computing system according to any preceding claim. (Item 5) 2. The computing system of claim 1, wherein the first transportation means comprises a most efficient transportation means operating according to a fixed transportation infrastructure. (Item 6) 2. The computing system of claim 1, wherein the first vehicle comprises a most supply constrained vehicle of the plurality of different vehicles. (Item 7) Identifying the one or more candidate transportation plans associated with the first transportation vehicle includes: identifying a set of fixed transport nodes associated with the first transport vehicle based on the current location and the destination of the request, the set of fixed transport nodes including one or more candidate departure nodes and one or more candidate arrival nodes; 2. A computing system according to any preceding claim, comprising: (Item 8) Identifying the one or more candidate transportation plans associated with the first transportation vehicle further comprises: accessing a database of predetermined transportation plans; identifying one or more predefined transportation plans between one of the candidate departure nodes and one of the candidate arrival nodes as the one or more candidate transportation plans; 8. The computing system of claim 7, comprising: (Item 9) Identifying the one or more candidate transportation plans associated with the first transportation vehicle further comprises: An on-demand communication between one of the candidate departure nodes and one of the candidate arrival nodes. generating one or more alternative transportation plans between one of the candidate departure nodes and one of the candidate arrival nodes based on historical data describing historical results of maneuver transportation, the one or more alternative transportation plans serving as the one or more candidate transportation plans; 9. The computing system according to item 7 or 8, comprising: (Item 10) Connecting one or more additional transportation segments on each of the one or more candidate transportation plans includes appending to each candidate transportation plan information describing estimated travel times associated with one or both of ground transportation from the current location to the candidate departure node and ground transportation from the candidate arrival node to the destination; 10. The computing system of claim 7, 8 or 9, comprising: (Item 11) 11. The computing system of claim 10, wherein the information describing estimated travel times associated with one or both of ground transportation from the current location to the candidate departure node and ground transportation from the candidate arrival node to the destination includes information describing historical variance between actual arrival times and estimated arrival times associated with one or both of ground transportation from the current location to the candidate departure node and ground transportation from the candidate arrival node to the destination. (Item 12) Connecting one or more additional transportation segments on each of the one or more candidate transportation plans includes appending to each candidate transportation plan information describing an estimated travel time associated with one or both of the user's physical passage through the candidate departure nodes and the user's physical passage through the candidate arrival nodes; 12. The computing system of any of items 7-11, comprising: (Item 13) The objective function determines, for each candidate journey, the following characteristics: Total travel time, a cumulative cost to said plurality of different service providers; the price charged to said user for said service to be provided; the deviation of the estimated arrival time from the required arrival time; deviation of the estimated departure time from the requested departure time, or Satisfying one or more desired vehicle characteristics; 2. The computing system of claim 1, further comprising: (Item 14) Using the objective function to generate the individual scores for each of the plurality of candidate journeys includes, for each candidate journey: identifying a respective number or quality of emergency response segments available for each transportation segment included within the candidate journey; determining an individual score for the candidate journey based, at least in part, on an individual number or quality of emergency response segments available for each transportation segment included within the candidate journey; 2. A computing system according to any preceding claim, comprising: (Item 15) Matching the user with a plurality of different service providers providing transportation via the plurality of different transportation modes through interaction with one or more rideshare networks includes: For at least one of the vehicles providing transportation between a pick-up location and a drop-off location, Determining a matching process start time; at the matching process start time, initiating a matching process on one of the rideshare networks; 2. A computing system according to any preceding claim, comprising: (Item 16) Determining the matching process start time includes, at least in part, A historical number of service providers available for the pickup location; an average historical response time for a service provider at the pickup location; an average historical conversion rate for service providers at the pickup location; an average historical travel time between the pick-up location and the drop-off location according to the at least one transportation means; an average historical variance between actual arrival times and estimated arrival times between the pick-up location and the drop-off location according to the at least one transport means; or historical supply or demand characteristics associated with the pick-up location or the drop-off location; Item 16. The computing system of item 15, further comprising: determining the matching process start time based on historical data describing one or more of: (Item 17) Determining the matching process start time includes, at least in part, the number of service providers currently available for the pickup location; the individual locations of the service providers currently available for said pickup location; an estimated response time for currently available service providers for the pickup location; an estimated conversion rate for currently available service providers for the pickup location; Current weather conditions, current traffic conditions, or current supply or demand characteristics associated with said pick-up location or said drop-off location; 17. The computing system of claim 15 or 16, further comprising: determining the matching process start time based on real-time data describing one or more of: (Item 18) Matching the user with a plurality of different service providers providing transportation via the plurality of different transportation modes through interaction with one or more rideshare networks includes: prior to initiating a matching process for a first transportation segment of the journey, initiating a matching process for a second transportation segment of the journey that occurs subsequent to the first transportation segment of the journey; 2. A computing system according to any preceding claim, comprising: (Item 19) One or more non-transitory computer readable media collectively storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations, including: receiving a request from a user for transportation from a current location to a destination; generating an end-to-end journey including a plurality of transportation legs including transportation via a plurality of different transportation means, the plurality of transportation legs including a first transportation leg from the current location to a first transportation node via land-based transportation, a second transportation leg from the first transportation node to a second transportation node via flight-based transportation, and a third transportation leg from the second transportation node to the destination via land-based transportation, wherein generating the end-to-end journey including the plurality of transportation legs includes: identifying one or more candidate flight plans associated with the second transportation leg from the first transportation node to the second transportation node; connecting one or more additional transport legs on each of the one or more candidate flight plans to generate a plurality of candidate itineraries; generating an individual score for each of the plurality of candidate journeys using an objective function; selecting one or more of the candidate journeys for presentation to the user based on the individual scores; and Including, 16. A non-transitory computer readable medium comprising: (Item 20) 20. The one or more non-transitory computer-readable media of claim 19, wherein the one or more additional transportation segments include one or more land-based vehicle transportation segments. [Brief description of the drawings]

[0009] A detailed discussion of the embodiments, directed to those skilled in the art, is set forth in the specification, which refers to the accompanying figures.

[0010] [Figure 1] FIG. 1 depicts a block diagram of an exemplary computing system in accordance with an exemplary embodiment of the present disclosure.

[0011] [Diagram 2] FIG. 2 depicts a pictorial diagram of an exemplary set of flight plans between an exemplary set of transportation nodes, in accordance with an exemplary embodiment of the present disclosure.

[0012] [Diagram 3] FIG. 3 depicts a pictorial diagram of an example transportation node, according to an example embodiment of the present disclosure.

[0013] [Figure 4] FIG. 4 depicts a pictorial diagram of an exemplary multi-modal transportation service itinerary, according to an exemplary embodiment of the present disclosure.

[0014] [Diagram 5] FIG. 5 depicts a flowchart diagram of an example method for planning a multi-modal transportation service itinerary, according to an example embodiment of the present disclosure.

[0015] [Figure 6A] 6A-B depict flow chart diagrams of an example method for fulfilling a multi-modal transportation service leg, according to an example embodiment of the present disclosure. [Figure 6B] 6A-B depict flow chart diagrams of an example method for fulfilling a multi-modal transportation service leg, according to an example embodiment of the present disclosure.

[0016] [Figure 7A] 7A-C depict flow chart diagrams of an example method for planning and fulfilling a multi-modal transportation service itinerary, according to an example embodiment of the present disclosure. [Figure 7B] 7A-C depict flow chart diagrams of an example method for planning and fulfilling a multi-modal transportation service itinerary, according to an example embodiment of the present disclosure. [Figure 7C] 7A-C depict flow chart diagrams of an example method for planning and fulfilling a multi-modal transportation service itinerary, according to an example embodiment of the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0017] Exemplary aspects of the present disclosure are directed to systems and methods for real-time planning and fulfillment of multi-modal transportation services in a multi-modal ride-sharing network. In particular, aspects of the present disclosure are directed to a computing system that creates an end-to-end multi-modal journey in response to a user request for transportation services between a current location and a destination. The multi-modal journey can include two or more transportation legs, including travel via two or more different transportation means, such as, by way of example, via car and via airplane. The computing system can fulfill the journey for the user, for example, by matching the user with different service providers and completing each transportation leg via its associated means. The computing system can monitor the user's progress along the journey in real time and dynamically mitigate delays or other complications in one of the transportation legs by determining and fulfilling alternative journeys. For example, the computing system can dynamically match the user with a service provider (e.g., to receive pooled transportation) while the user is progressing along an early leg of the journey. In some instances, the computing system may have direct control of the transportation services offered by the service provider on at least some of the transportation means, and thus dynamically optimize the transportation services planned by the service provider, taking into account real-time changes in rider availability and demand. In other instances, the computing system may match users with service providers from a floating, dynamic pool of transportation service providers. Thus, the systems and methods of the present disclosure may string together multiple transportation legs using different transportation means to generate an end-to-end journey, monitor user progress along the transportation legs, and address and mitigate delays and other deviations from the planned journey in real time.

[0018] More specifically, the computing system may receive a request from a user requesting that the computing system facilitate transportation services for the user from a current location to a destination. For example, the user may interact with a dedicated application on the user's computing device (e.g., a smartphone, tablet, wearable computing device, or equivalent) and initiate the request. In some instances, unless otherwise specified, the current location of the transportation service may be assumed to be the user's current location (e.g., as indicated by location data, such as GPS data, received from the user's computing device and / or as entered by the user). The user may also supply a desired destination (e.g., by typing the destination into a text field, which may provide suggested completion entries, for example, as the user types).

[0019] In some implementations, the request may also specify an "arrival" date and time that the user desires to arrive at the requested destination. Thus, the user may specify exactly when the user desires to arrive at the destination. In other implementations, the request may indicate a "departure" date and time that the user desires to depart. In some examples, the "departure" date and time may be assumed to be the current date and time unless otherwise specified.

[0020] In some implementations, the user may also provide entries regarding any number of additional characteristics that the user desires the transportation service to meet. For example, the additional entries may specify the number of seats required, the preferred vehicle type (e.g., specialty vehicle vs. economy vehicle, human driven vs. autonomous, etc.), available weight capacity such as the possibility of accommodating the weight of any baggage to be carried by the user, a maximum price, and / or various other characteristics.

[0021] In response to the request, the computing system can generate at least one journey that includes transportation of the user from a current location to a destination. Specifically, the computing system can create an end-to-end multi-modal journey that includes two or more transportation legs that include travel via two or more different modes of transportation, such as, for example, a car, a motorcycle, a light electric vehicle (e.g., an electric bicycle or scooter), a bus, a train, an aircraft (e.g., a plane), a watercraft, walking, and / or other modes of transportation. Exemplary aircraft can also include helicopters and other vertical take-off and landing aircraft (VTOL), such as electric vertical take-off and landing aircraft (eVTOL). The vehicles can include non-autonomous, semi-autonomous, and / or fully autonomous vehicles.

[0022] In some implementations, the computing system can facilitate the possibility of the user receiving transportation on one or more of the transportation segments included in the itinerary. As one example, the computing system can interact with one or more ride-sharing networks to match the user with one or more transportation service providers. As another example, the computing system can reserve or otherwise reserve a seat, space, or use of one or more of the transportation vehicles for the user. Additionally or alternatively, the computing system can simply provide information regarding options to be offered by one or more third parties for one or more of the transportation segments.

[0023] More specifically, in some implementations, the computing system may respond to a user's request by determining whether using a single transportation means or using multiple transportation means is more beneficial to fulfill the user's request. As one example, the computing system may evaluate the user's current location, current location at the time of the request, and / or destination, and determine the transportation means available at such locations (e.g., capable of accessing such locations). For example, the location may be checked against a list of whitelist locations that are approved for engagement with various types of means (e.g., flight means for purposes of generating a multi-modal travel itinerary). As another example, the computing system may evaluate (e.g., generate) one or more journeys that are single-mode and one or more journeys that are multi-mode (e.g., including various combinations of different transportation means). The computing system may compare the generated single- and multi-mode journeys and determine whether it is appropriate to suggest the single or multi-mode journey to the user. For example, one or more of the best journeys (e.g., as evaluated based on various characteristics such as cost, time, etc.) may be suggested to the user. The user can select one of the proposed itineraries and receive transportation services according to the selected itinerary.

[0024] Additionally, in some implementations, the computing system may continually re-evaluate various journeys (e.g., single and / or multi-mode journeys) before or even during completion of the selected journey. If an improved journey becomes available (which may include, for example, changing from a single-mode journey to a multi-mode journey when seats become available on an airline flight), the computing system may suggest the improved journey for selection by the user. In some implementations, if the user selects an improved journey during completion of an existing journey, the computing system may facilitate a switch to the updated journey, including, for example, rerouting the transportation provider currently transporting the user to the alternate updated destination.

[0025] Thus, in response to a user request, the computing system can implement one or more algorithms to generate an itinerary for the user. As an example, in some implementations, the computing system can sequentially analyze and identify potential transportation segments for each different available transportation mode. For example, the most essential, difficult, and / or supply-constrained transportation segments can be identified first, and then the remainder of the journey can be strung around such segments. In some implementations, the order of analysis for the different modes can be a function of the total distance associated with the transportation service (e.g., a shorter transportation service results in a land-based mode being assessed first, while a longer transportation service results in an air-based mode being assessed first).

[0026] As one particular example, in some implementations, the computing system may first analyze a first transportation mode that is the most efficient (e.g., in terms of travel speed and / or cost) transportation mode that operates according to a fixed infrastructure. As an example, for most longer transportation services and for the mix of different modes described above, the air mode will often be both the most efficient transportation mode (e.g., in terms of travel speed / time) and also operating according to a fixed infrastructure. By first analyzing the most efficient transportation mode that operates according to a fixed infrastructure, the computing system seeks to identify important transportation legs around which the remainder of the journey can be strung together.

[0027] More specifically, in some implementations, one or more of the transportation means may operate according to or within a fixed transportation infrastructure, where the possibility of passengers boarding and disembarking from the vehicle is constrained to a defined set of transportation nodes. As an example, in some implementations, aircraft operating within a ride-sharing network may be constrained to board and disembark passengers only at a defined set of physical take-off and / or landing areas, which may in some instances be referred to as skyports. To give an example, a metropolitan area may have dozens of transportation nodes located at various locations within the metropolitan area. Each transportation node may include one or more arrival points and / or other infrastructure to enable passengers to safely board or disembark from the aircraft. The transportation nodes may also include charging equipment, refueling equipment, and / or other infrastructure to enable the operation of the aircraft. The take-off and / or landing areas of the transportation nodes may be located at ground level and / or above ground level (e.g., on buildings).

[0028] As an alternative or in addition to aggregation points on fixed infrastructure, the computing system may first analyze the most supply-constrained transportation modes. More specifically, some transportation modes may be more supply-constrained than other modes in terms of the number of available service providers and / or the average number of services offered per day. For example, air modes are likely to be more supply-constrained than land-based modes such as cars, at least in the near future, due to the relatively greater challenges and costs involved in operating aircraft. By analyzing the most supply-constrained modes first, the computing system may generate itineraries more efficiently, since the most supply-constrained modes represent the most option-limited aspects in constructing different itineraries.

[0029] However, in many cases, the use of a fixed infrastructure will constrain the number and availability of service providers, and therefore, in many instances, the most supply-constrained vehicles also often operate on a fixed infrastructure.

[0030] Thus, the computing system may first identify any fixed transportation nodes (e.g., skyports) associated with a first transportation means (e.g., air means) associated with the user's request. For example, the computing system may identify any node within a threshold distance from the current location as a candidate departure node. Similarly, the computing system may identify any node within a threshold distance from the destination location as a candidate arrival node.

[0031] In some instances, the computing system may have control over at least some of the transportation services provided by the service provider on at least some of the transportation means and may therefore predetermine the transportation services planned by some of the service providers. For example, in some implementations, the aircraft operators may be controlled by (e.g., contracted with) the operators of the ride-sharing network. Thus, the computing system may generate an initial predefined set of flight plans for the aircraft assets (e.g., on a daily basis) and may add or remove passengers to or from each planned flight. In some implementations, the computing system may also dynamically optimize the transportation services planned by the service provider, taking into account real-time changes in passenger availability and demand. For example, the computing system may dynamically modify a given flight plan (e.g., delay a planned flight departure by 5 minutes and / or change a planned flight to an alternate arrival transportation node).

[0032] In a scenario where the first transportation means operates according to a predetermined plan, after identifying the relevant fixed transportation nodes, the computing system can access a database of predetermined transportation plans and identify candidate transportation plans between the relevant nodes. For example, the computing system can identify any transportation plan between one of the candidate departure nodes and one of the candidate arrival nodes that would satisfy the user's requirements, including, for example, any departure or arrival time requirements.

[0033] As an example, for a request that specifies an "arrival" time, the computing system may identify a number of candidate transportation plans that would allow the user to arrive at the specified destination at or before the "arrival" time (or immediately after the "arrival" time if no more beneficial plans are available). Similarly, for a request that specifies a "departure" time, the computing system may identify a number of candidate transportation plans that would allow the user to depart at or before the "departure" time (or immediately after the "departure" time if no more beneficial plans are available). As will be explained in more detail elsewhere herein, one aspect of determining whether a particular transportation plan meets these timing characteristics is to understand and calculate additional estimated amounts of time associated with the user's physical progression through each transportation node (e.g., skyports) and boarding / disembarking vehicles, the user's use of additional transportation means (e.g., car trips) to arrive at or depart from each transportation node, and any uncertainty or mean variance associated therewith.

[0034] To give an example, if a user seeks to arrive at their destination at 8:00 AM, the computing system may analyze a set of predefined flight plans between pairs of associated nodes and identify a first predefined flight plan between the nodes that is planned to operate from 7:35 AM to 7:50 AM and a second predefined flight plan between the nodes that is planned to operate from 7:45 AM to 8:00 AM. The computing system may further analyze historical data and understand that it typically takes 5 minutes for a passenger to disembark from a vehicle (e.g., an aircraft) and exit from a destination transportation node (e.g., a skyport). The computing system may also analyze additional data, such as map data, and understand that the user's final destination is approximately a 5-minute walk from the transportation node. Thus, the computing system may select the flight plan that departs from the departure node at 7:35 AM as a candidate flight plan. A journey building process may then be performed around the selected plan.

[0035] In other instances where the first transportation means does not have a predetermined schedule and may instead operate in an "on-demand" manner, the computing system may match the user with a service provider for the first transportation means from a floating, dynamic pool of independent transportation service providers. For example, service providers may dynamically join and leave the network, and the computing system may operate to match the passenger with a service provider currently participating in the network. The service provider may elect to provide service to the passenger or to decline to provide service. The matched service provider may pick up and drop off the user at a fixed transportation node. For example, with respect to a flight means, the computing system may match the user with one of a dynamically changing pool of aircraft operators, and the aircraft operator may elect to provide or decline the proposed flight service.

[0036] In some implementations, in any instance where the computing system operates to match users with service providers, the computing system may seek to do so in a pooling manner, where multiple users are matched with a single service provider. For example, pooling matching may include withholding the matching operation for a delay period during which multiple requests for matching are collected across the network and then collectively analyzed to identify opportunities for riders to be pooled with a single service provider. Alternatively, or in addition, riders may be dynamically added to or removed from an existing pool that is matched with a service provider. Pooling analysis may be performed at the time of request and / or transportation service fulfillment.

[0037] In a scenario where the service provider in the first transportation means is floating and transportation is "on-demand," the computing system can generate one or more alternative transportation plans for the first transportation means between one of the candidate departure nodes and one of the candidate arrival nodes. Each alternative plan can mimic and be based on historical observations of travel times between the candidate departure nodes and the candidate arrival nodes according to the first transportation means. Thus, the alternative plans can serve as an estimate (e.g., in terms of travel times, etc.) of transportation services that will be available at future times when the user seeks to travel according to the first transportation means.

[0038] To give an example, if a user seeks to arrive at their destination at 8:00 AM, the computing system may analyze historical data associated with travel between a pair of associated nodes and understand that transportation service between the pair of associated nodes from 7:30 AM to 8:00 AM often takes approximately 15 minutes. The computing system may further analyze the history and understand that it typically takes a passenger 5 minutes to disembark from a vehicle (e.g., an airplane) and exit a transportation node (e.g., a skyport). The computing system may analyze additional data, such as map data, and understand that the user's destination is approximately a 5 minute walk from the transportation node. Thus, the computing system may generate an alternative plan that includes the user departing from the departure node at 7:35 AM and arriving at the arrival node at 7:50 AM. The alternative plan may serve as a candidate transportation plan for the itinerary building process.

[0039] Thus, through analysis of a given set of available transportation plans and / or generation of one or more alternative plans associated with relevant transportation nodes, the computing system can identify a set of candidate transportation plans that can form a basis for building a set of potential journeys. In particular, the computing system can connect additional transportation legs for each individual candidate transportation plan to generate an end-to-end journey.

[0040] In some implementations, the computing system may filter the candidate transportation plans using one or more filters. As one example, the computing system may apply a filter that removes any candidate transportation plans that do not have a sufficient number of available seats to match the number of seats requested by the user. As another example, the computing system may apply a filter that removes any candidate transportation plans that employ vehicles that do not meet the vehicle attributes requested by the user (e.g., specialty vehicles vs. economy vehicles). As yet another example, a simple filter may ensure that the user is not already booked on a candidate transportation plan.

[0041] The computing system can append to each candidate transportation plan dynamic information associated with other transportation means that will be used to facilitate the candidate transportation plan for the user. For example, the dynamic information can include information describing the expected duration of any transportation legs (e.g., land-based legs such as car transport) that will need to be performed to transport a rider from the current location to the destination from corresponding candidate departure and arrival nodes.

[0042] In some implementations, information describing the expected duration of any additional transportation legs (e.g., land-based legs such as car transport) that will need to be performed can be determined based on historical and / or real-time data. As an example, if a candidate transportation plan includes a user departing from a starting transportation node at 7:35 AM, a computing system can analyze historical trip data and determine that between 7:00 AM and 8:00 AM, it typically takes a rider 15 minutes to physically pass through such starting transportation node, including, for example, undergoing any required security checks, dropping off baggage, listening to a safety briefing, and boarding an aircraft. Further, the computing system can analyze historical data associated with historical use of a land-based ride-share network to provide transportation services from the user's current location to the starting transportation node, and determine that the car transport is estimated to take 10 minutes. This (and other) information can be added to, or "spliced" into, the candidate transportation plan to generate a candidate itinerary.

[0043] More specifically, in some instances, adding dynamic information to each candidate transportation plan may include, or be referred to as, piecing together additional transportation leg information into the candidate transportation plan to generate an itinerary, where a journey refers to a complete end-to-end and multi-modal transportation service from a current location to a destination that includes two or more transportation legs. Thus, adding additional transportation leg information to each candidate transportation plan may result in the generation of several candidate itineraries.

[0044] The computing system may select one or more of the "best" trips and provide them for display to the user. As one example, to determine which trip is "best," the computing system may score each trip using an objective function that balances various factors, such as total travel time, cumulative cost to the service provider for providing various legs of the trip, price to the user for the service to be provided, deviation of estimated arrival time from requested arrival time, deviation of estimated departure time from requested departure time, satisfaction of desired vehicle characteristics, number and / or quality of contingency plans, and / or various other measures of trip quality.

[0045] More specifically, in some implementations, the computing system can assess the number and / or quality of contingency plans associated with a given journey. For example, the contingency plans can include alternative transport legs that a user can use to alternatively reach its destination if a particular transport leg of the journey is not successfully completed as planned. In some implementations, to understand the number and / or quality of contingency plans associated with a given journey, the computing system can determine, for each different candidate transport leg included within the candidate journey, the number and / or quality of alternative contingency transport legs available between a first location and a second location associated with the candidate transport leg.

[0046] To take an example, a first candidate itinerary may include a flight planned between transport node A and transport node B at 7:30 AM, while a second candidate itinerary may include a flight planned between transport node C and transport node B at 7:32 AM. Transport node C is slightly closer to the user's current location than transport node A, thus allowing the user to save a total of 4 minutes, but there may be significantly more planned flights between transport node A and transport node B than between transport node C and transport node B. For example, flights may be planned between transport node A and transport node B every 10 minutes from 7:30 AM to 8:00 AM (e.g., 7:30, 7:40, 7:50, 8:00 AM), while the next planned flight between transport node C and transport node B after the 7:32 AM departure is not scheduled to depart until 8:15 AM. Thus, there are significantly more and higher quality contingency plans associated with the planned flight between transportation nodes A and B versus the planned flight between transportation nodes C and B. This information can be included in the assessment of the candidate itinerary. Continuing with this example, the journey including the use of transportation node C allows the user to save 4 minutes, but the journey including transportation node A may be determined in some instances to be a more profitable journey due to the number and quality of contingency plans. This result may be especially true when ground transportation between the user's current location and transportation node C is known to have significant variance or to incur delays. Thus, the uncertainty and / or observed variance regarding the reliability / outcome of a leg of the journey can also be used as an input for scoring the candidate itinerary.

[0047] Thus, the computing system can analyze the candidate journeys and select one or more journeys that are of high quality according to various measures. The computing system can present the one or more journeys to the user (e.g., via a user interface on the user's computing device) along with additional information, such as a single end-to-end price for completing the journey. For example, the single price can be the sum of the prices per legs of the journey, each of which can be calculated using various techniques, including, for example, a fixed price and / or a dynamic or "floating" price. The user can elect to request the journey to be completed, to decline the completion (e.g., by taking no action), or to modify one or more characteristics of the request. For example, the user can modify the journey by indicating that the user chooses to complete one of the transportation legs on foot (e.g., rather than via car).

[0048] In some implementations, even if the computing system is unable to identify any journey that exactly meets all of the characteristics of the user's request, the computing system may select a "non-matching" journey for presentation to the user (e.g., along with a visual indication of the non-matching nature of the journey).

[0049] According to certain aspects of the present disclosure, when a user requests fulfillment of a presented journey, the computing system can interact with one or more ride-share networks to enable the user to complete the journey. For example, the computing system can interact with different ride-share networks for each different transportation mode employed by the journey and facilitate matching the user with service providers offering transportation using such transportation modes. The ride-share networks can be operated by or otherwise associated with the same and / or different entities. In some implementations, matching can occur in real-time as the user progresses along a leg of the journey. The service providers can include human operators (e.g., drivers or pilots) and / or vehicles. For example, for some transportation modes, the user can be matched with a human operator (e.g., a car driver), while for other modes, the user can be matched with a vehicle (e.g., an aircraft).

[0050] As one example, in instances where the first transportation means operates according to a predefined set of transportation plans, in response to a user requesting fulfillment of the journey, the computing system may immediately add the user (and any other requested seats) to the transportation plan of the first transportation means included in the journey. Thus, the user may be added to a predefined transportation plan as soon as fulfillment is requested, regardless of the extent to which the transportation plan was planned in advance to occur. As another example, in instances where the first transportation means operates on an on-demand basis, the computing system may wait until a time before or after the on-demand service would be required to initiate the matching process. In either case, if the journey includes additional legs, such as land-based legs that use an on-demand matching service, the computing system may wait until a time before or after the on-demand service would be required to initiate the matching process.

[0051] More specifically, for each transportation segment included within a selected itinerary for which on-demand rideshare matching is to be performed, the computing system can independently assess (and continually reassess during transportation service fulfillment) an appropriate matching process start time for such transportation segment. The matching process start time for each segment can be sufficiently prior to the planned departure time for such segment to successfully match a user with a service provider for such segment and complete the segment in a timely manner. For example, the matching process start time for a given transportation segment can be based on historical and / or real-time data associated with such transportation segment. As examples, the historical data can indicate several service providers typically available at the departure / pick-up location (e.g., for a relevant time period and / or day of the week), average response times and / or conversion rates for the service providers at the departure / pick-up location, average travel times associated with the transportation segment, average variance between actual and estimated arrival times associated with the transportation segment, historical supply and / or demand characteristics, and / or other historical measures of results related to performing matching for the transportation segment. The real-time data may indicate the number and individual locations of service providers currently available at the departure / pick-up location, estimated response times and / or diversion rates for currently available service providers, real-time weather information, real-time traffic information, real-time estimates or forecasts of supply and / or demand characteristics, and / or other real-time information that assists the system in determining the likely amount of time prior to the planned departure time for a trip segment that the system would need to initiate the matching process to reliably match a user with a service provider capable of successfully completing the trip segment. In other implementations, the matching process may begin a fixed amount of time prior to the planned departure along such a segment. For example, the fixed amount of time may be approximately 30 minutes.

[0052] In some implementations, the computing system may include and implement logic to address transportation service provider cancellation and / or inappropriate use of the rideshare network by a transportation service provider (e.g., as "gaming"). As one example, in the event of service provider cancellation or if the service provider has not made substantial progress toward fulfilling the requested trip, the computing system may automatically prompt the rider to re-address the request (e.g., re-match with a different service provider, but using the same itinerary). Alternatively or additionally, the computing system may automatically create a new request and perform the itinerary creation process for an additional period of time (e.g., if a segment of the original trip has only been unfulfilled and approved by the matched service provider).

[0053] In addition to or as an alternative to service provider cancellation, the computing system may include and implement logic to address user cancellation. As one example, if a user cancels a transportation request / journey prior to the scheduled time of pick-up and / or the actual pick-up for the initial transportation leg, the computing system may cancel the entire trip / journey. As another example, if a transportation service provider is already matched for the initial transportation leg, a first cancellation by the user may be treated as a request to re-match with the user for the initial transportation leg. A second cancellation by the user may then result in the entire trip / journey being canceled. This logic, interpreting a first cancellation as a re-matching request, avoids canceling the entire trip when a user simply cancels matching with a first service provider because the first service provider has not made substantial progress toward completing transportation services (e.g., the service provider's vehicle is not moving toward the pick-up location).

[0054] The computing system may perform the matching process for each leg of the journey separately and / or based on current information about the user's progress along the journey. In some implementations, the computing system may first perform the matching process for the most supply-constrained transportation means (e.g., air means) used by the journey. This can ensure that the user is matched with a service provider for the most challenging means and in advance of transporting the user from its initial current location (e.g., so the user is not stranded at a non-flight transportation node waiting for them). In other implementations, there is no predetermined order in which the matching is performed, but instead is based solely on separate analysis for each different transportation means of appropriate matching process start times.

[0055] In some implementations, the determination of the matching process start time for a given transportation leg can also be based on the user's current status in completing the journey. More specifically, the computing system can constantly monitor the user's progress along the journey (e.g., based on location data associated with the user's device and / or the corresponding vehicle transporting the user, with the user's permission). Thus, if there is a delay in one transportation leg of the journey, this delay can be taken into account when initiating and / or conducting the matching process for subsequent transportation legs of the journey. For example, the planned departure time of each subsequent leg can be delayed based on the delay. Thus, various historical and real-time data can be used to ensure that the computing system initiates and completes the matching process for different transportation legs at the appropriate time to provide the user with multi-modal transportation in a seamless and timely manner.

[0056] In some implementations, once the matching process for a transportation leg has begun, the computing system may continually monitor the probability that the system will be able to successfully match the user with an available service provider to provide the requested transportation. In some implementations, the computing system may proceed to attempt to match the user with a service provider at any time that the probability of a future match falls below a threshold. For example, in some implementations, the number of available service providers may be used as a proxy indicator for this probability, and the computing system may proceed to attempt a match if the number of available service providers falls below a certain threshold number.

[0057] According to another aspect of the present disclosure, in some implementations and scenarios, the computing system may disable the possibility of the transportation service provider contacting the user. In particular, one possible scenario is that the user is currently being transported via flight-based transportation. During the flight, the user may have been matched with a land-based transportation provider. The land-based transportation provider may arrive at an intermediate point (e.g., a destination transportation node) prior to the user's flight and initiate contact with the user (e.g., via phone call or text message) to ask the user about their location and whether the user is ready to board the land-based transportation service. This may be an annoying or otherwise undesirable experience for the user, as the user may feel as if they are delaying the land-based transportation service provider and / or being rushed by the land-based transportation service provider, which is currently in flight and therefore unable to take any steps to reduce the time until the user can board the land-based service. Thus, to prevent this scenario, the computing system may disable the possibility of the land-based service provider contacting the user if the land-based service is to be provided following the flight-based transportation segment and the flight-based transportation segment has not yet been completed. Once a flight-based transportation leg is completed, the service provider may again be enabled to contact the user. In some implementations, the computing system may provide status updates to the user and inform the user (e.g., "John has arrived and is ready to take you to your destination") despite disabling the service provider's ability to contact the user. In some implementations, the computing system may provide status updates to the service provider and inform the service provider (e.g., "Jane's flight is delayed by 5 minutes" or "Jane's flight will arrive in 7 minutes") despite disabling the service provider's ability to contact the user.

[0058] According to another aspect of the present disclosure, the computing system can continually monitor the success / feasibility of each transport leg in the journey and can implement real-time mitigation measures when a particular transport leg is significantly delayed or canceled / defaulted. Typically, the computing system may attempt to delay intervention / mitigation measures activity until it is deemed, with a significant probability, that one or more legs of the user's journey will not be able to be completed successfully.

[0059] In some implementations, the mitigation process can include and implement logic to respond to the cancellation of a flight on which the user is booked. As an example, if a planned flight is canceled and the user has not yet begun the journey or has not yet reached a threshold period before the start of the journey, the computing system can cancel the entire trip / journey. The user can be notified of the cancellation and given an opportunity to resubmit the request for transportation. However, if the user has already begun the journey or has entered a threshold period before the start of the journey, the computing system notifies the user and offers to reroute (e.g., replan the trip with updated information, rematch with an alternative service provider for the journey leg, and / or change the journey leg to an alternative transportation mode). In some implementations, the reroute operation can be given preference or preferential treatment (e.g., the user's use of special modes can be subsidized or rates reduced).

[0060] In some implementations, the mitigation process can include manual input by human mitigation personnel. For example, the need to implement mitigation can be automatically detected, and as a result, the computing system can provide an alert and a mitigation user interface to the human mitigation personnel. For example, the mitigation user interface can include a graphical user interface that shows potential alternative trip legs / journeys for a user currently undergoing a delay / cancellation. The human personnel can interact with the interface and adjust various parameters of the user's trip. For example, the human personnel can take other actions, such as rescheduling the user to a later trip plan, delaying a yet-to-depart trip plan (e.g., a flight plan) and causing the delayed user to wait, and / or delaying the start of the matching process for the subsequent trip leg.

[0061] In some implementations, the user interface may provide warnings or other indications of the extent to which a mitigation activity or potential action may affect other users of the system. For example, if mitigation personnel attempt to delay a transportation plan (e.g., a flight plan) that has not yet departed to wait for the delayed user, the user interface may inform the mitigation personnel that such an action will affect three other travelers. The warnings / indications provided within the user interface may provide impact information according to various metrics, including, for each available option / action, the number of users that will be affected as a result of the option / action, the number of users that will miss their arrival time as a result of the option / action, the total number of minutes that will be added to transportation services for all users as a result of the option / action, and / or other metrics. Generally, preference may be given to mitigation strategies that have the least impact on other users.

[0062] In other implementations, the mitigation process can be automated (e.g., with the ability for manual override). As an example, the computing system can continuously generate contingency itineraries for each user. For example, the contingency itineraries can be generated using the process as described above, but taking into account potential or actual delays in a transportation segment. When it is detected that a mitigation intervention should be implemented, the computing system can automatically select the best available contingency itinerary and indicate the selected itinerary to each user and other system components. For example, automatic updates and alerts can be sent to passengers, service providers, operation personnel, and / or other integrated systems. The contingency itineraries can be ranked for each available option / action based on various metrics, including the number of users that will be affected as a result of the option / action, the number of users that will miss their arrival time as a result of the option / action, the total number of minutes that will be added to the transportation service of all users as a result of the option / action, and / or other metrics. In some instances, this dynamic contingency generation can be viewed as a continuous cross-system re-optimization of itineraries based on real-time conditions.

[0063] Another example aspect of the disclosure is directed to the rider experience in a multi-modal journey. As an example, a user's device can provide a user interface that includes real-time information about different transportation legs included in the journey. For example, one example user interface can show information about the current leg of the journey in a first (e.g., upper) portion of the interface. Information about other legs (e.g., subsequent legs) can be shown in a second (e.g., lower) portion of the interface. For example, the information about the subsequent legs can include real-time updates or notifications that provide information about the ongoing matching process. For example, while on one leg of the journey, the user can receive notifications that the service provider for the next leg of the journey has been matched, is on the way to the next pick-up location, has arrived, etc. This provides the user with a concierge service that the user can enjoy with confidence that the system is actively ensuring that transportation is secured for each leg of the journey and that such transportation will allow the user to arrive at their final destination at the appropriate time.

[0064] Once the multi-modal journey is completed, the computing system can provide the user with a single receipt that can detail separate portions of the final cost associated with each of the multiple legs of the transportation. The computing system can generate the single receipt by generating multiple receipts for the multiple transportation legs, respectively, and then concatenating the multiple receipts to generate the single receipt.

[0065] Accordingly, aspects of the present disclosure are directed to systems and methods for real-time planning and fulfillment of multi-modal transportation services in a multi-modal ride-sharing network that efficiently interact with various networks of service providers to ensure a seamless and timely multi-modal experience for riders.

[0066] Referring now to the figures, exemplary embodiments of the present disclosure will be discussed in further detail. Exemplary Devices and Systems

[0067] 1 depicts a block diagram of an exemplary computing system 100 in accordance with an exemplary embodiment of the present disclosure. The computing system 100 includes a cloud services system 102 that may operate to plan and fulfill a multi-modal transportation service itinerary.

[0068] The cloud services system 102 can be communicatively connected via a network 180 to one or more passenger computing devices 140, one or more service provider computing devices 150 for a first vehicle, one or more service provider computing devices 160 for a second vehicle, one or more service provider computing devices 170 for an Nth vehicle, and one or more infrastructure and operations computing devices 190.

[0069] Each of the computing devices 140, 150, 160, 170, 190 may include any type of computing device, such as a smartphone, a tablet, a handheld computing device, a wearable computing device, an embedded computing device, a navigation computing device, a vehicle computing device, etc. The computing devices may include one or more processors and memory (e.g., similar to that which will be discussed with reference to the processor 112 and memory 114). Although the service provider devices are shown for N different vehicles, any number of different vehicles may be used, including, for example, less than the three illustrated vehicles (e.g., two vehicles may be used).

[0070] The cloud service system 102 includes one or more processors 112 and memory 114. The one or more processors 112 can be any suitable processing device (e.g., a processor core, a microprocessor, an ASIC, an FPGA, a controller, a microcontroller, etc.) and can be a single processor or multiple processors operatively connected. The memory 114 can include one or more non-transitory computer-readable storage media, such as RAM, ROM, EEPROM, EPROM, one or more memory devices, flash memory devices, etc., and combinations thereof.

[0071] The memory 114 may store information that may be accessed by one or more processors 112. For example, the memory 114 (e.g., one or more non-transitory computer-readable storage media, memory devices) may store data 116 that may be obtained, received, accessed, written, manipulated, created, and / or stored. In some implementations, the cloud service system 102 may obtain data from one or more memory devices that are remote from the system 102.

[0072] The memory 114 may also store computer-readable instructions 118 that may be executed by the one or more processors 112. The instructions 118 may be software written in any suitable programming language or may be implemented in hardware. Additionally or alternatively, the instructions 118 may be executed, logically and / or virtually, within separate threads on the processors 112. For example, the memory 114 may store instructions 118 that, when executed by the one or more processors 112, cause the one or more processors 112 to perform any of the operations and / or functions described herein.

[0073] In some implementations, the cloud services system 102 can facilitate the user's availability to receive transportation on one or more of the transportation segments included in the trip. As one example, the cloud services system 102 can interact with one or more ride-sharing networks to match the user with one or more transportation service providers 150, 160, 170. As another example, the cloud services system 102 can reserve or otherwise reserve a seat, space, or use of one or more of the transportation vehicles for the user. Additionally or alternatively, the cloud services system 102 can simply provide information regarding options to be provided by one or more third parties for one or more of the transportation segments.

[0074] More specifically, in some implementations, the cloud services system 102 can respond to a user request by determining whether using a single transportation mode or using multiple transportation modes is more beneficial to fulfill the user request. As one example, the cloud services system 102 can evaluate the user's current location, current location at the time of the request, and / or destination to determine the transportation modes available at such locations (e.g., capable of accessing such locations). For example, the location can be checked against a list of whitelist locations that are approved for engaging in various types of modes (e.g., flight modes for purposes of generating a multi-modal travel itinerary). As another example, the cloud services system 102 can evaluate (e.g., generate) one or more journeys that are unimodal and one or more journeys that are multimodal (e.g., including various combinations of different transportation modes). The cloud services system 102 can compare the generated unimodal and multimodal journeys and determine whether it is appropriate to suggest a unimodal or multimodal journey to the user. For example, one or more of the best itineraries (e.g., as evaluated based on various characteristics such as cost, time, etc.) can be suggested to the user. The user can select one of the suggested itineraries and receive transportation services according to the selected itinerary.

[0075] Additionally, in some implementations, the cloud services system 102 can continually re-evaluate various journeys (e.g., single and / or multi-modal journeys) before or even during completion of a selected journey. If an improved journey becomes available (which may include, for example, changing from a single-modal journey to a multi-modal journey when seats become available on an airline flight), the cloud services system 102 can suggest the improved journey for selection by the user. In some implementations, if a user selects an improved journey during completion of an existing journey, the cloud services system 102 can facilitate a switch to the updated journey, including, for example, rerouting the transportation provider currently transporting the user to an alternate updated destination.

[0076] In some implementations, the cloud services system 102 can include and implement logic to address transportation service provider cancellations and / or inappropriate use of the rideshare network by the transportation service provider (e.g., as "gaming"). As one example, in the event of a service provider cancellation or if the service provider has not made substantial progress toward fulfilling the requested trip, the cloud services system 102 can automatically prompt the rider to re-address the request (e.g., re-match with the service provider, but using the same itinerary). Alternatively or additionally, the cloud services system 102 can automatically create a new request and perform the itinerary creation process for an additional period of time (e.g., if a segment of the original trip has only been unfulfilled and approved by the matched service provider).

[0077] In addition to or as an alternative to service provider cancellation, the cloud services system 102 may include and implement logic to address user cancellation. As one example, if a user cancels a transportation request / journey prior to the scheduled time of pick-up and / or the actual pick-up for the initial transportation leg, the cloud services system 102 may cancel the entire trip / journey. As another example, if a transportation service provider is already matched for the initial transportation leg, a first cancellation by the user may be treated as a request to re-match with the user for the initial transportation leg. A second cancellation by the user may then result in the entire trip / journey being canceled. This logic, interpreting a first cancellation as a re-matching request, avoids canceling the entire trip when a user simply cancels matching with a first service provider because the first service provider has not made substantial progress toward completing the transportation service (e.g., the service provider's vehicle is not moving toward the pick-up location).

[0078] According to another aspect of the disclosure, in some implementations and scenarios, the cloud services system 102 may disable the possibility of a transportation service provider contacting the user. In particular, one possible scenario is one in which a user is currently being transported via flight-based transportation. During the flight, the user may have been matched with a land-based transportation provider. The land-based transportation provider may arrive at an intermediate point (e.g., a destination transportation node) prior to the user's flight and initiate contact with the user (e.g., via phone call or text message) to ask the user about their location and whether the user is ready to board the land-based transportation service. This may be an intrusive or otherwise undesirable experience for the user, as the user may feel as if they are delaying the land-based transportation service provider and / or being rushed by the land-based transportation service provider, which is currently in flight and therefore unable to take steps to reduce the time until the user can board the land-based service. Thus, to prevent this scenario, the cloud services system 102 may disable the ability of the land-based service provider to contact the user if a land-based service is to be provided following a flight-based transportation segment and the flight-based transportation segment has not yet been completed. Once the flight-based transportation segment is completed, the service provider may again be enabled to contact the user. In some implementations, the cloud services system 102 may provide status updates and inform the user (e.g., "John has arrived and is ready to take you to your destination") to the user despite disabling the service provider's ability to contact the user. In some implementations, the cloud services system 102 may provide status updates and inform the service provider (e.g., "Jane's flight is delayed by 5 minutes" or "Jane's flight will arrive in 7 minutes") to the user despite disabling the service provider's ability to contact the user.

[0079] In some implementations, the cloud services system 102 can implement one or more mitigation processes or routines to mitigate the failure of one or legs of a trip in a multi-leg trip. As an example, the mitigation process implemented by the cloud services system 102 can include and implement logic to respond to the cancellation of a flight on which a user is booked. As an example, if a planned flight is canceled and the user has not yet begun the trip or has not yet reached a threshold period before the start of the trip, the cloud services system 102 can cancel the entire trip / journey. The user can be notified of the cancellation and given an opportunity to resubmit the request for the trip. However, if the user has already begun the trip or has entered a threshold period before the start of the trip, the cloud services system 102 can notify the user and offer to reroute (e.g., replan the trip with updated information, re-match with an alternative service provider for the trip leg, and / or change the trip leg to an alternative transportation mode). In some implementations, reroute operations may be given preference or preferential treatment (eg, a user's use of special means may be subsidized or have reduced fees).

[0080] In some implementations, once a multi-modal journey has been completed, the cloud services system 102 can provide the user with a single receipt. The single receipt can detail the separate portions of the final cost associated with each of the multiple legs of the journey. The cloud services system 102 can generate the single receipt by generating multiple receipts for the multiple legs of the journey, respectively, and then concatenating the multiple receipts to generate the single receipt.

[0081] Cloud services system 102 can include several different systems, such as a state of the world system 126, a forecasting system 128, an optimization / planning system 130, and a matching and fulfillment system 132. Matching and fulfillment system 132 can include a different matching system 134 for each vehicle and a monitoring and mitigation system 136. Each of systems 126-136 can be implemented in software, firmware, and / or hardware, including as software that, for example, when executed by processor 112, causes cloud services system 102 to perform desired operations. Systems 126-136 can cooperate and interoperate (e.g., including feeding information to each other).

[0082] World state system 126 can operate to maintain data describing the current state of the world. For example, world state system 126 can generate, collect, and / or maintain data describing projected passenger demand, projected service provider supply, projected weather conditions, planned itineraries, predefined transportation plans (e.g., flight plans) and allocations, current demand, current ground transportation service providers, current transportation node operational status (e.g., including recharge or refueling capabilities), current aircraft status (e.g., including current fuel or battery levels), current aircraft pilot status, current flight state and trajectory, current airspace information, current weather conditions, current communication system behavior / protocols, and / or the like. World state system 126 can obtain such world state information through communication with some or all of devices 140, 150, 160, 170, 190. For example, device 140 can provide current information about passengers, while devices 150, 160, and 170 can provide current information about service providers. The device 190 can provide current information about the status of the infrastructure and associated operations / management.

[0083] The forecasting system 128 may generate forecasts of demand and supply for transportation services at or between various locations over time. The forecasting system 128 may also generate or provide weather forecasts. The forecasts made by the system 128 may be generated based on historical data and / or through modeling of supply and demand. In some instances, the forecasting system 128 may be referred to as an RMR system, where RMR stands for "routing, matching, and recharging." The RMR system may be capable of simulating the daily behavior of activity across multiple rideshare networks.

[0084] The optimization / planning system 130 can generate transportation plans for various transportation assets and / or generate itineraries for passengers. For example, the optimization / planning system 130 can perform flight planning. As another example, the optimization / planning system 130 can plan or manage / optimize a journey, which includes interactions between passengers and service providers across multiple transportation modes.

[0085] The matching and fulfillment system 132 can match riders with service providers for different modes of transportation. For example, each individual matching system 134 can communicate with a corresponding service provider computing device 150, 160, 170 via one or more APIs or connections. Each matching system 134 can communicate trajectories and / or assignments to a corresponding service provider. Thus, the matching and fulfillment system 132 can perform or address assignments of ground transportation, flight trajectories, takeoff / landing, etc.

[0086] The monitoring and mitigation system 136 can perform monitoring of a user's journey and can perform mitigation measures when the journey is experiencing significant delays (e.g., one of the legs fails to complete). Thus, the monitoring and mitigation system 136 can perform situational awareness, advisories, adjustments, and the like. The monitoring and mitigation system 136 can trigger alerts and actions that are sent to the devices 140, 150, 160, 170, and 190. For example, passengers, service providers, and / or operational personnel can be alerted when a transportation plan is modified and can be provided with an updated plan / course of action. Thus, the monitoring and mitigation system 136 can have additional control of the movements of aircraft, ground vehicles, pilots, and passengers.

[0087] In some implementations, the cloud service system 102 may also store or include one or more machine-learned models. For example, the models may be or otherwise include various machine-learned models, such as support vector machines, neural networks (e.g., deep neural networks), decision tree-based models (e.g., random forests), or other multi-layer nonlinear models. Exemplary neural networks include feed-forward neural networks, recurrent neural networks (e.g., long short-term memory recurrent neural networks), convolutional neural networks, or other forms of neural networks.

[0088] In some instances, the service provider computing devices 150, 160, 170 may be associated with an autonomous vehicle. Thus, the service provider computing devices 150, 160, 170 may provide communications between the cloud service system 102 and the autonomous vehicle's autonomy stack, which autonomously controls the movement of the autonomous vehicle.

[0089] Infrastructure and operations computing devices 190 can be any form of computing device used by or on infrastructure or operations personnel, including, for example, devices configured to perform passenger security checks, baggage check-in / out, recharging / refueling, safety briefings, vehicle check-in / out, and / or the like.

[0090] Network 180 can be any type of network or combination of networks that enables communication between devices. In some embodiments, the network can include one or more of a local area network, a wide area network, the Internet, a secure network, a cellular network, a mesh network, a peer-to-peer communication link, and / or some combination thereof, and can include any number of wired or wireless links. Communications over network 180 can be accomplished using any type of protocol, protection scheme, encoding, formatting, packaging, etc., via, for example, a network interface. (Example Fixed Infrastructure)

[0091] FIG. 2 depicts a pictorial diagram of an example set of flight plans between an example set of transportation nodes, according to an example embodiment of the present disclosure. In particular, FIG. 2 provides a simplified illustration of an example fixed infrastructure associated with flight-based transportation in an example metropolitan area. As illustrated in FIG. 2, there are four transportation nodes, which may be referred to as "skyports." For example, a first transportation node 202 is located within a first proximity area of ​​the metropolitan area, a second transportation node 204 is located within a second proximity area, a third transportation node 206 is located within a third proximity area, and a fourth transportation node 208 is located within a fourth proximity area. The locations and numbers of the transportation nodes are provided by way of example only. Any number of transportation nodes in any different locations may be used.

[0092] Flights are available (e.g., may be pre-planned) between certain pairs of transportation nodes. For example, flight path 210 exists between the first transportation node 202 and the fourth transportation node 208. Similarly, flight path 212 exists between the fourth transportation node 208 and the third transportation node 206.

[0093] 3 depicts a pictorial diagram of an example transportation node 300, in accordance with an example embodiment of the present disclosure. The example transportation node 300 includes several take-off / arrival points, such as points 302 and 304. The example transportation node 300 also includes several vehicle parking locations, such as parking locations 306 and 308. For example, a refueling or recharging infrastructure may be accessible at each parking location.

[0094] Flight trajectories into and out of transportation node 300 may be defined, configured, assigned, communicated, etc. Figure 3 illustrates several flight trajectories, including, for example, trajectories 310 and 312. The trajectories can be fixed or dynamically calculated. The trajectories can be calculated by the aircraft or can be calculated centrally and then assigned and communicated to the aircraft. As an example, Figure 3 illustrates helicopter 314 taking off from point 304 following trajectory 312. (Example of a multi-modal transportation service)

[0095] 4 depicts a pictorial diagram of an exemplary multi-modal transportation service itinerary 400, in accordance with an exemplary embodiment of the present disclosure. The itinerary 400 includes three transportation legs for transporting a user from a current location 402 to a destination 408. In particular, the itinerary 400 includes a first land-based (e.g., car-based) transportation leg 450 that transports the user from the current location 402 to a departure transportation node 404, a second flight-based transportation leg 452 that transports the user from the departure transportation node 404 to an arrival transportation node 406, and a third land-based (e.g., car-based) transportation leg 454 that transports the user from the arrival transportation node 406 to the destination 408. (Exemplary Method)

[0096] FIG. 5 depicts a flowchart diagram of an example method 500 for planning a multi-modal transportation service itinerary, according to an example embodiment of the present disclosure.

[0097] At 502, a computing system may receive a request for transportation services between a current location and a destination.

[0098] At 504, the computing system can identify associated fixed transport nodes associated with the first vehicle having a fixed infrastructure.

[0099] At 506, the computing system may access a database of predefined transportation plans between relevant fixed transportation nodes associated with the first vehicle.

[0100] At 508, the computing system may select one or more candidate transportation plans from the database.

[0101] At 510, the computing system can populate the candidate transportation plan with dynamic information associated with one or more additional transportation legs via one or more second transportation vehicles.

[0102] At 512, the computing system can generate at least one journey including transportation via a first transportation plan selected from the candidate transportation plans and one or more additional transportation legs of one or more second transportation means.

[0103] At 514, the computing system may determine whether the user has requested the journey to be completed. If it is determined that the user has requested the journey to be completed, the method 500 may proceed to block 602 of Figure 6. However, if it is determined that the user has not requested the journey to be completed, the method 500 may proceed to 516.

[0104] At 514, the computing system may determine whether the user has modified one or more variables of the request. If it is determined that the user has modified one or more variables of the request, the method 500 may return to block 504 and begin the journey construction process again. However, if it is determined that the user has not modified one or more variables of the request, the method 500 may return to block 512 and select an alternative journey for presentation to the user.

[0105] 6A-B depict a flowchart diagram of an example method 600 for fulfilling a multi-modal transportation service leg, according to an example embodiment of the disclosure. Although the blocks of method 600 are shown in an example sequential order for convenience of explanation, in some implementations various blocks may be performed out of order and / or in parallel. For example, blocks 606, 608, 628, and 630 may be performed separately and / or in parallel with various other blocks of method 600.

[0106] First, referring to FIG. 6A, at 602, a computing system may add a user to a passenger manifest for a first transportation plan of a first transportation means.

[0107] At 604, the computing system may determine whether an initial transportation leg exists prior to the first transportation plan. If it is determined that an initial transportation leg does not exist, the method 600 may proceed to block 616. However, if it is determined that an initial transportation leg exists, the method 600 may proceed to 606.

[0108] At 606, the computing system may determine an appropriate matching process start time for the initial trip leg based on historical and / or real-time data associated with the initial trip leg of the second vehicle.

[0109] At 608, the computing system can match the user with a service provider to fulfill the initial transport leg via the second vehicle.

[0110] At 610, the computing system can monitor the probability of successful completion of the initial transport leg.

[0111] At 612, the computing system may determine whether the probability of success is below a threshold. If it is determined that the probability of success is below the threshold, the method 600 may proceed to block 614, where the computing system may implement a mitigation process.

[0112] However, if at 612 it is determined that the probability of success of the initial transportation leg did not fall below the threshold, the method 600 may proceed to 616. At 616, the computing system may enable execution of the first transportation plan. After block 616, the method 600 proceeds to block 618 of FIG. 6B.

[0113] Now referring to FIG. 6B, at 618, the computing system may monitor the probability of successful completion of the first transportation leg.

[0114] At 620, the computing system may determine whether the probability of success is below a threshold. If it is determined that the probability of success is below the threshold, the method 600 may proceed to block 622, where the computing system may implement a mitigation process.

[0115] However, if at 620 it is determined that the probability of success of the initial transport leg did not fall below the threshold, method 600 may proceed to 624 .

[0116] At 624, the computing system may determine whether additional transport legs exist within the journey. If it is determined that no additional transport legs exist, the method 600 may proceed to block 626. At 626, the computing system may perform service completion activities such as conducting financial transactions, sending receipts, obtaining feedback from the transportation service participants, etc.

[0117] However, if at 324 it is determined that additional transport legs exist, the method 600 may proceed to 628 .

[0118] At 628, the computing system may determine an appropriate matching process start time for the additional trip leg based on historical and / or real-time data associated with the additional trip leg of the second vehicle.

[0119] At 630, the computing system can match the user with a service provider to fulfill the additional trip leg via a second vehicle.

[0120] At 632, the computing system may monitor the probability of successful completion of the additional transport leg.

[0121] At 634, the computing system may determine whether the probability of success falls below a threshold. If it is determined that the probability of success falls below the threshold, the method 600 may proceed to block 636, where the computing system may implement a mitigation process.

[0122] However, if at 634 it is determined that the probability of success of the initial transport leg did not fall below the threshold, the method 600 may return to 624 to again assess whether additional transport legs are present within the journey.

[0123] 7A-C depict a flowchart diagram of an example method 700 for planning and fulfilling a multi-modal transportation service itinerary, according to an example embodiment of the present disclosure. Although the blocks of method 700 are shown in an example sequential order for convenience of explanation, in some implementations various blocks may be performed out of order and / or in parallel. For example, blocks 710, 712, 716, 718, 738, and 740 may be performed separately and / or in parallel with various other blocks of method 700.

[0124] Referring initially to FIG. 7A, at 702, a computing system may receive a request for transportation services between a current location and a destination.

[0125] At 704, the computing system can generate alternative itineraries that include multiple transportation legs according to multiple transportation modes.

[0126] At 706, the computing system may determine whether the user has requested the journey to be completed. If it is determined that the user has requested the journey to be completed, method 700 may proceed to block 708. However, if it is determined that the user has not requested the journey to be completed, method 700 may return to block 704 and generate an alternative itinerary for the user.

[0127] At 708, the computing system can identify a first transportation leg associated with the most supply-constrained vehicle.

[0128] At 710, the computing system may determine an appropriate matching process start time for the transportation segment associated with the most supply-constrained transportation means based on historical and / or real-time data associated with that transportation segment.

[0129] At 712, the computing system can match users with service providers to fulfill the trip leg via the most supply-constrained vehicle.

[0130] At 714, the computing system may determine whether an initial transport leg exists prior to the first transport leg. If it is determined that an initial transport leg does not exist, the method 700 may proceed to block 726 of FIG. 7B. However, if it is determined that an initial transport leg exists, the method 700 may proceed to block 716 of FIG. 7B.

[0131] Now referring to FIG. 7B, at 716, the computing system may determine an appropriate matching process start time for the initial transportation segment based on historical and / or real-time data associated with the initial transportation segment of the second transportation means, and further based on the matched service providers for the first transportation segment (e.g., expected variance in departure times offered by the matched service providers for the first transportation segment).

[0132] At 718, the computing system can match the user with a service provider to fulfill the initial transport leg via the second vehicle.

[0133] At 720, the computing system can monitor the probability of successful completion of the initial transport leg.

[0134] At 722, the computing system may determine whether the probability of success is below a threshold. If it is determined that the probability of success is below the threshold, the method 700 may proceed to block 724, where the computing system may implement a mitigation process.

[0135] However, if at 722 it is determined that the probability of success of the initial transportation leg did not fall below the threshold, the method 700 may proceed to 726. At 726, the computing system may enable execution of the first transportation plan. After block 726, the method 700 proceeds to block 728 of FIG. 7C.

[0136] Now referring to FIG. 7C, at 728, the computing system may monitor the probability of successful completion of the first transportation leg.

[0137] At 730, the computing system may determine whether the probability of success is below a threshold. If it is determined that the probability of success is below the threshold, the method 700 may proceed to block 732, where the computing system may implement a mitigation process.

[0138] However, if at 730 it is determined that the probability of success of the initial transport leg did not fall below the threshold, method 700 may proceed to 734 .

[0139] At 734, the computing system may determine whether additional transport legs exist within the journey. If it is determined that no additional transport legs exist, the method 700 may proceed to block 736. At 736, the computing system may perform service completion activities such as conducting financial transactions, sending receipts, obtaining feedback from the transportation service participants, etc.

[0140] However, if at 734 it is determined that additional transport legs exist, the method 700 may proceed to 738 .

[0141] At 738, the computing system may determine an appropriate matching process start time for the additional trip leg based on historical and / or real-time data associated with the additional trip leg of the second vehicle.

[0142] At 740, the computing system can match the user with a service provider to fulfill the additional trip leg via the second vehicle.

[0143] At 742, the computing system can monitor the probability of successful completion of the additional transport leg.

[0144] At 744, the computing system may determine whether the probability of success is below a threshold. If it is determined that the probability of success is below the threshold, the method 700 may proceed to block 746, where the computing system may implement a mitigation process.

[0145] However, if at 744 it is determined that the probability of success of the initial transport leg did not fall below the threshold, the method 700 may return to 734 to again assess whether additional transport legs are present within the journey. (Additional Disclosure)

[0146] The use of a computer-based system allows for a wide variety of possible configurations, combinations, and divisions of tasks and functionality between and among components. Computer-implemented operations may be performed on a single component or across multiple components. Computer-implemented tasks and / or operations may be performed sequentially or in parallel. Data and instructions may be stored in a single memory device or across multiple memory devices.

[0147] Although the present subject matter has been described in detail with respect to various specific exemplary embodiments thereof, each example is provided as an explanation, not a limitation of the present disclosure. Those skilled in the art can easily produce modifications, variations, and equivalents of such embodiments upon attainment of the above understanding. Thus, the present disclosure does not exclude the inclusion of such modifications, variations, and / or additions to the present subject matter that would be readily apparent to those skilled in the art. For example, features illustrated or described as part of one embodiment can be used with another embodiment to produce yet a further embodiment. Thus, the present disclosure is intended to cover such modifications, variations, and equivalents.

[0148] In particular, although Figures 5, 6A-B, and 7A-C each depict steps performed in a particular order for purposes of illustration and discussion, the methods of the present disclosure are not limited to the order or sequence specifically depicted. Various steps of methods 5, 6A-B, and 7A-C can be omitted, rearranged, combined, and / or adapted in various ways without departing from the scope of the present disclosure.

[0149] Another example aspect of the disclosure is directed to a computer-implemented method for planning and fulfilling a multi-modal transportation service journey, the method including obtaining, by a computing system having one or more computing devices, data describing an end-to-end journey for a user describing transportation from a current location to a destination, the journey including a plurality of transportation legs, including transportation via a plurality of different transportation means, monitoring, by the computing system, the user's progress along each transportation leg of the journey, detecting, by the computing system, a failure of one of the transportation legs of the journey, and implementing, by the computing system, a mitigation process to mitigate the failure of one of the transportation legs of the journey.

[0150] In some implementations, performing a mitigation process by the computing system includes causing the computing system to provide a mitigation user interface to human mitigation personnel, the mitigation user interface enabling the human mitigation personnel to modify one or more aspects of the journey.

[0151] In some implementations, the mitigation user interface enables human mitigation personnel to delay a given transportation plan associated with one of the transportation legs of the journey and / or provides the human mitigation personnel with an indicator describing one or more impacts of one or more potential actions available to the human mitigation personnel within the mitigation user interface.

[0152] In some implementations, for at least one potential action, an indicator in the mitigation measures user interface describes the number of users that would be affected as a result of the potential action, the number of users that would miss their arrival time as a result of the potential action, and the total number of minutes that would be added to transportation services for all users as a result of the potential action.

[0153] In some implementations, implementing the mitigation process by the computing system includes automatically generating, by the computing system, one or more emergency response itineraries for the user; selecting, by the computing system, one of the emergency response itineraries for the user; and communicating, by the computing system, with at least the user device and updating the itinerary to the selected emergency response itinerary.

[0154] In some implementations, selecting one of the emergency response itineraries for the user by the computing system includes ranking the emergency response itineraries based, at least in part, by the computing system on the number of users that would be affected as a result of the selection of each emergency response itinerary, the number of users that would miss their arrival time as a result of the selection of each emergency response itinerary, and / or the total number of minutes that would be added to the transportation services of all users as a result of the selection of each emergency response itinerary.

Claims

1. 1. A computing system comprising: one or more processors; one or more non-transitory computer-readable media storing instructions for execution by the one or more processors, the instructions causing the computing system to perform operations; Equipped with The operation includes: Accessing a request to transport the user from a current location to a destination; calculating one or more candidate end-to-endpoint journeys based at least in part on the current location and the destination, each candidate end-to-endpoint journey comprising a plurality of transportation legs including transportation via a plurality of different transportation means, the plurality of transportation legs comprising at least a first transportation leg and a second transportation leg, the first transportation leg comprising ground-based transportation provided via one or more ground-based vehicles associated with a ground-based transportation service provider, and the second transportation leg comprising flight-based transportation provided via one or more aircraft associated with an air-based transportation service provider; scoring each of the one or more candidate end-to-end journeys using an objective function that evaluates costs associated with the plurality of transportation legs and times associated with the plurality of transportation legs; calculating a selected end-to-end journey for presentation to the user having a best score based on scoring using the objective function; providing a user device with data indicative of the selected end-to-end journey; Including, Scoring each of the one or more candidate endpoint-to-endpoint journeys using the objective function further comprises evaluating at least one of a number or quality of contingency plans to provide alternative transportation segments associated with each candidate endpoint-to-endpoint journey.

2. 2. The computing system of claim 1, wherein scoring each of the one or more candidate endpoint-to-endpoint journeys using the objective function further evaluates at least one of deviation of an estimated arrival time from a required arrival time or deviation of an estimated departure time from a required departure time.

3. 2. The computing system of claim 1, wherein scoring each of the one or more candidate endpoint-to-endpoint journeys using the objective function further evaluates at least one of an uncertainty or variance associated with each transportation leg of each candidate endpoint-to-endpoint journey.

4. 2. The computing system of claim 1, wherein providing the data to the user device indicative of the selected end-to-end journey includes providing a single end-to-end price for fulfilling the selected end-to-end journey, the single end-to-end price corresponding to a sum of respective prices for the plurality of transportation legs.

5. The operation includes: receiving an indication from the user device indicating a modified end-to-end journey comprising a user modification to one or more characteristics of the selected end-to-end journey; providing updated data to the user device indicative of the revised end-to-end journey; The computing system of claim 1 further comprising:

6. The operation includes: receiving an indication from the user device indicating that the user has elected to request completion of the selected end-to-end journey; initiating a request to one or more rideshare networks to enable the user to complete the selected end-to-end journey; The computing system of claim 1 further comprising:

7. 7. The computing system of claim 6, wherein the operations further include adding the user at a current time to a transportation plan for at least one of the first transportation segment or the second transportation segment in response to receiving the indication from the user device indicating that the user elects to request completion of the selected end-to-end journey.

8. 2. The computing system of claim 1, wherein one or more of the plurality of transportation segments is an alternative transportation plan that would be available at a future time at which the user seeks to travel, the alternative transportation plan being an estimate of transportation services that would be available at the future time, generated based on at least one of historical data or real-time data.

9. 1. A computer-implemented method, comprising: Accessing a request to transport the user from a current location to a destination; calculating one or more candidate end-to-endpoint journeys based at least in part on the current location and the destination, each candidate end-to-endpoint journey comprising a plurality of transportation legs including transportation via a plurality of different transportation means, the plurality of transportation legs comprising at least a first transportation leg and a second transportation leg, the first transportation leg comprising ground-based transportation provided via one or more ground-based vehicles associated with a ground-based transportation service provider, and the second transportation leg comprising flight-based transportation provided via one or more aircraft associated with an air-based transportation service provider; scoring each of the one or more candidate end-to-end journeys using an objective function that evaluates costs associated with the plurality of transportation legs and times associated with the plurality of transportation legs; calculating a selected end-to-end journey for presentation to the user having a best score based on scoring using the objective function; providing a user device with data indicative of the selected end-to-end journey; Including, The computer-implemented method of claim 1, wherein scoring each of the one or more candidate endpoint-to-endpoint journeys using the objective function further comprises evaluating at least one of a number or quality of contingency plans to provide alternative transportation segments associated with each candidate endpoint-to-endpoint journey.

10. 10. The computer-implemented method of claim 9, wherein scoring each of the one or more candidate endpoint-to-endpoint journeys using the objective function further evaluates at least one of deviation of an estimated arrival time from a required arrival time or deviation of an estimated departure time from a required departure time.

11. 10. The computer-implemented method of claim 9, wherein scoring each of the one or more candidate endpoint-to-endpoint journeys using the objective function further comprises evaluating at least one of an uncertainty or variance associated with each transportation leg of each candidate endpoint-to-endpoint journey.

12. 10. The computer-implemented method of claim 9, wherein providing the data to the user device indicative of the selected end-to-end journey includes providing a single end-to-end price for fulfilling the selected end-to-end journey, the single end-to-end price corresponding to a sum of respective prices for the multiple transportation legs.

13. receiving an indication from the user device indicating a modified end-to-end journey comprising a user modification to one or more characteristics of the selected end-to-end journey; providing updated data to the user device indicative of the revised end-to-end journey; The computer-implemented method of claim 9 , further comprising:

14. receiving an indication from the user device indicating that the user has elected to request completion of the selected end-to-end journey; initiating a request to one or more rideshare networks to enable the user to complete the selected end-to-end journey; The computer-implemented method of claim 9 , further comprising:

15. 10. The computer-implemented method of claim 9, wherein one or more of the plurality of transportation segments is an alternative transportation plan that would be available at a future time at which the user seeks to travel, the alternative transportation plan being an estimate of transportation services that would be available at the future time, generated based on at least one of historical data or real-time data.

16. One or more non-transitory computer-readable media storing instructions for execution by one or more processors, the instructions causing the one or more processors to perform operations; The operation includes: Accessing a request to transport the user from a current location to a destination; calculating one or more candidate end-to-endpoint journeys based at least in part on the current location and the destination, each candidate end-to-endpoint journey comprising a plurality of transportation legs including transportation via a plurality of different transportation means, the plurality of transportation legs comprising at least a first transportation leg and a second transportation leg, the first transportation leg comprising ground-based transportation provided via one or more ground-based vehicles associated with a ground-based transportation service provider, and the second transportation leg comprising flight-based transportation provided via one or more aircraft associated with an air-based transportation service provider; scoring each of the one or more candidate end-to-end journeys using an objective function that evaluates costs associated with the plurality of transportation legs and times associated with the plurality of transportation legs; calculating a selected end-to-end journey for presentation to the user having a best score based on scoring using the objective function; providing a user device with data indicative of the selected end-to-end journey; Including, Scoring each of the one or more candidate endpoint-to-endpoint journeys using the objective function further evaluates at least one of a number or quality of contingency plans to provide alternative transportation segments associated with each candidate endpoint-to-endpoint journey.

17. The operation includes: receiving an indication from the user device indicating a modified end-to-end journey comprising a user modification to one or more characteristics of the selected end-to-end journey; providing updated data to the user device indicative of the revised end-to-end journey; 20. The one or more non-transitory computer readable media of claim 16, further comprising:

18. The operation includes: receiving an indication from the user device indicating that the user has elected to request completion of the selected end-to-end journey; initiating a request to one or more rideshare networks to enable the user to complete the selected end-to-end journey; 20. The one or more non-transitory computer readable media of claim 16, further comprising:

Citation Information

Patent Citations

  • Information processor and information processing method

    JP2000048032A

  • Transfer route guidance system and route guidance server

    JP2005182146A

  • Route presenting device, method of presenting route, and computer program

    JP2008210278A

  • Navigation device

    JP2009002683A

  • Trip system

    JP2016139263A