Method, apparatus and readable storage medium for simplifying vehicle driving data

By marking and simplifying vehicle driving data, identifying changes in roads and electronic fences, and calculating driving time, the problem of high computing pressure and low efficiency of cloud servers is solved, and efficient and accurate vehicle trajectory and mileage calculation is achieved.

CN118097815BActive Publication Date: 2026-07-21TUS CLOUD CONTROL (BEIJING) TECH LTD

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
TUS CLOUD CONTROL (BEIJING) TECH LTD
Filing Date
2024-01-08
Publication Date
2026-07-21

AI Technical Summary

Technical Problem

In existing technologies, the large amount of driving data reported by vehicles leads to high computing pressure and low computing efficiency on cloud servers.

Method used

By acquiring driving data reported by vehicles, marking it according to location information and timestamp information, identifying data on changes in road connectivity and geofence location relationships, determining the latest timestamp data, calculating driving time, and simplifying the marked data into simplified vehicle data.

Benefits of technology

The amount of simplified data was reduced, which improved the calculation efficiency of vehicle trajectory and mileage, and ensured the accuracy of the calculation results.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118097815B_ABST
    Figure CN118097815B_ABST
Patent Text Reader

Abstract

The application discloses a method, device and readable storage medium for simplifying vehicle driving data, the method comprising: acquiring a plurality of driving data reported by a vehicle; wherein the driving data comprises position information, vehicle speed information and timestamp information; determining driving data representing changes in road connection relationship in each driving data according to the position information of the driving data, marking the driving data to obtain first marked data; determining driving data representing changes in position relationship with an electronic fence in each driving data according to the position information of the driving data, marking the driving data to obtain second marked data; determining driving data with the latest timestamp information in each marked driving data; determining a driving time length required for the vehicle to travel a preset distance according to the vehicle speed information of the driving data with the latest timestamp information; marking the driving data according to the driving time length to obtain third marked data; and determining the first marked data, the second marked data and the third marked data as simplified data of the vehicle.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This specification relates to the field of intelligent driving technology for vehicles, and in particular to a method, apparatus, and readable storage medium for simplifying vehicle driving data. Background Technology

[0002] Currently, vehicles can report a large amount of driving data (such as longitude, latitude, timestamps, speed, and heading angle) to cloud servers. The cloud servers can then calculate the vehicle's driving status (such as its trajectory and mileage) based on the received data. Because vehicles report driving data frequently, the cloud servers receive a large amount of data. Existing cloud servers use all received reported data to calculate the vehicle's driving status, which not only creates significant computational pressure but also reduces computational efficiency. Summary of the Invention

[0003] In view of this, embodiments of this specification provide a method, apparatus, and readable storage medium for simplifying vehicle driving data, in order to solve the technical problem of low computational efficiency in the prior art.

[0004] The embodiments in this specification adopt the following technical solutions:

[0005] This specification provides an embodiment of a method for simplifying vehicle driving data, including:

[0006] Acquire multiple driving data reported by the vehicle; wherein the driving data includes location information, vehicle speed information and timestamp information;

[0007] Based on the location information of the driving data, determine the driving data that indicates a change in road connection relationship, mark it, and obtain the first marked data;

[0008] Based on the location information of the driving data, identify the driving data that indicates a change in the relationship with the electronic fence location, mark them, and obtain the second marked data;

[0009] Determine the driving data with the latest timestamp among all the marked driving data;

[0010] The driving time required for the vehicle to travel the preset distance is determined based on the vehicle speed information of the latest driving data in the timestamp information;

[0011] The driving data is marked according to the driving time to obtain the third marked data;

[0012] The first marker data, the second marker data, and the third marker data are determined as simplified data for the vehicle.

[0013] Optionally, the step of determining and marking driving data indicating changes in road connectivity based on the location information of the driving data specifically includes:

[0014] Based on the location information of the driving data, determine whether two adjacent driving data with timestamp information are in different road connection relationships;

[0015] If so, mark the driving data with the later timestamp among two adjacent driving data with the timestamp information.

