Route processing method and device and storage medium

Abstract

The invention provides a route processing method and device and a storage medium. Comprising the steps that coordinate information of a to-be-processed route is obtained, a route library stored in a vehicle control unit is obtained, and the route library comprises a first preset number of fixed routes; performing identification processing on the coordinate information so as to determine a matched route of the to-be-processed route in a first preset number of fixed routes; acquiring gradient information of a to-be-processed route; performing auxiliary correction processing on the matched route according to the gradient information to determine whether the matched route is matched with the to-be-processed route; and if it is determined that the matched route is matched with the to-be-processed route, determining an accelerator strategy for the to-be-processed route according to the matched route and the gradient information. The processing accuracy and the processing efficiency of the route are improved.

Description

Technical Field

[0001] This application relates to the field of intelligent driving technology, and particularly to a method, device, and storage medium for processing routes. Background Art

[0002] Route recognition aims to determine and optimize the path from one location to another, and the application scenarios include route navigation, logistics transportation, public transportation, and emergency response.

[0003] In the prior art, route recognition relies on a large vehicle networking data set platform to collect and process the GPS (Global Positioning System) information of vehicles and other relevant information for calculation to provide or optimize the route recognition situation. However, relying on the large vehicle networking data set platform for calculation will increase latency and data transmission costs, causing a large consumption of computing resources and costs, and lacking the correction of key indicators, resulting in low-quality travel routes.

[0004] Based on this, in the prior art, there are problems of low efficiency in processing routes and poor accuracy of the processing results of routes. Summary of the Invention

[0005] Embodiments of this application provide a method, device, and storage medium for processing routes, so as to achieve the effect of improving the processing efficiency and accuracy of routes.

[0006] In a first aspect, embodiments of this application provide a method for processing a route, including:

[0007] Obtain the coordinate information of the route to be processed, and obtain the route library stored in the vehicle control unit, where the route library includes a first preset number of fixed routes;

[0008] Perform recognition processing on the coordinate information to determine a matching route of the route to be processed among the first preset number of fixed routes;

[0009] Obtain the slope information of the route to be processed;

[0010] According to the slope information, perform auxiliary correction processing on the matching route to determine whether the matching route matches the route to be processed;

[0011] If it is determined that the matching route matches the route to be processed, then determine the throttle strategy for the route to be processed according to the matching route and the slope information.

[0012] In a possible implementation manner, performing recognition processing on the coordinate information to determine a matching route of the route to be processed among the first preset number of fixed routes includes:

[0013] Perform map Euclidean distance matching processing on the coordinate information according to a first preset number of fixed routes, and determine the matching route of the route to be processed in combination with a first preset matching similarity.

[0014] In a possible implementation manner, performing identification processing on the coordinate information to determine the matching route of the route to be processed among a first preset number of fixed routes includes:

[0015] Perform calculation processing of the dynamic time warping algorithm on the coordinate information according to a first preset number of fixed routes, and determine the matching route of the route to be processed in combination with a second preset matching similarity.

[0016] In a possible implementation manner, before obtaining the coordinate information of the route to be processed and obtaining the route library stored in the vehicle control unit, it further includes:

[0017] Obtain multiple trip data;

[0018] Determine multiple valid routes according to the multiple trip data;

[0019] Perform sorting and classification processing on the multiple valid routes to obtain a first preset number of fixed routes and a second preset number of pending routes;

[0020] Store the first preset number of fixed routes and the second preset number of pending routes in the route library of the vehicle control unit.

[0021] In a possible implementation manner, determining multiple valid routes according to the multiple trip data includes:

[0022] Determine the starting points and ending points of multiple trips according to the multiple trip data;

[0023] Determine multiple routes to be screened according to the starting points and ending points of multiple trips;

[0024] Perform short trip filtering processing and / or interrupted trip filtering processing on the multiple routes to be screened to obtain multiple valid routes.

[0025] In a possible implementation manner, the trip data includes the starting duration and the shutting-down duration, and / or the trip data includes the starting global positioning system discrete points and the shutting-down global positioning system discrete points.

[0026] In a possible implementation manner, performing sorting and classification processing on the multiple valid routes includes:

[0027] Determine the priority corresponding to the valid route according to the number of driving times corresponding to the valid route;

