A method and system for determining satellite non-coverage area

Abstract

The present application discloses a method and system for determining satellite non-coverage areas, comprising: obtaining target vehicle terminal message data within a set time period; the message data including the vehicle terminal type, longitude and latitude, and time; counting the duration of occurrence of message data from Beidou vehicle terminal and GPS vehicle terminal in each geographic grid; determining geographic grids where the duration of occurrence of message data from GPS vehicle terminal exceeds the set time period and where no message data from Beidou vehicle terminal appears as Beidou non-coverage areas; determining geographic grids where the duration of occurrence of message data from Beidou vehicle terminal exceeds the set time period and where no message data from GPS vehicle terminal appears as GPS non-coverage areas; and determining Beidou and GPS non-coverage areas for geographic grids where no message data from Beidou vehicle terminal and GPS vehicle terminal appears based on the target vehicle terminal message data. This method allows for rapid and efficient positioning of satellite non-coverage areas.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of satellite monitoring technology, and specifically to a method and system for determining a satellite non-coverage area. Background Art

[0002] Currently, GPS and Beidou platforms offer global satellite positioning coverage. However, due to factors such as terrain, buildings, vegetation, and climate, there may be areas where satellite positioning platforms lack signal coverage. Policy requirements require that heavy trucks weighing over 12 tons be equipped with a vehicle-mounted computer that complies with ministerial standards and reports vehicle status data to the National Public Freight Supervision Platform. This data includes information on the satellite status of Beidou or GPS. This information can be used to analyze Beidou and GPS signal coverage, which is extremely valuable.

[0003] Currently, there is no public method for mining satellite coverage using satellite status information. Summary of the Invention

[0004] To this end, embodiments of the present application provide a method and system for determining a satellite non-coverage area, which can quickly and efficiently locate the satellite non-coverage area.

[0005] In order to achieve the above objectives, the embodiments of the present application provide the following technical solutions:

[0006] According to a first aspect of an embodiment of the present application, a method for determining a satellite non-coverage area is provided, the method comprising:

[0007] Obtain target vehicle terminal message data within a set time period; the message data includes vehicle terminal type, longitude and latitude, and time;

[0008] Count the duration of message data from Beidou vehicle terminals and GPS vehicle terminals in each geographic grid;

[0009] The geographical grid where the appearance time of the GPS vehicle terminal's message data exceeds the set time and the Beidou vehicle terminal's message data does not appear is determined as a Beidou non-coverage area;

[0010] The geographical grid where the appearance time of the Beidou vehicle terminal's message data exceeds the set time and the GPS vehicle terminal's message data does not appear is determined as a GPS non-coverage area;

[0011] For the geographical grid where no message data of Beidou vehicle terminal and GPS vehicle terminal appears, the non-coverage area of Beidou and GPS is determined according to the message data of the target vehicle terminal.

[0012] Optionally, determining the Beidou and GPS non-coverage areas according to the target vehicle terminal message data includes:

[0013] According to the target vehicle terminal message data, all the road sections that the target vehicle terminal passes through are matched as reference sections;

[0014] Matching each reference road segment to a corresponding geographic grid according to each reference road segment;

[0015] According to the geographical grid corresponding to each reference section and the message data in each geographical grid, the non-coverage area of each reference section is determined as the non-coverage area of Beidou and GPS.

[0016] Optionally, determining the uncovered area of each reference road section according to the geographical grid corresponding to each reference road section and the message data in each geographical grid includes:

[0017] Determine the geographical grids with message data and the geographical grids without message data on each reference road section according to the geographical grids corresponding to each reference road section and the message data in each geographical grid;

[0018] The non-covered area of each reference road section is determined according to the upstream and downstream relationship between the geographical grids with message data and the geographical grids without message data on each reference road section.

[0019] Optionally, determining the uncovered area of each reference section according to the upstream and downstream relationship between the geographical grids with message data and the geographical grids without message data on each reference section includes:

[0020] The geographical grids without message data between non-adjacent geographical grids with message data on each reference road section are determined as the non-covered area of the reference road section, thereby obtaining the non-covered area of each reference road section.

[0021] Optionally, matching all road sections passed by the target vehicle terminal according to the target vehicle terminal message data includes:

[0022] Determine a candidate road section for each location point based on multiple location data of a time sequence segment in the message data of each target vehicle terminal;

