Expressway passing billing determination method, device and equipment and medium

Abstract

The invention discloses a highway passing billing determination method, device and equipment and a medium, and relates to the field of intelligent traffic billing, and the method comprises the steps: obtaining a preset coding system; the preset coding system establishes a spatial topological structure and an administrative affiliation relationship of the charging unit in the road network according to the hierarchical nested structure and the road feature information, and the charging unit has a binding relationship with the geographic element identification code in the vector map; matching the vehicle positioning data with geographic element identification codes in a vector map to obtain a charging unit corresponding to a vehicle passing process, and generating initial charging details after closing a passing record; and if it is detected that the charging units corresponding to the two adjacent bills are discontinuous on the passing path in the initial charging details, complementing the missing charging units based on a preset coding system to generate final charging details. Therefore, the complex road structure can be finely coded, and the problem that a traditional scheme cannot support continuous charging interval calculation is solved.

Description

Technical Field

[0001] The present invention relates to the technical field of intelligent traffic billing, and in particular to a method, device, equipment and medium for determining highway tolls. Background Art

[0002] With the development of intelligent transportation technology, mileage-based charging methods based on vehicle positioning and road network data are gaining increasing attention. In intelligent transportation systems, spatiotemporal processing and digital modeling of road networks are key to building accurate charging systems. Spatiotemporal processing involves comprehensive analysis of road and vehicle information across both time and space. This requires combining dynamic positioning data with the static road network to effectively track a vehicle's precise location and travel progress. Digital modeling abstracts complex road networks into coded units, facilitating subsequent route identification and billing.

[0003] Traditional solutions are mainly based on coarse-grained road matching and lack the refined encoding and processing of complex road structures, resulting in the inability to support continuous toll interval calculation. In particular, when the toll path is discontinuous, the system finds it difficult to effectively complete it. Therefore, the above problems urgently need to be solved by people in this field. Summary of the Invention

[0004] In view of this, the purpose of the present invention is to provide a method, apparatus, device, and medium for determining highway toll charges, which can perform refined encoding of complex road structures and solve the problem that traditional solutions cannot support the calculation of continuous toll intervals. The specific solution is as follows:

[0005] In a first aspect, the present application discloses a method for determining highway toll charges, comprising:

[0006] Obtaining a preset coding system; wherein the preset coding system establishes a spatial topological structure and administrative affiliation of charging units in a road network according to a hierarchical nested structure and road feature information; the charging units have billing attributes; and the charging units are bound to geographic element identification codes in a vector map;

[0007] Matching the vehicle positioning data with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle's passage process, and generating initial billing details after closing the passage record;

[0008] If it is detected that the charging units corresponding to two adjacent charges in the initial billing details are not continuous on the passage path, the missing charging units are supplemented based on the preset coding system to generate the final billing details.

[0009] Optionally, the preset coding system includes a highway layer, a section layer, a toll interval layer, an interchange layer, a ramp layer, a service facility layer and a roadside equipment layer, and the charging unit includes the toll interval layer, the interchange layer and the ramp layer; wherein the toll interval is the main line road between two interchanges.

[0010] Optionally, the step of supplementing the missing charging unit based on the preset coding system includes:

[0011] The charging units in the preset coding system are nodes, and when any two charging units are directly connected, an edge is established between the two nodes corresponding to the any two charging units; wherein the weight value of the edge is the topological distance between the any two charging units;

[0012] For the detected discontinuous path portion, determine the starting node and the ending node of the discontinuous path portion, and calculate the path with the shortest topological distance between the starting node and the ending node according to the shortest path algorithm, and complete the missing charging unit according to the path with the shortest topological distance.

[0013] Optionally, the step of supplementing the missing charging unit based on the preset coding system includes:

[0014] Determining whether the charging unit at the vehicle entry location and / or the charging unit at the vehicle exit location is missing based on the traffic record;

[0015] If the charging unit at the vehicle entry position and / or the charging unit at the vehicle exit position is missing, the charging unit with the shortest topological distance is recursively searched based on the hierarchical nested structure in the preset coding system, and when the charging unit with the shortest topological distance meets the preset recursive condition, the charging unit with the shortest topological distance is determined as the missing charging unit and is supplemented accordingly.

[0016] Optionally, if the charging unit at the vehicle entry position is missing and / or the charging unit at the vehicle exit position is missing, recursively searching for the charging unit with the shortest topological distance based on the hierarchical nested structure in the preset coding system includes:

[0017] If only the charging unit at the vehicle entry location is missing, then based on the hierarchical nested structure in the preset coding system, reversely recursively search for the charging unit with the shortest topological distance;

[0018] If only the toll collection unit at the vehicle exit location is missing, then based on the hierarchical nested structure in the preset coding system, forward recursively search for the toll collection unit with the shortest topological distance;

