Method of Establishing Neighboring Points for a Digital Road Network System

• US 20080195307A1
• Filed: 10/13/2005
• Published: 08/14/2008
• Est. Priority Date: 10/18/2004
• Status: Abandoned Application

• Current Assignee: Societe De Technologie Michelin (Compagnie Generale DES Etablissements Michelin SCA)
• Original Assignee: Societe De Technologie Michelin (Compagnie Generale DES Etablissements Michelin SCA)
• Inventors: Raynaud, Michel, Bouslouk, Mouna
• Application Number:
  US11/665,652
• Publication Number:
  US 20080195307A1
• Time in Patent Office: Days
• US Class Current: 701/202
• CPC Class Codes: G01C 21/3811 Point data, e.g. Point of Interest [POI]

Abstract

A method of establishing neighboring points for a digital road network system stored on a storage medium and comprising a plurality of segments and indications of the position of these segments, in which, in order to link a given neighboring point with a given intersection:

• • (a) the class of said intersection (CC) is established;
  • (b) it is verified whether the class (CC) of this intersection is greater than a given intersection recognition threshold (SPCC);
  • (c) an identification is made of the selectable surrounding neighboring points (PV), which are located within a given radius of the intersection and which have a range or threshold of the minimum required value (SPV);
  • (d) the PV closest to the intersection is selected and a link is created between the data corresponding to said intersection and those of said neighboring point (PV).

Claims

1. A method of establishing neighboring points for a digital road network system stored on a storage medium and comprising a plurality of segments and indications of the position of these segments, said segments being capable of being combined in piecing together a road network so as to form portions of roads and intersections, in which, in order to link a given neighboring point with a given intersection:

(a) the class of said intersection (CC) is established;

(b) it is verified whether the class (CC) of this intersection is greater than a given intersection recognition threshold (SPCC);

(c) an identification is made of the selectable surrounding neighboring points (PV), which are located within a given radius of the intersection and which have a range or threshold of the minimum required value (SPV);

(d) the PV closest to the intersection is selected and a link is created between the data corresponding to said intersection and those of said neighboring point (PV).

2. The method of establishing neighboring points as claimed in claim 1, characterized in that the threshold (SPV) depends on the class (CC) of the intersection such that the higher the class, the higher the threshold (SPV) is.

3. The method of establishing neighboring points as claimed in claim 1, characterized in that the maximum radius of a neighboring point (PV) depends on the one hand on the range of this point, and on the other hand on the class (CC), such that, for a given class value (CC), the more the range of the PV increases, the more the maximum radius increases, and for a given range, the more the class (CC) increases, the more the maximum radius increases.

4. The method of establishing neighboring points as claimed in claim 1, characterized in that the class of an intersection (CC) is the average of the classes of the three main segments.

5. The method of establishing neighboring points as claimed in claim 1, characterized in that the network also includes nodes, which can be used in a representation of the road network to join together a plurality of segments.

6. The method of establishing neighboring points as claimed in claim 1, characterized in that a neighboring point is a locality and its range is established according to importance, judged by the population, administrative rank and resources of said locality.

7. Software comprising code elements programmed for implementing the method as claimed in claim 1, when said software is loaded into a computer system and executed by said computer system.

8. Software in the form of a product recorded onto a machine-readable medium, comprising programmed code elements as claimed in claim 7.

9. A method of setting up a route sheet, for drawing up a list of instructions enabling a user to travel along a route based on indications provided by this list, in which the instructions relating to the changes in direction to be made at intersections are completed by this intersection'"'"'s neighboring points, the neighboring points (PV) being established using the method as claimed in claim 1.

10. The method as claimed in claim 9, characterized in that the points enabling said route to be established are identified by selecting a first modeling element of the road network, preferably a node, close to the point of departure, and a second modeling element of the road network, preferably a node, close to the point of arrival, identifying a plurality of routes, each consisting of a plurality of route elements connected from the first element to the second element, and searching for at least one intermediate element for each of said routes in said set of road network modeling elements.

11. The method as claimed in claim 9, characterized in that said plurality of routes is determined from a DIJKSTRA algorithm.

12. The method as claimed in claim 9, characterized in that said plurality of routes is determined from a FORD algorithm.

13. Software comprising code elements programmed for implementing the method as claimed in claim 9, when said software is loaded into a computer system and executed by said computer system.

14. Software in the form of a product recorded onto a machine-readable medium, comprising programmed code elements as claimed in claim 13.

15. A route calculation device, comprising:

a data input unit, for receiving the data associated with a point of departure and those associated with a point of arrival;

access to a storage unit comprising a set of road network modeling elements;

a calculation unit designed for;

identifying a plurality of routes enabling each to connect the points of departure and arrival;

establishing at least one neighboring point (PV) for at least one intersection.

16. The route calculation device as claimed in claim 15, used to produce and put together the data necessary for drawing up a route sheet including therein at least one neighboring point (PV) in association with at least one intersection.

17. The route calculation device as claimed in claim 15, including a guidance unit, designed to generate guidance information as a function of the mapping elements of the selected route.

18. A computer system including a device as claimed in claim 15.