METHOD FOR RESTORING TELEMETRIC DATA FROM AN INCOMPLETE MOTOR VEHICLE JOURNEY

Abstract

METHOD FOR RESTORING TELEMETRIC DATA OF AN INCOMPLETE JOURNEY OF A MOTOR VEHICLE The present invention relates to a method for managing telemetric data of a motor vehicle (2), comprising the following steps: a) receiving by telemetry data from the motor vehicle relating to the movement of said motor vehicle; b) identifying, on the basis of the data relating to the movement, journeys taken by the motor vehicle; notable by the following steps: c) detecting an incomplete journey (Ti), on the basis of a minimum distance (Di) between a stopping point (B) and a starting point (A) of two successive journeys (T58, T59), respectively; d) identifying, from a history of the complete journeys of the motor vehicle, at least one sequence of one or more journeys including the starting point; e) determining the most probable sequence among the at least one sequence identified, to complete the incomplete journey.(Figure to be published with the abbreviation: Figure 2).

Description

Title of the invention: METHOD FOR RESTORING TELEMETRIC DATA FROM AN INCOMPLETE JOURNEY OF A MOTOR VEHICLE technical field

[0001] The present invention relates to the field of motor vehicles, more particularly to the field of motor vehicle telemetry. Previous technique

[0002] Modern motor vehicles are generally equipped with sensors that collect various information in real time, such as GPS location, engine performance, driving conditions, and fuel consumption. This data is then transmitted from the vehicles to storage servers via a network connection, usually a 4G network.

[0003] On the servers, information from each trip is recorded, including details such as departure and arrival times, GPS location, speed, engine speed, and driving events such as acceleration and braking, etc. Once stored, this data is subjected to in-depth analysis, used for various applications ranging from improving vehicle performance to fleet management, car insurance, predictive maintenance, and data-driven decision-making.

[0004] However, a significant percentage of telemetry transmissions experience data loss, particularly concerning one or more trips made by the motor vehicle. For example, when the vehicle travels from point A to point B, the next trip should invariably begin at point B (provided that the odometer reading at the end of the previous trip is equal to that at the beginning of the next trip). However, it frequently happens that the transmitted data indicates that the motor vehicle's trip started from a different point C, thus resulting in the loss of one or more trips linking point B to point C.

[0005] The published patent document WO 2016 / 159815 Al discloses a method for detecting potential carpooling between several motor vehicles based on a history of routes of similar journeys of motor vehicles.

[0006] However, the solution proposed by the document does not make it possible to overcome the loss of telemetry data relating to the journeys of motor vehicles. Description of the invention

[0007] The present invention aims to overcome at least one of the drawbacks of the aforementioned prior art. More specifically, the invention aims to to offer a simple, efficient and economical solution to restore telemetry data from an incomplete journey of a motor vehicle.

[0008] To this end, the invention relates to a method for managing telemetry data from a motor vehicle, comprising the following steps: a) receiving by telemetry data from the motor vehicle relating to the movement of said motor vehicle; b) identification, based on data relating to movement, of routes travelled by the motor vehicle; notable for the following steps: c) detection of an incomplete journey, based on a minimum distance between a stopping point and a starting point of two successive journeys, respectively; d) identification, from a history of the complete journeys of the motor vehicle, of at least one sequence of one or more journeys including the starting point; e) determination of the most probable sequence among the at least one identified sequence, to complete the incomplete path.

[0009] According to one embodiment, each sequence of complete journeys comprises at least two complete journeys of the motor vehicle, comprising a first journey having the stopping point as a starting point of said first journey of the corresponding sequence, and the starting point as a stopping point of a last journey of said sequence.

[0010] According to one embodiment, step d) of identifying at least one sequence, includes for each of the starting and stopping points (A, B), a calculation of a theoretical direct distance linking said points (A, B), respectively with each of the points of the complete paths constituting the corresponding sequence, so as to identify the identical points when the calculated theoretical direct distance is less than a predefined threshold.

[0011] Advantageously, the identical points correspond to the starting point of the first path of the identified sequence and to the stopping point of the last path of said sequence.

[0012] According to one embodiment, the calculation of the direct theoretical distance is carried out using the haversine formula.

[0013] According to one embodiment, step e) of determining the most probable sequence includes a measurement of the total distance traveled by the motor vehicle between the starting point (B') of the first journey of each of the at least one identified sequence and the stopping point (A') of the last journey of said corresponding sequence.

[0014] According to one embodiment, step e) comprises measuring the total distance traveled by several identified sequences, and comparing the measured distances of each of said identified sequences with the minimum measured distance of the incomplete journey between the stopping point (B) and the starting point (A) of the two successive journeys of the motor vehicle.

[0015] According to one embodiment, the most probable sequence is the one whose measured distance among those of other identified sequences is closest to the minimum measured distance of the incomplete path.