[0016] Optionally, the step of determining and marking driving data that indicates a change in the relationship with the electronic fence's location based on the location information of the driving data specifically includes:

[0017] Based on the location information of the driving data, determine whether two adjacent driving data points with timestamp information are both inside or outside the electronic fence;

[0018] If not, the driving data is marked according to the driving data with the later timestamp information among two adjacent driving data.

[0019] Optionally, marking the driving data according to the driving time specifically includes:

[0020] The first frame of driving data after the driving duration is determined based on the timestamp information of each driving data, and then marked.

[0021] Optionally, after marking the driving data according to the driving time, the method further includes:

[0022] Calculate the time difference between the latest timestamp in each of the driving data and the current time.

[0023] If the time difference is greater than or equal to the first preset threshold, the driving data corresponding to the latest timestamp information is marked.

[0024] Optionally, after determining the driving data with the latest timestamp information among the marked driving data, the method further includes:

[0025] Calculate the positional distance between the latest timestamp of each marked driving data and the driving data at the current moment;

[0026] When the position spacing is greater than the second preset threshold, the driving data at the current moment is marked.

[0027] This specification also provides an embodiment of a device for simplifying vehicle driving data, including:

[0028] The data acquisition module is used to acquire multiple driving data reported by the vehicle; wherein the driving data includes location information, vehicle speed information and timestamp information;

[0029] The first marking module is used to determine, based on the location information of the driving data, the driving data that indicates a change in road connection relationship, and mark it to obtain the first marked data;

[0030] The second marking module is used to determine, based on the location information of the driving data, the driving data that indicates a change in the relationship with the electronic fence position, and mark them to obtain the second marking data;

[0031] The data determination module is used to determine the latest timestamp information among the marked driving data.

[0032] The duration calculation module is used to determine the driving time required for the vehicle to travel a preset distance based on the vehicle speed information of the latest driving data in the timestamp information;

[0033] The third marking module is used to mark the driving data according to the driving time to obtain the third marked data;

[0034] A data simplification module is used to use the first marker data, the second marker data, and the third marker data as simplified data for the vehicle.

[0035] This specification also provides a non-volatile computer-readable storage medium storing a machine-executable program and / or instructions that, when executed by a processor, implement the method for simplifying vehicle driving data according to any of the preceding claims.

[0036] This specification also provides a computer device including a memory and a processor, wherein the memory stores a control program, which, when executed by the processor, is used to implement the method for simplifying vehicle driving data according to any of the preceding claims.

[0037] The above-described at least one technical solution adopted in the embodiments of this specification can achieve the following beneficial effects:

[0038] The system acquires multiple driving data points reported by the vehicle; based on the location information of the driving data, it identifies driving data points indicating changes in road connectivity and marks them to obtain first marked data; based on the location information of the driving data, it identifies driving data points indicating changes in their relationship with the electronic fence and marks them to obtain second marked data; it identifies the driving data point with the latest timestamp among the marked driving data; it determines the driving time required for the vehicle to travel a preset distance based on the speed information of the driving data with the latest timestamp; it marks the driving data based on the driving time to obtain third marked data; the first marked data, second marked data, and third marked data are used as simplified data for the vehicle. In this embodiment, the number of simplified data points is significantly less than the number of driving data points, which helps to improve the calculation efficiency of vehicle trajectory or mileage and ensures the accuracy of the calculation results. Attached Figure Description

[0039] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings:

[0040] Figure 1 This is a flowchart of a method for simplifying vehicle driving data in one embodiment of this specification;

[0041] Figure 2 This is a flowchart of a method for simplifying vehicle driving data in one embodiment of this specification;

[0042] Figure 3 This is a schematic diagram of the structure of a device for simplifying vehicle driving data in one embodiment of this specification;

[0043] Figure 4 This is a schematic diagram of a computer device in one embodiment of this specification. Detailed Implementation

[0044] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly and completely described below in conjunction with specific embodiments and corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0045] The technical solutions provided in the various embodiments of this specification are described in detail below with reference to the accompanying drawings.