[0023] Based on the candidate road segments for each location point, determine the shortest path between the road segments of two adjacent location points;

[0024] Calculate the vertical distance between each location point and each candidate road segment;

[0025] Calculate the path set consisting of the shortest paths and perpendicular distances between two adjacent position points;

[0026] Merge the shortest path in the first path set and the shortest path in the second path set in the order of the path sets to obtain a merged set;

[0027] The paths in the merged set are merged with the shortest paths in the third path set to obtain a new merged set. This is repeated until the paths in the merged set are merged with the shortest paths in the last path set to obtain a total route set including all routes from the starting point to the ending point, which are used as all the road sections passed by the target vehicle terminal.

[0028] Optionally, after matching all road sections passed by the target vehicle terminal according to the target vehicle terminal message data, the method further includes:

[0029] Discontinuous sections and set blocked sections are screened out from all sections to obtain reference sections.

[0030] According to a second aspect of an embodiment of the present application, a system for determining a satellite non-coverage area is provided, the system comprising:

[0031] The message data acquisition module is used to obtain the target vehicle terminal message data within a set time period; the message data includes the vehicle terminal type, longitude and latitude, and time;

[0032] The geographic grid statistics module is used to count the appearance time of the message data of the Beidou vehicle terminal and the GPS vehicle terminal in each geographic grid;

[0033] The Beidou non-coverage area determination module is used to determine the geographical grid where the appearance time of the GPS vehicle terminal's message data exceeds the set time and the Beidou vehicle terminal's message data does not appear as a Beidou non-coverage area;

[0034] The GPS non-coverage area determination module is used to determine the geographical grid where the appearance time of the Beidou vehicle terminal's message data exceeds the set time and the GPS vehicle terminal's message data does not appear as the GPS non-coverage area;

[0035] The Beidou and GPS non-coverage area determination module is used to determine the Beidou and GPS non-coverage area according to the target vehicle terminal message data for the geographical grid where no Beidou vehicle terminal and GPS vehicle terminal message data appear.

[0036] Optionally, the Beidou and GPS non-coverage area determination module is specifically configured to:

[0037] According to the target vehicle terminal message data, all the road sections that the target vehicle terminal passes through are matched as reference sections;

[0038] Matching each reference road segment to a corresponding geographic grid according to each reference road segment;

[0039] According to the geographical grid corresponding to each reference section and the message data in each geographical grid, the non-coverage area of each reference section is determined as the non-coverage area of Beidou and GPS.

[0040] According to a third aspect of an embodiment of the present application, an electronic device is provided, comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor executes the computer program to implement the method described in the first aspect above.

[0041] According to a fourth aspect of an embodiment of the present application, a computer-readable storage medium is provided, on which computer-readable instructions are stored. The computer-readable instructions can be executed by a processor to implement the method described in the first aspect above.

[0042] In summary, the embodiments of the present application provide a method and system for determining satellite non-coverage areas, which obtain target vehicle terminal message data within a set time period; the message data includes the vehicle terminal type, longitude and latitude, and time; count the appearance time of the message data of the Beidou vehicle terminal and the GPS vehicle terminal in each geographical grid; determine the geographical grid where the appearance time of the GPS vehicle terminal message data exceeds the set time period and the Beidou vehicle terminal message data does not appear as the Beidou non-coverage area; determine the geographical grid where the appearance time of the Beidou vehicle terminal message data exceeds the set time period and the GPS vehicle terminal message data does not appear as the GPS non-coverage area; for the geographical grid where the Beidou vehicle terminal message data and the GPS vehicle terminal message data do not appear, determine the Beidou and GPS non-coverage areas according to the target vehicle terminal message data. Quickly and efficiently locate satellite non-coverage areas. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] To more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for the embodiments or the description of the prior art. Obviously, the drawings described below are merely exemplary, and those skilled in the art can derive other implementation drawings based on the provided drawings without inventive effort.

[0044] The structures, proportions, sizes, etc. illustrated in this specification are intended solely to complement the contents disclosed herein and to facilitate understanding and reading by persons skilled in the art. They are not intended to limit the conditions under which the present invention may be implemented and therefore have no substantive technical significance. Any structural modifications, changes in proportions, or adjustments in sizes, without affecting the efficacy and objectives of the present invention, shall remain within the scope of the technical contents disclosed herein.

[0045] Figure 1A schematic diagram of a flow chart of a method for determining a satellite non-coverage area provided in an embodiment of the present application;

