Methods and systems for generating parking routes

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 ...

Alternative routes

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 ...

ALTERNATIVE ROUTES

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. If so, the main route continues to be used as the main route after passing through the decision point. If not, it is determined whether the current position is on an outgoing segment associated with one of the stored alternative routes. If so, then this alternative route is used as the new main route after the decision point. If not, a new alternative route from the decision point to the destination passing along the outgoing segment on which the current position is found is generated, and used as the new main route after passing the decision point. 1. A method of determining a route taken by a user through a navigable network , the navigable network being represented by an electronic map comprising a plurality of segments representing navigable elements of the navigable network , the segments being connected by nodes , the method comprising:identifying an upcoming decision point along a main route being travelled by a user between an origin and a destination, at which decision ...

ALTERNATIVE ROUTES

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. 1. A method of generating routes through a navigable network , the navigable network being represented by an electronic map comprising a plurality of segments representing navigable elements of the navigable network , the segments being connected by nodes , the method comprising:defining a sub-network of the navigable network comprising a network of intersecting routes through the navigable network between an origin and a destination of a first origin-destination pair, the sub-network being represented by a subset of segments of the electronic map, and wherein nodes at which there are two or more outgoing segments of the subset of segments are indicative of decision points of the sub-network;generating a main route between an origin and a destination of a second origin-destination pair; andidentifying a first decision point of the sub-network to be encountered along the main route, and generating an alternative route between the decision point and the destination of the second origin-destination pair using a route generation process in which at least a first segment of the portion of the main route outgoing from the node representative of the first decision point is blocked ...

Alternative routes

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.

Methods and Systems for Generating Parking Routes

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.

DEVICE FOR ADJUSTING THE LOCATION IN THE PERIPHERAL SENSE ON ROTARY PRINTING MACHINES.

DEVICE FOR ADJUSTING THE LOCATION IN THE PERIPHERAL SENSE ON ROTARY PRINTING MACHINES.

Dans un dispositif de réglage du repérage dans le sens périphérique d'un cylindre porte-clichés (1) sur des machines à imprimer rotatives, il faut pouvoir opérer de manière simple un réglage continu et précis du repérage dans le sens périphérique, par le fait que l'extrémité du tourillon d'axe (2) du cylindre porte-clichés (1) se trouve dans une douille (8), sur laquelle une deuxième douille (9) est disposée concentriquement et reçoit sur sa périphérie une roue d'entraînement (11) à denture oblique, que la deuxième douille (9) présente sur sa surface frontale un palier à roulement (13) sur la bague intérieure duquel est monté une bielle (16) reliée à un entraînement de réglage (19; 21; 27; 32; 33; 34; 35), par l'intermédiaire d'un levier (18) monté centralement. In a device for adjusting the registration in the peripheral direction of a plate cylinder (1) on rotary printing machines, it is necessary to be able to operate in a simple way a continuous and precise adjustment of the registration in the peripheral direction, by the fact that the end of the axle journal (2) of the printing plate cylinder (1) is located in a sleeve (8), on which a second sleeve (9) is arranged concentrically and receives on its periphery a drive wheel (11) with oblique teeth, that the second bush (9) has on its front surface a rolling bearing (13) on the inner ring of which is mounted a connecting rod (16) connected to an adjustment drive (19; 21; 27 ; 32; 33; 34; 35), via a centrally mounted lever (18).

Methods and systems for generating parking routes

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.