[0019] If the charging unit at the vehicle entry position is missing and the charging unit at the vehicle exit position is missing, a bidirectional recursive search is performed for the charging unit with the shortest topological distance based on the hierarchical nested structure in the preset code.

[0020] Optionally, when the charging unit with the shortest topological distance satisfies a preset recursive condition, determining the charging unit with the shortest topological distance as the missing charging unit includes:

[0021] When the recursive search depth is not greater than the preset number of levels, and the charging unit with the shortest topological distance meets the valid path rules in the preset coding system, the charging unit with the shortest topological distance is determined to meet the preset recursive conditions, and the charging unit with the shortest topological distance is determined to be the missing charging unit.

[0022] Optionally, the process of matching the vehicle positioning data with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle passage process and generate the corresponding initial billing details further includes:

[0023] If multiple geographic element identification codes in the vector map match the same charging unit, determining the earliest matching time and the latest matching time of the multiple geographic element identification codes;

[0024] The multiple billings corresponding to the multiple geographic element identification codes are merged into one billing; the time span of the one billing is determined based on the earliest matching time and the latest matching time.

[0025] In a second aspect, the present application discloses a device for determining a highway toll, comprising:

[0026] A coding system determination module is used to obtain a preset coding system; the preset coding system establishes the spatial topological structure and administrative affiliation of charging units in the road network according to the hierarchical nesting structure and road feature information, the charging units have billing attributes, and the charging units are bound to the geographic element identification codes in the vector map;

[0027] a charging unit matching module for matching the vehicle positioning data with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle's passage process and generate initial billing details after closing the passage record;

[0028] The completion and billing module is used to complete the missing charging units based on the preset coding system to generate the final billing details if it is detected that the charging units corresponding to two adjacent billings in the initial billing details are discontinuous on the pass path.

[0029] In a third aspect, the present application discloses an electronic device, comprising:

[0030] Memory, used to store computer programs;

[0031] A processor is used to execute the computer program to implement the above-disclosed method for determining highway tolls.

[0032] In a fourth aspect, the present application discloses a computer-readable storage medium for storing a computer program; wherein, when the computer program is executed by a processor, the aforementioned method for determining highway tolls disclosed above is implemented.

[0033] It can be seen that the present application proposes a method for determining highway tolls, including: obtaining a preset coding system; the preset coding system establishes the spatial topological structure and administrative affiliation of the charging unit in the road network according to the hierarchical nested structure and road feature information, the charging unit has a billing attribute, and the charging unit is bound to the geographic element identification code in the vector map; the vehicle positioning data is matched with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle passage process, and generate the initial billing details after closing the passage record; if it is detected that the charging units corresponding to two adjacent billings in the initial billing details are not continuous on the passage path, the missing charging units are supplemented based on the preset coding system to generate the final billing details. In summary, it can be seen that the preset coding system in the present application is constructed according to the hierarchical nested structure and road feature information, so that complex road structures can be finely coded. At the same time, the present application binds the charging unit to the geographic element identification code in the vector map, creates a standardized digital representation for each charging unit, overcomes the shortcomings of the coarse-grained matching of the traditional solution, and makes the description of the road network more detailed and accurate. In addition, after matching the vehicle positioning data with the geographic element identification code to obtain the charging unit and generate the initial billing details, for the situation where adjacent charging units in the initial billing details are discontinuous on the passage path, this application can complete the missing charging units based on the preset coding system, ensuring the continuity of the charging interval, so as to accurately calculate the vehicle's fees during the entire passage process, solving the problem that traditional solutions cannot support the calculation of continuous charging intervals. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are merely embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.

[0035] Figure 1 This is a flow chart of a method for determining highway toll charges disclosed in this application;

[0036] Figure 2 This is an architecture diagram of a highway toll processing system disclosed in this application;

[0037] Figure 3 This is a flowchart of a specific method for determining highway tolls disclosed in this application;

[0038] Figure 4 This is a schematic diagram of the structure of a device for determining highway toll charges disclosed in this application;

[0039] Figure 5 This is a structural diagram of an electronic device disclosed in this application. DETAILED DESCRIPTION

[0040] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present invention.

[0041] In intelligent transportation systems, spatiotemporal processing and digital modeling of road networks are key to building accurate toll collection systems. Traditional solutions rely primarily on coarse-grained road matching, lacking refined encoding and processing of complex road structures. This results in an inability to support continuous toll interval calculations, especially when toll paths are discontinuous, making it difficult for the system to effectively complete the toll intervals. Consequently, these issues urgently need to be addressed by researchers in this field.