[0046] Figure 1This is a flowchart illustrating a method for simplifying vehicle driving data in one embodiment of this specification. This method can be applied to a cloud server, which can communicate with the vehicle to obtain the driving data reported by the vehicle. See also... Figure 1 The method is shown below and may include the following steps:

[0047] Step S102: Obtain multiple driving data reported by the vehicle; the driving data may include location information, vehicle speed information and timestamp information;

[0048] In this step, the acquired driving data can be real-time driving data reported by the vehicle during operation, or historical driving data stored by the vehicle for a specific time period. Generally, the vehicle reports driving data at a frequency of 10Hz. Location information can be represented using longitude and latitude. Driving data may also include information such as heading angle and elevation value.

[0049] Step S104: Based on the location information of the driving data, determine the driving data that indicates a change in road connection relationship in each driving data, mark it, and obtain the first marked data;

[0050] In this step, when the road connections of a vehicle change, the vehicle's actual trajectory may change direction. To ensure that the simplified data accurately reflects the vehicle's actual trajectory, it is necessary to identify and mark the driving data that indicates changes in road connections based on the location information of the driving data. If the road connection in the driving data is empty, then the driving data is not within the high-precision map it relies on and can be ignored. Road connections can be used to distinguish different road segments, that is, to determine the boundaries of road segments.

[0051] Step S106: Based on the location information of the driving data, determine the driving data that indicates a change in the relationship with the electronic fence location, mark it, and obtain the second marked data;

[0052] In this step, the geofence can reflect the vehicle's mileage. However, the vehicle may not always remain within the geofence during its journey; it may wander outside of it. Directly calculating the vehicle's mileage or trajectory based solely on the geofence can easily lead to errors. Therefore, identifying and marking the driving data points that indicate changes in their position relative to the geofence, based on the location information of the driving data, facilitates more accurate calculation of the vehicle's mileage and trajectory.

[0053] Step S108: Determine the driving data with the latest timestamp information among the marked driving data;

[0054] In this step, those skilled in the art can understand the specific meaning of the latest timestamp information. For example, if timestamp information one is 1:01:02, timestamp information two is 1:01:03, and timestamp information three is 1:01:04, then the latest timestamp information is timestamp information three. It is understandable that because driving data is continuously being marked, the latest timestamp information among the marked driving data is dynamically changing. That is, after executing step S106 or step S104, the latest timestamp information will change.

[0055] Step S110: Determine the driving time required for the vehicle to travel the preset distance based on the vehicle speed information of the latest driving data in the timestamp information;

[0056] In this step, the preset distance can be set, for example, any value between 10 and 30 meters, with 20 meters being preferred. If the obtained driving time is greater than the preset time or the vehicle speed information is zero, the preset time can be used as the driving time. The size of the preset time can be set, for example, to 5 seconds. This method can avoid the driving time being too long and the obtained simplified data being too short.

[0057] Step S112: Mark the driving data according to the driving time to obtain the third marked data;

[0058] In this step, the driving data is marked according to the driving time, which can also be understood as marking the driving data once at each driving time interval. The above steps do not have a specific order. Generally, to more accurately reflect the vehicle's driving trajectory and mileage, the first frame of driving data reported by the vehicle can also be marked. Before marking the driving data, it can be determined whether the driving data has already been marked; if it has already been marked, marking can be stopped to avoid duplicate marking.

[0059] Step S114: Determine the first marker data, the second marker data, and the third marker data as simplified data for the vehicle.

[0060] In this embodiment, multiple driving data reported by the vehicle are acquired; driving data indicating changes in road connectivity are identified based on the location information of the driving data and marked to obtain first marked data; driving data indicating changes in the relationship with the electronic fence are identified based on the location information of the driving data and marked to obtain second marked data; the driving data with the latest timestamp information among the marked driving data is identified; the driving time required for the vehicle to travel a preset distance is determined based on the vehicle speed information of the driving data with the latest timestamp information; the driving data is marked based on the driving time to obtain third marked data; the first marked data, the second marked data, and the third marked data are determined as simplified data of the vehicle. In this embodiment, the number of simplified data is significantly less than the number of driving data, which is beneficial to improving the calculation efficiency of vehicle trajectory or mileage and ensuring the accuracy of the calculation results.