[0028] Sort multiple valid routes according to the priorities corresponding to the respective valid routes to obtain the order of each valid route;

[0029] Classify multiple valid routes according to the order of each valid route.

[0030] In a possible implementation manner, after determining that the matching route matches the route to be processed and then determining the throttle strategy for the route to be processed according to the matching route and the slope information, it further includes:

[0031] Update the route library according to the matching route of the route to be processed.

[0032] In a second aspect, an embodiment of the present application provides a route processing device, including: a memory, a processor;

[0033] The memory stores computer-executable instructions;

[0034] The processor executes the computer-executable instructions stored in the memory, so that the processor executes the above first aspect and / or various possible implementation manners of the first aspect.

[0035] In a third aspect, an embodiment of the present application provides a computer-readable storage medium, in which computer-executable instructions are stored, and when the computer-executable instructions are executed by a processor, they are used to implement the above first aspect and / or various possible implementation manners of the first aspect.

[0036] In a fourth aspect, an embodiment of the present application provides a computer program product, including a computer program, and when the computer program is executed by a processor, it implements the above first aspect and / or various possible implementation manners of the first aspect.

[0037] A route processing method, device and storage medium provided by an embodiment of the present application, by obtaining the coordinate information of the route to be processed and the route library stored in the vehicle control unit, where the route library includes a first preset number of fixed routes, determining a matching route for the route to be processed based on the coordinate information of the route to be processed; and performing an auxiliary correction process on the matching route by obtaining the slope information of the route to be processed to achieve a secondary determination of the matching route; and determining the throttle strategy for the route to be processed according to the matching route and the slope information after the secondary determination. Compared with the method of calculating routes using a large platform of the vehicle networking dataset in the prior art, the present application reduces the dependence on the cloud platform by performing local processing in the vehicle control unit, reduces the costs of computing resources and data transmission; combines the slope information for auxiliary correction to improve the accuracy of route recognition; determines the throttle strategy for the route to be processed according to the matching route and the slope information after the secondary determination, and optimizes the driving performance of the vehicle. Description of the Drawings

[0038] The accompanying drawings herein are incorporated into the specification and form a part of this specification, showing embodiments consistent with the present application, and are used together with the specification to explain the principles of the present application.

[0039] Figure 1 Schematic diagram of the processing system architecture of a route provided for the present application;

[0040] Figure 2 Flow diagram of the processing method of the route provided for the present application Figure 1 ;

[0041] Figure 3 Flow diagram of the processing method of the route provided for the present application Figure 2 ;

[0042] Figure 4 Flow diagram of the processing method of the route provided for the present application Figure 3 ;

[0043] Figure 5 Flow diagram of the processing method of the route provided for the present application Figure 4 ;

[0044] Figure 6 Flow diagram of the processing method of the route provided for the present application Figure 5 ;

[0045] Figure 7 Schematic diagram of the structure of the processing device of the route provided for the present application;

[0046] Figure 8 Schematic diagram of the structure of the processing equipment of the route provided for the present application.

[0047] Through the above-mentioned accompanying drawings, specific embodiments of the present application have been shown, and there will be more detailed descriptions hereinafter. These accompanying drawings and the textual descriptions are not intended to limit the scope of the concept of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. Detailed Description of the Embodiments

[0048] Here, the exemplary embodiments will be described in detail, and the examples are shown in the accompanying drawings. When the following description refers to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0049] It should be noted that the data involved in this application are all information and data authorized by users or fully authorized by all parties. The collection, use, and processing of relevant data need to comply with relevant laws, regulations, and standards, and corresponding operation entrances are provided for users to choose to authorize or refuse.

[0050] The route recognition of vehicles plays an important role in aspects such as navigation, traffic management, autonomous driving, and logistics management; it can effectively reduce the driving time and fuel consumption of vehicles, and improve the safety and reliability of vehicle driving.

[0051] In the prior art, route recognition uses a cloud computing platform to calculate the route based on discrete GPS coordinate points to provide the route recognition situation. However, the cloud computing platform requires a large amount of computing resources and costs, and relying solely on discrete GPS coordinate points may result in misjudgment of the actual route in complex urban environments or mountain roads, leading to insufficient accuracy of the route recognition result.

[0052] Based on this, in the prior art, there are problems of low processing efficiency and insufficient accuracy of routes.

