Abstract: A method of determining a parking route for a vehicle travelling on a road network within a geographic area is disclosed. A sub-network is determined comprising a subset of segments of an electronic map that are representative of roads within a predetermined walking time or distance of a destination location. Data indicative of a walking time or distance from the segment to the destination location is associated, at least with the segments of the sub-network representing roads having at least one associated parking space. A search algorithm having an associated cost function is used to explore the segments of the sub-network from an origin location to identify a plurality of candidate parking routes, wherein the cost for a given parking route is based on the probability of the vehicle successfully finding a parking space on the parking route and the expected cumulative travel and walking time or distance to the destination location should a parking space be found along the parking route.

Abstract: A method is disclosed for determining a route taken by a user at a decision point in a navigable network in an area covered by an electronic map. The map comprises a plurality of segments representing navigable segments of the navigable network in the area covered by the electronic map. A user is travelling along a main route from an origin to a destination. An upcoming decision point is identified, and one or more alternative routes between the decision point and the destination generated. Data indicative of each route is stored in a route pool, associated with data indicative of the outgoing segment at the decision point that forms part of the route. Each route passes along a different outgoing segment, and which segments are all different to an outgoing segment included in a continuation of the main route. When the user has passed through the decision point, it is determined whether the current position of the user lies on the outgoing segment forming the continuation of the main route.

Abstract: A method of determining a parking route for a vehicle travelling on a road network within a geographic area is disclosed. A sub-network is determined comprising a subset of segments of an electronic map that are representative of roads within a predetermined walking time or distance of a destination location. Data indicative of a walking time or distance from the segment to the destination location is associated, at least with the segments of the sub-network representing roads having at least one associated parking space. A search algorithm having an associated cost function is used to explore the segments of the sub-network from an origin location to identify a plurality of candidate parking routes, wherein the cost for a given parking route is based on the probability of the vehicle successfully finding a parking space on the parking route and the expected cumulative travel and walking time or distance to the destination location should a parking space be found along the parking route.

Abstract: A method is disclosed for generating routes in an area covered by an electronic map. The map comprises a plurality of segments representing navigable segments of a navigable network in the area covered by the electronic map. A main route from an origin to a destination is generated through the network in a manner which favors segments which are segments of a predefined sub-network. When the user commences travel, the method involves identifying a first decision point along the main route being travelled that is a decision point of the sub-network. An alternative route is generated between the decision point and the destination, in a method involving favoring segments of the sub-network, and in which the outgoing segment of the main route being travelled to the first decision point is blocked.

Abstract: A method is disclosed for generating routes in an area covered by an electronic map. The map comprises a plurality of segments representing navigable segments of a navigable network in the area covered by the electronic map. A main route from an origin to a destination is generated through the network in a manner which favours segments which are segments of a predefined sub-network. When the user commences travel, the method involves identifying a first decision point along the main route being travelled that is a decision point of the sub-network. An alternative route is generated between the decision point and the destination, in a method involving favouring segments of the sub-network, and in which the outgoing segment of the main route being travelled to the first decision point is blocked.

Abstract: A method is disclosed for determining a route taken by a user at a decision point in a navigable network in an area covered by an electronic map. The map comprises a plurality of segments representing navigable segments of the navigable network in the area covered by the electronic map. A user is travelling along a main route from an origin to a destination. An upcoming decision point is identified, and one or more alternative routes between the decision point and the destination generated. Data indicative of each route is stored in a route pool, associated with data indicative of the outgoing segment at the decision point that forms part of the route. Each route passes along a different outgoing segment, and which segments are all different to an outgoing segment included in a continuation of the main route. When the user has passed through the decision point, it is determined whether the current position of the user lies on the outgoing segment forming the continuation of the main route.