Method and system for obtaining multimodal routes
By distinguishing public and private transport subnets in multi-mode transportation networks and using cross-time data, the problem of difficulty in integrating the two networks in the prior art is solved, and efficient multi-mode route planning and environmentally friendly traffic integration are achieved.
Patent Information
- Application Number
- CN202110180665.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2013-08-19
- Filing Date
- 2014-08-11
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2034-08-11
AI Technical Summary
The prior art is difficult to effectively integrate public transportation networks and private transportation networks, making it difficult to generate multi-modal routes across two types of networks, and route planning algorithms cannot easily operate the two types of networks.
By using cross-time data representing each section in a multi-modal transport network, distinguishing between a public transport subnet and a private transport subnet, the public transport subnet is only available at a specific time, while the private transport subnet can be used at any time, and The cross-time data is adjusted based on the travel frequency so that the route planning engine can explore multimodal routes.
It realizes the generation of multi-modal routes without the need for detailed scheduling information, simplifies the route planning process, and can handle sections of different types of subnets without modifying the existing route planning engine, providing more efficient overall itinerary and Reduce environmental impact.
Smart Images

Figure CN112964268B_ABST
Abstract
Description
[0001] Information about divisional applications
[0002] This case is a divisional application. The parent case of the divisional application is an invention patent application with application date of August 11, 2014, application number 201480055886.8, and invention name “Method and system for obtaining multi-modal routes”. Technical Field
[0003] The present invention relates to methods and systems for obtaining a multimodal route through a multimodal transportation network. A multimodal transportation network is a network that permits travel through more than one mode of transportation. More specifically, the present invention relates to performing route planning on a multimodal network comprising sub-networks of different types. The multimodal network comprises a first transportation sub-network (e.g., a public transportation network) that can be joined, left, and traveled through only at certain times, and a second transportation sub-network (e.g., a network for use by private transportation, such as a road network) that can be freely joined, left, and traveled through by a user at any time. Background Art
[0004] There are certain challenges in obtaining a multimodal route through a multimodal transportation network. Such transportation networks typically include sub-networks of different types, i.e., associated with different modes of transportation. These differences in the properties of the different types of networks make it difficult to generate a multimodal route that spans both types of networks, because a route planning engine cannot easily operate on both types of networks. Route planning algorithms tend to be specific for a certain type of transportation network. Current attempts to obtain a multimodal route involve exploring different networks separately to determine a route through them. For example, a route may be determined from a departure point through a network associated with one mode of transportation to a departure point for another mode of transportation, and then a route from the departure point for the other mode of transportation to a destination through a network associated with the other mode of transportation is determined.
[0005] By way of example, a multimodal transportation network may include a public transportation subnetwork and a transportation subnetwork for use by private transportation, such as a road network (referred to herein as a "private transportation subnetwork"). These types of networks have different properties. The time of entry, exit, and travel through a public transportation network is constrained such that entry, exit, and travel through the network may only occur at specific times, i.e., according to a schedule associated with the network. In contrast, when private transportation is used, no such constraints exist with respect to a private transportation network, such as a road network. In a private transportation network, a user may freely choose to enter, exit, or travel through the network at a time of their choosing.
[0006] Private transportation routing algorithms (e.g., automobile routing algorithms) and public transportation routing algorithms tend to be mathematically different due to the different nature of such networks, and therefore cannot be easily integrated to provide a truly multimodal route plan. Previous attempts to obtain multimodal routes involving both road and public transportation networks have tended to involve using a first routing algorithm to find a route through the road network from an origin to the nearest interchange point with the public transportation network, and then using a second routing plan for the public transportation network to find a route from the interchange to the destination. There is increasing interest in being able to generate multimodal routes, for example, to allow a user to integrate their use of private and public transportation between an origin and destination of interest to provide a more efficient overall trip and / or reduce environmental impact.
[0007] Applicants have recognized that there is a need for improved methods and systems for generating routes through a multimodal transportation network, particularly where the network includes a first sub-network (e.g., a public transportation network) in which time to enter, exit, and travel through the network is constrained, and a second sub-network (e.g., a road network) that is not so constrained. Summary of the invention
[0008] According to a first aspect of the invention, there is provided a method of performing route planning in a multimodal transport network represented using a plurality of road segments, each road segment indicating a navigable road segment of the network, and each road segment having data associated therewith indicating a traversal time for the road segment, wherein the plurality of road segments representing the multimodal transport network comprises:
[0009] a first subset of road segments indicating a first transportation sub-network of the multimodal transportation network, the first transportation sub-network being a network that can be joined, left, and traveled through by users only at specific times; and
[0010] a second subset of road segments indicating a second transportation subnetwork of the multimodal transportation network, the second transportation subnetwork being a network that can be joined, left, and traveled through by a user at substantially any time,
[0011] the transit time data associated with at least some of the first subset of the plurality of road segments indicative of navigable road segments of the first transportation subnetwork of the multimodal transportation network is based on a transit time indicative of a time taken to travel along the road segment and an additional time based on a frequency with which travel along the road segment occurs,
[0012] The method comprises:
[0013] A route search is performed between an origin and a destination within the multimodal transportation network using the transit time data associated with the road segments of the multimodal transportation network to obtain one or more possible multimodal routes through the transportation network from the origin to the destination.
[0014] The method may be extended to the step of representing the multimodal network using a plurality of road segments, each road segment indicating a navigable road segment of the network, and each road segment having data associated therewith indicating a traversal time for the road segment, as set out above.
[0015] Furthermore, and in accordance with a second aspect of the invention, there is provided a system arranged to perform route planning in a multimodal transport network represented by a plurality of road segments, each road segment indicating a navigable road segment of the network, and each road segment having data associated therewith indicating a traversal time for the road segment, wherein the plurality of road segments representing the multimodal transport network comprises:
[0016] a first subset of road segments indicating a first transportation sub-network of the multimodal transportation network, the first transportation sub-network being a network that can be joined, left, and traveled through by users only at specific times; and
[0017] a second subset of road segments indicating a second transportation subnetwork of the multimodal transportation network, the second transportation subnetwork being a network that can be joined, left, and traveled through by a user at substantially any time,
[0018] the transit time data associated with at least some of the first subset of the plurality of road segments indicative of navigable road segments of the first transportation subnetwork of the multimodal transportation network is based on a transit time indicative of a time taken to travel along the road segment and an additional time based on a frequency with which travel along the road segment occurs,
[0019] The system comprises:
[0020] Means for performing a route search between an origin and a destination within the multimodal transportation network using the transit time data associated with the road segments of the multimodal transportation network to obtain one or more possible multimodal routes through the transportation network from the origin to the destination.
[0021] In this other aspect, the present invention may include any or all of the features described in relation to the first aspect of the present invention (and vice versa), as long as they are not mutually inconsistent. Thus, if not explicitly stated herein, the system of the present invention may include means for implementing any of the steps of the described method.
[0022] Means for implementing any of the steps of the method may include a set of one or more processors configured (e.g., programmed) for doing so. A given step may be implemented using the same or a different set of processors as any other step. Any given step may be implemented using a combination of sets of processors. The system may further include data storage means (e.g., computer memory) for storing, for example, data indicating road segments of a multimodal transportation network and associated transit time data.
[0023] Thus, the present invention relates to methods and systems for performing route planning with respect to a multimodal transportation network. As used herein, a multimodal transportation network refers to a transportation network through which travel via two or more different modes of transportation can occur. The modes of transportation may include, but are not limited to, boat, car, train, tram, airplane, bicycle, walking, carpool, carriage, or bus. Boats as referred to herein may encompass any type of boat, such as a ferry, canal boat, water bus, etc. Trains as referred to herein include any type of train, such as a subway, bus rapid transit, intercity train, etc. The term "bicycle" may include motorized or non-motorized bicycles and mixed type bicycles.
[0024] According to the present invention, each road segment of the navigable road segment representing a multimodal transport network is associated with data indicating the crossing time for the road segment. Certain road segments are associated with the crossing time based on the transit time and the additional time (which is based on the frequency of traveling along the road segment) for crossing the road segment. These road segments are at least some road segments in the road segment of the first transport subnetwork indicating the multimodal network, and the first transport subnetwork allows users to join, leave and travel through the network only at a specific time. The specific time can be a scheduled time (for example, according to a timetable). These are features that are usually associated with a public transport network. In a preferred embodiment, the first transport subnetwork is a public transport network. Of course, it will be appreciated that the present invention can also be applicable to situations where the transport subnetwork is different types (constrained about the time of entering and exiting the network and traveling through the network). The first transport subnetwork can be at least a part of a public transport network in an applicable area forming a part of the multimodal transport network.
[0025] The first transport subnetwork permits travel via one or more modes of transport. In a preferred embodiment in which the first transport subnetwork is a public transport network, the network may permit travel by any one or more of the following: bus, tram, carriage, train, ship, and airplane. For example, the network may be an integrated public transport network that permits travel by more than one of these modes (e.g., bus, train, ship, and / or tram). However, in some embodiments, the first transport subnetwork permits travel only via a single mode of transport. The first transport subnetwork is associated with one or more modes of transport that enable the first transport subnetwork to be joined, left, and traveled through only at specific times. The first transport subnetwork may be defined by sections extending between nodes of the network. The nodes may correspond to sites or stations of the network.
[0026] According to the present invention, a multimodal transport network comprises a first transport subnetwork and a second transport subnetwork. The first and second transport subnetworks are of different types (i.e., they permit different types of travel). This is due to the type of network and the transport modes with which the networks are associated. The first and second transport subnetworks are preferably associated with different transport modes. The first and second transport subnetworks each permit travel via one or more transport modes, preferably wherein at least one and optionally each of the transport modes permitted via the first transport subnetwork is different from the transport modes permitted via the second transport subnetwork. In some embodiments, the first transport subnetwork does not permit travel via a mode of travel or each mode of travel permitted by the second transport subnetwork, and vice versa.
[0027] The second transport subnetwork is a network that can be joined, left and traveled through by users at substantially any time. The second subnetwork is associated with one or more modes of travel that enable the network to be joined, left and traveled through by users substantially freely. Therefore, the time of entering, exiting and traveling through the network is not constrained. This means that users are usually free to enter, leave or travel through the subnetwork at will. Although users may experience some small restrictions on entering, leaving or traveling through the subnetwork imposed by traffic control (such as traffic lights, etc.), users are usually free to travel at the time of their choice. This is in contrast to the first transport subnetwork. The time of entering, exiting and traveling through the second transport subnetwork is not subject to scheduling (e.g., timetable) constraints. The network is preferably a transport network for use by private transport ("private transport network" mentioned herein), such as a road network. The network is preferably a network that allows travel through one or more modes including cars, bicycles and walking. The second transport subnetwork can allow travel only via one mode of transport. The network may be a network that allows travel by private vehicles (e.g., cars, vans, trucks, bicycles, motorcycles, etc.). Private transportation refers to transportation that allows users to travel at the time of their choice. This includes hired vehicles or other forms of transportation that are not subject to scheduling constraints. For ease of reference herein, the second transportation subnetwork may be referred to as a private transportation or private vehicle network, such as a road network, and travel through the road network is carried out by vehicles or cars. However, it will be understood that this is only exemplary, and the subnetwork may be any such network (e.g., a walking network, a bicycle network, etc.) that allows users to freely enter, exit, and travel through the network. References to transportation modes by cars or vehicles should also be understood to be only exemplary. For example, the transportation mode may be by walking, bicycles, motorcycles, etc. In an embodiment where the network is a road network, travel may be by any form of vehicle (e.g., motorcycles, cars, vans, trucks, etc.) that is allowed to travel along the road. The second transportation subnetwork may be at least a portion of a private transportation network in an applicable area that forms part of a multimodal transportation network.
[0028] The multimodal transportation network comprises a first and a second transportation subnetwork. The multimodal transportation network may consist of these networks or may include, for example, one or more additional road segments forming one or more additional transportation subnetworks. For example, the network may include, for example, one or more additional public transportation networks permitting travel via one or several different modes. The multimodal transportation network is a global transportation network provided by a combination of at least the first and second transportation subnetworks.
[0029] The multimodal transportation network includes one or more points at which an exchange between a first transportation subnetwork and a second transportation subnetwork (i.e., between different modes of transportation) may occur. These may correspond to nodes (e.g., stations) of the first transportation subnetwork. Exchange points between subnetworks may be referred to as transit points. Data representing the multimodal transportation network may include data representing one or more exchange points. An exchange point may be represented by a node of the multimodal transportation network having at least one incoming or outgoing segment on the first transportation subnetwork and at least one incoming or outgoing segment on the second transportation subnetwork.
[0030] A plurality of sections for representing a multimodal transport network each represent a corresponding section of the network (i.e., a section in reality). The term "section" has its general meaning in the art, and refers to an arc extending between nodes of a network. The section can be represented using electronic map data. Preferably, each navigable section is associated with data indicating a subnetwork of the multimodal transport network to which it belongs. Each section is additionally associated with crossing time data for the section. A section can also be associated with any additional information about its properties.
[0031] According to the present invention, each section of the multimodal transport network is associated with data indicating the crossing time for the section. The data may indicate the crossing time in any manner. As will be described in more detail below, the crossing time data for at least some sections of the section forming the part of the first transport subnetwork is based on an additional time component, which is based on the frequency of traveling along the section through the first transport subnetwork. However, although the crossing time data for these sections are based on the additional time component, the crossing time data indicates the overall crossing time, which is indicated in the same manner as the crossing time data associated with other sections that are not based on the additional time component. Therefore, the crossing time data associated with any one of the sections of the multimodal network may be treated in the same manner by the route planning engine. The route planning engine will operate using the overall crossing time data associated with the section (regardless of how it may be derived). The present invention recognizes that by adjusting the transit time data for a road segment that forms part of a transport subnetwork (where travel is time-constrained) (i.e., including an extra time penalty), the road segment can be provided with appropriate overall transit time data, which enables the road segment to be considered together with the road segments of the second transport subnetwork when determining a route through a multimodal transport network, but so that the road segment can be penalized as appropriate depending on the frequency at which travel along the road segment is permitted. Lower frequencies will tend to be associated with longer expected waiting times for the road segment. Associating such road segments with larger extra time penalties (indicating longer expected waiting times) can cause the road segment to be treated less favorably by a route planning engine (as is often the case with conventional road route planning applications). Since the penalty is incorporated into the transit time data associated with the road segment of the subnetwork, the route planning engine can operate according to any conventional technique to determine a route based on transit time (taking into account road segments of different types of subnetworks constituting the multimodal network) and does not require access to detailed scheduling information for the first subnetwork. The route planning engine does not need to distinguish between road segments of different subnetworks constituting the multimodal network. This enables true multimodal route planning to be performed with the ability of the route planning engine to explore all segments of the multimodal network together. This can be performed without modifying conventional route planning engines (such as automotive route planning engines) that determine routes based on traversal times associated with segments of the network.
[0032] At least some of the road segments indicating the first transport subnetwork are associated with additional frequency-based time-based transit time data. Only a subset of the road segments indicating the first transport subnetwork may be associated with additional frequency-based time-based transit time data. The road segments (e.g., the road segments of the subset) preferably include (or are) those road segments of a subnetwork that are associated with (e.g., extend from) an exchange point with a second transport subnetwork (e.g., with a road segment of the second transport subnetwork). The road segment may be an entry or exit road segment at an exchange point. An exchange point may be referred to as a transfer point between the first and second subnetworks. An exchange point may correspond to a node (e.g., a station) of the first transport subnetwork. Thus, a road segment of the first transport subnetwork associated with an exchange point may be an entry or exit road segment of the first transport subnetwork at a node that also has an entry or exit road segment that is part of the second transport subnetwork. This enables the frequency-based component of the transit time to be considered only for those road segments where a user may expect to wait for travel (i.e., when changing from the second subnetwork).
[0033] As used herein, the transit time on which the crossing time for a segment is based refers to the expected time taken to travel from one end to the other along the segment (i.e., the travel time for the segment). The transit time may be an approximation of the transit time for the segment. For example, variations according to the time of day may be ignored, or for segments of a first sub-network, the precise timing according to a schedule or the exact driving employed may be ignored. The transit time data enables one or more multimodal routes through the transportation network to be obtained through route searching. However, as discussed below, once one or more routes have been obtained, detailed timing data for the routes may be obtained (e.g., with reference to data indicating the scheduling for the sub-network (e.g., accurate schedule data) that may be obtained from a third-party route planning scheme).
[0034] The frequency at which travel along the road segment of the first transport subnetwork may occur may be defined by the dispatching and controlling of transport along the road segment. The frequency may be the frequency at which transport travel along the road segment is performed.
[0035] It will be appreciated that there may be traffic with different frequencies and / or transit times that travel along the same path within the first transportation subnetwork. For example, when traveling from A to B, there may be more frequent traffic that stops at various intermediate points C, D, and E, or less frequent express traffic that travels from A to B without stopping. This can be accounted for in various ways. It is envisioned that the first subnetwork may be represented using multiple groups of road segments representing different traffic. For example, with respect to stopped traffic, there may be road segments extending from A to C, from C to D, from D to E, and from E to B, each road segment being associated with a transit time based on an appropriate transit time, and for at least those road segments associated with an exchange point with a second subnetwork, each road segment is associated with a frequency of stopped traffic. With respect to express traffic, there may be a single road segment extending from A to B (which may be defined as a group of road segments extending from A to B), which is associated with a transit time based on a transit time from A to B and a traffic frequency when express traffic is used.
[0036] The crossing time associated with at least some of the road segments of the first transport subnetwork is based on the transit time for the road segment and an additional frequency-based time. This is because, since the ability to travel along the road segment is subject to (for example) scheduling constraints, the time actually spent traveling along the road segment as part of the route can be measured by the sum of the transit time for the road segment (i.e., the time used to travel from one end to the other end) and the expected waiting time (i.e., for driving along the road segment) (which will depend on the frequency). It has been found that the frequency (i.e., the driving frequency) of traveling along the road segment of the first subnetwork may be used to provide an approximation of the waiting time. For example, if the driving frequency is 5 times an hour, it can be assumed that there will be a driving every 12 minutes. This can be used to provide an approximate waiting time. For example, in a simple case, the interval between driving can be simply halved to give an approximation of the average waiting time. For the example of a driving frequency of 5 times per hour, it can be assumed that there is an average waiting time of 6 minutes, trying to capture the variation of the waiting time that may actually be experienced, depending on the exact arrival time. Of course, more complex methods may be used to estimate frequency-based waiting times. However, it has been found that only an approximate indication of the frequencies required to implement one or more multimodal routes can be obtained. As discussed in more detail below, once a final candidate list of possible routes has been obtained, individual routes may be considered in more detail (e.g., using a route planning scheme designed for use only with the first transportation network and utilizing data indicative of a schedule for the first transportation subnetwork) to obtain exact travel frequencies.
[0037] Therefore, it is preferred that an additional time indication of the expected waiting time is based on the frequency with which travel along the road segment may occur. The expected waiting time is the expected waiting before travel along the road segment may begin. This may be the waiting time for driving along the road segment (e.g. at an exchange with a second network associated with the road segment). Preferably, the expected waiting time is obtained based on the inverse of the frequency with which travel along the road segment may occur.
[0038] In an embodiment, a transit time associated with a segment of a first transportation subnetwork that is associated with (e.g., extends from) an interchange point with a segment of a second subnetwork of the multimodal network is associated with a transit time that includes an additional frequency-based time. This enables easier exploration of routes through the multimodal network with reference to the transit time for the route. The transit time for a route that includes an interchange between the subnetworks may more appropriately reflect the actual transit time for the route (by taking into account the expected waiting time at the interchange).
[0039] It is envisioned that the crossing time for a road segment may be time-dependent. In the case where the crossing time is based on the transit time for the road segment and the additional time (which is based on the frequency of travel along the road segment that may occur), the time dependency may be caused by the time dependency of one or both of the transit time and the additional time based on the frequency. At least the additional time based on the frequency may be time-dependent. This is because the frequency of travel along the road segment that may occur may change throughout the day (e.g., there may be more frequent driving at a busier time of the day). The crossing time for other road segments (e.g., a road network) of a multimodal network (e.g., associated with its second subnetwork) may also be time-dependent. This may achieve changes in the expected crossing time due to the changing traffic conditions that will be taken into account. This may be similar to the technology used in conventional route planning methods (i.e., about a single mode of transportation) (e.g., route planning through a road network), where a time-dependent crossing time may be used. In any embodiment where the crossing time is time-dependent, the time may be dependent on the time of day and / or the day of the week. The or each road segment associated with time-dependent transit time data may be associated with multiple transit times for different time periods (e.g., time of day and / or day of week). An appropriate transit time may then be selected for use in the route generation process based on the current time or time at which travel is expected to occur. However, since it has been discovered that one or more multimodal routes may be generated based on transit time data that is approximate in nature, wherein a more detailed consideration of a limited number of discovered routes is then implemented, for example, with reference to data indicative of a schedule for a transport subnetwork (e.g., using a third party route planning scheme), it is not necessary that precise transit times be associated with road segments (at least for road segments of the first subnetwork) and it is merely optional that the data is time-dependent.
[0040] Each road segment of the multimodal network is associated with a crossing time. However, not every road segment is associated with a crossing time that is based at least in part on an extra time (which is based on the frequency at which travel along the road segment may occur). In an embodiment, only at least some road segments of the first transport subnetwork (e.g., those road segments extending from an exchange point with the second subnetwork) are associated with a crossing time that is based at least in part on the extra time. In an embodiment, at least some road segments of the road segments of the first transport subnetwork (e.g., those road segments that do not extend from an exchange point with the second subnetwork) are not associated with a crossing time that is based at least in part on the extra time (which is based on frequency). In an embodiment, road segments of the multimodal network that do not form part of the first transport subnetwork are not associated with a crossing time that is based at least in part on the extra time (which is based on frequency). Such road segments may be (or include) road segments of a second transport subnetwork of the multimodal network. In an embodiment, road segments of the second subnetwork of the multimodal network are not associated with a crossing time that is based at least in part on the extra time (which is based on frequency). Those road segments (of whichever sub-network) that are not associated with a transit time based on transit time and additional frequency-based time may be associated with a transit time based on transit time (preferably only transit time). Preferably, the road segments of the second sub-network are associated with a transit time based on transit time (preferably only transit time).
[0041] The transit time based on the transit time may be determined in any manner known in the art. For a segment of the second subnetwork (e.g., a private or road network) through which travel can occur substantially freely, the transit time may be an attribute of the segment associated with digital map data indicating the segment. It is customary to associate segments of the road network with transit time data in the form of transit time data to enable route generation. For segments of the first transport subnetwork, a transit time based on the transit time (whether used alone or in conjunction with an additional frequency-based component) may be obtained for the segment based on the expected travel time along the segment as described above. This may be an approximation of the expected travel time (e.g., without regard to the exact timing according to the timetable).
[0042] According to the present invention, a route search is performed between a starting point and a destination within a multimodal transport network using transit time data associated with a road segment of the network in order to obtain one or more multimodal routes through the transport network. This step can be implemented using any route search algorithm known in the art, such as a route search algorithm for use with a car route planned through a road network (e.g., a shortest path search algorithm based on a Dijkstra algorithm). Such search algorithms typically consider at least the transit time associated with a road segment of the road network and optionally other factors. By associating transit time data with each of the road segments of the multimodal network, regardless of the type of subnetwork to which the road segment belongs, the road segment can be treated in the same manner and the route can be obtained in the same manner as a route through a conventional single mode transport network (e.g., a road network). The route algorithm will only consider the overall transit time associated with the road segment (whether or not it is based on additional frequency-based time). The route search considers the transit time data associated with those road segments considered for route planning purposes. Such road segments may be a subset of the road segments of the multimodal network (e.g., based on the starting point and / or destination).
[0043] The method extends to the step of representing a section of a multimodal network as described herein such that the section is associated with transit time data. This can be achieved by accessing appropriate data. The method also extends to the step of forming data representing the multimodal network. The transit time data can be obtained in any suitable manner. The transit time data for the sections of the first sub-network can be obtained from a third party source (owner or operator of the public transportation network). The data for the sections of the second sub-network can be obtained from digital map data used for route planning.
[0044] The starting point and destination may be obtained in any suitable manner. In some embodiments, the starting point and / or destination are input by the user. In other embodiments, one or both of the starting point and destination may be inferred by the system. For example, this may be implemented with reference to the user's current location and / or frequently traveled routes.
[0045] In some preferred embodiments, the route search takes into account one or more exchange point preferences. These are taken into account in addition to the transit time data. Since each route obtained in the route search is a multimodal route, the route will include at least one exchange point between the first and second transport subnetworks. The exchange point preferences are preferably user preferences and can be input by the user. The preferences can be input by the user with respect to a specific route search (e.g., with a starting point and a destination) or the preferences can be pre-set preferences set by the user in advance and then used for any route search performed. The exchange point preferences can indicate preferences about the type of exchange point, the location of the exchange point, the nature of the exchange point, etc. Any combination of such preferences can be used. For example, the preference can specify that the exchange point is within a given distance of the starting point, the destination, or the user's home and / or that the exchange point has a parking space supply. In this way, by providing appropriate preferences about the exchange point, the user can attempt to obtain a route that involves a change from, for example, a road to a public transport network (closer to home or alternatively closer to the destination, such as on the outskirts of a city).
[0046] It will be appreciated that the route search algorithm may take such preferences into account in any suitable manner. For example, the algorithm may explore the multimodal transportation network and when an exchange point (i.e., a node where there is an incoming or outgoing segment belonging to both the first and second transportation subnetworks) is encountered, determine whether the exchange point satisfies the criteria provided by one or more preferences. If the exchange point is not according to the preferences, the algorithm may discontinue consideration of the route and continue to explore other routes. If the preferences are satisfied, the algorithm may continue to explore the particular route that includes the exchange point. In other arrangements, it is contemplated that one or more possible routes may be obtained and then the one or more possible routes may be checked to see whether an exchange point associated with a route (any route that is not ignored) satisfies any of the exchange point preferences.
[0047] In general, the method may include the step of receiving one or more exchange point preferences from a user. The preferences may be any of the types described above. These preferences may then be used in a route search or after a route search to select a route from the possible routes obtained.
[0048] Preferably, the transit time data is used to provide a cost based on the transit time for each road segment considered in the route search. The cost associated with each road segment can be considered to obtain a route through the network. In addition to the transit time, other factors can also be used to determine the overall cost for the road segment. Preferably, a shorter transit time is associated with a lower cost. It will be seen that those road segments with a transit time based on an additional frequency-related component will then be penalized relative to other road segments that do not have this additional component (for the same transit time). In an embodiment, as the frequency decreases (and therefore the expected waiting time increases), at least the penalty increases. Therefore, the time based on the frequency provides a time penalty that is inversely proportional to the frequency. The step of performing a route search using the transit time data may include using the transit time data to obtain at least the fastest route through the network between the starting point and the destination. Alternatively or in addition, the method may include obtaining at least the minimum cost route through the network between the starting point and the destination. The minimum cost route will usually correspond to the fastest route, unless other route planning preferences are applied and the route planning preferences are given a greater weight. Therefore, in an embodiment, the fastest route may correspond to the minimum cost route through the network. A cost based on the transit time associated with a route through the network may be obtained by summing the transit times associated with each segment of the network. In an embodiment, where a segment is associated with an exchange between the network, the transit time will take into account the approximate expected waiting time at the exchange by means of an additional time component included in the transit time for the segment.
[0049] As a result of the route search, one or more possible multimodal routes between the starting point and the destination are obtained. Each route involves at least two modes of transport. Each route includes at least one section of the first transport subnetwork and at least one section of the second transport subnetwork. Therefore, each route includes a portion extending through the first transport subnetwork and a portion extending through the second transport subnetwork. In a preferred embodiment, the starting point is a starting point within the second transport subnetwork and the destination is a destination within the first transport subnetwork, although the opposite arrangement is also possible. Therefore, in an embodiment, the route or each route is a route that starts in the second transport subnetwork and ends in the first transport subnetwork. Although only one possible multimodal route (e.g., the fastest route) can be obtained, in other preferred embodiments, multiple multimodal routes (e.g., the fastest route and one or more sub-fastest routes) are obtained. Preferably, only a limited set of possible multimodal routes is obtained. In some embodiments, a set (from two to five) of multimodal routes is obtained. The routes are preferably a set of fastest routes. Such routes can be obtained by ranking the obtained routes according to the crossing time. This may be done with reference to the duration and / or arrival time of the route when following a route as determined using transit time data associated with the segments of the multimodal network. The transit time data associated with the segments of the multimodal network enables one or more possible routes through the network between an origin and a destination to be obtained taking into account the transit time. However, as described above, the transit time for segments of a sub-network, in particular for forming part of a sub-network (which may only be joined, left and traveled through at specific times), may only be an approximation of the actual transit time. References to a route being the "fastest" route or the like should be understood to mean that the route is the fastest route subject to any other constraints that may be imposed on the route search process (e.g., preferences regarding exchange points).
[0050] Preferably, for the or each possible multimodal route obtained from the origin to the destination, the method comprises obtaining data indicating interchange points along the route at which there is a change between the first and second transport subnetworks (e.g. a change from the second transport subnetwork to the first transport subnetwork). Preferably, the or each route comprises only one such interchange point. It is helpful to identify interchange points between networks, which enables more detailed route planning to be carried out in relation to the portion of the route through the first subnetwork, as discussed below. This may also be useful when selecting one or several recommended routes for a user. As part of the route exploration process, the interchange points of the route may be obtained.
[0051] Once a number of possible multimodal routes have been obtained, the method may include selecting a subset of one or more of the routes to recommend to the user. A single recommended route may be selected.
[0052] In some embodiments, the method may include selecting one or more recommended routes from a plurality of possible multimodal routes obtained using data indicating an exchange point identified with respect to each route. The method may include selecting the one or more recommended routes with reference to one or more criteria (which may be user-specified) with respect to the exchange points. The criteria may be the presence of a parking space supply and / or the exchange point being within a predetermined distance of the origin, destination, or home of the user.
[0053] Alternatively or in addition, the method may include selecting one or more recommended routes from a plurality of possible multimodal routes obtained using more accurate transit time data obtained for at least a portion of the route extending through the first transportation subnetwork. The recommended route may be the fastest route. However, where other preferences are taken into account (e.g., with respect to interchange points), the recommended route may be the optimal route taking into account these preferences and transit times.
[0054] In any of its embodiments, whether or not a recommended route is obtained, the method preferably includes obtaining data indicating a more accurate transit time for each possible multimodal route obtained. The step of obtaining data indicating a more accurate transit time for the route includes obtaining data indicating a more accurate transit time for at least a portion of the route extending through the first transport subnetwork. This can be used to verify that the route is suitable and / or to enable identification of a recommended route with respect to transit times. When following the route, the data indicating a more accurate transit time may be based on an estimated arrival time, or the duration of the route. Obtaining data indicating a more accurate transit time may involve obtaining more accurate data indicating a transit time and / or a frequency-based time (e.g., an expected waiting time for a portion of the route extending through the first subnetwork). Preferably, more accurate data indicating at least a frequency-based time (e.g., an expected waiting time) is obtained.
[0055] In some embodiments, a method includes obtaining a plurality of possible multimodal routes through a multimodal transportation network between an origin and a destination using transit time data associated with road segments of the network, wherein the transit time data associated with the road segments provides an approximation of the transit time for the road segments, and obtaining a more accurate transit time for each of the plurality of possible multimodal routes.
[0056] Determining a more accurate transit time for a possible multimodal route may involve obtaining a more accurate transit time for a portion of the route that is at least defined by one or more road segments that form part of a first transportation subnetwork. This may be based on the duration of the route or an estimated arrival time when following the route. The method may include obtaining a more accurate transit time for a portion of the route based on the transit time of the route and the expected waiting time at an exchange point between a first transportation subnetwork and a second subnetwork of the multimodal network. Determining a more accurate transit time for the route may be implemented using (optionally third party) (e.g., route planning scheme) data indicating a transportation schedule for a transportation subnetwork (which may only be joined, left, and traveled through at specific times). This data may provide accurate waiting times at exchanges of the transportation subnetwork and a more accurate transit time for the route. In these embodiments, the present invention uses transit time data associated with road segments of the multimodal network (including transit time data based at least in part on the frequency with which travel along road segments of the first subnetwork may occur) to obtain a final candidate list of possible routes that may be the fastest routes. In a preferred embodiment, (third party) scheduling data is used to more accurately determine the crossing time for this limited list of routes and thus select the recommended route that can be the optimal route with respect to the crossing time. Therefore, the initial final candidate list of possible routes can be obtained by treating the multimodal network as a single network under the condition of considering the road segments forming part of the first sub-network separately and referring to accurate scheduling data (e.g., obtained from a third party, limited to the final evaluation of possible routes). This is in contrast to the prior art technology that relies on third party route planning data for sub-networks (which can only be added, left and traveled through at specific times) to obtain any route through the multimodal network containing this sub-network. According to the present invention in any one of its embodiments, alternatively or additionally, third party data can be used to obtain a more detailed journey for one or more of the possible routes. It will be understood that the scheduling data mentioned herein (e.g., data indicating the scheduling for the first transport sub-network) can be third party data (e.g., third party route planning data). The present invention provides the ability to avoid the need to rely on third party data at least in the route search process for obtaining one or more possible multimodal routes.
[0057] In a preferred embodiment, as discussed above, for each possible route, the method includes obtaining data indicating an exchange point at which an exchange between the first and second subnetworks exists ("exchange data"). The method may include using the exchange data to obtain a more accurate transit time for at least the portion of the route through the first transport subnetwork. The more accurate transit time data preferably includes a more accurate transit time for traveling along the portion of the route and a more accurate expected waiting time at the exchange point. The exchange data may be used to interrogate the scheduling data to provide more accurate transit time data. For example, data indicating an exchange point and a destination may be used to interrogate the scheduling data to obtain more accurate data about the transit time (e.g., duration and / or estimated arrival time) for the portion of the route through the first subnetwork. Of course, depending on whether the portion of the route through the first transport subnetwork occurs at the destination or origin end of the multimodal route or in between, the exchange data may be used together with the origin rather than the destination, or indeed data indicating another exchange, to interrogate the scheduling data.
[0058] In the event that a more accurate transit time for a route is found to be significantly different from a previously obtained approximate transit time, at least the possible route may be discarded. The route search process may be performed again in a manner to avoid the route. Thus, determining a more accurate transit time may enable the discarding of an inappropriate route.
[0059] Preferably, the more accurate transit time for each possible route is used to obtain one or more recommended routes, for example, for output to a user.
[0060] Preferably, the or each possible route obtained comprises only a single exchange point at which there is a change between the first and second sub-networks. In some preferred embodiments, the multimodal route comprises a first portion extending from the origin to the exchange point and a second portion extending from the exchange point to the destination, wherein one of the first and second portions extends through the first transport sub-network and the other of the first and second portions extends through the second transport sub-network.
[0061] The method may include the step of outputting data indicating at least one of the one or more possible multimodal routes to a user. The route or each route is preferably a recommended route. The step of outputting data indicating at least one of the routes preferably includes outputting data indicating an exchange point of the route. Alternatively or in addition, for at least one of the one or more possible multimodal routes generated, the method may include outputting data indicating a journey for the route to the user. The method may include generating a set of navigation instructions indicating at least a portion of the route or each route extending through a second subnetwork (e.g., a road network). The method may include providing to the user scheduling data indicating a schedule for a portion of the route extending through the first subnetwork. The scheduling data may indicate a suggested departure time and a duration of travel along a portion of the route. Alternatively or in addition, the method may include storing data indicating one or more possible multimodal routes.
[0062] According to the invention in any of its embodiments, the second sub-network is preferably a road network and the portion of the route through the second sub-network is preferably a road route to be driven by the user.The exchange point is preferably a point at which the user will transfer between car travel and public transport.
[0063] It will be appreciated that reference to determining data indicative of a crossing time for a route may relate to, for example, determining a transit time or estimated arrival time for a route based on a departure time (such as the current time or a specified time).
[0064] In general, the system of the present invention in any of its embodiments may be at least one processing device. The processing device or processing device may be a device of a mobile device (such as a navigation device, whether a portable (or personal) navigation device (PND) or an integrated device) or a device of a server.
[0065] The method of the present invention may be implemented by a server or client device (e.g., a navigation device). However, it will be appreciated that, although the method may be implemented by a device having navigation functionality, the method may also be implemented by any suitable system having route generation capability but not necessarily navigation functionality. For example, the method may be implemented by a computer system (e.g., a desktop or laptop system) that does not have navigation functionality. One or more multimodal routes may be presented to the user, which may then be printed or otherwise used to assist in route selection at a subsequent time or, for example, the route may be stored for future use (e.g., downloaded to a navigation device). In some embodiments, the method of the present invention in any one of its aspects or embodiments is implemented using a navigation device, and the present invention extends to a navigation device that is arranged to implement the steps of the method of any one of the aspects or embodiments of the present invention. The navigation device may be a PND or an integrated (e.g., in-vehicle) device. The device is preferably a device associated with a vehicle. According to any of the aspects or embodiments of the present invention, a navigation device may include a display for displaying an electronic map to a user, a set of one or more processors configured to access digital map data and cause the electronic map to be displayed to the user via the display, and a user interface operable by the user to enable the user to interact with the device. Therefore, the system of the present invention may be a system of processing devices such as a navigation device.
[0066] In embodiments where data indicative of at least one of the obtained multimodal routes is output to the user, this may be implemented at least in part by a navigation device associated with the user's vehicle. The navigation device may output data indicative of at least a portion of the route through the second subnetwork. Alternatively or in addition, the method may include the step of transmitting data indicative of an exchange point along the route and a starting point or destination of the route to a third party to enable third-party scheduling data indicative of a portion of the route extending between the exchange point and the starting point or destination through the first subnetwork to be provided to the user (e.g., via the user's mobile device).
[0067] In other embodiments, the method of the present invention in any of its aspects or embodiments may be implemented by a server, and the present invention extends to a server arranged to implement the steps of the method of any of its aspects or embodiments. The system of the present invention in any of its aspects or embodiments may be a system of processing devices such as a server.
[0068] Of course, the steps of the method of the present invention in any of its aspects or embodiments may be implemented in part by a server and in part by a client device (e.g., a navigation device or other mobile device). For example, route generation may be implemented by a server (e.g., at the request of a navigation device) and provided to the device for output to a user. The steps of the method may be performed exclusively on the server or in any combination with some performed on the server and others performed on the navigation device or performed exclusively on the navigation device. Therefore, the system of the present invention may be provided in part by a navigation device or other mobile device and in part by a server.
[0069] In an embodiment, data representing a multimodal network may be stored as digital map data, incorporating transit time data. A device executing the method may then access the data in order to implement the steps of the invention. The data may be stored by the device or may be stored remotely from the device, thereby permitting access by the device.
[0070] The use of transit time data in the form described herein, including additional frequency-based components for segments of sub-networks of a multimodal network that may be joined, left and traveled through by users only at specific times, is believed to be advantageous in itself. The present invention extends to data products storing such data and methods of forming such data products.
[0071] According to another aspect of the present invention, there is provided a data product storing digital map data representing a multimodal transport network using a plurality of road segments, each road segment indicating a navigable road segment of the network, and each road segment having data associated therewith indicating a traversal time for the road segment, wherein the plurality of road segments representing the multimodal transport network comprises:
[0072] a first subset of road segments indicating a first transportation sub-network of the multimodal transportation network, the first transportation sub-network being a network that can be joined, left, and traveled through by users only at specific times; and
[0073] a second subset of road segments indicating a second transportation subnetwork of the multimodal transportation network, the second transportation subnetwork being a network that can be joined, left, and traveled through by a user at substantially any time,
[0074] The crossing time data associated with at least some of the first subset of navigable road segments of the first transport subnetwork of the multimodal transportation network indicating the plurality of road segments is based on a transit time indicating a time taken to travel along the road segments and an additional time based on a frequency with which travel along the road segments occurs.
[0075] According to another aspect of the present invention, there is provided a method of forming a data product storing digital map data representing a multimodal transport network, the method comprising representing the multimodal transport network using a plurality of road segments, each road segment indicating a navigable road segment of the network, and each road segment having data associated therewith indicating a traversal time for the road segment, wherein the plurality of road segments representing the multimodal transport network comprises:
[0076] a first subset of road segments indicating a first transportation sub-network of the multimodal transportation network, the first transportation sub-network being a network that can be joined, left, and traveled through by users only at specific times; and
[0077] a second subset of road segments indicating a second transportation sub-network of the multimodal transportation network, the second transportation sub-network being a network that can be freely joined, left and traveled through by users at any time,
[0078] The crossing time data associated with at least some of the first subset of the plurality of road segments indicating navigable road segments of the first transportation subnetwork of the multimodal transportation network is based on a transit time indicating a time taken to travel along the road segments and an additional time based on a frequency with which travel along the road segments occurs.
[0079] The data product may further include data indicating one or more points at which an exchange between the first and second transport subnetworks may occur, wherein each exchange point corresponds to a node of the multimodal transport network at which there is at least one incoming or outgoing segment of the first transport subnetwork and at least one incoming or outgoing segment of the second transport subnetwork.
[0080] The data product in any of these other aspects or embodiments of the invention may have any suitable form. In some embodiments, the data product may be stored on a computer readable medium. The computer readable medium may be, for example, a floppy disk, a CD ROM, a ROM, a RAM, a flash memory, or a hard disk. The invention extends to a computer readable medium comprising a data product according to the invention in any of its aspects or embodiments.
[0081] It will be appreciated that the method according to the present invention in any of its aspects or embodiments may be implemented at least in part using software. It will therefore be seen that when viewed from other aspects, the present invention extends to a computer program product comprising computer-readable instructions, which are suitable for implementing any or all of the methods described herein when executed on a suitable data processing component. The present invention also extends to a computer software carrier comprising this software. This software carrier may be a physical (or non-transitory) storage medium or may be a signal (e.g., an electronic signal via a wire, an optical signal, or a radio signal (e.g., to a satellite or the like)).
[0082] The present invention according to any of its other aspects or embodiments may include any of the features described with reference to the other aspects or embodiments of the present invention, as long as they are not mutually contradictory.
[0083] Advantages of these embodiments are set out below, and further details and features of each of these embodiments are defined in the accompanying dependent claims and elsewhere in the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS
[0084] Some preferred embodiments of the present invention will now be described, by way of example only, and with reference to the accompanying drawings, in which:
[0085] Figure 1 is a flow chart illustrating the steps of a method for performing route planning in a multimodal transportation network according to one embodiment of the present invention;
[0086] Figure 2 indicating possible multimodal routes between an origin and a destination in a multimodal transportation network and interchange points between subnetworks associated with the routes;
[0087] Figure 3 Graphic instructions and Figure 2 The crossing time data associated with the route indicated in;
[0088] Figure 4 Indicates the time determined using the transit time data Figure 3 The fastest route among the possible routes;
[0089] Figure 5 illustrating a more accurate transit time for a determined fastest route based on accurate scheduling data (e.g., based on use of a third party route planning solution);
[0090] Figure 6 illustrates an exemplary multimodal route through a multimodal transportation network, where a user intends to travel from his or her home by car and reach the center of the city by public transportation using a transfer point on the outskirts of the city (i.e., close to the destination); and
[0091] Figure 7 Another exemplary multimodal route through a multimodal transportation network is illustrated, where a user intends to travel from his home by car and reach a city center by public transportation using a transfer point close to his home. DETAILED DESCRIPTION
[0092] The present invention will be described with reference to a multimodal transportation network comprising a first subnetwork in the form of a public transportation network and a second subnetwork in the form of a road network for use by users traveling in private vehicles (e.g., cars). The public transportation network will be exemplified as a train network, although it will be appreciated that the present invention is applicable to any type of public transportation permitting travel via one or more modes. The times of joining, leaving, and traveling through the first subnetwork are subject to scheduled travel constraints through the network. In contrast, users are free to join, leave, or travel through the road network at essentially any time of their choosing. It will be appreciated that the techniques of the present invention are equally applicable to other instances of subnetworks of a multimodal transportation network, including a first subnetwork in which the times of joining, leaving, and traveling through the network are constrained to specific times and a second subnetwork in which such times are unconstrained (in which users are able to travel freely through the network). Reference will now be made to Figure 1 The steps of a method according to the invention for obtaining a multimodal route through a multimodal transportation network are described.
[0093] according to Figure 1 In step 1 of the invention, a multimodal transport network is represented by digital map data indicating a plurality of road segments indicating road segments of the network. The road segments represent real-life road segments of the network extending between nodes of the network. Each road segment is associated with data indicating the sub-network to which it belongs (i.e., the train network or the road network) and is also associated with transit time data.
[0094] It will be appreciated that the steps of the method may be implemented by a server or a mobile device (e.g., a navigation device), or may be implemented by a device having route planning functionality but not necessarily navigation functionality (e.g., a route planning solution implemented via any type of device). The steps of the method may be implemented by a combination of different devices. The device executing the method may have access to data indicating a plurality of road segments constituting a multimodal network, and may store this data.
[0095] The crossing time data associated with a road segment of a road network indicates the transit time for traveling from one end to the other end along the respective road segment. This crossing time data is usually provided as part of the digital map data used for the route planning process. The crossing time for a road segment indicates the expected time for crossing the road segment. The crossing time data may be time-dependent. For example, each road segment may be associated with a set of crossing times that may be applicable to different time slots (e.g., at different times of the day and different days of the week). In some arrangements, crossing time data for 10-minute time slots throughout the day are provided for each day of the week.
[0096] The transit time data associated with some sections in the section of the train network is based on the data indicating the approximate transit time for the section and the extra time, and the extra time is based on the frequency of traveling along the section that may occur. The section with this type of transit time data is those sections of the train network extending from the exchange point with the road network. The exchange point with the road network corresponds to the node of the train network, wherein there is also an entry or exit section of the road network. This exchange point can be a station of the train network. The approximate transit time indicates the approximate time for traveling from one end of the section to the other end. It has been found that this transit time does not need to be accurate. Although the transit time can vary to a certain extent throughout the day (for example, due to relatively fast or slower driving), it has been found that it is sufficient to use an approximate value of the transit time for the purpose of the present invention. Similarly, the extra time based on frequency can be based on an approximate value of the driving frequency. This enables the implementation of initial route planning without reference to the specific scheduling of driving along the section (for example, third-party scheduling). The additional time based on frequency indicates the expected waiting time for driving along the road section when changing from the road network to the train network. For example, when the driving frequency is 5 times per hour, the interval between trains will be 12 minutes. This interval can be used to obtain the expected waiting time. In a simple case, the expected waiting time can be provided by halving the interval between trains, thereby giving (in this example) an expected waiting time of 6 minutes. This reflects that the waiting time will change between about zero minutes and 12 minutes, which depends on the time of arrival at the exchange point relative to the departure time of the previous driving. Of course, more complex techniques can be used to obtain the expected waiting time based on the driving frequency. It will be seen that the additional frequency-based component of the crossing time (that is, the expected waiting time) acts as a time penalty, so that the road section associated with a longer waiting time will have a higher overall crossing time associated with it (for the same crossing time). When performing route planning by the network, this acts as a penalty (depending on the amount of the waiting time to a certain extent) that makes the road section less favorable, as described below.
[0097] Other sections of the train network that are not associated with an exchange point may be associated with a transit time based solely on transit time (in a similar manner to sections of the road network). Transit time based transit times may be based on an approximation of the transit time (in the manner already described with respect to those sections that have transit times based on both transit time and additional frequency based times).
[0098] In step 3 of the method, an indication of a starting point and a destination in a multimodal network is received. The starting point and / or the destination may be specified by a user. However, in other arrangements, it is contemplated that one or both of the starting point and the destination may be inferred by the user, for example by taking into account the user's current location and the routes typically travelled by the user at relevant times of the day.
[0099] In step 5, a group of multiple possible routes between the starting point and the destination through a multi-mode network that crosses both the train and road networks is determined. The number of generated routes can be selected as needed. However, the number of routes should be limited, thereby forming a final candidate list of routes. This minimizes the amount of subsequent processing required to obtain the recommended route. For example, 2 to 5 routes can be generated. The route is generated using a route planning algorithm that considers the crossing time of the sections used for the network and is preferably used to minimize the total travel time for the route between the starting point and the destination. Although some sections are associated with crossing times based on both transit time and additional frequency-based time, and other sections are associated with crossing times based only on transit time, for a route planning algorithm related only to the overall crossing time associated with the sections, the two sections will appear to be the same. This makes it possible to treat the sections of the train network and the road network in the same way, so that the route planning algorithm can generate a route that considers the crossing time of the multi-mode network as a whole. It is not necessary to use different route planning algorithms for trains and road networks. A route is generated by assigning each section that is considered to be based on the cost of the crossing time. Higher traversal times will be associated with higher costs. In this way, a minimum cost route (and if desired, one or more sub-minimum cost routes) can be identified between an origin and a destination, which will correspond to the fastest route and a given number of sub-fastest routes. Obtaining the set of possible routes can therefore be carried out in the same manner as when obtaining routes through a road network in a conventional manner.
[0100] In at least a preferred embodiment, the route search used to obtain the set of possible routes takes into account one or more user preferences regarding interchange points. Each multimodal route obtained will include an interchange point between the road and train networks. The user may specify that they only wish to view routes where the interchange point meets one or more criteria, such as being close to the user's home, origin, or destination, and / or having parking provision. The route search will then take this preference into account, so that only routes with interchange points that meet the criteria are considered. Figure 6and 7 Two exemplary routes are shown in the figure.
[0101] exist Figure 6 In FIG. 6 , a user is expected to travel by car from his home 60 and reach the city center 62 by public transportation using transfer points 63, 64, 65, 66, 67 on the outskirts of the city (thereby avoiding the need for the user to travel into the city center by car). Figure 6 The fastest multimodal route is via junction 65.
[0102] exist Figure 7 In FIG. 7 , the user again intends to depart from his home 70 and reach the city center 72 by public transportation using transfer points 73 , 74 , 75 , 76 close to his home. Figure 7 The fastest multimodal route in is via transfer point 74.
[0103] In step 7, an exchange point is identified for each of the possible routes, the exchange point being a point at which there is a transfer between the train and the road network. For ease of explanation, reference will be made to the situation where the starting point is in the road network and the destination is in the train network, so that the transfer is from the road network to the train network. This would be, for example, the situation where a user wishes to travel from home to a city center for work, the user drives to a suitable station (i.e., an exchange point) and stops there before proceeding by train for the remainder of the route to the city center. Each route consists of a first portion from the starting point through the road network to the exchange point and a second portion from the exchange point through the train network to the destination. Although the transit time for the first portion of the route through the road network may be fairly accurate based on transit time data in digital map data commonly used for route planning purposes, the transit time used to provide the transit time for the sections of the train network and the frequencies used to provide additional time penalties where applicable are based on approximate values.
[0104] In step 9, a more accurate transit time is obtained for each possible route. This is achieved by obtaining a more accurate transit time for the second portion of the route (by interrogating the scheduling data for the train network (e.g., third party route plan data) using the interchange point) and an estimated time of arrival at the interchange point (known from the plan of the first portion of the route through the road network). This may enable identification of appropriate driving for the second portion of the route, and obtaining more detailed journey information and an estimated time of arrival at the destination. Obtaining more accurate data about the second portion of the route (and therefore timing information for the route as a whole) in this way with reference to accurate scheduling data is merely an optional feature. Where a more accurate transit time for a possible route is obtained in this way, the fastest route based on the more accurate timing may be identified and used as the recommended route. It is envisaged that if the more accurate transit time for a possible route differs significantly from the transit time that has been estimated using the approximate transit time data (e.g., if the difference exceeds a certain threshold), then the route may be ignored. The route generation process of step 5 may be repeated, subject to time constraints to avoid particular routes.
[0105] In step 11, a recommended route is selected from a plurality of possible routes. This can be done in several ways. The route may be the fastest route established using approximate transit time data, or in embodiments where a more accurate transit time is obtained for the route, the route may be the fastest route determined based on the more accurate transit time data.
[0106] In step 13, the recommended route is output to the user. A set of navigation instructions is obtained for a first portion of the route through the road network, which can be output to the user via a navigation device associated with the user's car. Once the user arrives at the interchange point, the destination can be provided to a third party route planning application to enable guidance for the portion of the route through the train network to be provided to the user via a third party user provided mobile device application.
[0107] In an embodiment, the route to be followed and / or the set of navigation instructions may be obtained by or shared between two or more navigation devices; one navigation device may be embedded in a vehicle and the other navigation device may be a mobile device (and therefore may be used while traveling on a public transportation network).
[0108] Now refer to Figures 2 to 5 Some of the steps of this method are illustrated in more detail.
[0109] Figure 2 The diagram illustrates a multimodal transportation network including first and second networks (ie, train and road networks) in an area of interest. Figure 2The diagram illustrates several possible routes that have been identified between a starting point 20 (in this case, the user's home) and a destination 22 (in the center of Amsterdam). These routes are Figure 1 The result of the initial route generation process described in step 5 of . Each route includes a first portion through the road network from the starting point to the exchange point (i.e., the station) and a second portion from the exchange point to the destination. In this example, the user has specified that he is interested in routes associated with exchange points that are within a predetermined distance of his home and have parking for his car.
[0110] Figure 3 The possible routes are illustrated in more detail. This figure illustrates the way to obtain transit time data and the way to associate the transit time data with the segments of each of the train and road networks used in generating possible routes. The transit times along the road segments (i.e., from the starting point 20 to the exchange points A, B, C and D) are illustrated as 25 minutes, 20 minutes, 20 minutes and 18 minutes respectively. These are the transit times associated with the segments of the network that form a part of the first part of the route according to the digital map data describing the network. If the portion of the route includes multiple road segments, then the transit times for each road segment will only be summed to provide the overall transit time for this portion of the route. Each of the train network segments is annotated with a transit time, such as 27 minutes and a frequency of 2x (i.e., twice an hour) for the segment from B to the destination 22. These are usually approximate values for the transit time used to travel along the segment and the frequency of driving per hour along the segment, respectively. Each of these sections of the train network extending from the interchange point is associated with data indicative of a crossing time based on a transit time and also based on an expected waiting time (which is based on the frequency of travel).
[0111] Figure 4 Graphical instructions Figure 3 As can be seen, the fastest route among the possible routes based on this approximate transit time data is the route via exchange station D. The transit time from home to the station via the road network is 18 minutes. Next, the approximate transit time to the destination by train is 30 minutes. Since the frequency of this route is 5 times an hour, the approximate expected waiting time is calculated to be 6 minutes. This gives a total estimated transit time of 54 minutes. Of course, in the case where more than one section of the train network is included in the route, the transit time for each section can be summed to obtain the overall transit time. The transit time will be based on the transit time and not on the expected waiting time for subsequent sections along the route, and is not associated with the exchange point.
[0112] As discussed above, estimated travel times based on traversal times associated with road segments are only approximate. Figure 5The diagram illustrates the results of querying a third party route plan using exchange site D to determine a more accurate transit time for the applicable departure time. The transit time for the car portion of the route remains at 18 minutes. However, it was found that the actual waiting time was 4 minutes instead of the estimated 6 minutes. The transit time for the train trip remains at 30 minutes, giving a total transit time of 52 minutes for the route instead of the estimated 54 minutes. Since this is not significantly different, and is actually slightly faster than the estimated value, this route can be considered the recommended route.
[0113] Navigation instructions may be provided to the driver via the onboard navigation device for the portion of the route from the starting point to the interchange point or a car park associated therewith. Navigation instructions may be provided to guide the user to walk from the car park to the station if desired. The destination may be provided to a third party route planning application (or 'app') for the train network when the user arrives at the interchange station to enable guidance to be provided for the portion of the journey through the public transport train network.
[0114] Figure 6 The diagram illustrates another scenario in which the present invention may be useful. Here, a recommended route is shown from a starting point 60 to a destination 62 in the city center via an exchange station 65 on the outskirts of a town. This route may be obtained as a result of a route search in which a user has specified that they are interested in exchange points within a predetermined distance of the destination. The first part of this route from the starting point to the exchange station is via a road network, with the continuation from the exchange station being via a train network. Several other possible exchange stations 63, 64, 66 and 67 are also shown. Figures 1 to 5 The described approach selects a recommended route from among several possible multimodal routes from an origin to a destination via each of these alternative exchange sites.
[0115] Of course, the principles of the invention are equally applicable to situations where the first part of the journey from a starting point is via a public transport network, with a subsequent interchange to a road network (for continuing the journey to the destination) or to a more complex multimodal route (involving more than one interchange between transport modes).
[0116] It will be seen that according to certain aspects and embodiments of the present invention, using the transit points and transit point connectivity data, a determination is made of favorable transit points for changing from car to public transportation, along with an approximate estimated travel time to the final destination. The transit points and destination are delivered to a third party public transportation route planner to determine the exact public transportation route. The results are combined with the driving route to determine the total estimated travel time.
[0117] To perform multimodal route planning (e.g., a combination of car routing on a road network and public transport (PT) routing), it is necessary to select the optimal transfer point from one mode of transport (e.g., car) to another mode of transport (e.g., public transport). The selection of this transfer point requires performing optimal route planning for all modes of transport involved.
[0118] However, automobile routing and PT routing algorithms are often mathematically different, thereby causing complications in forming a true multi-modal routing plan.
[0119] Thus, at least in embodiments of the present invention, cost values are determined and assigned to branches of a PT network so that the PT network can be mathematically explored in the same manner as a road network. For example, line frequencies on a PT network can be used to calculate expected waiting and transfer times. With these calculated times, it is possible to assign travel time values to all branches in the PT network. In some embodiments, the travel time values may be time dependent.
[0120] The optimal route to the final destination can then be calculated using the PT network, resulting in transfer points, an "approximate" itinerary for the PT portion of the trip, and an approximate estimated travel time (ETT). As will be appreciated, the itinerary will not include actual arrival and departure times for the PT network at this stage.
[0121] The calculated transfer points from one mode of transportation to another (in the case of a car to a PT) and the final destination can then be used to query a third party for the "actual" PT journey.
[0122] Optionally, a check may be performed to determine whether the travel time of the actual PT journey is substantially the same as the approximate PT journey determined in the route planning calculation. If the difference between the two journeys is greater than a predetermined threshold (e.g., the actual journey is substantially longer than the approximate journey), then the route planning calculation is performed again but selection of the previously selected transfer point is prohibited.
[0123] Once a route has been determined, a navigation device within the vehicle can be used to guide the user from their home to a selected junction using the road network. Once at the junction, the user can access the PT journey from a mobile device (e.g., a smartphone).
[0124] Any of the methods according to the present invention may be implemented at least in part using software (e.g., a computer program). Therefore, the present invention also extends to a computer program comprising computer-readable instructions that can be implemented to execute or cause a navigation device to execute a method according to any of the aspects or embodiments of the present invention. Therefore, the present invention encompasses a computer program product that causes the one or more processors to generate suitable images (or other graphical information) for display on a display screen when executed by one or more processors. The present invention accordingly extends to a computer software carrier that includes this software that causes (in conjunction with the data processing component) the device or system to implement the steps of the method of the present invention when used to operate a system or device including a data processing component. This computer software carrier may be a non-transitory physical storage medium (e.g., a ROM chip, a CD ROM, or a disk) or may be a signal (e.g., an electronic signal via a wire, an optical signal, or a radio signal (e.g., to a satellite or the like)). The present invention provides a machine-readable medium containing instructions that, when read by a machine, causes the machine to operate according to the method of any of the aspects or embodiments of the present invention.
[0125] Without explicit statement, it will be understood that the present invention in any of its aspects may include any or all of the features described with respect to other aspects or embodiments of the present invention, as long as they are not mutually exclusive. In particular, although various embodiments of operations that may be performed in a method and by an apparatus have been described, it will be understood that any one or more or all of these operations may be performed in a method and by an apparatus in any combination as desired and appropriate.
[0126] Finally, it should be noted that although the appended claims set forth particular combinations of features described herein, the scope of the present invention is not limited to the particular combinations claimed below, but extends to encompass any combination of features or embodiments disclosed herein, regardless of whether the particular combinations are specifically listed in the appended claims at this time.
Claims
1. A method of performing route planning in a multimodal transportation network represented using a plurality of road segments, each road segment indicating a navigable road segment of the network, wherein the plurality of road segments representing the multimodal transportation network comprises: a first subset of road segments indicating a first transportation subnetwork of the multimodal transportation network, the first transportation subnetwork being a network that can be joined, left, and traveled through by a user only at specific times; and a second subset of road segments indicating a second transportation subnetwork of the multimodal transportation network, the second transportation subnetwork being a network that can be joined, left, and traveled through by a user at any time, The method comprises: obtaining first approximate transit time data associated with at least some of the first subset of the plurality of road segments based on a transit time for each road segment indicating an approximate time taken to travel along the road segment and an additional time determined based on a frequency of travel along the road segment; obtaining second approximate transit time data associated with road segments of the second transportation subnetwork based on a transit time for each road segment indicating an approximate time taken to travel along the road segment; performing a route search between an origin and a destination within the multimodal transportation network to obtain one or more possible multimodal routes from the origin to the destination through the transportation network, wherein a respective total approximate transit time based on the first approximate transit time data and the second approximate transit time data is associated with each of the one or more possible multimodal routes, determining a more accurate crossing time for the one or more possible multimodal routes using data indicative of a schedule for joining, traveling on, and / or leaving the first transportation subnetwork, and In response to determining that a difference between the more accurate transit time of at least one of the one or more possible multimodal routes and the total approximate transit time of the at least one possible multimodal route exceeds a threshold, the at least one possible multimodal route is ignored. 2 . The method of claim 1 , wherein the first and second transportation sub-networks are for use by different transportation modes. The method according to claim 1 , wherein the first transport sub-network is a public transport network. The method according to claim 1 , wherein the second transport sub-network is a road network.
5. The method of claim 1 or 2, wherein each of at least some road segments of the first transport sub-network is associated with an exchange point of the second transport sub-network.
6. A method according to claim 1 or 2, wherein the additional time determined based on the frequency of traveling along the road segment indicates an expected waiting time before starting to travel along the road segment; and / or wherein the additional time determined based on the frequency of traveling along the road segment is inversely proportional to the frequency of traveling along the road segment.
7. The method according to claim 1 or 2, wherein: Performing a route search between an origin and a destination within the network using the total approximate transit time data associated with the road segment of the multimodal transportation network to obtain one or more possible multimodal routes through the transportation network from the origin to the destination includes: determining a fastest route through the multimodal network; and / or Wherein performing a route search takes into account one or more interchange point user preferences.
8. The method of claim 7, wherein the one or more exchange point user preferences include preferences regarding a location of the exchange point and / or a property of the exchange point.
9. The method of claim 7, wherein the one or more exchange point user preferences include a preference specifying that the exchange point is within a given distance of the origin, destination, or the user's home and / or that the exchange point has parking availability.
10. The method according to claim 1 or 2, comprising: Data is obtained for each of the one or more possible multimodal routes indicating an interchange point along the route at which there is a change between the first and second transportation sub-networks.
11. The method of claim 1 or 2, wherein a plurality of possible multimodal routes are obtained, the method further comprising selecting a subset of one or more multimodal routes among the plurality of possible multimodal routes obtained to recommend to the user.
12. The method of claim 11, further comprising selecting each multimodal route from the subset of the one or more multimodal routes using more accurate transit time data obtained for at least a portion of the route through the first transportation subnetwork and / or data indicating interchange points along the route at which a change between the first and second transportation subnetworks exists.
13. The method of claim 1 or 2, further comprising outputting data indicative of at least one of the one or more possible multimodal routes to a user.
14. The method of claim 11, further comprising outputting data regarding a multimodal route selected from a plurality of possible multimodal routes for recommendation to a user.
15. A system arranged to perform route planning in a multimodal transportation network represented by a plurality of road segments, each road segment indicating a navigable road segment of the network, wherein the plurality of road segments representing the multimodal transportation network comprises: a first subset of road segments indicating a first transportation sub-network of the multimodal transportation network, the first transportation sub-network being a network that can be joined, left, and traveled through by users only at specific times; and a second subset of road segments indicating a second transportation subnetwork of the multimodal transportation network, the second transportation subnetwork being a network that can be joined, left, and traveled through by a user at any time, The system includes a memory storing instructions and at least one processor, the at least one processor executing the instructions to at least perform the following operations: obtaining first approximate transit time data associated with at least some of the first subset of the plurality of road segments based on a transit time for each road segment indicating an approximate time taken to travel along the road segment and an additional time determined based on a frequency of travel along the road segment, obtaining second approximate transit time data associated with road segments of the second transportation subnetwork based on a transit time for each road segment indicating an approximate time taken to travel along the road segment; performing a route search between an origin and a destination within the multimodal transportation network to obtain one or more possible multimodal routes through the transportation network from the origin to the destination, wherein a respective total approximate transit time based on the first approximate transit time data and the second approximate transit time data is associated with each of the one or more possible multimodal routes, determining a more accurate crossing time for the one or more possible multimodal routes using data indicative of a schedule for joining, traveling on, and / or leaving the first transportation subnetwork, and In response to determining that a difference between the more accurate transit time of at least one of the one or more possible multimodal routes and the total approximate transit time of the at least one possible multimodal route exceeds a threshold, the at least one possible multimodal route is ignored.
16. The system of claim 15, wherein the at least one processor executes the instructions to further perform the method of any one of claims 2-14.
17. A computer program product comprising instructions which, when executed by at least one processor of a computing device, cause the computing device to operate according to the method of any one of claims 1 to 14.
18. A non-transitory computer readable medium having stored thereon the computer program product of claim 17.