[0046] Figure 2 A block diagram of a system for determining satellite non-coverage areas provided in an embodiment of the present application;

[0047] Figure 3 A schematic structural diagram of an electronic device provided in an embodiment of the present application is shown;

[0048] Figure 4 A schematic diagram of a computer-readable storage medium provided in an embodiment of the present application is shown. DETAILED DESCRIPTION

[0049] The following describes the implementation of the present invention using specific embodiments. Those skilled in the art will readily understand the other advantages and benefits of the present invention from the disclosure herein. Obviously, the embodiments described are only a portion of the present invention, not all of it. All other embodiments derived by persons of ordinary skill in the art based on the embodiments of the present invention without inventive effort are intended to fall within the scope of protection of the present invention.

[0050] Figure 1 A method for determining a satellite non-coverage area provided in an embodiment of the present application is shown, and the method includes:

[0051] Step 101: Acquire target vehicle terminal message data within a set time period; the message data includes vehicle terminal type, latitude and longitude, and time;

[0052] Step 102: Counting the appearance time of the message data of the Beidou vehicle terminal and the GPS vehicle terminal in each geographical grid;

[0053] Step 103: Determine the geographical grid where the appearance time of the GPS vehicle terminal message data exceeds the set time and the Beidou vehicle terminal message data does not appear as a Beidou non-coverage area;

[0054] Step 104: determining the geographical grid where the appearance time of the Beidou vehicle terminal message data exceeds the set time and the GPS vehicle terminal message data does not appear as the GPS non-coverage area;

[0055] Step 105: For the geographical grids where no Beidou vehicle terminal and GPS vehicle terminal message data appear, determine the Beidou and GPS non-coverage areas according to the target vehicle terminal message data.

[0056] In a possible implementation, determining the Beidou and GPS non-coverage areas based on the target vehicle terminal message data includes:

[0057] According to the message data of the target vehicle terminal, all the road sections passed by the target vehicle terminal are matched as reference sections; the geographical grid corresponding to each reference section is matched according to each reference section; and the non-coverage area of each reference section is determined according to the geographical grid corresponding to each reference section and the message data in each geographical grid, as the non-coverage area of Beidou and GPS.

[0058] In a possible implementation, determining the uncovered area of each reference road section according to the geographical grid corresponding to each reference road section and the message data in each geographical grid includes:

[0059] According to the geographical grid corresponding to each reference road section and the message data in each geographical grid, the geographical grids with message data and the geographical grids without message data on each reference road section are determined; according to the upstream and downstream relationship between the geographical grids with message data and the geographical grids without message data on each reference road section, the non-covered area of each reference road section is determined.

[0060] In a possible implementation, determining the uncovered area of each reference road section based on the upstream and downstream relationship between the geographical grids with message data and the geographical grids without message data on each reference road section includes:

[0061] The geographical grids without message data between non-adjacent geographical grids with message data on each reference road section are determined as the non-covered area of the reference road section, thereby obtaining the non-covered area of each reference road section.

[0062] In a possible implementation, matching all road sections passed by the target vehicle terminal according to the target vehicle terminal message data includes:

[0063] Determine the candidate road sections for each location point based on multiple position data of a time sequence segment in the message data of each target vehicle terminal; determine the shortest path between the road sections of two adjacent location points based on the candidate road sections of each location point; calculate the perpendicular distance between each location point and each candidate road section; calculate the path set consisting of the shortest paths and perpendicular distances between two adjacent location points; merge the shortest path in the first path set with the shortest path in the second path set in the order of the path sets to obtain a merged set; merge the path in the merged set with the shortest path in the third path set to obtain a new merged set, and so on, until the path in the merged set is merged with the shortest path in the last path set, thereby obtaining a total route set including all routes starting from the starting point and terminating at the end point, which serves as all the road sections passed by the target vehicle terminal.

[0064] In a possible implementation, after matching all road sections passed by the target vehicle terminal according to the target vehicle terminal message data, the method further includes:

[0065] Discontinuous sections and set blocked sections are screened out from all sections to obtain reference sections.

[0066] Another method for determining a satellite non-coverage range provided in an embodiment of the present application is described below, including the following steps:

[0067] Step 1: Acquire target vehicle-mounted terminal message data that is functioning normally within a set timeframe. This target vehicle-mounted terminal message data includes the vehicle-mounted terminal type, latitude and longitude, and time. Vehicle-mounted terminal types include Beidou and GPS. In this step, characteristic values of the vehicle's normal state are determined based on historical data. Based on these characteristic values, it is determined whether the vehicle-mounted terminal is within the normal range. This is used to select a functioning vehicle-mounted terminal as the target vehicle-mounted terminal.

[0068] Step 2: Count the appearance time of the message data of the Beidou vehicle terminal and the GPS vehicle terminal in each geographical grid; the geographical grid is divided within the monitoring range according to the set latitude and longitude side lengths.

[0069] Step 3: Determine whether the duration of the GPS vehicle terminal's appearance exceeds the set duration, while the Beidou vehicle terminal does not appear, and determine that the geographical grid is a Beidou non-coverage area; and, determine whether the duration of the Beidou vehicle terminal's appearance exceeds the set duration, while the GPS vehicle terminal does not appear, and determine that the geographical grid is a GPS non-coverage area; and for the geographical grid where no Beidou vehicle terminal and GPS vehicle terminal's message data appear, execute step 4.

[0070] Step 4: Match all the road sections that the target vehicle terminal has passed through based on the target vehicle terminal message data;

[0071] Step 5: From the results of the road network matching, filter out sections where the routes are discontinuous (count the number of vehicles passing through these sections. If the data of a set proportion of vehicles in this section is discontinuous), and set blocked sections (the purpose is to only retain road networks of the types of expressways, national highways, provincial highways, urban expressways, county roads, and township roads) to obtain reference sections.

[0072] Step 6: Perform spatial topology calculation based on each reference road section, match the geographic grid corresponding to each reference road section, and obtain the geographic grid that intersects with the reference road section.

[0073] Step 7: Determine the geographical grids with message data and the geographical grids without message data on each reference road section according to the geographical grids corresponding to each reference road section and the message data in each geographical grid;

[0074] Step 8: Determine the geographical grids without message data between the non-adjacent geographical grids with message data on each reference section as the non-coverage area of the reference section, so as to obtain the non-coverage area of each reference section: that is, check the vehicle terminal data of the grids where the road network entering the area and the road network leaving the area are located; if there is trajectory data of more than the set time length in these two types of areas, the middle area is the non-coverage area; if there is still no trajectory data of the set time length in these two types of areas, the three areas are merged into one non-coverage area; find the areas with vehicle message data coverage at both ends, and the merged area in the middle is the area that is not covered by Beidou and GPS.

[0075] In summary, the embodiment of the present application provides a method for determining satellite non-coverage areas, which obtains target vehicle terminal message data within a set time period; the message data includes the vehicle terminal type, longitude and latitude, and time; counts the appearance time of the message data of the Beidou vehicle terminal and the GPS vehicle terminal in each geographical grid; determines the geographical grid where the appearance time of the GPS vehicle terminal message data exceeds the set time period and the Beidou vehicle terminal message data does not appear as the Beidou non-coverage area; determines the geographical grid where the appearance time of the Beidou vehicle terminal message data exceeds the set time period and the GPS vehicle terminal message data does not appear as the GPS non-coverage area; for the geographical grid where the Beidou vehicle terminal and GPS vehicle terminal message data do not appear, determines the Beidou and GPS non-coverage areas according to the target vehicle terminal message data. Quickly and efficiently locate satellite non-coverage areas.

[0076] Based on the same technical concept, the embodiment of the present application also provides a satellite non-coverage area determination system, such as Figure 2 As shown, the system includes:

[0077] The message data acquisition module 201 is used to acquire the target vehicle terminal message data within a set time period; the message data includes the vehicle terminal type, longitude and latitude, and time;

[0078] The geographic grid statistics module 202 is used to count the appearance time of the message data of the Beidou vehicle terminal and the GPS vehicle terminal in each geographic grid;

[0079] The Beidou non-coverage area determination module 203 is used to determine the geographical grid where the appearance time of the GPS vehicle terminal message data exceeds the set time and the Beidou vehicle terminal message data does not appear as the Beidou non-coverage area;

[0080] The GPS non-coverage area determination module 204 is configured to determine a geographical grid where the appearance time of the Beidou vehicle terminal message data exceeds a set time and the GPS vehicle terminal message data does not appear as a GPS non-coverage area;