[0053] To solve the above problems, the core concept of this application is: by identifying and processing coordinate information, initially match a preset fixed route that matches the route to be processed to obtain a matching route; and correct the matching route according to the obtained slope information for matching verification. If the matching verification is passed, combine the matching route and slope information to optimize the throttle strategy of the route to be processed, so as to improve the processing efficiency and accuracy of the route.

[0054] Optionally, Figure 1 This is a schematic diagram of the system architecture for processing a route provided by this application. As Figure 1 shown, the system architecture for processing a route includes at least one of a data acquisition device 101, a processing device 102, and a display device 103.

[0055] It can be understood that the structure schematically shown in the embodiments of this application does not constitute a specific limitation on the above architecture. In other feasible embodiments of this application, the above architecture may include more or fewer components than shown, or combine certain components, or split certain components, or different component arrangements, which can be specifically determined according to the actual application scenario and are not limited here. Figure 1 The components shown can be implemented in hardware, software, or a combination of software and hardware.

[0056] In the specific implementation process, the data acquisition device 101 may include an input / output interface or a communication interface, and the data acquisition device 101 can be connected to the processing device through the input / output interface or the communication interface.

[0057] The processing device 102 can perform recognition processing on the coordinate information to determine a matching route of the route to be processed among a first preset number of fixed routes; according to the obtained slope information of the route to be processed, perform auxiliary correction processing on the matching route to determine whether the matching route matches the route to be processed; if it is determined that the matching route matches the route to be processed, then determine an accelerator strategy for the route to be processed according to the matching route and the slope information.

[0058] The display device 103 can also be a touch display screen or the screen of a terminal device, which is used to receive user instructions while displaying the above content to realize interaction with the user.

[0059] The following uses specific embodiments to elaborate in detail on the technical solution of the present application and how the technical solution of the present application solves the above technical problems. These several specific embodiments below can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below with reference to the accompanying drawings.

[0060] Figure 2 Flow schematic of the route processing method provided by the present application Figure 1 , as Figure 2 shown, the method includes:

[0061] S201. Obtain the coordinate information of the route to be processed, and obtain the route library stored in the vehicle control unit, where the route library includes a first preset number of fixed routes.

[0062] In this embodiment, the route to be processed refers to the route to be traveled currently.

[0063] S202. Perform recognition processing on the coordinate information to determine a matching route of the route to be processed among a first preset number of fixed routes.

[0064] In a possible implementation manner, performing recognition processing on the coordinate information to determine a matching route of the route to be processed among a first preset number of fixed routes includes:

[0065] Perform map Euclidean distance matching processing on the coordinate information according to the first preset number of fixed routes, and combine the first preset matching similarity to determine a matching route of the route to be processed.

[0066] In this embodiment, for example, the first preset matching similarity can be 80%. Perform map Euclidean distance matching processing on the coordinate information according to the first preset number of fixed routes. When the matching similarity between the fixed route and the coordinate information is higher than the first preset matching similarity, then use this fixed route as the matching route of the route to be processed.

[0067] In another possible implementation, the coordinate information is identified and processed to determine a matching route for the route to be processed among a first preset number of fixed routes, including:

[0068] According to the first preset number of fixed routes, the coordinate information is processed by calculating using the dynamic time warping algorithm, and in combination with a second preset matching similarity, a matching route for the route to be processed is determined.

[0069] In this embodiment, according to the first preset number of fixed routes and the coordinate information, the dynamic time warping algorithm is used to calculate the minimum cumulative distance. When the minimum cumulative distance is less than the second preset matching similarity, the fixed route is used as the matching route for the route to be processed, where the cumulative distance refers to the path cost of converting the fixed route into the route to be processed.

[0070] S203. Obtain the slope information of the route to be processed.

[0071] In this embodiment, the slope information of the route to be processed refers to the degree of inclination of the route to be processed. The elevation data of the route to be processed can be obtained through a global positioning system device, and based on the elevation data, the slope information of the route to be processed is calculated; or the slope information of the route to be processed is calculated through an in-vehicle sensor.

[0072] S204. According to the slope information, perform an auxiliary correction process on the matching route to determine whether the matching route matches the route to be processed.