[0042] To this end, an embodiment of the present application proposes a highway toll determination scheme that can finely encode complex road structures and solve the problem that traditional schemes cannot support the calculation of continuous charging intervals.

[0043] The present application discloses a method for determining highway toll charges. Figure 1 ,include:

[0044] Step S11: Obtain a preset coding system; the preset coding system establishes the spatial topological structure and administrative affiliation of the charging unit in the road network according to the hierarchical nested structure and road feature information. The charging unit has a billing attribute, and the charging unit is bound to the geographic element identification code in the vector map.

[0045] In this embodiment, a preset coding system establishes the spatial topology and administrative affiliation of toll collection units within the road network based on a hierarchical nesting structure and road characteristic information. The hierarchical nesting structure includes a hierarchical mapping relationship: road network layer → highway layer → road section layer → toll interval layer → interchange layer → ramp layer. Furthermore, the preset coding system also includes a service facility layer and a roadside equipment layer. The road characteristic information includes, but is not limited to, road direction and road grade. Toll collection units have billing attributes and are bound to Geographic Element Identifiers (GIDs) in vector maps. A toll collection unit includes the toll interval layer, the interchange layer, and the ramp layer. A toll interval is the main road between two interchanges (i.e., interchanges), such as the K12+300 to K35+800 section of the G4 Beijing-Hong Kong-Macao Expressway. Interchanges are interchanges between different highways or roads, such as the Jiaxing hub where the Shanghai-Kunming Expressway and the Hangzhou Ring Expressway meet. Ramps are directional passages connecting roads at different levels, such as Ramp A at the Shanghai Hongqiao Interchange.

[0046] It should be noted that the coding rules for the above layers are as follows: (1) Road network layer: Use a unified geographic element identification code for identification, such as GID 222. (2) Highway layer: The coding length is 7 digits. Rules for 1st to 5th digits: Consists of 1 letter identifier and 4 digits. If the digits are less than 4 digits, use "0" to fill in 4 digits after the letter identifier. For example, the highway number "G15" should be encoded as "G0015". Highway numbers follow the "GB / T917-2009" standard. Rules for 6th to 7th digits: Use the provincial administrative division code specified in "GB / T2260". (3) Section layer: The coding length is 11 digits. Rules for 1st to 7th digits: Select the first 7 digits of the corresponding highway layer code. If there are overlapping sections, the highway number with a higher administrative level and a smaller highway number is preferred; if there are still duplicates, the highway number with a higher administrative level and a smaller highway number is also selected. Rules for 8th to 11th digits: The first 3 digits are sequential codes, and the 4th digit is reserved, with the default value of 0. The sequence code starts from 001 according to the provincial section of the highway, starting from the north / east direction (the loop route is in clockwise order from the north direction). If the highway is not segmented, the sequence code is fixed to 001. (4) Toll interval layer: The code length is 16 bits in total. Rules for the 1st to 11th bits: Directly use the section layer code. If multiple sections are involved, select the section code with a higher administrative level and a smaller highway number. Rules for the 12th to 14th bits: Starting from the north / east direction, number in sequence from 001. When the section changes, the numbering starts again from 001. Rules for the 15th bit: "1" means up, "2" means down. Rules for the 16th bit: Reserved bit, default is 0. (5) Intercommunication layer: The code length is 15 bits in total. Rules for the 1st to 11th bits: Use the section layer code. If multiple sections exist, select the section code with a higher administrative level and a smaller highway number. Rules for digits 12-15: The first three digits are the interchange sequence number, numbered from 001 according to the north / east direction; the fourth digit is reserved for subsequent interchanges, and the default value is 0. (6) Ramp layer: The coding length is 18 digits. Rules for digits 1-15: The interchange layer code is used. Rules for digits 16-17: Indicates the turning direction of intersection section 1 and intersection section 2, numbered clockwise starting from the north / east direction, with the specific corresponding relationship as follows: 11 represents north-east, 12 represents north-south, 13 represents north-west, 21 represents east-south, 22 represents east-west, 23 represents east-north, 31 represents south-west, 32 represents south-north, 33 represents south-east, 41 represents west-north, 42 represents west-east, and 43 represents west-south. Rules for digit 18: "1" represents the main line, and "2" represents the ramp. (7) Service facility layer: The coding length is 18 digits. Rules for digits 1-11: Use the section-level code. Rules for digits 12-15: Starting from the north / east direction, number the routes sequentially from 001. The 15th digit is reserved and starts at 0. If the route section or uplink / downlink direction changes, the numbering restarts from 001. Rules for digit 16: "0" indicates bidirectional, "1" indicates uplink, and "2" indicates downlink.Rules for digits 17-18: "01" indicates a service area, "02" indicates a parking lot, "03" indicates a gas station, and "04" indicates a charging station. (8) Roadside equipment layer: The coding length is 18 digits. Rules for digits 1-11: Use the road section layer coding. Rules for digits 12-15: Starting from the north / east direction, numbering starts from 001 in sequence. The 15th digit is a reserved digit and starts from 0. When the road section changes or the up / down direction changes, the numbering starts again from 001. Rules for digits 16: "0" indicates bidirectional, "1" indicates uplink, and "2" indicates downlink. Rules for digits 17-18: "11" indicates a surveillance camera, and "12" indicates a DSRC (Dedicated Short Range Communications) gantry.

