Fence-based vehicle inspection method, device and storage medium

Abstract

The present application relates to a vehicle checking method, device and storage medium based on a fence. The method includes: obtaining the original trajectory points of the vehicle, wherein the original trajectory points include the various stop points of the vehicle; establishing a stop sequence for each vehicle for the original trajectory points, generating an index based on the stop sequence, so as to query through query conditions; setting the query conditions to an electronic fence and preset time information for querying, and obtaining the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence. The present application accurately delineates the fence boundary, counts the time when the vehicle enters and exits the fence, and determines whether the vehicle carries the route in combination with the time limit. Through the truck's trajectory information and the marked fence information, the historical carrier vehicle can be accurately found without the need for a complex model. The operation is simple and efficient, thereby improving the search efficiency.

Description

Technical Field

[0001] The present application relates to the technical field of trajectory mining and electronic fences. More specifically, the present application relates to a fence-based vehicle inspection method, device, and storage medium. Background Art

[0002] In the truck matching application scenario, a transportation requirement is given and a suitable vehicle is found from a vast pool of vehicles. Existing methods create a "profile" of the vehicle, using basic vehicle information, routes it frequently travels, cargo types it frequently transports, and its past orders. These methods then use models or algorithms to match and sort, selecting the vehicle most likely to complete the transaction.

[0003] However, if these prior data are missing, such as the type of cargo on the vehicle, historical orders, etc., and only vehicle trajectories are available, the model-based approach is not applicable. Summary of the Invention

[0004] To address the aforementioned technical deficiencies and the need for faster vehicle inspections, the present invention proposes a vehicle inspection solution based on electronic fencing. Electronic fencing does not employ physical protective walls or fences, but instead uses positioning, communication, and sensor detection technologies to detect cross-zone behavior within a virtual perimeter. The present invention first establishes an index of each vehicle and its corresponding stop point, then uses the starting and ending fencing, along with a preset time limit, to query the target vehicle's transport data.

[0005] A first aspect of the present invention provides a fence-based vehicle inspection method, the method comprising:

[0006] Obtaining original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle;

[0007] Establishing a stop sequence for each vehicle based on the original trajectory points, and generating an index based on the stop sequence to enable querying based on query conditions;

[0008] The query conditions are set to the electronic fence and the preset time limit information to obtain the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence.

[0009] Specifically, the index generated according to the docking sequence is generated based on H3 grid and GeoHash.

[0010] Specifically, the index generated according to the docking sequence is generated based on the H3 grid and GeoHash, including:

[0011] Get the H3 hexagonal grid;

[0012] Create a joint index between each vehicle and each H3 hexagonal grid.

[0013] Furthermore, the establishing of a joint index between each vehicle and each H3 hexagonal grid includes:

[0014] Get the stop sequence;

[0015] Establish a mapping relationship between each vehicle ID and each H3 hexagonal grid in the stop sequence;

[0016] Converting the position coordinates of the stop points in the stop point sequence into character strings, wherein the stop points are represented by five-tuples;

[0017] Generate a joint index for querying vehicles.

[0018] Furthermore, the query condition is set to an electronic fence and preset time information to query, and the carrier information of the target vehicle is obtained, wherein the electronic fence includes a starting fence and an end fence, including:

[0019] Mark the starting and ending fences;

[0020] Get preset timeliness information;

[0021] Query target vehicles that are within the starting fence and the ending fence and meet the preset time information.

[0022] Furthermore, the target vehicle in the query is within the starting fence and the ending fence and meets the preset time limit information: the kth stop of the target vehicle is within the starting fence, the rth stop is within the ending fence, and the start time of the rth stop is later than the end time of the kth stop, where k and r are natural numbers.

[0023] Further preferably, after obtaining the transport information of the target vehicle, the method further includes: sorting the vehicles from high to low according to the number of transport trips within the boundaries defined by the starting point fence and the end point fence.

[0024] A second aspect of the present invention provides a fence-based vehicle inspection device, the device comprising:

[0025] The first module is used to obtain the original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle;

