Vehicle positioning-based illegal vehicle use monitoring method, system, equipment and medium
By demarcating electronic fences in vehicle monitoring and processing trajectory data, using inverse geocoding and polygon judgment, the monitoring inaccuracy problem caused by positioning errors is solved, and the accuracy and timeliness of vehicle monitoring are improved.
Patent Information
- Application Number
- CN202510042293.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-01-10
- Publication Date
- 2025-07-08
AI Technical Summary
The existing vehicle monitoring technology has problems in positioning accuracy and signal reliability, resulting in false alarms and missed alarms, blurred boundaries of electronic fences, affecting monitoring accuracy.
By demarcating electronic fences, configuring the departure location, destination location and pass through, processing vehicle trajectory data to remove noise and drift points, using inverse geocoding to match administrative area codes, and combining polygon fences to determine parking locations, improving alarm accuracy.
It realizes the accuracy of vehicle trajectory analysis and the timeliness of alarms, reduces false alarms and missed reports, and enhances the regulatory effect.
Smart Images
Figure CN120279698A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical fields of geographic information processing and vehicle monitoring, and specifically relates to a method, system, device, and medium for monitoring illegal vehicle use based on vehicle positioning. Background Art
[0002] GIS, i.e., Geographic Information System, is a specific and very important spatial information system. It collects, stores, manages, calculates, analyzes, displays, and describes relevant geographic distribution data in the space of the entire or part of the Earth's surface (including the atmosphere) under the support of computer hardware and software systems.
[0003] BDS, i.e., BeiDou Navigation Satellite System, is a global satellite navigation system independently built and operated by China.
[0004] An electronic fence is a virtual boundary created using electronic technology and a positioning system (such as GPS, RFID, etc.). An electronic fence sets a virtual geographic boundary through software and hardware technologies. When a target (such as a vehicle, animal, or person) enters or leaves this boundary, the system will automatically send an alarm or perform a preset action.
[0005] Existing vehicle monitoring technologies usually rely on positioning technologies such as GPS or BeiDou, combined with in-vehicle terminals and back-end monitoring platforms, to determine whether a vehicle is in violation by using location data, such as exceeding an electronic fence or entering a restricted area. Although widely used, there are also some significant drawbacks: (1) Positioning accuracy and signal reliability issues: GPS / BeiDou signals will deteriorate in specific environments (such as urban canyons with high-rise buildings, tunnels, underground parking lots, and dense forests), resulting in positioning drift or increased errors, which may reach dozens of meters or even hundreds of meters. This can cause false alarms (the vehicle is misjudged to enter a restricted area or leave a designated area) or missed alarms (the vehicle is actually in violation but the positioning shows it is in a compliant area). (2) Blurred electronic fence boundary: When setting an electronic fence, the boundary is usually a line. When the vehicle's driving trajectory is close to the boundary, due to positioning errors, it may repeatedly cross the virtual boundary line, generating a large number of "entry and exit" alarms, many of which are invalid.
[0006] Therefore, how to improve the accuracy of positioning and alarm is of great significance to the development of vehicle monitoring technologies. Summary of the Invention
[0007] In view of the deficiencies in the prior art, the present invention provides a method, system, device and medium for monitoring illegal vehicle use based on vehicle positioning, which analyzes and processes vehicle trajectories, matches an alarm rule model to generate a vehicle use warning, so as to standardize vehicle use and can timely and early detect illegal vehicle use through technical means.
[0008] To achieve the above object, the present invention adopts the following technical solutions:
[0009] A method for monitoring illegal vehicle use based on vehicle positioning, comprising the following steps:
[0010] Step 1: Define an electronic fence for specifying the parking range and bind the associated vehicle.
[0011] Step 2: Configure the departure location, destination location and passing locations. The passing locations of the round-trip route of the vehicle are the same, and the route from the departure location to the destination must be unique and cannot be configured repeatedly.
[0012] Step 3: Obtain a vehicle use task, obtain vehicle trajectory data according to the task departure time and task end time, and then remove noise points, drift points and compress the trajectory data.
[0013] Step 4: Determine whether the trajectory data processed in Step 3 is all within the passing locations. If so, enter Step 5; otherwise, determine that there is a detour and generate a passing location anomaly alarm.
[0014] Step 5: After the vehicle use task ends, obtain the vehicle parking position, and determine whether the parking position is within the bound fence. If so, end the monitoring; otherwise, generate an illegal parking alarm.
[0015] To optimize the above technical solutions, the specific measures taken further include:
[0016] Further, in Step 1, the point order of the electronic fence needs to be clockwise or counterclockwise without crossing. The polygon electronic fence data consists of longitude, latitude, point order, fence name and alarm rules, and is stored in the database.
[0017] Further, in Step 2, the configuration of the departure location, destination location and passing locations specifically includes: configuring the administrative region codes of the departure location, destination location and passing locations.
[0018] Further, in Step 3, the removal of noise points, drift points and compression of the trajectory data is specifically as follows:
[0019] The method for processing trajectory noise points is: removing the points in the trajectory point set where the longitude and latitude are not within the vehicle use country, the speed is equal to 0 or the positioning status is non-positioning.
[0020] The method for processing trajectory drift points is as follows: Calculate the distance between two adjacent points in the trajectory. If the distance between two adjacent points is greater than the set distance threshold and the positioning time between the two adjacent points is less than or equal to the set time threshold, it is considered that the latter point is a drift point and is removed from the trajectory point set;
[0021] The method for compressing trajectory data is as follows: Segment and slice the continuous trajectory points according to the direction angle every 15 degrees, then process each sliced trajectory segment. For the trajectory segments with more than 10 trajectory points in all trajectory segments, perform average sampling with a sampling rate of 5, that is, retain one point for every 5 trajectory points, and retain the last point position for the trajectory points that do not meet the sampling rate.
[0022] Further, in step 4, the method for determining whether all the trajectory data processed in step 3 is within the passing area is as follows:
[0023] Read the processed trajectory data P[p1, p2, …, p i ,..., p n , where p i represents the i-th trajectory point. Use inverse geocoding to convert the trajectory point p i into an administrative region code adcode, and then match it with the administrative region codes of the passing areas. If the administrative region code of the trajectory point p i is in the set L of administrative region codes of the passing areas, the trajectory is normal; if the administrative region code of the trajectory point p i is not in the set L of administrative region codes of the passing areas, the trajectory is abnormal.
[0024] Further, in step 5, the method for determining whether the parking position is within the bound fence is as follows:
[0025] The fence is a polygon. If the parking position is at a vertex of the polygon, it is considered that the parking position is within the bound fence;
[0026] If the parking position is on any side of the polygon, it is considered that the parking position is within the bound fence;
[0027] If the parking position is neither on a side nor coincides with any vertex, the following process is used for judgment:
[0028] Step a: Traverse the longitude and latitude of the vertices of the polygon fence. Define the west longitude as negative, the east longitude as positive, the south latitude as negative, and the north latitude as positive, to obtain the minimum longitude x min , the minimum latitude y min , the maximum longitude x max and the maximum latitude y max, the minimum longitude and the minimum latitude form the first vertex, the maximum longitude and the minimum latitude form the second vertex, the maximum longitude and the maximum latitude form the third vertex, and the minimum longitude and the maximum latitude form the fourth vertex. The first vertex, the second vertex, the third vertex, and the fourth vertex form a rectangle M that is the minimum enclosing fence;
[0029] Step b: Determine whether the longitude and latitude point P(x,y) of the parking position is within the rectangle M, where x is the longitude of the longitude and latitude point of the parking position and y is the latitude of the longitude and latitude point of the parking position. If it does not satisfy x >= x min and x <= x max , or does not satisfy y >= y min and y <= y max , it is considered that the parking position is not inside the polygon fence and not inside the rectangle M either; if it simultaneously satisfies x >= x min and x <= x max , y >= y min and y <= y max , it is considered that the longitude and latitude point of the parking position is inside the rectangle M, and proceed to step c;
[0030] Step c: Emit a horizontal ray from the longitude and latitude point of the parking position to find the intersection points with each side of the polygon, and determine the number of intersection points. If it is odd, it is considered that the parking position is inside the polygon fence, otherwise it is outside the fence.
[0031] The present invention also proposes a monitoring system for illegal vehicle use based on vehicle positioning, including:
[0032] An electronic fence setting module for delimiting an electronic fence and binding and associating vehicles; the electronic fence is used to define the parking range;
[0033] A route configuration module for configuring the departure location, the destination location, and the passing locations. The passing locations of the round-trip route of the vehicle are the same, and the route from the departure place to the destination must be unique and cannot be configured repeatedly;
[0034] A trajectory preprocessing module for obtaining a vehicle use task, obtaining vehicle trajectory data according to the task departure time and the task end time, and then removing noise points, drift points, and compressing the trajectory data;
[0035] A detour judgment module for judging whether the trajectory data processed by the trajectory preprocessing module is all within the passing locations. If so, call the illegal parking judgment module, otherwise determine that a detour has occurred and generate a passing location anomaly warning;
[0036] An illegal parking judgment module for obtaining the vehicle parking position after the vehicle use task ends, and judging whether the parking position is within the bound fence. If so, end the monitoring, otherwise generate an illegal parking warning.
[0037] The beneficial effects of the present invention are as follows: The present invention analyzes and processes vehicle trajectories, matches warning rule models, and generates vehicle usage warnings to standardize vehicle usage, enabling timely and early detection of illegal vehicle usage through technical means. The present invention effectively improves the accuracy of warnings and strengthens the supervision effect through two-way constraints of the route passing areas and electronic fences, and is easy to replicate and promote. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 FIG. is a flowchart of an illegal vehicle usage monitoring method based on vehicle positioning proposed by the present invention.
[0039] Figure 2 FIG. is a schematic diagram of a rectangle forming a minimum enclosing fence.
[0040] Figure 3 FIG. is a schematic diagram for judging whether the longitude and latitude points of the parking position are within the rectangle.
[0041] Figure 4 FIG. is a schematic diagram for judging whether the longitude and latitude points of the parking position are within the fence by the ray method. DETAILED DESCRIPTION OF THE EMBODIMENTS
[0042] Next, the technical solutions in the embodiments of the present application will be clearly and completely described with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present application without creative efforts shall fall within the protection scope of the present application.
[0043] Embodiment 1
[0044] The present invention proposes an illegal vehicle usage monitoring method based on vehicle positioning. The flowchart of this method is as Figure 1 shown, and includes the following steps:
[0045] Step 1: Define an electronic fence for specifying the parking range and bind and associate vehicles; in Step 1, the point order of the electronic fence needs to be clockwise or counterclockwise without crossing. The polygon electronic fence data consists of longitude, latitude, point order, fence name, and warning rules, and is stored in the database.
[0046] Step 2: Configure the departure location, destination location, and passing areas. The passing areas of the round-trip routes of the vehicle are the same, and the route from the departure location to the destination must be unique and cannot be configured repeatedly; in Step 2, the specific configuration of the departure location, destination location, and passing areas includes: configuring the administrative region codes of the departure location, destination location, and passing areas. For example, if the passing area is Nanjing, the administrative region code 3201 is stored in the database.
[0047] Step 3: Obtain the vehicle usage task, acquire the vehicle trajectory data based on the task departure time and task end time, and then remove noise points, drift points, and compress the trajectory data. In step 3, the specific method for removing noise points, drift points, and compressing the trajectory data is as follows:
[0048] The method for processing trajectory noise points is: remove the points in the trajectory point set where the longitude and latitude are not within the vehicle usage country, the speed is equal to 0, or the positioning status is non-positioning.
[0049] The method for processing trajectory drift points is: calculate the distance between adjacent two points in the trajectory. If the distance between adjacent two points is greater than the set distance threshold and the positioning time between adjacent two points is less than or equal to the set time threshold (the time threshold in this embodiment is 30s), it is considered that the latter point is a drift point and is removed from the trajectory point set.
[0050] The method for compressing the trajectory data is: segment and slice the continuous trajectory points according to the direction angle every 15 degrees, then process each sliced trajectory segment, perform average sampling on the trajectory segments with more than 10 trajectory points in all trajectory segments, the sampling rate is 5, that is, one point is retained every 5 trajectory points, and the last point is retained for the trajectory points that do not meet the sampling rate.
[0051] Step 4: Determine whether all the trajectory data processed in step 3 is within the passing areas. If so, enter step 5; otherwise, determine that there is a deviation and generate an alarm for abnormal passing areas. In step 4, the method for determining whether all the trajectory data processed in step 3 is within the passing areas is as follows:
[0052] Read the processed trajectory data P[p1, p2, …, p i ,..., p n , where p i represents the i-th trajectory point. Use inverse geocoding to convert the trajectory point p i to the administrative region code adcode, and then match it with the administrative region codes of the passing areas. If the administrative region code of the trajectory point p i is in the set L of administrative region codes of the passing areas, the trajectory is normal; if the administrative region code of the trajectory point p i is not in the set L of administrative region codes of the passing areas, the trajectory is abnormal.
[0053] Step 5: After the vehicle usage task ends, obtain the vehicle parking location, and determine whether the parking location is within the bound fence. If so, end the monitoring; otherwise, generate an alarm for illegal parking. In step 5, the method for determining whether the parking location is within the bound fence is as follows:
[0054] The fence is a polygon. If the parking location is at a vertex of the polygon, it is considered that the parking location is within the bound fence.
[0055] If the parking position is on any side of the polygon, it is considered that the parking position is within the bound fence;
[0056] If the parking position is neither on a side nor coincides with any vertex, the following process is used for judgment:
[0057] Step a: Traverse the longitude and latitude of the polygon fence vertices. As Figure 2 shown, to facilitate comparison of the magnitudes of longitude and latitude, the west longitude is defined as negative, the east longitude as positive, the south latitude as negative, and the north latitude as positive, obtaining the minimum longitude x min , the minimum latitude y min , the maximum longitude x max and the maximum latitude y max . The minimum longitude and minimum latitude form the first vertex A(x min ,y min ), the maximum longitude and minimum latitude form the second vertex B(x max ,y min ), the maximum longitude and maximum latitude form the third vertex C(x max ,y max ), the minimum longitude and maximum latitude form the fourth vertex D(x min ,y max ). The first vertex, the second vertex, the third vertex, and the fourth vertex form a rectangle M that minimally encloses the fence;
[0058] Step b: Determine whether the longitude and latitude point P(x,y) of the parking position is within the rectangle M. As Figure 3 shown, x is the longitude of the longitude and latitude point of the parking position, and y is the latitude of the longitude and latitude point of the parking position. If it does not satisfy x >= x min and x <= x max , or does not satisfy y >= y min and y <= y max , it is considered that the parking position is not inside the polygon fence and not inside the rectangle M either; if it simultaneously satisfies x >= x min and x <= x max , y >= y min and y <= y max , it is considered that the longitude and latitude point of the parking position is inside the rectangle M, and proceed to step c;
[0059] Step c: Emit a horizontal ray from the longitude and latitude point of the parking position to find the intersection points with the sides of the polygon, and judge the number of intersection points. If it is odd, it is considered that the parking position is inside the polygon fence; otherwise, it is outside the fence. As Figure 4 shown.
[0060] Embodiment 2
[0061] The present invention proposes a vehicle positioning-based illegal vehicle use monitoring system corresponding to the method of Embodiment 1, including:
[0062] An electronic fence setting module for defining an electronic fence and binding associated vehicles; the electronic fence is used to define a parking range;
[0063] A route configuration module for configuring a departure location, a destination location, and passing locations. The passing locations of the round-trip route of the vehicle are the same, and the route from the departure location to the destination must be unique and cannot be configured repeatedly;
[0064] A trajectory preprocessing module for obtaining a vehicle usage task, obtaining vehicle trajectory data according to the task departure time and task end time, and then removing noise points, drift points, and compressing the trajectory data;
[0065] A detour judgment module for judging whether the trajectory data processed by the trajectory preprocessing module is all within the passing locations. If so, call the illegal parking judgment module; otherwise, determine that a detour has occurred and generate a passing location anomaly warning;
[0066] An illegal parking judgment module for obtaining the vehicle parking position after the vehicle usage task ends, and judging whether the parking position is within the bound fence. If so, end the monitoring; otherwise, generate an illegal parking warning.
[0067] The implementation methods of each module and module functions in the system are exactly the same as the steps of the method in Embodiment 1, so they will not be described in detail here.
[0068] Embodiment 3
[0069] The present invention provides an electronic device, including: a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, it implements the illegal vehicle usage monitoring method based on vehicle positioning as described in Embodiment 1.
[0070] Embodiment 4
[0071] The present invention provides a computer-readable storage medium storing a computer program, and the computer program causes a computer to execute the illegal vehicle usage monitoring method based on vehicle positioning as described in Embodiment 1.
[0072] In the embodiments disclosed in the present application, a computer storage medium may be a tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device. The computer storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatuses, or devices, or any suitable combination of the foregoing. More specific examples of the computer storage medium would include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disc read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.
[0073] Those of ordinary skill in the art will appreciate that the units and algorithm steps of the examples described in connection with the embodiments disclosed in the present application can be implemented in electronic hardware or in a combination of computer software and electronic hardware. Whether these functions are executed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may use different methods for each specific application to implement the described functions, but such implementation should not be considered to exceed the scope of the present application. The above are only the preferred embodiments of the present invention, and the protection scope of the present invention is not limited to the above embodiments. All technical solutions falling within the idea of the present invention belong to the protection scope of the present invention. It should be noted that for those of ordinary skill in the art of this technology, several improvements and refinements made without departing from the principle of the present invention should be regarded as within the protection scope of the present invention.
Claims
1. A method for monitoring illegal vehicle use based on vehicle positioning, characterized in that, It includes the following steps: Step 1: Define an electronic fence for specifying the parking range and bind the associated vehicle; Step 2: Configure the departure location, destination location, and passing locations. The passing locations of the vehicle's round-trip route are the same. The route from the departure location to the destination must be unique and cannot be configured repeatedly; Step 3: Obtain the vehicle usage task, obtain the vehicle trajectory data according to the task departure time and task end time, and then remove noise points, drift points, and compress the trajectory data; Step 4: Determine whether the trajectory data processed in Step 3 is all within the passing locations. If so, go to Step 5; otherwise, determine that a detour occurs and generate an abnormal warning for the passing location; Step 5: After the vehicle usage task ends, obtain the vehicle parking location and determine whether the parking location is within the bound fence. If so, end the monitoring; otherwise, generate a warning for illegal parking.
2. The method for monitoring illegal vehicle use based on vehicle positioning according to claim 1, wherein, In Step 1, the point order of the electronic fence needs to be clockwise or counterclockwise without crossing. The polygon electronic fence data consists of longitude, latitude, point order, fence name, and warning rules, and is stored in the database.
3. The method for monitoring illegal vehicle use based on vehicle positioning according to claim 1, characterized in that In Step 2, the specific configuration of the departure location, destination location, and passing locations includes: configuring the administrative region codes of the departure location, destination location, and passing locations.
4. The method for monitoring illegal vehicle use based on vehicle positioning according to claim 1, wherein, In Step 3, the specific method of removing noise points, drift points, and compressing the trajectory data is as follows: The method for processing trajectory noise points is: remove the points in the trajectory point set whose longitude and latitude are not within the vehicle-using country, the speed is equal to 0, or the positioning status is non-positioning; The method for processing trajectory drift points is: calculate the distance between adjacent two points in the trajectory. If the distance between adjacent two points is greater than the set distance threshold and the positioning time between adjacent two points is less than or equal to the set time threshold, the latter point is considered a drift point and removed from the trajectory point set; The method for compressing the trajectory data is: segment and slice the continuous trajectory points according to the direction angle every 15 degrees, then process each sliced trajectory segment, and perform average sampling on the trajectory segments with more than 10 trajectory points in all trajectory segments. The sampling rate is 5, that is, one point is retained for every 5 trajectory points, and the last point is retained for the trajectory points that do not meet the sampling rate.
5. The method for monitoring illegal vehicle use based on vehicle positioning according to claim 1, characterized in that, In Step 4, the method for determining whether the trajectory data processed in Step 3 is all within the passing locations is: Read the processed trajectory data P[p1, p2, …, p i ,..., p n , where p i represents the i-th trajectory point. Use reverse geocoding to convert the trajectory point p i into the administrative region code adcode, and then match it with the administrative region codes of the passing places. If the administrative region code of the trajectory point p i is in the set L of administrative region codes of the passing places, the trajectory is normal; if the administrative region code of the trajectory point p i is not in the set L of administrative region codes of the passing places, the trajectory is abnormal.
6. The method for monitoring illegal vehicle use based on vehicle positioning according to claim 1, characterized in that In Step 5, the method for determining whether the parking location is within the bound fence is: If the fence is a polygon and the parking location is at a vertex of the polygon, the parking location is considered to be within the bound fence; If the parking location is on any side of the polygon, the parking location is considered to be within the bound fence; If the parking location is neither on a side nor coincides with any vertex, the following process is used for judgment: Step a: Traverse the latitudes and longitudes of the vertices of the polygon fence. Define the west longitude as negative, the east longitude as positive, the south latitude as negative, and the north latitude as positive to obtain the minimum longitude x min , the minimum latitude y min , the maximum longitude x max and the maximum latitude y max . The minimum longitude and the minimum latitude form the first vertex, the maximum longitude and the minimum latitude form the second vertex, the maximum longitude and the maximum latitude form the third vertex, and the minimum longitude and the maximum latitude form the fourth vertex. The first vertex, the second vertex, the third vertex, and the fourth vertex form a rectangle M that minimally encloses the fence Step b: Determine whether the longitude and latitude point P(x, y) of the parking position is within the rectangle M, where x is the longitude of the longitude and latitude point of the parking position, and y is the latitude of the longitude and latitude point of the parking position. If it does not satisfy x >= x min and x <= x max , or does not satisfy y >= y min and y <= y max , it is considered that the parking position is not inside the polygon fence and not inside the rectangle M either; if it simultaneously satisfies x >= x min and x <= x max , y >= y min and y <= y max , it is considered that the longitude and latitude point of the parking position is inside the rectangle M, and enter step c; Step c: Emit a horizontal ray from the longitude and latitude point of the parking location to the right to find the intersection points with each side of the polygon, and judge the number of intersection points. If the number is odd, the parking location is considered to be inside the polygon fence; otherwise, it is outside the fence.
7. A vehicle positioning-based illegal vehicle use monitoring system, characterized in that, It includes: An electronic fence setting module for defining the electronic fence and binding the associated vehicle; the electronic fence is used to specify the parking range; A route configuration module for configuring the departure location, destination location, and passing locations. The passing locations of the vehicle's round-trip route are the same. The route from the departure location to the destination must be unique and cannot be configured repeatedly; A trajectory preprocessing module, which is used to obtain vehicle usage tasks, acquire vehicle trajectory data according to the task departure time and task end time, and then remove noise points and drift points from the trajectory data and compress it; A detour judgment module, which is used to judge whether all the trajectory data processed by the trajectory preprocessing module is within the passing areas. If so, it calls the illegal parking judgment module; otherwise, it determines that there is a detour and generates an abnormal warning for the passing areas; An illegal parking judgment module, which is used to obtain the vehicle parking position after the vehicle usage task ends, and judge whether the parking position is within the bound fence. If so, the monitoring ends; otherwise, an illegal parking warning is generated.
8. An electronic device, characterized in that, including: A memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, the method for monitoring illegal vehicle usage based on vehicle positioning according to any one of claims 1-6 is implemented.
9. A computer-readable storage medium storing a computer program, characterized in that, The computer program causes the computer to execute the method for monitoring illegal vehicle usage based on vehicle positioning according to any one of claims 1-6.