[0016] The invention also relates to a computer program comprising computer-readable code instructions, notable in that said program leads the computer to implement the steps of the telemetry data management process of a motor vehicle according to the invention, when said program is executed by a computer.

[0017] The invention also relates to a device comprising a computer-readable recording medium, notable in that the computer program according to the invention is recorded on the recording medium.

[0018] The invention further relates to a motor vehicle, remarkable in that said motor vehicle is configured to execute the telemetry data management process of a motor vehicle according to the invention.

[0019] The measures of the invention are advantageous in that the determination of the most probable sequence among sequences identified from the history of complete journeys makes it possible to complete the incomplete journey, in a simple and economical way, in order to adapt its telemetry data and to fill any interruption in the recording of the latter.

[0020] This ensures continuity of data relating to the movement of motor vehicles, which allows for better use of data for more efficient and more precise management of information, ultimately leading to improved decision-making.

[0021] Furthermore, the method according to the invention makes it possible to minimize unnecessary or unusable data transmissions, generally carried out via a paid 4G connection. Thus, the invention makes it possible to achieve significant savings by reducing data transfer costs. Brief description of the drawings

[0022] [Fig-1] is a schematic representation of a list of successive paths of a motor vehicle comprising a starting point and a stopping point, said list comprising an incomplete route whose missing telemetry data will be completed by those of a sequence of routes following a telemetry data management method according to the invention;

[0023] [Fig.2] schematically represents the starting and stopping points of the successive journeys listed in [Fig.1];

[0024] [Fig.3] is a schematic representation of a history of journeys of the motor vehicle recorded before the incomplete journey of [Fig.2], and from which at least one sequence is identified according to the method of the invention. Detailed description

[0025] Figure 1 shows a list of successive journeys of a motor vehicle, including an incomplete journey for which telemetry data is missing, i.e., was not transmitted via a network connection from the vehicle to a storage server. This can be caused by several reasons, including an interrupted transmission of said telemetry data.

[0026] The present invention proposes a method for managing telemetry data of the motor vehicle, so as to ensure the recovery of missing and / or incomplete telemetry data of one or more journeys.

[0027] In this regard, the method for managing telemetric data of the motor vehicle includes a first step a) of receiving by telemetry data from the motor vehicle relating to these movements, then a step b) of identifying, on the basis of the data relating to the movements, the routes traveled by said motor vehicle.

[0028] With reference to [Fig.1], each journey includes a starting point (beginning) and a stopping point (end), each of these points includes a recorded GPS position, as well as a value from the odometer of the motor vehicle in order to determine the distance traveled and to be able to detect a possible incomplete journey, such as the incomplete journey Ti between the stopping points B of journey T58 and the starting point A of journey T59.

[0029] The incomplete path Ti is detected here, at step c) of the process, between the two successive paths T58 and T59 based on a minimum distance Di between the two points A and B that exceeds a certain threshold value. In the illustrated example, the distance Di is equal to 55 km; this is the missing distance (the difference in pedometer values ​​between points A and B).

[0030] Figure 2 schematically represents the incomplete route Ti, for which telemetry data is incomplete. The route Ti is unknown, as shown in the dashed line. The method of the invention makes it possible to identify, within a history of recorded routes of the same motor vehicle 2, sequences of routes that can replace the incomplete route Ti.

[0031] To this end, the method for managing telemetry data of the motor vehicle 2, further includes a step d) of identifying, from the history of the complete journeys of the motor vehicle 2, at least one sequence of one or more journeys including the starting point (A).

[0032] Figure 3 is a schematic representation of the vehicle's journey history automobile recorded before the incomplete journey Ti of the [Fig.2], and from which at least one sequence is identified according to the method of the invention.

[0033] By way of example, two sequences SI and S2 were identified in step c). Each of the sequences SI, S2 comprises a path having the starting point A in Figures 1 and 2, and preferably the stopping point B. Here, these points are respectively identified as A' and B', because they may include a GPS position that is not exactly identical but close enough to constitute the sequence.

[0034] Preferably, each of the sequences SI and S2 comprises at least two complete journeys of the motor vehicle, comprising a first journey (T22 and T26) having the stopping point B as a starting point B' of said first journey T22, T26 of the corresponding sequence, and having the starting point A as a stopping point A' of a last journey (T24 and T27) of said sequence SI, S2.

[0035] Preferably, the identified SI, S2 sequences are free of incomplete paths, such as path T25.

[0036] In order to determine the points A' and B' to form each sequence, step d) of the method of the invention includes for each of the starting and stopping points (A and B of figures 1 and 2), a calculation of a direct theoretical distance linking said points A, B, respectively with each of the points (G, H, I, C, F, etc.) of the complete paths (from T20 to T28) constituting the corresponding sequence, so as to identify the identical points A', B' when the calculated direct theoretical distance is less than a predefined threshold, for example, less than 2 km.