[0026] The second module is used to establish a stop sequence for each vehicle based on the original trajectory points, and generate an index based on the stop sequence to query according to the query conditions;

[0027] The third module is used to set the query condition to the electronic fence and preset time information to query and obtain the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence.

[0028] A third aspect of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the following steps:

[0029] Obtaining original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle;

[0030] Establishing a stop sequence for each vehicle based on the original trajectory points, and generating an index based on the stop sequence to enable querying based on query conditions;

[0031] The query conditions are set to the electronic fence and the preset time limit information to obtain the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence.

[0032] A fourth aspect of the present invention provides a computer program product, comprising a computer program, which, when executed by a processor, implements the following steps:

[0033] Obtaining original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle;

[0034] Establishing a stop sequence for each vehicle based on the original trajectory points, and generating an index based on the stop sequence to enable querying based on query conditions;

[0035] The query conditions are set to the electronic fence and the preset time limit information to obtain the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence.

[0036] The beneficial effects of this application are as follows: this application establishes a stop sequence for each vehicle based on the original trajectory point, generates an index based on the stop sequence, and searches through query conditions. The query conditions are set to the electronic fence and preset time information for query, and the carrier information of the target vehicle is obtained. It has been verified that this method is simple and efficient and has high accuracy in finding matching vehicles. This application accurately delineates the fence boundary, counts the time when the vehicle enters and exits the fence, and determines whether the vehicle is carrying the route based on the time. Through the truck's trajectory information and the marked fence information, the historical carrier vehicle can be accurately found. No complex model is required, the operation is simple and efficient, and the search efficiency is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the present application and, together with the description, serve to explain the principles of the present application.

[0038] The present application can be more clearly understood from the following detailed description with reference to the accompanying drawings, in which:

[0039] Figure 1 A schematic diagram of the method steps of an exemplary embodiment of the present application is shown;

[0040] Figure 2 A schematic diagram of an electronic fence according to an exemplary embodiment of the present application is shown;

[0041] Figure 3 A schematic diagram of an electronic fence and H3 grid application according to an exemplary embodiment of the present application is shown;

[0042] Figure 4 A schematic diagram of the device structure of an exemplary embodiment of the present application is shown;

[0043] Figure 5 A schematic structural diagram of an electronic device provided by an exemplary embodiment of the present application is shown;

[0044] Figure 6 A schematic diagram of a storage medium provided by an exemplary embodiment of the present application is shown. DETAILED DESCRIPTION

[0045] Hereinafter, embodiments of the present application will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are merely exemplary and are not intended to limit the scope of the present application. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present application. It is obvious to those skilled in the art that the present application can be implemented without one or more of these details. In other examples, in order to avoid confusion with the present application, some technical features known in the art are not described.

[0046] It should be noted that the terms used herein are only for the purpose of describing specific embodiments and are not intended to limit the exemplary embodiments according to the present application. As used herein, unless the context clearly indicates otherwise, the singular form is also intended to include the plural form. In addition, it should also be understood that when the terms "comprise" and / or "include" are used in this specification, they indicate the presence of the features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.

[0047] Now, exemplary embodiments according to the present application will be described in more detail with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in a variety of different forms and should not be construed as being limited to the embodiments described herein. The accompanying drawings are not drawn to scale, and certain details may be magnified and omitted for the purpose of clarity. The shapes of the various regions and layers shown in the figures and the relative sizes and positional relationships therebetween are merely exemplary and may deviate in practice due to manufacturing tolerances or technical limitations, and those skilled in the art may further design regions / layers with different shapes, sizes, and relative positions according to actual needs.

[0048] The following is attached with the instruction manual Figure 1-6 Several examples are given to describe exemplary implementations of the present application. It should be noted that the following application scenarios are only provided to facilitate understanding of the spirit and principles of the present application, and the implementations of the present application are not limited in this respect. On the contrary, the implementations of the present application can be applied to any applicable scenario.

[0049] Example 1:

[0050] This embodiment implements a fence-based vehicle inspection method, such as Figure 1 As shown, the method includes:

[0051] S1. Obtaining original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle;

[0052] S2. Establish a stop sequence for each vehicle based on the original trajectory points, and generate an index based on the stop sequence to query based on the query condition;

[0053] S3. Set the query condition to the electronic fence and preset time information to query and obtain the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence.

[0054] Electronic fences do not have physical protective walls or fences, but use positioning, communication, sensor detection and other technologies to detect cross-area behavior of virtual perimeters, such as Figure 2 As shown, the electronic fence can enclose a boundary by the starting fence and the end fence. Figure 2 Some of the characters are unclear, which does not affect the content to be protected by this application. Figure 2 It mainly serves as a guide.

[0055] The index generated according to the docking sequence is based on the H3 grid and GeoHash.

[0056] Specifically, the index generated according to the docking sequence is based on the H3 grid and GeoHash, including:

[0057] Get the H3 hexagonal grid;

[0058] Create a joint index between each vehicle and each H3 hexagonal grid.

[0059] Furthermore, a joint index is established between each vehicle and each H3 hexagonal grid, including:

[0060] Get the stop sequence;

[0061] Establish a mapping relationship between each vehicle ID and each H3 hexagonal grid in the stop sequence;

[0062] Convert the position coordinates of the stop points in the stop point sequence into strings, where the stop points are represented by five-tuples;

[0063] Generate a joint index for querying vehicles.

[0064] Furthermore, the query condition is set to the electronic fence and the preset time information to query and obtain the carrier information of the target vehicle, wherein the electronic fence includes the starting fence and the end fence, including:

[0065] Mark the starting and ending fences;

[0066] Get preset timeliness information;

[0067] Query the target vehicles that are within the starting fence and the ending fence and meet the preset time information.

[0068] Furthermore, the query for target vehicles within the starting and ending fences that meet the preset timeliness requirements is as follows: the target vehicle's kth stop is within the starting fence, the rth stop is within the ending fence, and the start time of the rth stop is later than the end time of the kth stop, where k and r are natural numbers. The target vehicle's kth stop can be on the same day, on different days, or within a preset time period.

[0069] Further preferably, after obtaining the transport information of the target vehicle, the method further includes: sorting the vehicles from high to low according to the number of transport trips within the boundaries defined by the starting point fence and the end point fence.

[0070] This application establishes a stop sequence for each vehicle based on the original trajectory point, generates an index based on the stop sequence, and queries through query conditions. The query conditions are set to electronic fences and preset time information for query to obtain the carrier information of the target vehicle. It has been verified that this method is simple and efficient and has a high accuracy in finding matching vehicles.

[0071] Example 2:

[0072] This embodiment implements a fence-based vehicle inspection method, including: obtaining the original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle; establishing a stop sequence for each vehicle for the original trajectory points, generating an index based on the stop sequence, and querying through query conditions; setting the query conditions to an electronic fence and preset time information for querying to obtain the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence.

[0073] In one possible implementation, obtaining the vehicle's original trajectory requires obtaining the vehicle's daily stops. When calculating vehicle stops, the starting point is the first point with a GPS speed of 0, and the ending point is the first point with a GPS speed greater than 0 or a point greater than 100 meters away from the next point with a GPS speed of 0. Once the ending point is determined, the stop center and maximum radius are calculated. Stops with a maximum radius greater than 50 meters are filtered out, and stops with a maximum radius less than 50 meters are output, and the next stop is determined.

[0074] Assuming that a car has an average of 10 stops per day, there are about 3,600 stops per year. The number of stops for 6 million cars per year is about 21.6 billion. In order to quickly retrieve the target vehicle through these stops, a stop sequence sp for each vehicle is established. i =(sp i1 ,sp i2 ,…sp in ), an index is generated based on the stop sequence to enable querying based on query conditions. Each stop point is a five-tuple sp = (vid, lon, lat, st, et), where vid is the vehicle ID, lon is the longitude coordinate, lat is the latitude coordinate, st is the stop start time, and et is the stop end time. For point spatial location search, we use H3 grid and GeoHash dual indexing to quickly retrieve vehicles within a specified polygon. For example: for each vehicle, create index A: vid:<gid1,gid2...gidn> , where vid is the vehicle ID and gid is the H3 hexagonal grid. H3 is a hexagonal hierarchical index grid system open sourced by Uber that can convert longitude and latitude into a string ID, such as Figure 3 As shown, a polygonal geo-fence can be filled with a specified level of H3 grid, thereby converting the boundary into a sequence of strings.

