A method and device for processing highway toll information

Abstract

The invention discloses a method for processing highway toll information, and relates to the field of computers, and in particular to a method for processing highway toll information. By constructing a site model, and in the site model, establishing a virtual channel for two toll units in the same toll interval and in opposite directions, it is possible to perform reverse gantry misidentification interference compatibility processing on an actual highway network, calculate and restore the actual vehicle driving path, and avoid erroneous charges caused by billing errors caused by reverse gantry misidentification.

Description

Technical Field

[0001] The present invention relates to the field of computers, and in particular to a method and device for processing highway toll information. Background Art

[0002] At present, my country implements a networked toll collection system for highways, that is, after a vehicle enters the highway through the entrance lane, no toll will be charged in the middle, no matter how many different highway toll collection entities it passes through, until it leaves the highway, at which point the toll will be charged according to the vehicle's actual travel path in the exit lane.

[0003] Since highways are all two-way lanes, the gantry uses microwave communication technology to identify vehicles, which is prone to reverse interference and gives the vehicle a reverse logo. This will cause the vehicle's billing path to be inconsistent with the actual travel path, resulting in charging errors. In the case of incorrect charging, the only solution is to refund the fee afterwards or temporarily close the gantry.

[0004] Therefore, in view of the problems existing in the prior art, it is urgent to provide a technology that can avoid the interference of the identified reverse gantry, and it is particularly important to calculate a technology that conforms to the actual passage path. Summary of the invention

[0005] The object of the present invention is to avoid the deficiencies in the prior art and to provide a method for calculating the actual toll of a vehicle without being affected by erroneous identification of a reverse gantry.

[0006] The purpose of the present invention is achieved through the following technical solutions:

[0007] A method for processing highway toll information comprises the following steps:

[0008] S1: Obtaining a site model, where the site model includes a number of connection channels, which are used to represent the connection relationship between each charging site and each charging unit;

[0009] S2: establish a virtual channel for two charging units in the same charging interval and in opposite directions, and update the site model;

[0010] S3: Acquire vehicle driving information, which includes information about each toll station and toll unit that the vehicle passes through;

[0011] S4: In the site model updated in step S2, the vehicle travel path is fitted by using the shortest path algorithm;

[0012] S5: Calculate the toll of the vehicle according to the vehicle's travel path.

[0013] Specifically, the toll station information obtained in step S3 includes: time information when the vehicle passes through the toll station; the toll unit information obtained in step S3 includes: time information when the vehicle passes through the toll unit.

[0014] More specifically, step S4 includes:

[0015] S41: Determine the starting toll station and the ending toll station of the vehicle.

[0016] More specifically, step S4 also includes:

[0017] S42: Determine the order in which the vehicle passes through each toll unit according to the time information when the vehicle passes through the toll unit.

[0018] More specifically, step S4 also includes:

[0019] S43: According to the determined starting toll station and ending toll station and the determined order of the toll units, the shortest driving path connecting the starting toll station and the ending toll station is fitted in the station model.

[0020] More specifically, step S4 also includes:

[0021] S44: adding the information of the toll units added in the shortest driving path to the information of the toll units passed by the vehicle obtained in step S3 in order, and synthesizing the vehicle driving path;

[0022] S45: In the vehicle driving path obtained in step S44, the connecting channels are merged.

[0023] More specifically, the shortest path algorithm adopts Dijkstra algorithm.

[0024] In the above, each connection channel in the site model is associated with corresponding mileage information and fee information; the mileage information and fee information corresponding to the virtual channel are both zero.

[0025] According to another aspect of the present invention, there is provided a computing device, including a memory, a processor, and computer instructions stored in the memory and executable on the processor, wherein the processor implements the steps of the above-mentioned highway toll information processing method when executing the instructions.

[0026] According to another aspect of the present invention, a computer-readable storage medium is provided, which stores computer instructions, and when the instructions are executed by a processor, the steps of the highway toll information processing method described above are implemented.

[0027] The beneficial effects achieved by the present invention are as follows: a method for processing highway toll information, which constructs a site model and establishes a virtual channel for two toll units in the same toll interval and in opposite directions in the site model, thereby realizing reverse gantry misidentification interference compatibility processing for the actual highway network, calculating and restoring the actual driving path of the vehicle, and avoiding erroneous charges caused by billing errors due to reverse gantry misidentification. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] The present invention may be better understood by describing exemplary embodiments disclosed in the present invention in conjunction with the accompanying drawings, in which:

[0029] Figure 1 What is shown is a schematic structural block diagram of a computing device according to an embodiment disclosed in the present invention;

[0030] Figure 2 What is shown is a schematic flow chart of a method for processing highway toll information according to an embodiment disclosed in the present invention;

[0031] Figure 3 Shown is a schematic diagram of a highway station model according to an embodiment disclosed in the present invention. DETAILED DESCRIPTION

[0032] The specific embodiments of the present invention will be described below. It should be noted that in the specific description of these embodiments, in order to be concise and clear, this specification cannot provide a detailed description of all the features of the actual embodiments. It should be understood that in the actual implementation of any embodiment, just as in the process of any engineering project or design project, in order to achieve the specific goals of the developer and to meet system-related or business-related restrictions, various specific decisions are often made, and this will also change from one embodiment to another. In addition, it can also be understood that although the efforts made in this development process may be complex and lengthy, for ordinary technicians in the field related to the content disclosed by the present invention, some changes such as design, manufacturing or production based on the technical content disclosed by the present invention are just conventional technical means, and should not be understood as the content of the present invention is insufficient.

[0033] Unless otherwise defined, the technical or scientific terms used in the claims and the specification shall have the usual meaning understood by persons with ordinary skills in the technical field to which the invention belongs. The words "first", "second" and similar words used in the patent application specification and the claims of the present invention do not indicate any order, quantity or importance, but are only used to distinguish different components. "One" or "one" and other similar words do not indicate a quantitative limitation, but indicate the existence of at least one. "Include" or "comprises" and other similar words mean that the elements or objects appearing before "include" or "comprises" include the elements or objects listed after "include" or "comprises" and their equivalent elements, and do not exclude other elements or objects. "Connected" or "connected" and other similar words are not limited to physical or mechanical connections, nor are they limited to direct or indirect connections.

[0034] Figure 1 The structure block diagram of a computing device 100 according to an embodiment of the present specification is shown. The components of the computing device 100 include but are not limited to a memory 110 and a processor 120. The processor 120 is connected to the memory 110 via a bus 130, and the database 150 is used to store data.

[0035] The computing device 100 also includes an access device 140 that enables the computing device 100 to communicate via one or more networks 160. Examples of these networks include a public switched telephone network (PSTN), a local area network (LAN), a wide area network (WAN), a personal area network (PAN), or a combination of communication networks such as the Internet. The access device 140 may include one or more of any type of network interface (e.g., a network interface card (NIC)) whether wired or wireless, such as an IEEE 802.11 wireless local area network (WLAN) wireless interface, a World Wide Interoperability for Microwave Access (Wi-MAX) interface, an Ethernet interface, a universal serial bus (USB) interface, a cellular network interface, a Bluetooth interface, a near field communication (NFC) interface, and the like.

[0036] In one embodiment of the present specification, the above components of the computing device 100 and Figure 1 Other components not shown in the figure may also be connected to each other, for example, via a bus. It should be understood that Figure 1 The computing device structure block diagram shown is only for the purpose of illustration, and is not intended to limit the scope of this specification. Those skilled in the art can add or replace other components as needed.

[0037] The computing device 100 may be any type of stationary or mobile computing device, including a mobile computer or mobile computing device (e.g., a tablet computer, a personal digital assistant, a laptop computer, a notebook computer, a netbook, etc.), a mobile phone (e.g., a smart phone), a wearable computing device (e.g., a smart watch, smart glasses, etc.), or other types of mobile devices, or a stationary computing device such as a desktop computer or PC. The computing device 100 may also be a mobile or stationary server.

[0038] The processor 120 may execute Figure 2 Steps in the method shown.

[0039] Figure 2 A schematic flow chart of a method for processing highway toll information according to an embodiment of the present application is shown, including steps S1 to S5.

[0040] In order to make the objectives, technical solutions and advantages of the present invention more clear, the embodiments of the present invention will be further described in detail below with reference to the accompanying drawings.

[0041] A method for processing highway toll information comprises the following steps:

[0042] S1: Obtaining a site model, where the site model includes a number of connection channels, which are used to represent the connection relationship between each charging site and each charging unit;

[0043] S2: A virtual channel is established for two charging units in the same charging section and in opposite directions, and the site model is updated; each charging unit is connected to the corresponding charging unit in the opposite direction through the virtual channel.

[0044] S3: Acquire vehicle driving information, which includes information about each toll station and toll unit that the vehicle passes through;

[0045] S4: In the site model updated in step S2, the vehicle travel path is fitted by using the shortest path algorithm;