[0037] The term "identical" is used by abuse of language to emphasize the proximity of the selected points A', B' with points A and B, although there is a tolerance or slight difference between their GPS coordinates.

[0038] Preferably, the calculation of the direct theoretical distance is carried out using the haversine formula, advantageously allowing verification of the proximity between said calculation and the GPS coordinates of each point of the historical journeys.

[0039] Now that the SI, S2 sequences are identified, the process performs a final step e) of determining the most probable sequence among the identified sequences, in order to complete the incomplete path Ti of [Fig.2].

[0040] In this regard, the method includes measuring a total distance DSI, DS2 traveled by the motor vehicle between points B' and A' of each sequence identified SI, S2, it is therefore the difference of the recorded values ​​of the vehicle's pedometer at said points A', B', so as to determine the total distance DSI, DS2 of the corresponding sequence.

[0041] Next, step e) includes comparing the measured distances DSI, DS2 with the minimum measured distance Di of the incomplete path Ti between points A and B of [Fig.2],

[0042] Advantageously, the most probable sequence that can replace the incomplete path is the one whose measured distance among those of other identified sequences is closest to the minimum measured distance of the incomplete path.

[0043] As an example, DSI comprises 120 km and DS2 comprises 50 km, so it is the sequence S2 which is retained, the latter comprising telemetry data which will be assigned to the incomplete journey Ti of the [Fig.1], so as to complete said journey Ti, for example, by making an adaptation of the departure and arrival times of the journeys T58 and T59, as well as the odometer values.

[0044] The method for managing telemetric data of the motor vehicle is preferably executed in the form of a computer program (computer algorithm) comprising computer-readable code instructions, said program being advantageously recorded on a motor vehicle recording medium which is readable by a computer.

Claims

Claims

1. Method for managing telemetric data of a motor vehicle (2), comprising the following steps: a) receiving by telemetry data from the motor vehicle (2) relating to the movement of said motor vehicle (2); b) identifying, on the basis of the data relating to the movement, journeys traveled by the motor vehicle (2); characterized by the following steps: c) detecting an incomplete journey (Ti), on the basis of a minimum distance (Di) between a stopping point (B) and a starting point (A) of two successive journeys (T58, T59), respectively; d) identifying, from a history of the complete journeys of the motor vehicle (2), at least one sequence (SI, S2) of one or more journeys comprising the starting point (A); e) determining the most probable sequence from among the at least one identified sequence (SI, S2), to complete the incomplete journey (Ti).

2. Method according to claim 1, wherein each sequence (SI, S2) of complete journeys comprises at least two complete journeys of the motor vehicle (2), comprising a first journey (T22, T26) having the stopping point (B) as a starting point (B') of said first journey (T22, T26) of the corresponding sequence (SI, S2), and the starting point (A) as a stopping point (A') of a last journey (T24, T27) of said sequence (SI, S2).

3. Method according to claim 2, in which step d) of identifying the at least one sequence (SI, S2), comprises for each of the starting and stopping points (A, B), a calculation of a direct theoretical distance linking said points (A, B), respectively with each of the points of the complete journeys constituting the corresponding sequence (SI, S2), so as to identify the identical points (A', B') when the calculated direct theoretical distance is less than a predefined threshold.

4. A method according to claim 3, wherein the calculation of the direct theoretical distance is carried out using the haversine formula.

5. Method according to one of claims 1 to 4 and according to claim 2, in which step e) of determining the most probable sequence comprises a measurement of a total distance (DSI, DS2) traveled by the motor vehicle (2) between the starting point (B') of the first journey of each of the at least one identified sequence (SI, S2) and the point stop (A') of the last journey of said corresponding sequence (SI, S2).

6. Method according to claim 5, in which step e) comprises measuring the total distance traveled (DSI, DS2) of several identified sequences (SI, S2), and a comparison of the measured distances (DSI, DS2) of each of said identified sequences (SI, S2) with the minimum measured distance (Di) of the incomplete journey (Ti) between the stopping point (B) and the starting point (A) of the two successive journeys (T58, T59) of the motor vehicle (2).

7. Method according to claim 6, in which the most probable sequence is the one whose measured distance (DSI, DS2) among those of other identified sequences (SI, S2) is closest to the minimum measured distance (Di) of the incomplete path (Ti).

8. Computer program comprising computer-readable code instructions, characterized in that said program causes the computer to implement the steps of the method for managing telemetric data of a motor vehicle (2) according to one of claims 1 to 7, when said program is executed by a computer.

9. Device comprising a computer-readable recording medium, characterized in that the computer program according to claim 8 is recorded on the recording medium.

10. Motor vehicle (2), characterized in that said motor vehicle (2) is configured to execute the method for managing telemetric data of a motor vehicle (2) according to one of claims 1 to 9.

Images