[0073] In this embodiment, based on the slope information, an auxiliary correction process is performed on the matching route to make the matching route conform to the actual driving situation, thereby improving the accuracy of route processing to determine the matching degree between the matching route and the route to be processed.

[0074] S205. If it is determined that the matching route matches the route to be processed, then according to the matching route and the slope information, determine an accelerator strategy for the route to be processed.

[0075] In this embodiment, according to the matching route and the slope information, key slope sections are identified, where the key slope sections include uphill sections, downhill sections, and flat road sections; in the uphill section, an accelerator strategy of increasing the accelerator and reducing the gear is adopted to provide sufficient power and increase the torque output of the engine, and the increase amplitude of the accelerator is adjusted according to the slope magnitude of the uphill section; in the downhill section, an accelerator strategy of reducing the accelerator and reducing the gear is adopted to control the vehicle speed; in the flat road section, an accelerator strategy of maintaining a constant accelerator is adopted to stabilize the vehicle speed.

[0076] The processing method of the route provided by the embodiment of the present application obtains the coordinate information of the route to be processed and multiple fixed routes stored in the route library of the vehicle control unit, determines a matching route for the route to be processed based on the coordinate information of the route to be processed; and performs an auxiliary correction process on the matching route by obtaining the slope information of the route to be processed to determine the similarity between the matching route and the route to be processed; and determines the throttle strategy of the route to be processed according to the matching route and the slope information. Compared with the route processing method in the prior art, the present application reduces the dependence on the cloud platform through local processing in the vehicle control unit, reduces the costs of computing resources and data transmission; combines the slope information for auxiliary correction to improve the accuracy of route recognition; determines the throttle strategy of the route to be processed according to the matching route and the slope information, reduces energy consumption, and optimizes the driving performance of the vehicle.

[0077] Optionally, after determining that the matching route matches the route to be processed and determining the throttle strategy for the route to be processed according to the matching route and the slope information, it further includes:

[0078] Updating the route library according to the matching route of the route to be processed.

[0079] Figure 3 For the flow diagram of the route processing method provided by the present application Figure 2 As Figure 3 shown, on the basis of the Figure 2 embodiment, before obtaining the coordinate information of the route to be processed and obtaining the route library stored in the vehicle control unit in the above step S201, it further includes:

[0080] S301. Obtain multiple trip data.

[0081] Optionally, the trip data includes the start duration and the shutdown duration, and / or the trip data includes the start GPS discrete points and the shutdown GPS discrete points.

[0082] In this embodiment, the start duration refers to the time from when the engine starts to when the engine running state reaches a stable state; the shutdown duration refers to the time from when the engine is turned off to when the engine completely stops running; the start GPS discrete points refer to the initial discrete points recorded by the GPS and the discrete points within 10 kilometers from the initial discrete points; the shutdown GPS discrete points refer to the end discrete points recorded by the GPS and the discrete points within 10 kilometers from the end discrete points.

[0083] S302. Determine multiple effective routes according to the multiple trip data.

[0084] In this embodiment, according to multiple trip data, multiple valid routes are determined, reducing the processing of invalid routes, thereby improving the route processing efficiency, reducing the impact on the processing results of the routes, and improving the accuracy of route processing.

[0085] S303. Perform sorting and classification processing on the multiple valid routes to obtain a first preset number of fixed routes and a second preset number of pending routes.

[0086] In this embodiment, for example, if there are 4 valid routes, namely the first valid route, the second valid route, the third valid route, and the fourth valid route, where the fourth valid route is a newly added route; perform sorting processing on the first valid route, the second valid route, and the third valid route to obtain 3 fixed routes; use the fourth valid route as 1 pending route.

[0087] S304. Store the first preset number of fixed routes and the second preset number of pending routes in the route library of the vehicle control unit.

[0088] In this embodiment, as Figure 4 shown, for example, storing the first preset number of fixed routes and the second preset number of pending routes in the route library of the vehicle control unit includes:

[0089] Read the storage space of 4 routes in the route library of the vehicle control unit;

[0090] Judge whether the storage space of the 4 routes is empty;

[0091] If the storage spaces of all 4 routes are empty, store the first valid route, the second valid route, the third valid route, and the pending route in the route library respectively, and record the corresponding number of driving times as 1;