[0047] Take a section of the Shanghai-Kunming Expressway (G60) in Hangzhou, Zhejiang Province (33) as an example. Highway layer: Code "G006033", indicating that it is the Zhejiang section of the Shanghai-Kunming Expressway. Section layer: Code "G0060330030", indicating that it is the third section of the Hangzhou section of the expressway. Toll section layer: Code "G006033003000120", indicating that it is a certain downlink toll section. Interchange layer: Code "G00603300300020", indicating that it is the second interchange of the section. Ramp layer: Code "G00603300300020212", indicating that it is the east-southeast ramp of the interchange. Service facility layer: Code "G00603300300010003", indicating that it is the first two-way gas station of the section. Roadside equipment layer: Code "G00603300300010012" indicates the first bidirectional DSRC gantry on the road section. This code represents the spatial topology of the toll collection unit within the road network and clearly identifies it as administratively located in Hangzhou, Zhejiang.

[0048] Step S12: Match the vehicle positioning data with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle's passage process, and generate initial billing details after closing the passage record.

[0049] In this embodiment, the vehicle positioning data is matched with the geographic element identification code in the vector map to obtain the charging unit and the corresponding start and end time corresponding to the vehicle passage process, and the initial billing details are generated after the passage record is closed. The initial billing details contain multiple billings, and each charging unit corresponds to a billing. The billing amount is calculated based on the length of the charging unit and the rate, and the charging mileage and amount of all billing details in the passage record are accumulated to obtain the total mileage and total billing amount of the passage record. It should be pointed out that if multiple geographic element identification codes in the vector map are matched to the same charging unit, the earliest matching time and the latest matching time of the multiple geographic element identification codes are determined, and the multiple billings corresponding to the multiple geographic element identification codes are merged into one billing; the time span of the one billing is determined based on the earliest matching time and the latest matching time.

[0050] For example, suppose a car is traveling on a highway, and its positioning data is matched with a vector map within a certain period of time. At 10:00, the vehicle positioning data matches the geographic element identification code GID-001, which corresponds to charging unit A; at 10:10, the positioning data matches the geographic element identification code GID-002, which also corresponds to charging unit A; at 10:20, the positioning data matches the geographic element identification code GID-003, which also corresponds to charging unit A. When closing the pass record to generate the initial billing details, since GID-001, GID-002, and GID-003 all match the same charging unit A, the system will determine that the earliest matching time of these multiple geographic element identification codes is 10:00 and the latest matching time is 10:20. Originally, these three geographic element identification codes would correspond to three billings respectively, but according to the above rules, these three billings will be merged into one billing. The combined charge spans from 10:00 to 10:20. This approach more accurately reflects the actual time a vehicle passes through the same toll station, avoiding duplicate charges or unreasonable split charges, and ensuring accurate and reasonable charges.

[0051] Step S13: If it is detected that the charging units corresponding to two adjacent charges in the initial billing details are discontinuous on the passage path, the missing charging units are supplemented based on the preset coding system to generate the final billing details.

[0052] In this embodiment, after closing the passage record, the system will sort the initial billing details according to the start and end time. If it is detected that the charging units corresponding to two adjacent charges in the initial billing details are not continuous along the passage path, the missing charging units will be supplemented based on the preset coding system to generate the final billing details. The following are two specific examples of missing supplementation:

[0053] In one specific embodiment, the charging units in the preset coding system are used as nodes. When any two charging units are directly connected, an edge is established between the two nodes corresponding to the two charging units. The weight of the edge is the topological distance between the two charging units. For a detected discontinuous path portion, the starting and ending nodes of the discontinuous path portion are determined, and the path with the shortest topological distance between the starting and ending nodes is calculated using a shortest path algorithm. The missing charging units are then completed based on the path with the shortest topological distance. The shortest path algorithm includes, but is not limited to, the Dijkstra algorithm, the A-Star algorithm (A* search algorithm), and the bidirectional Dijkstra algorithm (bidirectional Dijkstra algorithm).