[0081] The Beidou and GPS non-coverage area determination module 205 is used to determine the Beidou and GPS non-coverage area according to the target vehicle terminal message data for the geographical grid where no Beidou vehicle terminal and GPS vehicle terminal message data appear.

[0082] In a possible implementation manner, the Beidou and GPS non-coverage area determination module 205 is specifically configured to:

[0083] According to the message data of the target vehicle terminal, all the road sections passed by the target vehicle terminal are matched as reference sections; the geographical grid corresponding to each reference section is matched according to each reference section; and the non-coverage area of each reference section is determined according to the geographical grid corresponding to each reference section and the message data in each geographical grid, as the non-coverage area of Beidou and GPS.

[0084] The present application also provides an electronic device corresponding to the method provided in the above embodiment. Figure 3 , which shows a schematic diagram of an electronic device provided in some embodiments of the present application. The electronic device 20 may include: a processor 200, a memory 201, a bus 202, and a communication interface 203. The processor 200, the communication interface 203, and the memory 201 are connected via the bus 202. The memory 201 stores a computer program executable on the processor 200. When the processor 200 executes the computer program, it executes the method provided in any of the aforementioned embodiments of the present application.

[0085] 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 and at least one other network element are connected via at least one physical port 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.

[0086] The 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, etc. The memory 201 is used to store programs. The processor 200 executes the programs upon receiving execution instructions. The methods disclosed in any of the aforementioned embodiments of the present application may be applied to or implemented by the processor 200.

[0087] 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.

[0088] The electronic device provided in the embodiments of the present application and the method 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, operated or implemented by them.

[0089] The present application also provides a computer-readable storage medium corresponding to the method provided in the above embodiment. Figure 4 The computer-readable storage medium shown is a CD 30 on which a computer program (ie, a program product) is stored. When the computer program is run by a processor, the method provided by any of the aforementioned embodiments is executed.

[0090] It should be noted that 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.

[0091] The computer-readable storage medium provided in the above-mentioned embodiments of the present application and the method provided in the embodiments of the present application are based on the same inventive concept and have the same beneficial effects as the method adopted, run or implemented by the application program stored therein.

[0092] It should be noted that:

[0093] 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, it is apparent that the structure required for constructing such devices is suitable. In addition, the present application is not directed to any specific programming language. It should be understood that various programming languages may be utilized to implement the present application described herein, and the above description of specific languages is provided for the purpose of disclosing the best mode of implementation of the present application.

[0094] 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 description.

[0095] Similarly, it should be understood that in order to streamline the present application and aid in understanding 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 fewer 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 itself serving as a separate embodiment of the present application.

[0096] Those skilled in the art will appreciate that the modules in the devices in the embodiments may be adaptively changed and arranged in one or more devices different from the embodiments. The modules or units or components in the embodiments may be combined into one module or unit or component, and in addition may be divided into multiple submodules or subunits or subcomponents. All features disclosed in this specification (including the accompanying claims, abstracts and drawings) and all processes or units of any method or device disclosed herein may be combined in any combination, except that at least some of such features and / or processes or units are mutually exclusive. Unless expressly stated otherwise, each feature disclosed in this specification (including the accompanying claims, abstracts and drawings) may be replaced by an alternative feature providing the same, equivalent or similar purpose.

[0097] Furthermore, those skilled in the art will appreciate that although some embodiments described herein include certain features included in other embodiments but not other features, combinations of features from different embodiments are intended to be within the scope of this application and to form different embodiments. For example, in the claims below, any of the claimed embodiments may be used in any combination.

[0098] The various component embodiments of the present application can be implemented in hardware, or implemented in a software module running on one or more processors, or implemented 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 an embodiment of the present application. The application can also be implemented as a part or all of the equipment or device program (for example, computer program and computer program product) for performing the method described herein. Such a program realizing the present 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.

[0099] It should be noted that the above embodiments illustrate rather than limit the present application, and that a person skilled in the art may devise alternative embodiments without departing from the scope of the appended claims. In the claims, any reference symbols placed between brackets should not be construed as limiting the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The present application may be implemented by means of hardware comprising several different elements and by means of appropriately programmed computers. In a unit claim enumerating several means, several of these means may be embodied by the same item of hardware. The use of the words first, second, and third etc. does not indicate any order. These words may be interpreted as names.