[0092] If the first valid route has been stored in the storage space of the 4 routes, and the second valid route, the third valid route, and the pending route have not been stored, then judge whether the second valid route coincides with the first valid route. If they coincide, add 1 to the corresponding number of driving times of the first valid route; if the second valid route does not coincide with the first valid route, store the second valid route in the route library, and set the corresponding number of driving times of the second valid route to 1;

[0093] If the storage spaces of the four routes have stored the first valid route and the second valid route, and have not stored the third valid route and the pending route, and if they overlap, then the third valid route is successively compared with the first valid route and the second valid route to determine whether the third valid route overlaps with the first valid route or the second valid route. If there is an overlap, the driving times corresponding to the corresponding valid route are incremented by 1; if the third valid route does not overlap with the first valid route or the second valid route, the third valid route is stored in the route library, and the driving times corresponding to the third valid route are set to 1;

[0094] If the storage spaces of the four routes have stored the first valid route, the second valid route and the third valid route, and have not stored the pending route, then the pending route is successively compared with the first valid route, the second valid route and the third valid route to determine whether the pending route overlaps with the first valid route, the second valid route or the third valid route. If there is an overlap, the driving times corresponding to the corresponding valid route are incremented by 1; if the pending route does not overlap with the first valid route, the second valid route or the third valid route, the pending route is stored in the route library, and the driving times corresponding to the pending route are set to 1;

[0095] If the storage spaces of the four routes have all stored the corresponding valid routes, when a new valid route is obtained, it is successively compared with the first valid route, the second valid route and the third valid route to determine whether the new valid route overlaps with the first valid route, the second valid route or the third valid route. If there is an overlap, the driving times corresponding to the corresponding valid route are incremented by 1; if the new valid route does not overlap with the first valid route, the second valid route and the third valid route, the new valid route is used to update the pending route;

[0096] When storing the valid routes, they are sorted from largest to smallest based on the driving times corresponding to the valid routes;

[0097] For the valid routes whose driving times have not changed within a preset period, deletion processing is performed.

[0098] The route processing method provided by the embodiments of the present application determines multiple valid routes through multiple trip data, and performs sorting and classification processing on the valid routes to obtain a first preset number of fixed routes and a second preset number of pending routes, and controls the total number of routes stored in the route library of the vehicle control unit through comparison to reduce the storage pressure of the vehicle control unit.

[0099] Figure 5 For the flow diagram of the route processing method provided by the present application Figure 4 as Figure 5 shown, this embodiment is in Figure 3Based on the embodiments, the step S302 of determining multiple effective routes according to multiple trip data is described in detail. The method further includes:

[0100] S501. Determine the starting points and ending points of multiple trips according to multiple trip data.

[0101] In this embodiment, the starting point of the trip is the discrete point where the global positioning system is started, and the ending point of the trip is the discrete point where the global positioning system is turned off.

[0102] S502. Determine multiple routes to be screened according to the starting points and ending points of multiple trips.

[0103] In this embodiment, according to the starting point and the corresponding ending point of each trip, they are matched with the preset map data. If a route with the same starting point and ending point of the trip is matched in the preset map data, the route with the same starting point and ending point of the trip is used as the route to be screened.

[0104] S503. Perform short trip filtering processing and / or interrupted trip filtering processing on multiple routes to be screened to obtain multiple effective routes.

[0105] In this embodiment, for each route to be screened, record the starting duration of the previous moment, the turning-off duration of the previous moment, the starting duration of the current moment, and the driving distance from the starting duration of the previous moment to the turning-off duration of the previous moment in the route to be screened;

[0106] If the time interval between the starting duration of the previous moment and the turning-off duration of the previous moment is less than the preset time interval, or the driving distance from the starting duration of the previous moment to the turning-off duration of the previous moment is less than the preset driving distance, then this trip is regarded as a short trip, and short trip filtering processing is performed on the short trip.

[0107] If the time interval between the turning-off duration of the previous moment and the starting duration of the current moment is greater than the preset interruption time, then this trip is regarded as an interrupted trip, and interrupted trip filtering processing is performed on the interrupted trip;

[0108] Optionally, if the trip information before and after the route to be screened is combined to form a complete route with this trip, then the route to be screened is retained.

[0109] The route processing method proposed in this application determines the routes to be screened through trip data, and performs filtering processing on short trips and interrupted trips in the routes to be screened to obtain effective routes; improving the accuracy of the routes.