[0061] In the embodiments of this specification, driving data that indicates changes in road connectivity is determined based on the location information of the driving data and marked accordingly. Specifically, this may include:

[0062] Determine whether two adjacent timestamp data points are in different road connections based on the location information of the driving data.

[0063] If so, mark the driving data with the later timestamp among two adjacent driving data.

[0064] In this embodiment, if two adjacent timestamp data points are in different road connection relationships, it indicates that the road connection relationship of the vehicle has changed. Marking the driving data with the later timestamp among the two adjacent timestamp data points—that is, marking the driving data point where the vehicle first enters the new road connection relationship—helps ensure that the simplified data accurately reflects the vehicle's trajectory and mileage. For example, if two adjacent timestamp data points are in road connection relationship 1 and road connection relationship 2 respectively, then the driving data point with the later timestamp can be marked; of course, both driving data points can also be marked.

[0065] In the embodiments of this specification, driving data that indicates a change in the relationship with the electronic fence's location is determined based on the location information of the driving data and marked. Specifically, this may include:

[0066] Based on the location information of the driving data, determine whether two adjacent driving data points with timestamp information are both inside or outside the electronic fence;

[0067] If not, the driving data is marked according to the driving data with the later timestamp information among two adjacent driving data.

[0068] In this embodiment, if two adjacent timestamp data points are not both inside or outside the electronic fence (i.e., one is inside and the other outside), it indicates that the vehicle's positional relationship with the electronic fence has changed. Marking the driving data based on the later timestamp of two adjacent timestamp data points helps ensure that the simplified data accurately reflects the vehicle's trajectory and mileage.

[0069] Figure 2 This is a flowchart illustrating a method for simplifying vehicle driving data in one embodiment of this specification. In this embodiment, driving data is marked based on the driving data with the later timestamp between two adjacent timestamp data sets. Specifically, this may include:

[0070] Step S202: Select the driving data with the later timestamp from two adjacent driving data sets as the target data;

[0071] Step S204: Using the timestamp information of the target data as the selected node, sequentially obtain the continuous driving data of multiple timestamp information after the selected node;

[0072] Step S206: Determine whether the target data and the continuous driving data with multiple timestamps are both inside or outside the electronic fence;

[0073] Step S208: If yes, determine whether there is marked driving data in the target data and the continuous driving data of multiple timestamp information;

[0074] Step S210: If it exists, mark the first frame of driving data that is located after the marked driving data in the continuous driving data of the target data and multiple timestamp information;

[0075] Step S212: If it does not exist, mark the target data.

[0076] In this embodiment, if part of the target data and multiple consecutive timestamp information of driving data are inside the electronic fence and the other part are outside the electronic fence, then no marking is required. Assume that timestamp information one is 1:01:02, timestamp information two is 1:01:03, timestamp information three is 1:01:04, timestamp information four is 1:01:05, timestamp information five is 1:01:06, timestamp information six is ​​1:01:07, and timestamp information seven is 1:01:08. Timestamp information one and timestamp information two are adjacent timestamps. The driving data corresponding to timestamp information one and timestamp information two are one inside the electronic fence and the other outside the electronic fence. The driving data corresponding to timestamp information two is selected as the target data. Using the timestamp information of the target data as the selection node, the consecutive driving data of multiple timestamp information after the selected node are obtained sequentially. For example, the driving data corresponding to timestamp information three to timestamp information six can be obtained, which means four more driving data can be obtained. The system determines whether the target data and consecutive driving data with multiple timestamps are both inside or outside the electronic fence. If so, it indicates that the vehicle has indeed entered or left the electronic fence. By judging consecutive driving data with multiple timestamps, the randomness of the judgment result can be reduced, and a more accurate positional relationship between the vehicle and the electronic fence can be obtained. If there is marked driving data in the consecutive driving data with multiple timestamps, the first frame of driving data following the marked driving data in the consecutive driving data with multiple timestamps is marked (for example, if the driving data corresponding to timestamp four has been marked, then the driving data corresponding to timestamp five is marked); if there is no marked driving data in the consecutive driving data with multiple timestamps, the target data is marked, which can accurately record the positional relationship between the vehicle and the electronic fence.

