Abstract: Navigation system (1) comprising a centralised server (10) having access to roadmapping data (19), and a plurality of mobile navigation modules (40), capable of communicating at least temporarily with the central server (10) to exchange data, in which the centralised server (10) comprises a navigation window generation module (14) enabling the route data to be formatted into a plurality of successive fixed windows, each corresponding to one or more route instructions and an exit detection data generation module (15), and in which the mobile navigation devices (40) comprise a route exit detection module (47), enabling the possible exits from the intended route to be detected during the movement of the mobile device.

Abstract: Navigation system (1) comprising access to roadmapping data (19), at least one microprocessor (11), at least one working memory (18), a route calculation module (13), and furthermore comprising: a navigation window generation module (14), enabling the route data to be formatted into a plurality of successive fixed windows, each corresponding to one or more route instructions; a window-changing data generation module enabling data to be generated which are capable of permitting an automatic passage from one navigation window to another; a navigation module (43), to provide the transmission to the user of the successive navigation windows; a window-changing module (47), enabling the passage from one window to another according to window-changing data.

Abstract: Method for automatically generating route maps, comprising receiving a route to be mapped (101); performing a formatting of the data of the route for arrangement on a support comprising splitting the route (103) to be mapped into a plurality of sections, each section comprising at least one entry point and one exit point; for each section, formatting a corresponding schematic representation of the portion of route in a manner isolated from the corresponding geographical map (104); formatting the sections in such a way that the entry point and/or the exit point of each section is substantially in the same sector with respect to the support on which the sections are arranged (105). Also disclosed is a corresponding system for generating route maps.

Abstract: Method for automatically generating route maps, comprising receiving a route to be mapped (101); performing a formatting of the data of the route for arrangement on a support comprising defining an orientation axis serving to orient the arrangement of the instructions on the support (202); defining at least two zones on the support (203), substantially side by side one another, aligned substantially along the orientation axis; splitting the route to be mapped into a plurality of unit sections (300); for each section, formatting the schematic representation of the manoeuvre and portion of route associated with a scale corresponding to the detected axial spacing (304) and aligning the paired route elements on each side of the orientation axis (305). Also disclosed is a corresponding system for generating route maps.

Abstract: A navigation method allowing a centralized server to supply guidance functions, in which a plurality of mobile terminals is provided with a central server and in which, following the receipt of a request from a terminal, the central server determines at least one itinerary between a given departure point and a given arrival point, defines a guidance zone making it possible to progress from this departure point to the arrival point, determines a plurality of guide points and, for each of these points, a guidance instruction, these guide points and the associated instructions being capable of allowing the user to move in the zone by receiving guidance instructions for the purpose of allowing the terminal to come gradually closer to the arrival point, the server transmits these guide points to the requesting terminal and the terminal receives the guide points.

Abstract: A method of determining routes between a point of departure(a) and a point of arrival (?) comprising the following steps: a) the nodes surrounding a departure node are scanned so as to determine the cost of each of these nodes; b) said scanning is continued until the point of arrival of the route is reached; c) during said scanning, the nodes are scanned so as to identify the nodes that can be used to form a mesh with a given starting index Id; d) when a mesh with an index Id is identified, the nodes and segments whose index is less than this index Id are eliminated; e) scanning the nodes continues so as to identify the nodes that can be used to form a new mesh, whose index Is is greater than that of the preceding mesh; f) nodes and segments whose index is less than this new index Is are eliminated; g) steps e and f are repeated until the desired elimination level is reached.

Abstract: A method for determining routes for a digital road network system on the basis of a main route connecting a starting point to a finishing point. The method makes it possible to reach a point of interest (POI) reachable by a plurality of secondary routes intersecting the main route. An optimal POI overall route is determined by performing the following steps. First, a POI overall route is evaluated for each of the potential secondary routes on the basis of at least the following route elements: (1) a useful portion of a main route and a corresponding score, the score being assigned a factor “k” lying between 0.1 and 0.7, and (2) the chosen secondary route and a corresponding score. Then, the POI overall route whose resulting score is optimal is chosen.

Abstract: A route calculation method allowing an optimized route to be drawn up by means of a calculator between a point ? and a point ?, consisting in using digitized data from at least a first and a second source, and consisting of (i) determining a plurality of alpha nodes (N?), referenced in both the first and the second sources, and determining a first optimization value for each of the nodes; (ii) determining a plurality of beta nodes (N?), referenced in both the third and the second sources, and determining a first optimization value for each of the nodes; (iii) determining, for all the pairs of nodes N? and N?, a second optimization value for each of the pairs of nodes (N?, N?); (iv) determining, for the set of alpha-beta route, the optimum nodes between the points alpha and beta. The invention also relates to a device allowing implementation of the present method.

Abstract: A route calculation method allowing an optimised route to be drawn up by means of a calculator between a point ? and a point ?, consisting in using digitised data from at least a first and a second source, and consisting of (i) determining a plurality of alpha nodes (N?), referenced in both the first and the second sources, and determining a first optimisation value for each of the nodes; (ii) determining a plurality of beta nodes (N?), referenced in both the third and the second sources, and determining a first optimisation value for each of the nodes; (iii) determining, for all the pairs of nodes N?and N?, a second optimisation value for each of the pairs of nodes (N?, N?); (iv) determining, for the set of alpha-beta route, the optimum nodes between the points alpha and beta. The invention also relates to a device allowing implementation of the present method.