[0110] Figure 6 It is a flowchart of the route processing method provided by this application Figure 5 , as Figure 6 shown, this embodiment is inFigure 3 Based on the embodiments, the above steps for sorting and classifying multiple valid routes will be described in detail. The method further includes:

[0111] S601. Determine the priority corresponding to the valid route according to the number of trips corresponding to the valid route.

[0112] In this embodiment, within a preset period, record the number of trips corresponding to all valid routes.

[0113] For example, the preset period includes three months or half a year; the priorities include the first priority, the second priority, and the third priority.

[0114] Optionally, determining the priority corresponding to the valid route according to the number of trips corresponding to the valid route includes:

[0115] Calculate the total number of trips according to the number of trips corresponding to the valid route, and calculate the proportion of the number of trips of the valid route based on the number of trips corresponding to the valid route and the total number of trips; divide the valid routes with the proportion of the number of trips of the valid route higher than or equal to the preset first proportion into the first priority; divide the valid routes with the proportion of the number of trips of the valid route higher than or equal to the preset second proportion and lower than the preset first proportion into the second priority; divide the valid routes with the proportion of the number of trips of the valid route lower than the preset second proportion into the third priority.

[0116] Also optionally, determining the priority corresponding to the valid route according to the number of trips corresponding to the valid route includes:

[0117] Divide the valid routes into the first priority, the second priority, and the third priority respectively according to the preset number of classification levels. Among them, if the number of trips corresponding to the valid route is greater than or equal to the preset first classification level, divide the valid route into the first priority; if the number of trips corresponding to the valid route is greater than or equal to the preset second classification level and less than the preset first classification level, divide the valid route into the second priority; if the number of trips corresponding to the valid route is less than the preset second classification level, divide the valid route into the third priority.

[0118] S602. Sort the multiple valid routes according to the priority corresponding to each valid route to obtain the order of each valid route.

[0119] In this embodiment, for the valid routes with determined priorities, within the same priority, sort the valid routes according to the corresponding number of trips based on the sorting rule from large to small to obtain the order of each valid route.

[0120] For example, if there are 3 valid routes, within a preset period, according to the number of trips corresponding to the valid routes, based on the rule from large to small, the 3 valid routes are sequentially divided into the first priority, the second priority, and the third priority.

[0121] S603. Classify multiple valid routes according to the order of each valid route.

[0122] In this embodiment, for example, the valid routes with the first priority, the second priority, and the third priority are classified as fixed routes; the newly added routes within the preset period are regarded as pending routes.

[0123] In the route processing method provided by this application, by recording the number of trips of each valid route within a preset period and sorting them, the valid routes are sequentially divided into the corresponding priorities, so as to realize the classification processing of the valid routes, reduce the processing time of the valid routes, and remove redundant valid routes, thereby improving the processing efficiency of the routes.

[0124] Figure 7 It is a schematic structural diagram of the route processing device provided by this application, as Figure 7 shown, the route processing device provided by this embodiment includes:

[0125] The first acquisition module 701 is configured to acquire the coordinate information of the route to be processed and acquire the route library stored in the vehicle control unit, where the route library includes a first preset number of fixed routes;

[0126] The first determination module 702 is configured to perform identification processing on the coordinate information to determine a matching route of the route to be processed among the first preset number of fixed routes;

[0127] The second acquisition module 703 is configured to acquire the slope information of the route to be processed;

[0128] The second determination module 704 is configured to perform auxiliary correction processing on the matching route according to the slope information to determine whether the matching route matches the route to be processed;

[0129] The third determination module 705 is configured to, if it is determined that the matching route matches the route to be processed, determine the throttle strategy for the route to be processed according to the matching route and the slope information.

[0130] In a possible implementation manner, before acquiring the coordinate information of the route to be processed and acquiring the route library stored in the vehicle control unit, it further includes:

[0131] The third acquisition module is configured to acquire multiple trip data.

[0132] Optionally, the trip data includes the start duration and the stop duration, and / or the trip data includes the start GPS discrete points and the stop GPS discrete points.

[0133] A fourth determination module, configured to determine a plurality of valid routes according to a plurality of trip data;

