Memory process, associated device and system.

Abstract

A memorization method characterized in that it comprises the following steps: Receiving, via a wireless communication network (400), from a first motor vehicle (200), a first motor vehicle journey record; For each motor vehicle journey record (116, 124, 126, 128) from a plurality of motor vehicle journey records: calculating a first distance of said each motor vehicle journey record (116, 124, 126, 128) with respect to the first motor vehicle journey record; Selecting a second motor vehicle journey record (124) from among the plurality of motor vehicle journey records such that the first distance is a minimum distance, the second motor vehicle journey record (124) having an identifier (123); Storing a copy of the identifier (123') in a list (110) of motor vehicle journey records (110) from the first vehicle (200). Figure for the summary: Figure 1

Description

Title of the invention: Memory method, associated device and system.

[0001] The invention relates to the storage of motor vehicle routes in a server.

[0002] There is a need to improve this memorization.

[0003] To this end, the invention relates to a memorization method characterized in that it includes the following steps: • Reception, via a radio frequency communication network (in other words: wireless) (for example, a mobile phone network or "Wi-Fi"), from a first motor vehicle, of a first recording of a motor vehicle journey, then • For each vehicle journey record in a plurality of vehicle journey records: a step of calculating a first distance of said vehicle journey record from the first vehicle journey record (in other words: from the first vehicle journey record), then • Selection of a second vehicle trip record from among the plurality of vehicle trip records such that the first distance (i.e., of each vehicle trip record (in other words, of the second vehicle trip record) from the first vehicle trip record) is a minimum distance (i.e., among the plurality of vehicle trip records), the second vehicle trip record having an identifier (which may include, for example, an identification number or an address in the memory of the vehicle trip record), then • Storing a copy of the identifier in a list (for example, stored as a linked list or an array) of car trip records of the first vehicle (i.e., each car trip record in the list of records consists of data recorded by the first motor vehicle, during a trip (different for each record in the list) of the first motor vehicle. Each car trip record in the list of records is, for example, received from the first motor vehicle).

[0004] Thus, thanks to the invention, the memory space required to store the first car journey record is reduced. The invention therefore makes it possible to reduce the memory space required to store car journey records for a fleet. The plurality of car journey records (as well as, for example, copies of identifiers) can consist of a large number of car journey records, which can, for example, exceed one billion.

[0005] A vehicle journey recording is understood to mean a set of data recorded (for example, prior to the reception stage), in a manner known to those skilled in the art, by a motor vehicle during a journey of the motor vehicle (and the method according to the invention may include the recording of this data as well as, for example, the transmission, by the first motor vehicle, of this data to the electronic device). Thus, the first vehicle journey recording consists of data recorded by the first motor vehicle during a journey of the first motor vehicle.

[0006] The recorded data can be of very different kinds.

[0007] Thus the recording may include, for example: • Locations of the motor vehicle during the journey, determined by a vehicle geolocation module, and / or • Vehicle speeds during the journey, measured by a vehicle speed sensor, and / or • The mileage of the motor vehicle during the journey, measured by the vehicle's odometer, and / or • Engine speeds of the motor vehicle's propulsion system, during the journey, measured by a vehicle engine speed sensor, and / or • Accelerations (longitudinal and / or lateral) of the vehicle during the journey, measured by an accelerometer in the motor vehicle, and / or • Weather or traffic data received during the journey from a remote server via a wireless communication module in the motor vehicle, and / or • The start time of the journey and the end time of the journey.

[0008] The memorization step can be followed by a step of reading the copy of the identifier, then a search in memory for the second car journey record from the identifier, then a reading in memory of the second car journey record.

[0009] It is thus possible to analyze (in other words: to process) (subsequently) the second car journey recording, for example, to program or carry out preventive maintenance steps (for example, to select parts to replace) on the first motor vehicle (and the method may include these steps analysis and maintenance).

[0010] For example, the process can be repeated for the first motor vehicle for different first recordings.

[0011] For example, at least part of the plurality of car journey recordings is recorded by motor vehicles different from the first vehicle, during journeys of these vehicles.

[0012] For example, the selection step includes a scan of the plurality of car journey records in memory.

[0013] The list of car journey records includes, for example, an identifier of the first motor vehicle.

[0014] According to one embodiment, the memorization process includes a check step to see if the minimum distance is less than a threshold, the implementation of the memorization step of a copy of the identifier being conditional on the minimum distance being less than the threshold (otherwise, the first record is memorized in the list of records).

[0015] Alternatively, this verification step is not carried out, for example, in the case where the plurality of car journey records consists of a large number of records.

[0016] For example, the first distance may be an aggregation (for example, a sum or an average, and alternatively, other mathematical or arithmetic combinations may be envisaged) of a plurality of distances.

[0017] For example, each distance in the plurality of distances being a distance between a part of the recordings of automobile (vehicle) journeys.

[0018] According to one embodiment: • The first car journey recording includes an initial geographic location, the first geographic location being the starting geographic location of the journey, and • For each car trip record, said each car trip record includes a second geographic location, the second geographic location being a starting geographic location of the trip, and • For each car journey recording, the said first distance is calculated, during the calculation step, from a second distance between the first geographical location and the second geographical location.

[0019] According to one embodiment: • The first car journey recording includes a third geographic location, the third geographic location being a final destination location, and • For each car trip record, said car trip record includes a fourth geographic location, the fourth geographic location being a trip end geographic location, and • For each car journey recording, the first distance is calculated, during the calculation step, from a third distance between the third and fourth geographic locations.

[0020] For example, the second and / or third distance is a planar (i.e., Euclidean) distance on a two-dimensional geographic map or a geodetic distance (for example, according to the so-called "law of sines" method or the so-called "Haversine" method).

[0021] According to one embodiment: • The first car journey recording includes a first hour, the first hour being the start time of the journey, and • For each car trip record, said each car trip record includes a second hour, the second hour being a trip start time, and • For each car journey recording, the said first distance is calculated, during the calculation step, from a difference between the first hour and the second hour.

[0022] According to one embodiment: • The first car journey recording includes a third hour, the third hour being the end time of the journey, and • For each car journey record, said car journey record includes a fourth hour, the fourth hour being a journey end time, and • For each car journey recording, the said first distance is calculated, during the calculation step, from a difference between the third hour and the fourth hour.

[0023] The start of a journey can be detected by the motor vehicle when the vehicle's ignition is switched on or when the vehicle starts to move.

[0024] The end of a journey can be detected by the motor vehicle when the vehicle's ignition is switched off or when the vehicle stops circulating or moving.

[0025] The first hour, the second hour, the third hour, and / or the fourth hour can be expressed as a number of seconds (or minutes) from a predetermined date (this is for example a so-called "Unix" time).

[0026] According to one embodiment: • The first car journey recording includes fifths lo geographical locations, the fifth geographical locations being geographical locations of route points, and • For each car trip record, said car trip record includes sixth geographic locations, the sixth geographic locations being geographic locations of trip points, and • For each car journey recording, the said first distance is calculated, during the calculation step, from a fourth distance between a (string of characters consisting of a) concatenation of coordinates, expressed in decimal degrees, of the fifth geographical locations and a (string of characters consisting of a) concatenation of coordinates, expressed in decimal degrees, of the sixth geographical locations.

[0027] By path points, we mean any points along the path. Path points include or are made up of, for example, points along the path where the path changes direction.

[0028] The fourth distance may be, for example, an edit distance (also known as the "Levenshtein distance") or a so-called "Jaro-Winkler distance". Generally speaking, it is a distance between character strings.

[0029] According to one embodiment: • The first car trip record includes initial values, the initial values ​​being numeric trip attribute values, and • For each car trip record, said car trip record includes second values, the second values ​​being numeric trip attribute values, and • For each car journey recording, the said first distance is calculated, during the calculation step, from a fifth distance between a first point with coordinates made up of the first values ​​and a second point with coordinates made up of the second values. • According to one embodiment, the fifth distance is a Euclidean distance or a so-called "Manhattan distance" (alternatively, a so-called "Minkowski distance" or a so-called "Chebyshev distance").

[0030] According to one embodiment: • The first car trip record includes third values, the third values ​​being binary trip attribute values, and • For each car trip record, said each car trip record includes fourth values, the fourth values being binary path attribute values, and • For each car journey recording, the said first distance is calculated, during the calculation step, from a sixth distance between a first bit word made up of the third values ​​and a second bit word made up of the fourth values.

[0031] According to one embodiment, the third distance is a so-called "Hamming distance" or a so-called "Jaccard distance".

[0032] The numerical trip attributes may consist of a mileage travelled (in other words: the total distance travelled during the trip), an average speed, engine speeds, or a number of accelerations, brakings and / or sharp turns

[0033] The binary route attributes can consist of weather conditions (for example, sunny, rainy weather) or traffic conditions (smooth, congested, etc.).

[0034] The invention also relates to a computer program comprising instructions executable by a microprocessor or a microcontroller or a computer, to implement the steps of the process according to the invention, when executed by the microprocessor or the microcontroller or the computer.

[0035] The method according to the invention can be implemented by an electronic device, for example a server. The invention therefore also relates to an electronic device configured to implement the steps of the method according to the invention, as well as a system comprising the electronic device (in other words: a server) and a first motor vehicle configured to send (and for example record) the first motor vehicle journey recording to the electronic device, for example via a radio frequency communication network.

[0036] The characteristics and advantages of the computer program, the electronic device, and the system are identical to those of the method according to the invention (without it being necessary to repeat them here).

[0037] When the electronic device, the first motor vehicle (or other element) is "configured to" (or "capable of") performing or implementing a step or operation, this implies, for example, that the element includes means for performing the step or operation. These means preferably include electronic means, for example, a computer program, data in memory, specialized electronic circuits, a data bus, a microprocessor, and / or a microcontroller.

[0038] Other features and advantages of the present invention will become more apparent upon reading the following detailed description, which includes embodiments of the invention given by way of non-limiting examples and illustrated by the attached drawings, in which:

[0039] [Fig. 1] represents an electronic device and a system, according to an embodiment of the invention, in top view,

[0040] [Fig.2] represents car journey recordings during the implementation of the process according to [Fig.4].

[0041] [Fig.3] represents the journeys during which the car journey recordings of [Fig.2] were made.

[0042] [Fig.4] represents an implementation of the process according to the invention, according to an example of an embodiment, by the electronic device of the [Fig.1],

[0043] In [Fig.1], certain elements are, of course, seen through transparency.

[0044] Detailed description of an example embodiment of the invention, with reference to figures 1 to 4.

[0045] [Fig. 4] and 1, in step S10, the vehicle 300 transmits, via the mobile telephone network 400, a car journey record 126 to a server 100 which receives it and stores it in a list of car journey records 120 identified by the identifier 121, for example of the type "VIN", of the vehicle 300. The car journey record 126, in the list 120, includes in particular an identifier 125. The identifier may include, for example, the date and / or time of recording or completion of the journey. The identifier 125 may include an identification number (for example, a serial number) or a memory address of the car journey record 126.

[0046] Also at step S10, the car journey record 124 with identifier 123 and the car journey record 128 with identifier 127 are received and stored in the same way in list 120.

[0047] At step S20, the vehicle 200 transmits, via the mobile telephone network 400, the car journey record 116 containing the identifier 115 to the server 100 which receives it and stores it in a list of car journey records 110 identified by the identifier 111, for example of type “VIN”, of the vehicle 200.

[0048] At step S30, the vehicle 200 transmits, via the mobile telephone network 400, the car journey recording 114 to the server 100 which receives it.

[0049] Trip records 114, 124, 126, 128 and 116, for example, have the same data structure. In particular, identifiers 123, 125, 127 and 115, for example, have the same data structure.

[0050] At step S40, server 100 selects car trip record 124 from among trip records 124, 126, 128 and 116 from car trip record 114.

[0051] At step S50, the server 100 consequently stores a copy 123' of the identifier 123 of the car journey record 124 in the list of car journey records 110 (therefore associated with the identifier 111 of the motor vehicle 200).

[0052] The S50 step of storing a copy 123' of the identifier 123 can be conditional upon the distance of the car journey record 124 from the car journey record 114 being less than a threshold. Otherwise, the car journey record 114 is then stored in the list of journey records 110.

[0053] At step S60, after other journey records (still with the same data structure) have been stored in the journey list 110, for example more than 100 journey records, the server 100 performs statistical processing from the stored records and made by the motor vehicle 200, including journey record 124, for example to program or carry out preventive maintenance steps.

[0054] Prior to step S10, for example during step S00: • The data from the car journey recording 126 are stored by the vehicle 300 during the journey T_126 shown [Fig.3], and • The data from the car journey recording 114 are stored by the vehicle 200 during the journey T_114 shown [Fig.3], and • The data from car journey records 116 are recorded by vehicle 200, and the data from journey records 124 and 128 are recorded by vehicle 300, in the same way.

[0055] During step S40, to select the car journey record 124, the server 100 searches, in the plurality of car journey records 116, 124, 126, 128 in memory, for the one closest to the car journey record 114, according to a distance denoted d.

[0056] Such a selection obviously requires the calculation of the distance d between the car journey record 114 and each car journey record 116, 124, 126, 128.

[0057] The car journey record 124 is the one located at a minimum distance, according to the distance d, from the car journey record 114 among the car journey records 116, 124, 126 and 128.

[0058] For example, the calculation of the distance d, according to one embodiment, is illustrated above by that of the distance between the car journey recording 114 and the car journey recording 126, which is written, with reference to [Fig.2]:

[0059] d(l 14, 126) = d2(LSTl 14, LST126) + d2(LENl 14, LEN126) + diff (TST114, TST126) + diff (TEN114, TEN126) + dLevenshtein (conc(lPG114, 2PG114, 3PG114, 4PG114), conc(lPG126, 2PG126, 3PG126)) + deuclid ((KIL114, SPE114), (KIL126, SPE126)) + dh((MET114, TRAF114), (MET126, TRAF126)), where: • LST114 and LST126 are the geographic starting locations of journey records 114 and 126, respectively. Thus, LST114 is the geographic location of the starting point T_LST114 of journey T_114, and LST126 is the geographic location of the starting point T_LST126 of journey T_126. • LENI 14 and LEN126 are the geographical end locations of journey records 114 and 126 respectively. Thus, LENI 14 is the geographical location of the end T_LENI 14 of journey T_114 and LEN126 is the geographical location of the end T_LEN126 of journey T_126. • d2 is a distance according to Haversine's formula, • TST114 and TST126 are the respective start times of the journey for the train route records 114 and 126. Thus, TST114 is the time at which vehicle 200 is at the beginning T_LST114 of route T_114 and TST126 is the time at which vehicle 300 is at the beginning T_LST126 of route T_126. • TEN114 and TEN126 are the end times of journey records 114 and 126 respectively. Thus, TEN114 is the time when vehicle 200 is at the end T_LEN 114 of journey T_114 and TEN126 is the time when vehicle 300 is at the end T_LENI 14 of journey T_126, • TST114, TST126, TEN114 and TEN126 are, for example, expressed in so-called "Unix" time, • diff being the difference, • 1PG114, 2PG114, 3PG114, 4PG114 being coordinates, represented in decimal degrees, of geographical locations, of points on the route of the route recording 114. Thus, 1PG114, 2PG114, 3PG114, 4PG114 are coordinates, represented in decimal degrees, respectively of points T_1PG114, T_2PG114, T_3PG114 and T_4PG114 of the route T_114, • 1PG126, 2PG126, 3PG126 being coordinates, represented in degrees decimals, of geographical locations, of points of journey of journey record 126. Thus, 1PG126, 2PG126, 3PG126, are coordinates, represented in decimal degrees, respectively of the points T_1PG126, T_2PG126 and T_3PG126 of journey T_126. • dLevenshtein being the Levenshtein distance. • conc being the string concatenation function, • KIL114, KIL126 are the mileage traveled respectively in trip records 114 and 126, KIL114, KIL126 are thus the mileage traveled during trips T_114 and T_126 respectively. • SPE114, SPE126 are the number of accelerations, brakings and turns abrupt respectively in journey recordings 114 and 126, and thus respectively of vehicle 200 and vehicle 300 during journeys T_114 and T_126. • deuclid is the Euclidean distance. (KIL114, SPE114) and (KIL126, SPE126) are points with numerical coordinates. • MET114 and MET126 are the weather conditions in respectively the trip recordings 114 and 126, represented in binary form, and thus respectively of trips T_114 and T_126. • TRAF114 and TRAF126 are the road traffic conditions respectively of journey recordings 114 and 126, represented in binary form, and thus respectively of journeys T_114 and T_126. • dh is the so-called "Hamming distance". (MET 114, TRAF114) and (MET 126, TRAF126) are words

[0060] In other words, d(l 14, 126) is obtained from d2(LSTl 14, LST126), d2(LENl 14, LEN126), diff (TST114, TST126), diff (TEN114, TEN126), dLevenshtein (conc(lPG114, 2PG114, 3PG114, 4PG114), conc(lPG126, 2PG126, 3PG126)), deuclid ((KIL114, SPE114), (KIL126, SPE126)), and / or dh((MET114, TRAF114), (MET126, TRAF126)).

[0061] [Fig. 1], to facilitate reading the figure, the server 100 stores only two trip lists 110 and 120 for two vehicles 200 and 300, each containing no more than three trip records. In practice, such a server could contain thousands, or even millions, of lists, each containing hundreds or even thousands of trip records.

Claims

Claims

1. Storage method characterized in that it comprises the following steps: • Reception (S30), via a radiofrequency communication network (400), from a first motor vehicle (200), of a first motor vehicle journey record (114), • For each motor vehicle journey record (116, 124, 126, 128) of a plurality of motor vehicle journey records: a step of calculating a first distance of said each motor vehicle journey record (116, 124, 126, 128) relative to the first motor vehicle journey record (114), • Selection (S40) of a second motor vehicle journey record (124) from among the plurality of motor vehicle journey records such that the first distance is a minimum distance, the second motor vehicle journey record (124) comprising an identifier (123),• Storing (S50) a copy of the identifier (123') in a list (110) of records (110) of automobile journeys of the first vehicle (200).,

2. Storage method according to the preceding claim comprising a step of verifying whether the minimum distance is less than a threshold, an implementation of the storage step (S50) of a copy (123') of the identifier (123) being conditioned on the minimum distance being less than the threshold.

3. A storage method according to any one of the preceding claims, wherein: • The first automobile journey record (114) comprises a first geographical location (LST114), the first geographical location (LST114) being a geographical location of the start of the journey, and • For each automobile journey record (116, 124, 126, 128), said each automobile journey record (126) comprises a second geographical location (LST126), the second geographic location (LST126) being a geographic location of the start of the journey, and • For each automobile journey record (116, 124, 126, 128) said first distance is calculated, during the calculation step, from a second distance between the first geographical location (LST114) and the second geographical location (LST126).

4. A storage method according to any preceding claim, wherein: • The first automobile trip record (114) comprises a third geographic location (LST114), the third geographic location (LST114) being an end-of-trip geographic location, and • For each automobile trip record (116, 124, 126, 128), said each automobile trip record (126) comprises a fourth geographic location (LST126), the fourth geographic location (LST126) being an end-of-trip geographic location, and • For each automobile journey record (116, 124, 126, 128) said first distance is calculated, during the calculation step, from a third distance between the third geographical location (LST114) and the fourth geographical location (LST126).

5. A storage method according to any preceding claim, wherein; • The first automobile trip record (114) includes a first time (TST114), the first time (TST114) being a trip start time, and • For each automobile trip record (116, 124, 126, 128), said each automobile trip record (126) comprises a second time (TST126), the second time (TST126) being a trip start time, and • For each automobile journey record (116, 124, 126, 128) said first distance is calculated, during the step calculation, from a difference between the first hour (TST114) and the second hour (TST126).

6.

7. A storage method according to any preceding claim, wherein: The first automobile trip record (114) includes a third time (TEN114), the third time (TEN114) being a trip end time, and For each automobile trip record (116, 124, 126, 128), said each automobile trip record (126) includes a fourth time (TEN126), the fourth time (TEN126) being a trip end time, and For each automobile journey record (116, 124, 126, 128) said first distance is calculated, during the calculation step, from a difference between the third hour (TEN114) and the fourth hour (TEN126). A storage method according to any preceding claim wherein: The first automobile trip record (114) comprises fifth geographical locations (1PG114, 2PG114, 3PG114, 4PG114), the fifth geographical locations (1PG114, 2PG114, 3PG114, 4PG114) being geographical locations of journey points, and For each automobile trip record (116, 124, 126, 128), said each automobile trip record (126) comprises sixth geographical locations (1PG126, 2PG126, 3PG126), the sixth geographical locations (1PG126, 2PG126, 3PG126) being geographical locations of journey points, and For each automobile journey record (116, 124, 126, 128) said first distance is calculated, during the calculation step, from a fourth distance between a concatenation of coordinates, expressed in decimal degrees, of the fifth geographical locations (1PG114, 2PG114, 3PG114, 4PG114) and a concatenation of coordinates, expressed in decimal degrees, of the sixth geographical locations (1PG126, 2PG126, 3PG126).

8. Computer program comprising instructions, executable by a microprocessor or a microcontroller, for implementing the method according to any one of claims 1 to 7, when executed by the microprocessor or the microcontroller.

9. Electronic device (110) configured to implement the steps of the method according to any one of claims 1 to 7.

Images