[0075] Specifically, generating an index based on the stop sequence is based on the H3 grid and GeoHash, including: obtaining the H3 hexagonal grid; establishing a joint index between each vehicle and each H3 hexagonal grid. Establishing a joint index between each vehicle and each H3 hexagonal grid includes: obtaining the stop sequence; establishing a mapping relationship between each vehicle ID in the stop sequence and each H3 hexagonal grid; converting the location coordinates of the stop points in the stop sequence into strings, where the stop points are represented by five-tuples; and generating a joint index for querying vehicles.

[0076] Furthermore, the query conditions are set to the electronic fence and preset time limit information for query to obtain the carrier information of the target vehicle, wherein the electronic fence includes the starting fence and the end fence, including: marking the starting fence and the end fence; obtaining the preset time limit information; querying the target vehicle within the starting fence and the end fence and meeting the preset time limit information.

[0077] Furthermore, the query is performed to determine if the target vehicle that is within the starting fence and the ending fence and meets the preset time limit information satisfies:

[0078] and

[0079] where 0≤r≤k≤n

[0080] Where i represents the target vehicle, k and r are stops, SPG represents the starting fence, EPG represents the ending fence, and Δt represents the preset time limit. The conditions are: the kth stop is within the starting fence, the rth stop is within the ending fence, and the start time of the rth stop is later than the end time of the kth stop. k and r are natural numbers. The kth stop can be on the same day as the target vehicle, on different days, or within a preset time period.

[0081] Further preferably, after obtaining the transport information of the target vehicle, the method further includes: sorting the vehicles from high to low according to the number of transport trips within the boundaries defined by the starting point fence and the end point fence.

[0082] In a possible most specific implementation, given the start and end polygons, the start and end H3 grid ID lists HSP and ESP are converted, and the vehicle ID list VL where the start and end grid IDs appear at the same time can be found through index A. For each vehicle, the following ordered list (sorted by st) is generated within the start and end polygons: s = <s1,s2,…s n >,s i(st,et,type), where st is the stop start time, et is the stop end time, and type is the starting point or the end point. Preferably, type is calculated as follows: if h3id is within the start fence HSP, it is the starting point; if it is within the end fence ESP, it is the end point; if s i .type=0 and s i+1 .type=1 and s i+1 .st-s i If .et<=Δt, the number of trips the vehicle has made plus one is recorded.

[0083] This application accurately defines the boundaries of the fence, counts the time when vehicles enter and exit the fence, and determines whether the vehicle is carrying the route based on the time limit. Through the truck's trajectory information and the marked fence information, the historical carrying vehicles can be accurately found. There is no need for complex models, the operation is simple and efficient, and the search efficiency is improved.

[0084] Example 3:

[0085] This embodiment implements a vehicle inspection device based on a fence, such as Figure 4 Shown, including:

[0086] The first module 401 is used to obtain original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle;

[0087] The second module 402 is used to establish a stop sequence for each vehicle based on the original trajectory points, and generate an index based on the stop sequence to perform a query based on a query condition;

[0088] The third module 403 is used to set the query condition to the electronic fence and the preset time information to query and obtain the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence.

[0089] It is understandable that the fence-based vehicle inspection device also includes an electronic fence platform and related APPs that can apply H3 grid and GeoHash dual indexing, which are not specifically limited here.

[0090] Please refer to the following Figure 5 , which shows a schematic diagram of an electronic device provided by some embodiments of the present application. Figure 5As shown, the electronic device 2 includes: a processor 200, a memory 201, a bus 202 and a communication interface 203, and the processor 200, the communication interface 203 and the memory 201 are connected via the bus 202; the memory 201 stores a computer program that can be run on the processor 200, and when the processor 200 runs the computer program, it executes the fence-based vehicle inspection method provided by any of the aforementioned embodiments of the present application. The electronic device can be an electronic device with a touch-sensitive display.