[0054] The Dijkstra algorithm is suitable for solving the single-source shortest path problem. It starts from a source node and gradually explores outward, calculating the shortest path to each other node. Its advantage is that it can guarantee a global optimal solution. In small and medium-sized road networks, its algorithm logic is relatively simple, easy to implement and understand. The algorithm definition is as follows: ; is the topological distance from charging unit i to charging unit j, The A-Star algorithm represents the sum of the topological distances of the edges traversed from the source node through a series of toll units to reach other nodes. The A-Star algorithm introduces a heuristic function, h(n), which estimates the distance from the current node to the target node. This heuristic function significantly improves search efficiency, by 30%-50% compared to traditional algorithms. It can quickly find optimal paths in complex road networks with large numbers of nodes and edges. The bidirectional Dijkstra algorithm is suitable for long-distance path completion. It performs a Dijkstra search simultaneously from both the starting point and the end point. This bidirectional search theoretically reduces the search range by approximately 50%, significantly improving efficiency when calculating long-distance paths. In practical applications, the appropriate shortest path algorithm can be selected for highway toll unit path completion based on factors such as the network size, path characteristics (such as distance), and resource and time requirements.

[0055] In another specific embodiment, it is determined based on the passage record whether the charging unit at the vehicle entry position and / or the charging unit at the vehicle exit position is missing; if the charging unit at the vehicle entry position and / or the charging unit at the vehicle exit position is missing, the charging unit with the shortest topological distance is recursively searched based on the hierarchical nested structure in the preset coding system, and when the charging unit with the shortest topological distance meets the preset recursive condition, the charging unit with the shortest topological distance is determined as the missing charging unit, and the missing charging unit is completed.

[0056] In the first aspect, if only the charging unit at the vehicle entry location is missing, then based on the hierarchical nested structure in the preset coding system, a reverse recursive search is performed for the charging unit with the shortest topological distance. The constraint formula can be , indicating that the recursive search depth is no more than 5 levels, which refers to the level of the hierarchical nesting structure in the preset coding system; secondly, if only the charging unit at the vehicle exit position is missing, then based on the hierarchical nesting structure in the preset coding system, the forward recursive search is performed for the charging unit with the shortest topological distance. The constraint formula can be , indicating that the recursive search depth is no more than 3 levels; thirdly, if the charging unit at the vehicle entry position is missing and the charging unit at the vehicle exit position is missing, then based on the hierarchical nested structure in the preset code, a bidirectional recursive search is performed for the charging unit with the shortest topological distance. The constraint formula can be , indicating that when searching for the charging unit with the shortest topological distance, the topological distance range considered is limited to no more than 5 kilometers. It should be noted that. When the recursive search depth is not greater than the preset number of levels, and the charging unit with the shortest topological distance meets the valid path rule in the preset coding system, it is determined that the charging unit with the shortest topological distance meets the preset recursive condition, and the charging unit with the shortest topological distance is determined to be the missing charging unit, that is, , Indicates the verification result, the value is "success" or "failure, Indicates that there is a path that complies with the valid path rules in the preset encoding system. Indicates the upper limit of the recursive search depth.

[0057] See also Figure 2As shown in the figure, in the toll collection system, the overall process operates collaboratively through the perception layer, processing layer, and application layer. The positioning module of the perception layer obtains vehicle positioning data and transmits it to the processing layer after data preprocessing. The road network matching engine of the processing layer matches the positioning data with the geographic feature identification code of the vector map according to a preset coding system. The code converter then converts it into the charging unit code. The billing processor generates the initial billing details based on this. If the paths corresponding to adjacent charging units are found to be discontinuous, the shortest path algorithm module constructs a graph structure based on the preset coding system and calculates the shortest path in topological distance. The recursive verification module recursively searches and verifies according to the hierarchical nested structure to determine the missing charging units. The application layer receives the results of the processing layer, integrates the paths with the path completion results, generates a fee list for the billing list, and the payment interface realizes the payment.

[0058] See also Figure 3 As shown, Figure 3 This document demonstrates the process for vehicle toll collection within a highway toll collection system. First, the vehicle's location data is received, followed by a determination of whether a GIS (Geographic Information System) match is successful. If the match fails, the process ends. If successful, a GID sequence is generated and converted into a toll unit code, creating an initial toll record. The system then determines whether the vehicle's path is continuous. If so, the toll is calculated directly, an electronic bill is generated, and the process ends. If the path is discontinuous, a shortest path algorithm is first used to complete the path, followed by recursive verification to verify the completion result. If the recursion depth is less than 5, missing units are automatically completed. If the recursion depth is 5 or greater, manual verification is performed to ensure the accuracy and rationality of the billing.

[0059] To verify the effectiveness and accuracy of this solution, this embodiment selected high-traffic highway scenarios, complex interchange scenarios, and tunnel scenarios for testing. The following are the specific test results and analysis.