[0134] An obtaining module, configured to perform sorting and classification processing on the plurality of valid routes to obtain a first preset number of fixed routes and a second preset number of pending routes;

[0135] A storage module, configured to store the first preset number of fixed routes and the second preset number of pending routes into a route library of a vehicle control unit.

[0136] In a possible implementation manner, the fourth determination module may specifically further be configured to:

[0137] Determine the starting points and ending points of a plurality of trips according to the plurality of trip data;

[0138] Determine a plurality of routes to be screened according to the starting points and ending points of the plurality of trips;

[0139] Perform short-trip filtering processing and / or interrupted-trip filtering processing on the plurality of routes to be screened to obtain a plurality of valid routes.

[0140] In a possible implementation manner, the obtaining module may specifically further be configured to:

[0141] Determine the priority corresponding to a valid route according to the number of driving times corresponding to the valid route;

[0142] Perform sorting processing on the plurality of valid routes according to the priorities corresponding to the respective valid routes to obtain the order of the respective valid routes;

[0143] Perform classification processing on the plurality of valid routes according to the order of the respective valid routes.

[0144] In a possible implementation manner, the first determination module 702 may specifically further be configured to:

[0145] Perform map Euclidean distance matching processing on the coordinate information according to the first preset number of fixed routes, and determine a matching route of the route to be processed in combination with a first preset matching similarity.

[0146] In a possible implementation manner, the first determination module 702 may specifically further be configured to:

[0147] Perform calculation processing of a dynamic time warping algorithm on the coordinate information according to the first preset number of fixed routes, and determine a matching route of the route to be processed in combination with a second preset matching similarity.

[0148] In a possible implementation, after determining that the matching route matches the route to be processed and then determining the throttle strategy for the route to be processed based on the matching route and the slope information, the following steps are further included:

[0149] An update module, configured to update the route library according to the matching route of the route to be processed.

[0150] The route processing device provided in this embodiment can execute the method provided in the above method embodiment. The implementation principle and technical effect are similar, and will not be elaborated here in this embodiment.

[0151] Figure 8 It is a schematic structural diagram of the route processing device provided in this application. As Figure 8 shown, the route processing device provided in this embodiment includes at least one processor 801 and a memory 802. Optionally, the route processing device further includes a communication component 803. Among them, the processor 801, the memory 802, and the communication component 803 are connected through a bus 804.

[0152] In the specific implementation process, at least one processor 801 executes the computer-executable instructions stored in the memory 802, so that at least one processor 801 executes the above method.

[0153] For the specific implementation process of the processor 801, reference can be made to the above method embodiment. The implementation principle and technical effect are similar, and will not be elaborated here in this embodiment.

[0154] In the above embodiment, it should be understood that the processor may be a central processing unit (English: Central Processing Unit, abbreviated as: CPU), and may also be other general-purpose processors, digital signal processors (English: Digital Signal Processor, abbreviated as: DSP), application specific integrated circuits (English: Application Specific Integrated Circuit, abbreviated as: ASIC), etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the method disclosed in combination with the invention can be directly implemented by the execution of the hardware processor, or can be implemented by the combination of the hardware and software modules in the processor.

[0155] The memory may include a high-speed memory (Random Access Memory, RAM), and may also include a non-volatile memory (Non-volatile Memory, NVM), such as at least one disk memory.

[0156] The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus can be divided into an address bus, a data bus, a control bus, etc. For the sake of convenience in representation, the buses in the drawings of this application are not limited to only one bus or one type of bus.

[0157] This application also provides a computer program product, including a computer program which, when executed by a processor, implements the above method.

[0158] This application also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the above method.

[0159] The above-mentioned readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as a static random access memory (SRAM), an electrically erasable programmable read-only memory (EEPROM), an erasable programmable read-only memory (EPROM), a programmable read-only memory (PROM), a read-only memory (ROM), a magnetic memory, a flash memory, a magnetic disk or an optical disc. The readable storage medium can be any available medium accessible by a general-purpose or special-purpose computer.

[0160] An exemplary readable storage medium is coupled to the processor, enabling the processor to read information from and write information to the readable storage medium. Of course, the readable storage medium can also be a component of the processor. The processor and the readable storage medium can be located in an Application Specific Integrated Circuit (ASIC). Of course, the processor and the readable storage medium can also exist as discrete components in a device.