[0077] In the embodiments of this specification, the marking of driving data according to driving time may specifically include:

[0078] The first frame of driving data after determining the driving time based on the timestamp information of each driving data is then marked.

[0079] In this embodiment, the first frame of driving data after determining the driving time based on the timestamp information of each driving data is marked. That is, a driving data is marked every driving time interval, which can avoid the situation of too little simplified data.

[0080] In the embodiments of this specification, after marking the driving data according to the driving time, the following may also be included:

[0081] Calculate the time difference between the latest timestamp in each driving data set and the current time.

[0082] If the time difference is greater than or equal to the first preset threshold, the driving data corresponding to the latest timestamp information will be marked.

[0083] In this embodiment, the time difference between the latest timestamp in each driving data set and the current time is calculated. If the time difference is greater than or equal to a first preset threshold, it indicates that it is no longer possible to obtain driving data reported by the vehicle. The driving data corresponding to the latest timestamp needs to be marked, i.e., the last driving data is marked, to accurately reflect the vehicle's trajectory and mileage. The first preset threshold can be set, for example, to any value between 3 and 6 seconds, such as 5 seconds. The current time information can be obtained from a cloud server or from the vehicle. This embodiment implements data marking based on fixed time intervals.

[0084] In the embodiments of this specification, calculating the time difference between the latest timestamp in each driving data set and the current time can specifically include:

[0085] The time difference between the latest timestamp in each driving data and the current time is calculated according to a preset time interval.

[0086] In this embodiment, the preset time interval can be set, for example, to any value between 2 and 5 minutes, such as 3 minutes. This embodiment can be executed through a scheduled task. As described in the previous embodiment, if the time difference is greater than or equal to the first preset threshold, it indicates that it is no longer possible to obtain the driving data reported by the vehicle. At this time, the vehicle is generally in a turned-off state. Considering that the vehicle will not be turned off frequently, calculating the time difference between the latest timestamp information in each driving data and the current time information according to the preset time interval can appropriately reduce the number of calculations and reduce the computational burden.

[0087] In the embodiments of this specification, after determining the driving data with the latest timestamp information among the marked driving data, the method may further include:

[0088] Calculate the positional distance between the latest timestamp of each marked driving data and the driving data at the current moment;

[0089] When the position spacing is greater than the second preset threshold, the driving data at the current moment is marked.

[0090] In this embodiment, the positional distance between the latest timestamp of each marked driving data and the driving data at the current moment is calculated. When the positional distance is greater than or equal to a second preset threshold, the driving data at the current moment is marked to avoid excessively large positional distances between marked driving data, so as to accurately reflect the vehicle's trajectory and mileage. This embodiment implements data marking based on a fixed distance.

[0091] Figure 3 This is a schematic diagram of a device for simplifying vehicle driving data according to one embodiment of this specification. The device for simplifying vehicle driving data may include a data acquisition module 601, a first marking module 602, a second marking module 603, a data determination module 604, a duration calculation module 605, a third marking module 606, and a data simplification module 607.

[0092] The data acquisition module 601 is used to acquire multiple driving data reported by the vehicle; wherein the driving data includes location information, vehicle speed information and timestamp information;

[0093] The first marking module 602 is used to determine, based on the location information of the driving data, the driving data that indicates a change in road connection relationship, and mark it to obtain the first marking data;

[0094] The second marking module 603 is used to determine, based on the location information of the driving data, the driving data that indicates a change in the relationship with the electronic fence position, and mark them to obtain the second marking data;

[0095] The data determination module 604 is used to determine the driving data with the latest timestamp information among the marked driving data;