[0046] S5: Calculate the toll of the vehicle according to the vehicle's travel path.

[0047] The toll station information obtained in step S3 includes: time information when the vehicle passes through the toll station; the toll unit information obtained in step S3 includes: time information when the vehicle passes through the toll unit.

[0048] Specifically, step S4 also includes the following steps:

[0049] S41: Determine the starting toll station and the ending toll station of the vehicle;

[0050] S42: determining the order in which the vehicle passes through each toll unit according to the time information when the vehicle passes through the toll unit;

[0051] S43: According to the determined order of the starting toll station and the ending toll station and the determined toll units, the shortest driving path connecting the starting toll station and the ending toll station is fitted in the station model; wherein the shortest driving path includes information of all the determined toll stations and the determined toll units;

[0052] S44: updating the vehicle driving information, adding the information of the charging units added in the shortest driving path to the vehicle driving information obtained in step S3 in order, and synthesizing the vehicle driving path;

[0053] S45: In the vehicle driving path obtained in step S44, the connection channels are merged to remove redundant virtual channels.

[0054] like Figure 3 As shown in the figure, it is a simplified example of the station model: A1, A2, C1 and C2 are toll stations, B1, B2, D1, D2, E1, E2, F1, F2, G1, G2, H1, H2, I1 and I2 are toll units; different letters are used to represent different toll intervals; the same letter but different numbers are used to represent toll stations or toll units in the same toll interval but in opposite directions. There are connecting channels between each interconnected toll station and toll unit.

[0055] When a vehicle passes through the interchange in the figure, it can continue to go straight, turn left, or turn right, but it cannot make a U-turn; taking A1 as an example, after a vehicle enters the interchange through A1, it can continue to go straight to toll unit B1, or turn left to toll unit F2, or turn right to toll unit G1.

[0056] For example, a vehicle enters the expressway from A1, passes through B1, and then leaves the expressway from C1. If the gantry has no recognition errors, the system retrieves the gantry information that the vehicle has passed through through the network, that is, the toll station information and toll unit information corresponding to the toll station and toll unit that have recognized the vehicle, and performs path fitting. The path calculated by fitting should be consistent with the actual path of the vehicle, which is A1-B1-C1.

[0057] If the vehicle is recognized and captured by the reverse gantry when passing through toll section B, the toll station information and toll unit information passed by the vehicle will be inconsistent with the actual information. At this time, the vehicle path points captured by the gantry and uploaded to the system are: A1, B2, C1.

[0058] If the site model is not further modified by establishing a virtual channel through step S2, but the gantry data of the vehicle passing through is directly retrieved through step S3 and fitted by step S4, at this time, since there is no direct connection between the charging units A1, B2 and C1, the system needs to fit a reasonable connection path connecting the above three charging units according to the road network. The fitted path is: A1-G1-H1-I2-B2-F2-E1-D1-C1 or A1-F2-E1-D1-B2-G1-H1-I2-C1. At this time, the path calculated by fitting is seriously inconsistent with the actual path of the vehicle.

[0059] After the network is modified in step S2, a virtual channel is established between B1 and B2: B1-B2 and B2-B1; similarly, between D1 and D2, between E1 and E2, between F1 and F2, between G1 and G2, between H1 and H2, and between I1 and I2. At this time, after steps S41 to S43, when the shortest path algorithm is used for fitting, the shortest driving path fitted is: A1-B1-B2-B1-C1, and the vehicle driving path is updated in step S44. At this time, the vehicle driving path is A1-B1-B2-B1-C1, which is close to the actual driving path of the vehicle.

[0060] Specifically, the shortest path algorithm adopts the Dijkstra algorithm.

[0061] Furthermore, each connection channel in the site model is associated with corresponding mileage information and fee information; the mileage information and fee information corresponding to the virtual channel are both zero. In the vehicle driving path A1-B1-B2-B1-C1, since the connection channels B1-B2 and B2-B1 are both virtual channels, the mileage information and fee information are both zero. When calculating the toll of the tolled vehicle, only the connection channels A1-B1 and B1-C1 need to be calculated. At this time, the calculated toll of the vehicle is consistent with the fee that should be collected for the actual passage of the vehicle.