[0060] (1) High-traffic and high-speed scenarios

[0061] In this scenario, a total of 53,078 samples were selected for testing. High-traffic highway sections are characterized by dense traffic and diverse driving conditions, placing extremely high demands on the real-time and accuracy of the path completion algorithm. The algorithm successfully completed 53,058 samples with an accuracy rate of 99.96%. This demonstrates that the algorithm can effectively handle complex traffic conditions when completing vehicle paths in high-traffic highway scenarios. It can accurately complete paths even when large numbers of vehicles are traveling simultaneously and positioning data is frequently updated, thereby ensuring toll collection accuracy.

[0062] (2) Complex interchange scenarios

[0063] For complex interchange scenarios, the test sample size was 4,543. Interchanges have complex road structures and highly variable vehicle paths, which can easily lead to problems such as difficulty matching positioning data and path discontinuities. The algorithm successfully completed all 4,533 samples, achieving an exceptionally high accuracy of 99.98%. This demonstrates the algorithm's strong adaptability to complex spatial topologies, enabling it to accurately analyze vehicle trajectories in interchanges. Through a rational path completion strategy, it can address toll collection challenges caused by complex road structures.

[0064] (3) Tunnel scene

[0065] In tunnel testing, the number of samples was 1,475. Due to factors such as signal obstruction, positioning data may be erroneous or lost in tunnels. The algorithm successfully completed all 1,470 samples with an accuracy rate of 99.66%. This demonstrates that the algorithm possesses sufficient error correction and path repair capabilities for positioning data in tunnels, a unique environment. It can accurately complete the vehicle's path within the tunnel, ensuring reasonable toll collection.

[0066] In summary, this solution demonstrates excellent performance in different typical scenarios. Therefore, in highway toll collection applications, this solution can reliably solve vehicle path-related issues.

[0067] This application introduces the method of "space-time processing + digital modeling" to construct a unified road network coding standard, and based on this, realizes precise road matching and billing processing. After closing the traffic record, the system will sort the billing details according to the start and end time, and check whether the adjacent billing details are continuous. For discontinuous billing details, the shortest path algorithm is used to supplement the charging unit with the smallest fee amount, and create the billing details. When closing the traffic record, check whether the entrance or exit of the toll road is missing. If missing, use a recursive algorithm to supplement the charging unit until the entrance or exit of the toll road is found, or the unique charging unit cannot be found. By associating the charging unit with the geographic feature identification code in the vector map, the complex charging structure of the highway can be described in detail. The Dijkstra algorithm and the recursive algorithm are used to ensure the continuity of the driving path and reduce the possibility of missed or duplicate billing. By automatically merging and completing the billing details and checking the rationality of the toll path, the accuracy and automation of the billing process are improved.

[0068] It can be seen that the present application proposes a method for determining highway tolls, including: obtaining a preset coding system; the preset coding system establishes the spatial topological structure and administrative affiliation of the charging unit in the road network according to the hierarchical nested structure and road feature information, the charging unit has a billing attribute, and the charging unit is bound to the geographic element identification code in the vector map; the vehicle positioning data is matched with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle passage process, and generate the initial billing details after closing the passage record; if it is detected that the charging units corresponding to two adjacent billings in the initial billing details are not continuous on the passage path, the missing charging units are supplemented based on the preset coding system to generate the final billing details. In summary, it can be seen that the preset coding system in the present application is constructed according to the hierarchical nested structure and road feature information, so that complex road structures can be finely coded. At the same time, the present application binds the charging unit to the geographic element identification code in the vector map, creates a standardized digital representation for each charging unit, overcomes the shortcomings of the coarse-grained matching of the traditional solution, and makes the description of the road network more detailed and accurate. In addition, after matching the vehicle positioning data with the geographic element identification code to obtain the charging unit and generate the initial billing details, for the situation where adjacent charging units in the initial billing details are discontinuous on the passage path, this application can complete the missing charging units based on the preset coding system, ensuring the continuity of the charging interval, so as to accurately calculate the vehicle's fees during the entire passage process, solving the problem that traditional solutions cannot support the calculation of continuous charging intervals.

[0069] Accordingly, the present application also discloses a device for determining highway toll charges, see Figure 4 As shown, the device includes:

[0070] A coding system determination module 11 is configured to obtain a preset coding system; the preset coding system establishes the spatial topology and administrative affiliation of charging units in the road network according to a hierarchical nested structure and road feature information; the charging units have billing attributes and are bound to geographic element identification codes in a vector map;

[0071] a charging unit matching module 12 for matching the vehicle positioning data with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle's passage process and generate initial billing details after closing the passage record;