[0096] The duration calculation module 605 is used to determine the driving time required for the vehicle to travel a preset distance based on the vehicle speed information of the latest driving data in the timestamp information;

[0097] The third marking module 606 is used to mark the driving data according to the driving time to obtain the third marking data;

[0098] The data simplification module 607 is used to use the first marker data, the second marker data, and the third marker data as simplified data for the vehicle.

[0099] Figure 4 This is a schematic diagram of a computer device according to one embodiment of this specification. Based on the same concept, the present invention also provides a computer device 800, which may include a memory 830 and a processor 810. The memory 830 stores a control program 820, which, when executed by the processor 810, is used to implement the method for simplifying vehicle driving data in any of the above embodiments.

[0100] Based on the same concept, the present invention also provides a non-volatile computer-readable storage medium having a machine-executable program and / or instructions stored thereon, wherein the machine-executable program and / or instructions, when executed by a processor, implement the method for simplifying vehicle driving data according to any of the above embodiments.

[0101] It should be noted that the apparatus provided in this application corresponds one-to-one with the method provided in this application. Therefore, the apparatus also has similar beneficial technical effects as the method. Since the beneficial technical effects of the method have been described in detail above, the beneficial technical effects of the apparatus will not be repeated here. The various embodiments described above in this application can be combined arbitrarily.

[0102] In the 1990s, improvements to a technology could be clearly distinguished as either hardware improvements (e.g., improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the methodology). However, with technological advancements, many methodological improvements today can be considered direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved methodology into the hardware circuit. Therefore, it cannot be said that a methodological improvement cannot be implemented using a hardware physical module. For example, a Programmable Logic Device (PLD) (e.g., a Field Programmable Gate Array (FPGA)) is such an integrated circuit whose logic function is determined by the user programming the device. Designers can program a digital system themselves to "integrate" it onto a PLD, without needing chip manufacturers to design and manufacture dedicated integrated circuit chips. Furthermore, nowadays, instead of manually manufacturing integrated circuit chips, this programming is mostly implemented using "logic compiler" software. Similar to the software compiler used in program development, the original code before compilation must be written in a specific programming language, called a Hardware Description Language (HDL). There are many HDLs, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, and RHDL (Ruby Hardware Description Language). Currently, the most commonly used are VHDL (Very-High-Speed ​​Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should understand that by simply performing some logic programming on the method flow using one of these hardware description languages ​​and programming it into an integrated circuit, the hardware circuit implementing the logical method flow can be easily obtained.

[0103] The controller can be implemented in any suitable manner. For example, it can take the form of a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro)processor, logic gates, switches, application-specific integrated circuits (ASICs), programmable logic controllers, and embedded microcontrollers. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicon Labs C8051F320. A memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art will also recognize that, in addition to implementing the controller in purely computer-readable program code form, the same functionality can be achieved by logically programming the method steps to make the controller take the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers. Therefore, such a controller can be considered a hardware component, and the means included therein for implementing various functions can also be considered as structures within the hardware component. Alternatively, the means for implementing various functions can be considered as both software modules implementing the method and structures within the hardware component.

[0104] The systems, devices, modules, or units described in the above embodiments can be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, a computer can be, for example, a personal computer, laptop computer, cellular phone, camera phone, smartphone, personal digital assistant, media player, navigation device, email device, game console, tablet computer, wearable device, or any combination of these devices.

[0105] For ease of description, the above devices are described separately by function as various units. Of course, in implementing this application, the functions of each unit can be implemented in one or more software and / or hardware.

[0106] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0107] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0108] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0109] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0110] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0111] Memory may include non-persistent storage in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0112] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0113] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0114] This application can be described in the general context of computer-executable instructions, such as program modules, that are executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform a specific task or implement a specific abstract data type. This application can also be practiced in distributed computing environments where tasks are performed by remote processing devices connected via a communication network. In distributed computing environments, program modules can reside in local and remote computer storage media, including storage devices.