[0161] The division of units is only a logical function division. In actual implementation, there can be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed coupling or direct coupling or communication connection between each other can be an indirect coupling or communication connection through some interfaces, devices or units, and can be in electrical, mechanical or other forms.

[0162] The unit described as a separate component may or may not be physically separated. The component shown as a unit may or may not be a physical unit, that is, it may be located in one place or may be distributed across multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0163] In addition, in each embodiment of the present invention, each functional unit can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit.

[0164] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in each embodiment of the present invention. The foregoing storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical discs that can store program codes.

[0165] Those of ordinary skill in the art can understand that all or part of the steps of implementing the above method embodiments can be completed by hardware related to program instructions. The foregoing program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps including the above method embodiments; and the foregoing storage medium includes: various media such as ROMs, RAMs, magnetic disks, or optical discs that can store program codes.

[0166] Finally, it should be noted that: After considering the specification and practicing the invention disclosed herein, those skilled in the art will easily think of other implementation schemes of the present invention. The present invention aims to cover any variations, uses, or adaptive changes of the present invention. These variations, uses, or adaptive changes follow the general principles of the present invention and include the common general knowledge or conventional technical means in the technical field not disclosed in the present invention. It is not limited to the exact structure described above and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present invention is only limited by the appended claims.

Claims

1. A route processing method, characterized in that: include: Acquire coordinate information of a route to be processed, and acquire a route library stored in a vehicle control unit, wherein the route library includes a first preset number of fixed routes; Performing identification processing on the coordinate information to determine a matching route of the route to be processed among the first preset number of fixed routes; Obtaining the slope information of the route to be processed; According to the slope information, performing auxiliary correction processing on the matching route to determine whether the matching route matches the route to be processed; If it is determined that the matching route matches the route to be processed, a throttle strategy for the route to be processed is determined according to the matching route and the slope information.

2. The method according to claim 1, characterized in that The identifying and processing the coordinate information to determine a matching route of the route to be processed among the first preset number of fixed routes includes: According to the first preset number of fixed routes, map Euclidean distance matching processing is performed on the coordinate information, and a matching route of the route to be processed is determined in combination with a first preset matching similarity.

3. The method according to claim 1, characterized in that The identifying and processing the coordinate information to determine a matching route of the route to be processed among the first preset number of fixed routes includes: According to the first preset number of fixed routes, the coordinate information is calculated and processed by a dynamic time warping algorithm, and combined with the second preset matching similarity, a matching route of the route to be processed is determined.

4. The method according to any one of claims 1 to 3, characterized in that: Before obtaining the coordinate information of the route to be processed and obtaining the route library stored in the vehicle control unit, the method further includes: Get multiple trip data; Determining multiple valid routes based on the multiple travel data; Sorting and classifying the multiple valid routes to obtain a first preset number of fixed routes and a second preset number of pending routes; The first preset number of fixed routes and the second preset number of pending routes are stored in a route library of the vehicle control unit.

5. The method according to claim 4, characterized in that Determining a plurality of valid routes according to the plurality of travel data includes: Determining the starting points and end points of the multiple trips according to the multiple trip data; Determining a plurality of routes to be screened according to the starting points and end points of the plurality of trips; The multiple routes to be screened are subjected to short-trip filtering processing and / or interrupted-trip filtering processing to obtain multiple valid routes.

6. The method according to claim 5, characterized in that The travel data includes a startup duration and an engine shutdown duration, and / or the travel data includes a startup global positioning system discrete point and an engine shutdown global positioning system discrete point.

7. The method according to claim 5 or 6, characterized in that: The sorting and classification of the multiple valid routes includes: Determining the priority of the valid route according to the number of trips corresponding to the valid route; Sorting the plurality of valid routes according to the priority corresponding to each valid route to obtain the order of each valid route; The plurality of valid routes are classified according to the order of the valid routes.

8. The method according to claim 5 or 6, characterized in that: After determining that the matching route matches the route to be processed, and determining a throttle strategy for the route to be processed according to the matching route and the slope information, the method further includes: The route library is updated according to the matching route of the route to be processed.

9. A route processing device, characterized in that: include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the route processing method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the route processing method according to any one of claims 1 to 7 when executed by a processor.

Images