[0072] The completion and billing module 13 is used to complete the missing charging units based on the preset coding system to generate the final billing details if it is detected that the charging units corresponding to two adjacent billings in the initial billing details are discontinuous on the pass path.

[0073] Among them, for more specific working processes of the above modules, please refer to the corresponding contents disclosed in the aforementioned embodiments, which will not be repeated here.

[0074] It can be seen that the present application proposes a method for determining highway tolls, including: obtaining a preset coding system; the preset coding system establishes the spatial topological structure and administrative affiliation of the charging unit in the road network according to the hierarchical nested structure and road feature information, the charging unit has a billing attribute, and the charging unit is bound to the geographic element identification code in the vector map; the vehicle positioning data is matched with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle passage process, and generate the initial billing details after closing the passage record; if it is detected that the charging units corresponding to two adjacent billings in the initial billing details are not continuous on the passage path, the missing charging units are supplemented based on the preset coding system to generate the final billing details. In summary, it can be seen that the preset coding system in the present application is constructed according to the hierarchical nested structure and road feature information, so that complex road structures can be finely coded. At the same time, the present application binds the charging unit to the geographic element identification code in the vector map, creates a standardized digital representation for each charging unit, overcomes the shortcomings of the coarse-grained matching of the traditional solution, and makes the description of the road network more detailed and accurate. In addition, after matching the vehicle positioning data with the geographic element identification code to obtain the charging unit and generate the initial billing details, for the situation where adjacent charging units in the initial billing details are discontinuous on the passage path, this application can complete the missing charging units based on the preset coding system, ensuring the continuity of the charging interval, so as to accurately calculate the vehicle's fees during the entire passage process, solving the problem that traditional solutions cannot support the calculation of continuous charging intervals.

[0075] Furthermore, an embodiment of the present application also provides an electronic device. Figure 5 This is a structural diagram of an electronic device 20 according to an exemplary embodiment. The content in the diagram should not be considered as any limitation to the scope of application of the present application.

[0076] Figure 5 This is a schematic diagram of the structure of an electronic device 20 provided in an embodiment of the present application. The electronic device 20 may specifically include: at least one processor 21, at least one memory 22, a display 23, an input / output interface 24, a communication interface 25, a power supply 26, and a communication bus 27. The memory 22 is used to store a computer program, which is loaded and executed by the processor 21 to implement the relevant steps of the highway toll determination method disclosed in any of the aforementioned embodiments. Furthermore, the electronic device 20 in this embodiment may specifically be an electronic computer.

[0077] In this embodiment, the power supply 26 is used to provide operating voltage for each hardware device on the electronic device 20; the communication interface 25 can create a data transmission channel between the electronic device 20 and the external device. The communication protocol it follows is any communication protocol that can be applied to the technical solution of this application and is not specifically limited here; the input and output interface 24 is used to obtain external input data or output data to the outside world. Its specific interface type can be selected according to specific application needs and is not specifically limited here.

[0078] Furthermore, the memory 22, as a resource storage medium, may be a read-only memory, random access memory, a magnetic disk, or an optical disk. The resources stored therein may include a computer program 221, which may be stored in a temporary or permanent manner. In addition to including a computer program capable of implementing the highway toll determination method disclosed in any of the aforementioned embodiments and executed by the electronic device 20, the computer program 221 may further include computer programs capable of performing other specific tasks.

[0079] Furthermore, an embodiment of the present application also discloses a computer-readable storage medium for storing a computer program; wherein, when the computer program is executed by a processor, the aforementioned method for determining highway tolls disclosed above is implemented.

[0080] For the specific steps of this method, please refer to the corresponding contents disclosed in the aforementioned embodiments, which will not be repeated here.

[0081] The various embodiments in this application are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other. For the devices disclosed in the embodiments, since they correspond to the methods disclosed in the embodiments, the description is relatively simple, and the relevant parts can be referred to the method part.

[0082] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the above description has generally described the components and steps of each example according to their functions. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0083] The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein may be implemented directly using hardware, a software module executed by a processor, or a combination of the two. The software module may be placed in random access memory (RAM), internal memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

[0084] Finally, it should be noted that, in this document, relational terms such as first and second, etc., are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "comprises," "comprising," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or device comprising a series of elements includes not only those elements, but also other elements not explicitly listed, or elements inherent to such process, method, article, or device. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of additional identical elements in the process, method, article, or device comprising the element.

[0085] The above is a detailed introduction to the highway toll determination method, device, equipment, and storage medium provided by this application. Specific examples are used in this article to illustrate the principles and implementation methods of this application. The description of the above embodiments is only used to help understand the method and core ideas of this application; at the same time, for general technical personnel in this field, based on the ideas of this application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as a limitation on this application.

Claims