[0062] Furthermore, step S45 can remove redundant virtual channels by merging the connection channels. In the above-mentioned fitting path A1-B1-B2-B1-C1, there are 5 nodes (the front and rear two are toll stations, and the middle 3 are toll units) and 4 connection channels: A1-B1, B1-B2, B2-B1 and B1-C1, among which B1-B2 and B2-B1 are both virtual channels; since A1-B1 and B1-C1 are consistent in the end, at this time, B1-B2 and B2-B1 can be directly removed at the same time without affecting the connection of the entire path; after removing B1-B2 and B2-B1, the remaining connection channels are: A1-B1 and B1-C1, and the connection channels A1-B1 and B1-C1 can be directly connected head to tail to form a new fitting path A1-B1-C1, which is exactly the same as the actual driving path of the vehicle, completely eliminating the interference caused by the misidentification of the reverse gantry, and restoring the actual driving path of the vehicle.

[0063] An embodiment of the present application further provides a computer-readable storage medium storing computer instructions, which, when executed by a processor, implement the steps of the highway toll information processing method as described above.

[0064] The above is a schematic scheme of a computer-readable storage medium of this embodiment. It should be noted that the technical scheme of the storage medium and the technical scheme of the above-mentioned highway toll information processing method belong to the same concept, and the details not described in detail in the technical scheme of the storage medium can be referred to the description of the technical scheme of the above-mentioned highway toll information processing method.

[0065] The above is a description of a specific embodiment of the specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the embodiments and still achieve the desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0066] The computer instructions include computer program codes, which may be in source code form, object code form, executable files or some intermediate forms, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the content contained in the computer-readable medium may be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electric carrier signals and telecommunication signals.

[0067] To summarize, according to an exemplary embodiment, by constructing a site model and establishing a virtual channel in the site model for two toll units in the same toll interval and in opposite directions, it is possible to perform reverse gantry misidentification interference compatibility processing on the actual highway network, filter out reverse interference conditions, calculate and restore the actual vehicle driving path, and avoid the problem of erroneous charging due to system calculation errors during the automatic toll collection and deduction process of highways, which can greatly reduce unnecessary labor costs; and the above method is very simple and efficient in the calculation process, which is beneficial to the stability of the overall system.

[0068] It should be noted that, in the apparatus and method disclosed in the present invention, it is obvious that each component or each step can be decomposed and / or recombined. These decompositions and / or recombinations should be regarded as equivalent schemes disclosed in the present invention. In addition, the steps of performing the above series of processes can naturally be performed in chronological order according to the order of description, but do not necessarily need to be performed in chronological order. Some steps can be performed in parallel or independently of each other.

[0069] The above specific implementations do not constitute a limitation on the scope of protection disclosed by the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle disclosed by the present invention shall be included in the scope of protection disclosed by the present invention.

Claims

1. A method for processing highway toll information, characterized in that: The following steps are involved: S1: Acquire a site model, wherein the site model includes a plurality of connection channels, which are used to represent the connection relationship between each charging site and each charging unit; S2: establishing a virtual channel for two charging units in the same charging interval and in opposite directions, and updating the site model; S3: Acquire vehicle driving information, wherein the vehicle driving information includes information of each toll station and toll unit that the vehicle passes through; The toll station information acquired in step S3 includes: time information when the vehicle passes through the toll station; The charging unit information acquired in step S3 includes: time information when the vehicle passes through the charging unit; S4: In the site model updated in step S2, the vehicle travel path is calculated by fitting the shortest path algorithm; The step S4 comprises: S41: Determine the starting toll station and the ending toll station of the vehicle; S42: determining the order in which the vehicle passes through each toll unit according to the time information when the vehicle passes through the toll unit; S43: fitting the shortest driving path between the starting toll station and the ending toll station in the station model according to the determined starting toll station and the ending toll station and the determined order of the toll units; S44: adding the information of the charging units added in the shortest driving path to the vehicle driving information obtained in step S3 in order, and synthesizing the vehicle driving path; S45: merging the connecting channels in the vehicle driving path obtained in step S44; S5: Calculate the toll of the vehicle according to the vehicle's travel path; Each connection channel in the site model is associated with corresponding mileage information and fee information; The mileage information and fee information corresponding to the virtual channel are both zero.

2. A method for processing highway toll information according to claim 1, characterized in that: The shortest path algorithm adopts Dijkstra algorithm.

3. A computing device comprising a memory, a processor, and computer instructions stored in the memory and executable on the processor, characterized in that: When the processor executes the instructions, the steps of the method according to any one of claims 1 to 2 are implemented.

4. A computer-readable storage medium storing computer instructions, characterized in that: When the instruction is executed by a processor, the steps of the method described in any one of claims 1 to 2 are implemented.

Images