Method of determining a route as a function of the sinuosity index

• US 20090222198A1
• Filed: 10/13/2005
• Published: 09/03/2009
• 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
• Application Number:
  US11/665,654
• Publication Number:
  US 20090222198A1
• Time in Patent Office: Days
• US Class Current: 701/200
• CPC Class Codes: G01C 21/3461 Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries

Abstract

The invention relates to a method of determining routes between a point of departure (α) and a point of arrival (β) for a digital road mapping system comprising a set of segments that are representative of a road network. The inventive method comprises the following steps consisting in: receiving a route request containing the points of departure and arrival and the selected, preferred sinuosity level; identifying a plurality of potential routes; assigning a value to each of the potential routes as a function of the global sinuosity index thereof, which is established from the sinuosity index of each of the segments forming the potential routes; and selecting the potential route with the sinuosity index that best corresponds to the sinuosity level of the request.

Claims

1. A method of determining routes between a point of departure (a) and a point of arrival (β

) for a digital road mapping system consisting of digital modeling elements of a road network comprising a set of segments representative of said road network and data relating to sinuosity for at least a portion of these segments, and including the following steps;

a route request is received including;

the points of departure and arrival;

the selected preferred sinuosity level;

a plurality of potential routes is identified;

each of said potential routes is assigned a rating as a function of its global sinuosity index established from the sinuosity index of each of the segments forming said potential routes;

the potential route whose sinuosity index best matches the sinuosity level of the request is selected.

2. A method of determining routes as claimed in claim 1, characterized in that the sinuosity level indicates a preference for the potential route having a substantially higher or substantially lower sinuosity.

3. A method of determining routes as claimed in claim 1, characterized in that the sinuosity level indicates a preference for the potential route having a substantially higher, a substantially lower, or an intermediate sinuosity.

4. A method of determining routes as claimed in claim 1, characterized in that said rating corresponds to the average sinuosity index of the route, evaluated thanks to the following relationship:

Sis(ISsegment X Lsegment/Ltotal, in which IS segment corresponds to the sinuosity index of a given segment, Lsegment corresponds to its length, and Ltotal corresponds to the total length of the route.

5. A method of determining routes as claimed in claim 1, characterized in that the step of identifying the plurality of potential routes further includes the following steps:

a) segments are scanned adjacent to the node (or point) of departure or to the node chosen so as to determine the cost of each of the nodes to which these segments lead;

b) from these nodes is selected the one whose cost is most favorable according to the set criteria;

(the shortest, the fastest, the most economic, preferring freeways, etc. or any combination of these criteria);

c) step “

a”

is repeated and said scanning is continued until the node whose cost is most favorable matches the point of arrival.

6. A method of determining routes as claimed in claim 5, characterized in that scanning the nodes is carried out using Dijkstra'"'"'s algorithm.

7. A method of determining routes as claimed in claim 5, characterized in that scanning the nodes is carried out using FORD'"'"'s algorithm.

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

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

10. A device for determining routes between a point of departure (a) and a point of arrival (β

) for a digital road mapping system consisting of digital modeling elements of a road network comprising a set of segments representative of said road network and data relating to sinuosity for at least a portion of these segments, and including the following steps;

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

a desired sinuosity level for the route to be established;

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 points of departure and arrival taking into account the sinuosity index of the segments of each of the routes.

11. A route calculation device as claimed in claim 10, characterized in that the sinuosity index is used to give differing weight to journeys having a high sinuosity index compared to journeys having a low sinuosity index.

12. A route calculation device as claimed in claim 10, including a guidance unit, designed to generate guidance information as a function of the mapping elements of the selected route.