[0115] The various embodiments in this specification are described in a progressive manner. Similar or identical parts between embodiments can be referred to interchangeably. Each embodiment focuses on describing the differences from other embodiments. In particular, the system embodiments are basically similar to the method embodiments, so the description is relatively simple; relevant parts can be referred to the descriptions in the method embodiments.

[0116] The above description is merely an embodiment of this application and is not intended to limit the scope of this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of the claims of this application.

Claims

1. A method for simplifying vehicle driving data, characterized in that, include: Obtain multiple driving data points reported by the vehicle; The driving data includes location information, vehicle speed information, and timestamp information; Based on the location information of the driving data, determine the driving data that indicates a change in road connection relationship, mark it, and obtain the first marked data; Based on the location information of the driving data, identify the driving data that indicates a change in the relationship with the electronic fence location, mark them, and obtain the second marked data; Determine the driving data with the latest timestamp among all the marked driving data; The driving time required for the vehicle to travel the preset distance is determined based on the vehicle speed information of the latest driving data in the timestamp information; The driving data is marked according to the driving time to obtain the third marked data; The first marker data, the second marker data, and the third marker data are determined as simplified data for the vehicle.

2. The method according to claim 1, characterized in that, The step of determining and marking driving data that indicates changes in road connectivity based on the location information of the driving data specifically includes: Based on the location information of the driving data, determine whether two adjacent driving data with timestamp information are in different road connection relationships; If so, mark the driving data with the later timestamp among two adjacent driving data with the timestamp information.

3. The method according to claim 1, characterized in that, The step of determining and marking driving data that indicates a change in the relationship with the electronic fence's location based on the location information of the driving data specifically includes: Based on the location information of the driving data, determine whether two adjacent driving data points with timestamp information are both inside or outside the electronic fence; If not, the driving data is marked according to the driving data with the later timestamp information among two adjacent driving data.

4. The method according to claim 1, characterized in that, The step of marking the driving data according to the driving time specifically includes: The first frame of driving data after the driving duration is determined based on the timestamp information of each driving data, and then marked.

5. The method according to claim 1, characterized in that, After marking the driving data according to the driving time, the method further includes: Calculate the time difference between the latest timestamp in each of the driving data and the current time. If the time difference is greater than or equal to the first preset threshold, the driving data corresponding to the latest timestamp information is marked.

6. The method according to claim 5, characterized in that, The calculation of the time difference between the latest timestamp in each of the driving data and the current time specifically includes: The time difference between the latest timestamp in each of the driving data and the current time is calculated according to a preset time interval.

7. The method according to claim 1, characterized in that, After determining the driving data with the latest timestamp information among the marked driving data, the method further includes: Calculate the positional distance between the latest timestamp of each marked driving data and the driving data at the current moment; When the position spacing is greater than the second preset threshold, the driving data at the current moment is marked.

8. A device for simplifying vehicle driving data, characterized in that, include: The data acquisition module is used to acquire multiple driving data reported by the vehicle; The driving data includes location information, vehicle speed information, and timestamp information; The first marking module is used to determine, based on the location information of the driving data, the driving data that indicates a change in road connection relationship, and mark it to obtain the first marked data; The second marking module is used to determine, based on the location information of the driving data, the driving data that indicates a change in the relationship with the electronic fence position, and mark them to obtain the second marking data; The data determination module is used to determine the latest timestamp information among the marked driving data. The duration calculation module is used to determine the driving time required for the vehicle to travel a preset distance based on the vehicle speed information of the latest driving data in the timestamp information; The third marking module is used to mark the driving data according to the driving time to obtain the third marked data; A data simplification module is used to use the first marker data, the second marker data, and the third marker data as simplified data for the vehicle.

9. A non-volatile computer-readable storage medium having stored thereon a machine-executable program and / or instructions that, when executed by a processor, implement the method for simplifying vehicle driving data according to any one of claims 1 to 7.

10. A computer device comprising a memory and a processor, the memory storing a control program and / or instructions, which, when executed by the processor, are used to implement the method for simplifying vehicle driving data according to any one of claims 1 to 7.