1. A method for determining highway toll charges, characterized in that: include: Get the preset encoding system; The preset coding system establishes the spatial topological structure and administrative affiliation of charging units in the road network according to the hierarchical nested structure and road feature information. The charging units have billing attributes and are bound to the geographic element identification codes in the vector map. Matching the vehicle positioning data with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle's passage process, and generating initial billing details after closing the passage record; If it is detected that the charging units corresponding to two adjacent charges in the initial billing details are not continuous on the passage path, the missing charging units are supplemented based on the preset coding system to generate the final billing details.

2. The method for determining highway tolls according to claim 1, wherein: The preset coding system includes a highway layer, a road section layer, a toll interval layer, an interchange layer, a ramp layer, a service facility layer and a roadside equipment layer. The toll collection unit includes the toll interval layer, the interchange layer and the ramp layer; wherein the toll interval is the main road between two interchanges.

3. The method for determining highway tolls according to claim 1, wherein: The method of supplementing the missing charging unit based on the preset coding system includes: The charging units in the preset coding system are nodes, and when any two charging units are directly connected, an edge is established between the two nodes corresponding to the any two charging units; wherein the weight value of the edge is the topological distance between the any two charging units; For the detected discontinuous path portion, determine the starting node and the ending node of the discontinuous path portion, and calculate the path with the shortest topological distance between the starting node and the ending node according to the shortest path algorithm, and complete the missing charging unit according to the path with the shortest topological distance.

4. The method for determining highway tolls according to claim 1, wherein: The method of supplementing the missing charging unit based on the preset coding system includes: Determining whether the charging unit at the vehicle entry location and / or the charging unit at the vehicle exit location is missing based on the traffic record; If the charging unit at the vehicle entry position and / or the charging unit at the vehicle exit position is missing, the charging unit with the shortest topological distance is recursively searched based on the hierarchical nested structure in the preset coding system, and when the charging unit with the shortest topological distance meets the preset recursive condition, the charging unit with the shortest topological distance is determined as the missing charging unit and is supplemented accordingly.

5. The method for determining highway tolls according to claim 4, wherein: If the charging unit at the vehicle entry position is missing and / or the charging unit at the vehicle exit position is missing, recursively searching for the charging unit with the shortest topological distance based on the hierarchical nested structure in the preset coding system includes: If only the charging unit at the vehicle entry location is missing, then based on the hierarchical nested structure in the preset coding system, reversely recursively search for the charging unit with the shortest topological distance; If only the toll collection unit at the vehicle exit location is missing, then based on the hierarchical nested structure in the preset coding system, forward recursively search for the toll collection unit with the shortest topological distance; If the charging unit at the vehicle entry position is missing and the charging unit at the vehicle exit position is missing, a bidirectional recursive search is performed for the charging unit with the shortest topological distance based on the hierarchical nested structure in the preset code.

6. The method for determining highway tolls according to claim 5, wherein: When the charging unit with the shortest topological distance satisfies a preset recursive condition, determining the charging unit with the shortest topological distance as the missing charging unit includes: When the recursive search depth is not greater than the preset number of levels, and the charging unit with the shortest topological distance meets the valid path rules in the preset coding system, the charging unit with the shortest topological distance is determined to meet the preset recursive conditions, and the charging unit with the shortest topological distance is determined to be the missing charging unit.

7. The method for determining highway tolls according to any one of claims 1 to 6, characterized in that: The process of matching the vehicle positioning data with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle passage process and generate the corresponding initial billing details also includes: If multiple geographic element identification codes in the vector map match the same charging unit, determining the earliest matching time and the latest matching time of the multiple geographic element identification codes; The multiple billings corresponding to the multiple geographic element identification codes are merged into one billing; the time span of the one billing is determined based on the earliest matching time and the latest matching time.

8. A device for determining highway toll charges, characterized in that: include: A coding system determination module, used to obtain a preset coding system; The preset coding system establishes the spatial topological structure and administrative affiliation of charging units in the road network according to the hierarchical nested structure and road feature information. The charging units have billing attributes and are bound to the geographic element identification codes in the vector map. a charging unit matching module for matching the vehicle positioning data with the geographic element identification code in the vector map to obtain the charging unit corresponding to the vehicle's passage process and generate initial billing details after closing the passage record; The completion and billing module is used to complete the missing charging units based on the preset coding system to generate the final billing details if it is detected that the charging units corresponding to two adjacent billings in the initial billing details are discontinuous on the pass path.

9. An electronic device, characterized in that: include: Memory, used to store computer programs; A processor, configured to execute the computer program to implement the method for determining highway tolls according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that Used to store a computer program; wherein, when the computer program is executed by a processor, it implements the highway toll determination method according to any one of claims 1 to 7.

Images