[0091] The memory 201 may include high-speed random access memory (RAM) and may also include non-volatile memory, such as at least one disk storage. The system network element communicates with at least one other network element via at least one communication interface 203 (which may be wired or wireless), and may utilize the Internet, a wide area network, a local area network, a metropolitan area network, or the like.

[0092] Bus 202 may be an ISA bus, a PCI bus, or an EISA bus. The bus may be divided into an address bus, a data bus, a control bus, and the like. Memory 201 is used to store programs, and processor 200 executes the programs upon receiving execution instructions. The fence-based vehicle inspection method disclosed in any of the aforementioned embodiments of the present application may be applied to or implemented by processor 200.

[0093] The processor 200 may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method can be completed by hardware integrated logic circuits in the processor 200 or by software instructions. The above processor 200 may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), an off-the-shelf field programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed in conjunction with the embodiments of this application can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium mature in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory 201 , and the processor 200 reads the information in the memory 201 and completes the steps of the above method in combination with its hardware.

[0094] The electronic device provided in the embodiment of the present application and the fence-based vehicle inspection method provided in the embodiment of the present application are based on the same inventive concept and have the same beneficial effects as the methods adopted, operated or implemented by them.

[0095] The present application also provides a computer-readable storage medium corresponding to the fence-based vehicle inspection method provided in the above embodiment. Figure 6 , Figure 6 The computer-readable storage medium shown is an optical disc 30 on which a computer program (ie, a program product) is stored. When the computer program is executed by a processor, the fence-based vehicle inspection method provided by any of the aforementioned embodiments is executed.

[0096] In addition, examples of the computer-readable storage medium may also include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other optical or magnetic storage media, which are not listed here one by one.

[0097] The computer-readable storage medium provided in the above-mentioned embodiments of the present application and the method for allocating quantum key distribution channels in a space-division multiplexed optical network provided in the embodiments of the present application are based on the same inventive concept and have the same beneficial effects as the methods adopted, run or implemented by the application programs stored therein.

[0098] An embodiment of the present application also provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of the fence-based vehicle inspection method provided in any of the aforementioned embodiments, the steps of the method including: obtaining the original trajectory points of the vehicle, wherein the original trajectory points include the various stop points of the vehicle; establishing a stop sequence for each vehicle for the original trajectory points, generating an index based on the stop sequence, and querying through query conditions; setting the query conditions to an electronic fence and preset time information for querying, and obtaining the carrier information of the target vehicle, wherein the electronic fence includes a starting fence and an end fence.

[0099] It should be noted that the algorithms and displays provided herein are not inherently related to any particular computer, virtual device, or other device. Various general-purpose devices may also be used in conjunction with the teachings herein. Based on the above description, the structure required to construct such devices is apparent. Furthermore, this application is not directed to any particular programming language. It should be understood that the content of this application described herein can be implemented using various programming languages, and the above description of specific languages is intended to disclose the best implementation methods of this application. In the description provided herein, a large number of specific details are described. However, it is understood that the embodiments of the present application can be practiced without these specific details. In some instances, well-known methods, structures, and techniques are not shown in detail so as not to obscure the understanding of this specification.

[0100] Similarly, it should be understood that in order to streamline the present application and aid understanding of one or more of the various inventive aspects, in the above description of the exemplary embodiments of the present application, various features of the present application are sometimes grouped together into a single embodiment, figure, or description thereof. However, this disclosed method should not be interpreted as reflecting an intention that the claimed application requires more features than are expressly recited in each claim. Rather, as reflected in the claims below, inventive aspects lie in less than all the features of the individual embodiments disclosed above. Accordingly, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of the present application.

