Analysis, measurement and automatic classification system of road routes and operation method thereof

An analysis, measurement and automatic classification method of road routes such as urban and suburban routes, a circuit, a racetrack, from a starting point to an arrival point, for driving a vehicle by a user on said road routes, implemented by the system (S) according to the preceding claims, comprising the following steps:

• 0. configuration phase of said system (S) for selecting a first mode and a second mode for automatically measuring and classifying said road routes;
• 1. if the first calculation mode is selected, select a bounding box on a road map, underlying a starting graph (G) defined by a set of vertices (V) and a set of arcs (E), said road map being relative to said road route by selecting a pair of geographic coordinates C1 (lat1, lon1) and C2(lat2, lon2);
• 2. extracting a sub graph (G1) defined by a subset of vertices (V1) and a subset of arcs (E1) from said starting graph (G) by selecting from said set of vertices (V) of said starting graph G) a subset of vertices (V1) including all vertices that are included within said bounding box, so that
• V1={v(lat, lon)∈V:lat≤lat1 and lon≥lon1 and lat≥lat2 and lon≤lon2}
• and selecting from said set of arcs (E) of said starting graph (G) a subset of arcs (E1) connecting all vertices contained in said subset of vertices (V1) so that:
• E1={e(v1,v2)∈E:v1∈V1ev2∈V1};
• a. if the first mode is chosen for each vertex of said subset of vertices (V1) calculate the possible paths to reach any other vertex of said subset of vertices (V1) by means of a routing algorithm;
• if the second mode is chosen, calculate a path connecting a starting vertex, coinciding with said starting point of the road route, to an arrival vertex, coinciding with said arrival point of said road route, comprising a set of arcs, each having a starting vertex A and a final vertex B;
• a1. converting said arcs into segments;
• b. converting said path calculated in said step a. in a broken line comprising said segments;
• c. normalizing said segments of said broken line, dividing said segments into parts of equal length so as to have a homogeneous broken line, i.e. composed of segments of comparable length;
• d. associating to each segment of said broken line a length and the angle between each segment and the meridian, projecting said starting point A and said final point B of each segment on a plane and applying the known formula for the calculation of the angle γ between two straight lines on a plane:
• γ
• =
• arctan
• 
• (
• 
• m
• -
• m
• ′
• 1
• +
• mm′
• 
• )
• (
• 5
• )
• wherein m and m′ are angular coefficients of two consecutive segments, at an angle having a positive value corresponds to a right curve, at a angle having a negative value corresponds a left curve and at a zero value angle correspond to two straight line segments belonging to the same straight line, compute the y angle for all the segments of the broken line, individuating all the curves and straight line comprising the broken line and output a first set of tracks containing all the right curves, a second set of tracks containing all the left curves and a third set of tracks containing all the straight line;
• e. correcting errors due to the realization of said road map, present in said group of tracks;
• f. analyzing the groups of correct tracks obtained from the preceding step e., evaluating the length, the sinuosity, the radius of curvature of the tracks and the distance between two curves, this latter given by the length of the straight line which separate two curves and assigning preliminary notes to each of the tracks;
• g. checking the coherence of said preliminary notes and generation of final notes.