[0100] 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 method for determining a satellite non-coverage area, characterized in that: The method comprises: Obtain target vehicle terminal message data within a set time period; the message data includes vehicle terminal type, longitude and latitude, and time; Count the duration of message data from Beidou vehicle terminals and GPS vehicle terminals in each geographic grid; The geographical grid where the appearance time of the GPS vehicle terminal's message data exceeds the set time and the Beidou vehicle terminal's message data does not appear is determined as a Beidou non-coverage area; The geographical grid where the appearance time of the Beidou vehicle terminal's message data exceeds the set time and the GPS vehicle terminal's message data does not appear is determined as a GPS non-coverage area; For the geographical grid where no Beidou vehicle terminal and GPS vehicle terminal message data appear, determine the Beidou and GPS non-coverage areas according to the target vehicle terminal message data; Among them, the determining of the Beidou and GPS non-coverage areas based on the target vehicle terminal message data includes: matching all road sections passed by the target vehicle terminal according to the target vehicle terminal message data as reference sections; matching the geographical grid corresponding to each reference section according to each reference section; determining the non-coverage area of each reference section according to the geographical grid corresponding to each reference section and the message data in each geographical grid, as the Beidou and GPS non-coverage area.

2. The method according to claim 1, wherein The step of determining the uncovered area of each reference road section according to the geographical grid corresponding to each reference road section and the message data in each geographical grid includes: Determine the geographical grids with message data and the geographical grids without message data on each reference road section according to the geographical grids corresponding to each reference road section and the message data in each geographical grid; The non-covered area of each reference road section is determined according to the upstream and downstream relationship between the geographical grids with message data and the geographical grids without message data on each reference road section.

3. The method according to claim 2, wherein The method of determining the uncovered area of each reference section according to the upstream and downstream relationship between the geographical grids with message data and the geographical grids without message data on each reference section includes: The geographical grids without message data between non-adjacent geographical grids with message data on each reference road section are determined as the non-covered area of the reference road section, thereby obtaining the non-covered area of each reference road section.

4. The method according to claim 1, wherein The step of matching all road sections passed by the target vehicle terminal according to the target vehicle terminal message data includes: Determine a candidate road section for each location point based on multiple location data of a time sequence segment in the message data of each target vehicle terminal; Based on the candidate road segments for each location point, determine the shortest path between the road segments of two adjacent location points; Calculate the vertical distance between each location point and each candidate road segment; Calculate the path set consisting of the shortest paths and perpendicular distances between two adjacent position points; Merge the shortest path in the first path set and the shortest path in the second path set in the order of the path sets to obtain a merged set; The paths in the merged set are merged with the shortest paths in the third path set to obtain a new merged set. This is repeated until the paths in the merged set are merged with the shortest paths in the last path set to obtain a total route set including all routes from the starting point to the ending point, which are used as all the road sections passed by the target vehicle terminal.

5. The method according to claim 1, wherein After matching all road sections passed by the target vehicle terminal according to the target vehicle terminal message data, the method further includes: Discontinuous sections and set blocked sections are screened out from all sections to obtain reference sections.

6. A satellite non-coverage area determination system, characterized in that: The system comprises: The message data acquisition module is used to obtain the target vehicle terminal message data within a set time period; the message data includes the vehicle terminal type, longitude and latitude, and time; The geographic grid statistics module is used to count the appearance time of the message data of the Beidou vehicle terminal and the GPS vehicle terminal in each geographic grid; The Beidou non-coverage area determination module is used to determine the geographical grid where the appearance time of the GPS vehicle terminal's message data exceeds the set time and the Beidou vehicle terminal's message data does not appear as a Beidou non-coverage area; The GPS non-coverage area determination module is used to determine the geographical grid where the appearance time of the Beidou vehicle terminal's message data exceeds the set time and the GPS vehicle terminal's message data does not appear as the GPS non-coverage area; The Beidou and GPS non-coverage area determination module is used to match all road sections passed by the target vehicle terminal according to the target vehicle terminal message data for the geographical grid where no Beidou vehicle terminal and GPS vehicle terminal message data appear, as reference sections; match the geographical grid corresponding to each reference section according to each reference section; determine the non-coverage area of each reference section according to the geographical grid corresponding to each reference section and the message data in each geographical grid, as the Beidou and GPS non-coverage area.

7. An electronic device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the method according to any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that Computer-readable instructions are stored thereon, and the computer-readable instructions can be executed by a processor to implement the method according to any one of claims 1 to 5.

Images