[0101] Those skilled in the art will appreciate that the modules in the devices in the embodiments can be adaptively changed and arranged in one or more devices different from the embodiments. The modules or units or components in the embodiments can be combined into one module or unit or component, and in addition they can be divided into multiple submodules or subunits or subassemblies. Except that at least some of such features and / or processes or units are mutually exclusive, all features disclosed in this specification and all processes or units of any method or device disclosed in this manner can be combined in any combination. Unless otherwise expressly stated, each feature disclosed in this specification can be replaced by an alternative feature providing the same, equivalent or similar purpose.

[0102] The various component embodiments of the present application can be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that a microprocessor or digital signal processor (DSP) can be used in practice to implement some or all of the functions of some or all of the components in the creation device of the virtual machine according to the embodiment of the present application. The application can also be implemented as a device or device program for executing part or all of the methods described herein. The program implementing the application can be stored on a computer-readable medium, or can have the form of one or more signals. Such a signal can be downloaded from an Internet website, or provided on a carrier signal, or provided in any other form.

[0103] The above description is merely a preferred embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A vehicle inspection method based on a fence, characterized in that: The method comprises: Obtaining original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle; A stop sequence for each vehicle is established for the original trajectory points. An index is generated based on the stop sequence to facilitate querying using query conditions. Each stop point is a five-tuple sp = (vid, lon, lat, st, et), where vid is the vehicle ID, lon is the longitude coordinate, lat is the latitude coordinate, st is the start time of the stop, and et is the end time of the stop. The query condition is set to the electronic fence and the preset time information to query and obtain the carrier information of the target vehicle, wherein the electronic fence includes the starting fence and the end fence; Generating an index based on the docking sequence is based on an H3 grid and GeoHash; Generating an index based on the docking sequence is based on an H3 grid and GeoHash, including: Get the H3 hexagonal grid; Create a joint index between each vehicle and each H3 hexagonal grid.

2. The fence-based vehicle inspection method according to claim 1, characterized in that: The step of establishing a joint index between each vehicle and each H3 hexagonal grid includes: Get the stop sequence; Establish a mapping relationship between each vehicle ID and each H3 hexagonal grid in the stop sequence; Converting the position coordinates of the stop points in the stop point sequence into character strings, wherein the stop points are represented by five-tuples; Generate a joint index for querying vehicles.

3. The fence-based vehicle inspection method according to claim 1, characterized in that: The query condition is set to the electronic fence and the preset time information to query, and the carrier information of the target vehicle is obtained, wherein the electronic fence includes a starting fence and an end fence, including: Mark the starting and ending fences; Get preset timeliness information; Query target vehicles that are within the starting fence and the ending fence and meet the preset time information.

4. The fence-based vehicle inspection method according to claim 3, characterized in that: The query is for a target vehicle that is within the starting fence and the ending fence and meets the preset timeliness information: the target vehicle's kth stop is within the starting fence, the rth stop is within the ending fence, and the start time of the rth stop is later than the end time of the kth stop, where k and r are natural numbers.

5. The fence-based vehicle inspection method according to claim 1, characterized in that: After obtaining the transport information of the target vehicle, the method further includes: sorting the vehicles according to the number of transport trips from high to low within the boundaries defined by the starting fence and the end fence.

6. A vehicle inspection device based on a fence, characterized in that: The device comprises: The first module is used to obtain the original trajectory points of the vehicle, wherein the original trajectory points include each stop point of the vehicle; The second module is used to establish a stop sequence for each vehicle based on the original trajectory points, and generate an index based on the stop sequence to query through query conditions, where each stop point is a five-tuple sp = (vid, lon, lat, st, et), where vid is the vehicle ID, lon is the longitude coordinate, lat is the latitude coordinate, st is the stop start time, and et is the stop end time; The third module is used to query the target vehicle by setting the query condition to an electronic fence and preset time information, wherein the electronic fence includes a starting fence and an end fence; Generating an index based on the docking sequence is based on an H3 grid and GeoHash; Generating an index based on the docking sequence is based on an H3 grid and GeoHash, including: Get the H3 hexagonal grid; Create a joint index between each vehicle and each H3 hexagonal grid.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.

8. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.

Images