Non-spatial database road information storage positioning method and device

Abstract

The invention relates to a non-spatial database road information storage positioning method and device, and relates to the field of intelligent traffic. Based on map track coordinate points, a polygon buffer area and bounding box calculation elements are generated, rapid road positioning is achieved by comparing the relation between the calculation elements and address coordinates, the method is suitable for storing road information in a non-spatial database, the problem that a previous text road storage form cannot be associated with the address coordinates is solved, and the road positioning efficiency is improved. Meanwhile, the problems that a non-spatial database is complex in operation and slow in information retrieval are solved, and the method has important significance in illegal accident handling in the field of traffic control business.

Description

Technical Field

[0001] The present invention relates to the field of intelligent transportation technology, and in particular to a non-spatial database road information storage and positioning method and device. Background Art

[0002] With the continuous growth of my country's car ownership, the increase in the number of complex motor vehicle drivers and the diversification of transportation modes, road traffic safety issues have become increasingly prominent. Traditional methods for handling traffic accidents and violations rely on storing road data in text form, and the handling personnel need to select the road where the accident occurred through cumbersome road retrieval methods to meet the needs of accident violation records. Specifically, the handling personnel first select the administrative division, then obtain all the road information under the division from the database, and finally select the specific road, section or intersection. This process is not only time-consuming and labor-intensive, but also prone to errors, and it is difficult to adapt to the needs of modern society for efficient and accurate traffic management. It reflects that there are obvious deficiencies in the above-mentioned existing technologies: the selection of roads when handling traffic accidents and violations is complicated, and the roads cannot be accurately located according to longitude and latitude, resulting in slow case handling and difficulty in statistical analysis of accident violations, which seriously affects the efficiency of traffic management and law enforcement.

[0003] In order to solve the above problems, the development of modern science and technology has put forward new demands, especially the increasing demand for obtaining road information through electronic coordinates. In the case of proprietary network connections and non-spatial databases storing data, the traditional text-based road data storage method can no longer meet the requirements of accurate and fast acquisition of road information. Therefore, it is particularly important to study how to obtain roads through address coordinates in non-spatial databases. This method can ensure the accuracy of longitude and latitude marking, ensure the accurate matching of road information, and provide necessary support and guarantee for subsequent accident black spot analysis, violation statistics, road construction analysis, etc., thereby improving the efficiency and accuracy of traffic management and data analysis. Summary of the invention

[0004] The purpose of the present invention is to provide a method and device for storing and locating road information in a non-spatial database to solve the problems existing in the above-mentioned prior art.

[0005] To achieve the above object, the technical solution adopted by the present invention is:

[0006] In a first aspect, the present invention provides a method for storing and locating road information in a non-spatial database, the method comprising:

[0007] S1. Determine road attributes; the road attributes include roads and other roads;

[0008] S2, entering different maintenance processes according to the different road attributes, if the road attribute is road, executing step S3, if the road attribute is other roads, jumping to step S5;

[0009] S3, depicting the specific road trajectory of the road in a dotted manner on the map;

[0010] S4. generating a road trajectory calculation element based on the specific road trajectory;

[0011] S5, marking the location of the other roads in the map in a dotted manner;

[0012] S6. Generate POI calculation elements based on the locations of the other roads;

[0013] S7, retrieving the road trajectory calculation elements according to the positioning electronic coordinates, and determining the road set;

[0014] S8. Retrieve the POI calculation elements according to the positioning electronic coordinates to determine the set of other roads where the POI is located.

[0015] In a possible implementation, in step S1:

[0016] The road includes at least one of a highway, a national highway, a provincial highway, a county highway, a rural highway, an urban expressway, an urban trunk road, an urban secondary trunk road and an urban branch road;

[0017] The other roads include at least one of community POI point information, gas station POI point information, scenic spot POI point information, and hospital POI point information.

[0018] In a possible implementation, in step S3:

[0019] The point drawing method is to mark the starting point and the end point on the map. The track between the starting point and the end point is composed of a series of points, and the points are connected by straight lines. The starting point and the end point are the starting point and the end point of the road.

[0020] In a possible implementation, in step S4:

[0021] The road trajectory calculation elements include: calculation of trajectory polygon buffer and calculation of trajectory bounding box;

[0022] The calculation of the trajectory polygon buffer includes: calculating the trajectory boundary of the area formed by the 20-meter range around the specific road trajectory, and the trajectory boundary is saved in the form of a series of points;

[0023] The calculation of the trajectory bounding box includes: calculating the minimum latitude coordinate, the maximum latitude coordinate, the minimum longitude coordinate, and the maximum longitude coordinate of the coordinate point based on the trajectory polygon buffer.

[0024] In a possible implementation, in step S5:

[0025] The dotting method is to mark the electronic coordinates of the location of the point on the map.

[0026] In a possible implementation, in step S6:

[0027] The POI calculation elements include: calculation of POI polygon buffer and calculation of POI bounding box;

[0028] The calculation of the POI polygon buffer includes: calculating the trajectory boundary of the area formed by the 50-meter range around the location of the other road, and the trajectory boundary is saved in the form of a series of points;

[0029] The calculation of the POI bounding box includes: calculating the minimum latitude coordinate, the maximum latitude coordinate, the minimum longitude coordinate, and the maximum longitude coordinate of the coordinate point based on the POI polygon buffer.

[0030] In a possible implementation, before step S7, the method further includes:

[0031] Converting the positioning electronic coordinates into the same coordinate system as the trajectory polygon buffer, the POI polygon buffer, the trajectory bounding box, and the POI bounding box according to the coordinate type;

[0032] The coordinate type includes at least one of: WGS-84 coordinate system, BD-09 coordinate system, and GCJ-02 coordinate system.

[0033] In a possible implementation, in step S7, retrieving the road trajectory calculation element according to the positioning electronic coordinates to determine the road set includes:

[0034] Road condition 1: The electronic coordinates of the positioning are within the trajectory bounding box. If the electronic coordinates of the positioning are (longitude, latitude), and the trajectory bounding box is (minimum longitude, minimum latitude), (maximum longitude, maximum latitude), then the screening condition is minimum longitude <= longitude <= maximum longitude, and minimum latitude <= latitude <= maximum latitude;

[0035] road condition 2: the electronic coordinates of the positioning are within the trajectory polygon buffer. If the electronic coordinates of the positioning are (longitude, latitude), the screening condition is (longitude, latitude) ∈ trajectory polygon buffer;

[0036] Road condition 3: Obtain offset coordinates according to the positioning electronic coordinates. The offset coordinates are 30-meter coordinates of the four directions of up, down, left, and right. Repeat road conditions 1 and road conditions 2 for the offset coordinates.

[0037] Road condition 4: Determine the road set based on road conditions 1 to 4.

[0038] In a possible implementation, in step S8, retrieving the POI calculation element according to the positioning electronic coordinates to determine the set of other roads includes:

[0039] Other condition 1: The electronic coordinates of the positioning are within the POI bounding box. If the electronic coordinates of the positioning are (longitude, latitude), and the POI bounding box is (minimum longitude, minimum latitude), (maximum longitude, maximum latitude), then the screening condition is minimum longitude <= longitude <= maximum longitude, and minimum latitude <= latitude <= maximum latitude;

[0040] Other condition 2: The electronic coordinates of the positioning are within the POI polygon buffer. If the electronic coordinates of the positioning are (longitude, latitude), the screening condition is (longitude, latitude)∈POI polygon buffer;

[0041] Other condition 3: Obtain all POI point information under the administrative division according to the administrative division, and filter out other POI roads with coordinate point distance <= 500 meters according to the coordinate distance;

[0042] Other condition 4: Determine the set of other roads based on other conditions 1 to 4.

[0043] In a second aspect, the present invention provides a non-spatial database road information storage and positioning device, characterized in that the device is applied to the non-spatial database road information storage and positioning method as described above, and the device comprises:

[0044] The basic road construction module is responsible for basic data entry and processing to meet the calculation needs of the coordinate positioning calculation module, including road trajectory processing and other road point processing;

[0045] The coordinate positioning calculation module is responsible for matching the positioning electronic coordinates with the road data to determine the roads near the point and other roads;

[0046] Among them, under the basic road construction module, the road information maintenance process executed includes steps S1 to S6; under the coordinate positioning calculation module, the information determination process executed includes steps S7 to S8.

[0047] In a third aspect, the present invention provides a computer device, comprising a processor and a memory, wherein the memory stores at least one instruction, at least one program, a code set or an instruction set, and the processor can load and execute at least one instruction, at least one program, a code set or an instruction set to implement the non-spatial database road information storage and positioning method provided above.

[0048] In a fourth aspect, the present invention provides a computer-readable storage medium, which stores at least one instruction, at least one program, code set or instruction set. The processor can load and execute at least one instruction, at least one program, code set or instruction set to implement the non-spatial database road information storage and positioning method provided above.

[0049] In a fifth aspect, the present invention provides a computer program product or a computer program, the computer program product or the computer program comprising computer program instructions, the computer program instructions being stored in a computer-readable storage medium. A processor reads the computer instructions from the computer-readable storage medium and executes the computer instructions, so that the computer device executes the non-spatial database road information storage and positioning method provided above.

[0050] The beneficial effects brought about by the technical solution provided by the present invention include at least:

[0051] The present invention generates polygon buffer and bounding box calculation elements based on map trajectory coordinate points, and realizes rapid road positioning by comparing the relationship between the calculation elements and the address coordinates. The present invention is suitable for storing road information in non-spatial databases, which solves the problem that the previous text road storage form cannot be associated with address coordinates. At the same time, it solves the problem that the non-spatial database has complex calculations and slow information retrieval, and is of great significance in the handling of illegal accidents in the field of traffic management business. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] The accompanying drawings are used to provide further understanding of the present invention and constitute a part of the specification. They are used to explain the present invention together with the embodiments of the present invention and do not constitute a limitation of the present invention.

[0053] Figure 1 A flowchart of a non-spatial database road information storage and positioning method provided by an exemplary embodiment of the present invention is shown.

[0054] Figure 2 A schematic diagram of a polygon buffer and a bounding box of road storage calculation elements of a non-spatial database road information storage and positioning method provided by an exemplary embodiment of the present invention is shown.

[0055] Figure 3A schematic diagram of calculating the road to which address coordinates belong in a non-spatial database road information storage and positioning method provided by an exemplary embodiment of the present invention is shown.

[0056] Figure 4 A structural block diagram of a non-spatial database road information storage and positioning device provided by an exemplary embodiment of the present invention is shown.

[0057] Figure 5 A schematic diagram of the structure of a computer device for executing a non-spatial database road information storage and positioning method provided by an exemplary embodiment of the present invention is shown. DETAILED DESCRIPTION

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

[0059] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0060] Figure 1 A flowchart of a non-spatial database road information storage and positioning method provided by an exemplary embodiment of the present invention is shown. The non-spatial database road information storage and positioning method comprises the following steps:

[0061] Step S1, determining road attributes.

[0062] Specifically, the road attributes include roads and other roads. Roads include at least one of expressways, national roads, provincial roads, county roads, rural roads, urban expressways, urban trunk roads, urban secondary trunk roads, and urban branch roads; other roads include at least one of community POI point information, gas station POI point information, scenic spot POI point information, and hospital POI point information.

[0063] In the embodiment of the present application, POI (Point of Interest) information refers to a specific location marked in a map or navigation system.

[0064] Step S2, enter different maintenance processes according to different road attributes. If the road attribute is road, execute step S3; if the road attribute is other roads, jump to step S5.

[0065] In the embodiment of the present application, the setting of entering into different maintenance processes according to different road attributes provides a basis for achieving fast and accurate positioning of roads.

[0066] Step S3: Draw the specific road trajectory on the map in the form of dots.

[0067] Specifically, the point drawing method of this step is to mark the starting point and the end point on the map. The trajectory between the starting point and the end point is composed of a series of points, and the points are connected by straight lines. The starting point and the end point are the starting point and the end point of the road.

[0068] The following steps S4 to S6 can be referred to Figure 2 , Figure 2 A schematic diagram of a polygon buffer and a bounding box of road storage calculation elements of a non-spatial database road information storage and positioning method provided by an exemplary embodiment of the present invention is shown.

[0069] Step S4: Generate road trajectory calculation elements based on the specific road trajectory.

[0070] In detail, the road trajectory calculation elements include: calculation of trajectory polygon buffer and calculation of trajectory bounding box; the calculation of trajectory polygon buffer includes: calculation of trajectory boundary of the area formed by 20 meters around the specific road trajectory, and the trajectory boundary is saved in the form of a series of points; the calculation of trajectory bounding box includes: calculation of the minimum latitude coordinate, maximum latitude coordinate, minimum longitude coordinate, and maximum longitude coordinate of the coordinate point based on the trajectory polygon buffer.

[0071] In the embodiment of the present application, the setting of generating road trajectory calculation elements based on specific road trajectories is intended to enhance the understanding and application of road space characteristics by constructing trajectory polygon buffers and trajectory bounding boxes, which can improve the accuracy and completeness of road information.

[0072] Step S5: Mark the locations of other roads on the map in a dotted manner.

[0073] Specifically, the marking method of this step is to mark the electronic coordinates of the location of the point on the map.

[0074] Step S6: Generate POI calculation elements based on the locations of other roads.

[0075] In detail, the POI calculation elements include: calculation of the POI polygon buffer and calculation of the POI bounding box; the calculation of the POI polygon buffer includes: calculation of the trajectory boundary of the area formed by the 50-meter range around the location of other roads, and the trajectory boundary is saved in the form of a series of points; the calculation of the POI bounding box includes: based on the POI polygon buffer, calculation of the minimum latitude coordinate, maximum latitude coordinate, minimum longitude coordinate, and maximum longitude coordinate of the coordinate point.

[0076] In an embodiment of the present application, the spatial analysis capability of a geographic information system (GIS) for points of interest (POI) is enhanced by constructing a POI polygon buffer and a POI bounding box.

[0077] It should be noted that before executing step S7, the following steps are also included:

[0078] The positioning electronic coordinates are converted into the same coordinate system as the trajectory polygon buffer, POI polygon buffer, trajectory bounding box, and POI bounding box according to the coordinate type; the coordinate type includes at least one of: WGS-84 coordinate system, BD-09 coordinate system, and GCJ-02 coordinate system.

[0079] In an embodiment of the present application, the above-mentioned conversion of the positioning electronic coordinates into the same coordinate system as the trajectory polygon buffer, POI polygon buffer, trajectory bounding box and POI bounding box according to the coordinate type ensures that all geographic data are operated under the same reference frame, thereby ensuring the consistency and accuracy of spatial analysis. Specifically, when using geographic information from different sources, such as location data obtained by GPS devices (usually based on the WGS-84 coordinate system), location information provided by Baidu map services (based on the BD-09 coordinate system), or data from other domestic map service providers (based on the GCJ-02 coordinate system), these data may be in different coordinate systems. In order to make these data compatible with each other and accurately superimposed on the same map, they must be uniformly converted to a common coordinate system.

[0080] The following steps S7 to S8 can be referred to Figure 3 , Figure 3 A schematic diagram of calculating the road to which address coordinates belong in a non-spatial database road information storage and positioning method provided by an exemplary embodiment of the present invention is shown.

[0081] Step S7: Retrieve the road trajectory calculation elements according to the positioning electronic coordinates to determine the road set. Specifically, this step includes:

[0082] Road condition 1: The electronic coordinates of the positioning are within the trajectory bounding box. If the electronic coordinates of the positioning are (longitude, latitude), and the trajectory bounding box is (minimum longitude, minimum latitude), (maximum longitude, maximum latitude), then the screening condition is minimum longitude <= longitude <= maximum longitude, and minimum latitude <= latitude <= maximum latitude;

[0083] road condition 2: the electronic coordinates of the positioning are within the trajectory polygon buffer. If the electronic coordinates of the positioning are (longitude, latitude), the screening condition is (longitude, latitude) ∈ trajectory polygon buffer;

[0084] Road condition 3: Obtain offset coordinates based on the positioning electronic coordinates. The offset coordinates are 30-meter coordinates of the four directions of up, down, left, and right. Repeat road conditions 1 and 2 for the offset coordinates.

[0085] Road condition 4: Determine the road set based on road conditions 1 to 4.

[0086] In the embodiment of the present application, the above process of retrieving the road trajectory calculation elements according to the positioning electronic coordinates to determine the road set is to accurately match the specific road position where the vehicle or pedestrian is currently located. This process is achieved through a series of screening conditions to ensure that the final road set is both accurate and efficient. First, road condition 1 requires that the positioning electronic coordinates must be within the trajectory bounding box. This means that if the positioning electronic coordinates (longitude, latitude) are to be considered as part of a certain road, it must meet the conditions within the spatial range defined by the trajectory bounding box. This preliminary screening can quickly exclude those coordinate points that are obviously not near the target road, thereby reducing unnecessary calculations. Secondly, road condition 2 further refines the screening criteria, requiring that the positioning electronic coordinates must not only be within the trajectory bounding box, but also be located in a more accurate trajectory polygon buffer. Since the polygon buffer is built based on the actual road shape, it can provide a more accurate road boundary description than a rectangular bounding box, which helps to improve matching accuracy. Next, in order to deal with the possible positioning error problem, road condition 3 is introduced. This condition proposes to offset the original positioning electronic coordinates to generate new coordinate points of 30 meters in the four directions of up, down, left and right, and repeat the first two conditions for these offset coordinates. This is done to take into account that there may be certain deviations in GPS signals, especially in complex environments such as urban canyons. In this way, the search range can be expanded to ensure correct matching even in marginal cases. Finally, combining all the above conditions, from the initial bounding box check to the final offset coordinate verification, a complete set of logical processes is formed to determine the road set where the vehicle or pedestrian is located. This step comprehensively considers the characteristics of geospatial data and the challenges in actual application scenarios, aiming to provide a road matching solution with strong robustness and high accuracy.

[0087] It is worth mentioning that the definition of positioning electronic coordinates in this application is to use digital technology to determine the numerical value of a point on the map. It is generally based on a specific coordinate system and accurately locates the location through horizontal and vertical coordinate values, which facilitates query, navigation, spatial analysis and other operations.

[0088] In summary, the purpose of this step is to utilize geometric and topological relationships to effectively narrow down the scope of candidate roads through multi-level screening of the positioning electronic coordinates, and finally determine the road set that is most likely to contain the coordinates.

[0089] Step S8: Retrieve POI calculation elements according to the positioning electronic coordinates to determine the set of other roads. Specifically, this step includes:

[0090] Other condition 1: The electronic coordinates of the positioning are within the POI bounding box. If the electronic coordinates of the positioning are (longitude, latitude), and the POI bounding box is (minimum longitude, minimum latitude), (maximum longitude, maximum latitude), then the screening condition is minimum longitude <= longitude <= maximum longitude, and minimum latitude <= latitude <= maximum latitude;

[0091] Other condition 2: The electronic coordinates of the positioning are within the POI polygon buffer. If the electronic coordinates of the positioning are (longitude, latitude), the screening condition is (longitude, latitude)∈POI polygon buffer;

[0092] Other condition 3: Obtain all POI point information under the administrative division according to the administrative division, and filter out other POI roads with coordinate point distance <= 500 meters according to the coordinate distance;

[0093] Other condition 4: Determine the set of other roads based on other conditions 1 to 4.

[0094] In the embodiment of the present application, the function of this step setting is similar to the above-mentioned step S7 and will not be repeated here.

[0095] Figure 4 The structure block diagram of a non-spatial database road information storage and positioning device provided by an exemplary embodiment of the present invention is shown. The non-spatial database road information storage and positioning device is applied to the above-mentioned non-spatial database road information storage and positioning method, and the device includes:

[0096] The basic road construction module is responsible for basic data entry and processing to meet the calculation needs of the coordinate positioning calculation module, including road trajectory processing and other road point processing;

[0097] The coordinate positioning calculation module is responsible for matching the positioning electronic coordinates with the road data to determine the roads near the point and other roads;

[0098] Among them, under the basic road construction module, the road information maintenance process executed includes steps S1 to S6; under the coordinate positioning calculation module, the information determination process executed includes steps S7 to S8.

[0099] In summary, the basic road construction module is used to construct the road trajectory, and the calculation elements of the trajectory and the calculation elements of the points are calculated for the roads and other roads of the POI. The calculation elements are a series of coordinate points, which are stored in the unstructured database in the form of text. The road where the point is located is determined by the bounding box and polygon buffer operations in the positioning calculation module and the calculation elements. The problem that the road text information cannot match the coordinates in the past is solved, and the address coordinate matching speed of the road is faster under the non-spatial database. The method of generating nearby points for the coordinates solves the problem of difficulty in matching road data caused by the deviation of the positioning itself. In the actual handling of traffic violations, the method of matching the positioning coordinates with the road data ensures the accuracy of data entry and provides basic data and method support for the analysis of the location of the accident violation.

[0100] It should be noted that the non-spatial database road information storage and positioning device provided in the above embodiment is only illustrated by the division of the above-mentioned functional modules. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0101] Figure 5 A schematic diagram of the structure of a computer device for executing a non-spatial database road information storage and positioning method provided by an exemplary embodiment of the present invention is shown, and the computer device includes:

[0102] The processor 501 includes one or more processing cores. The processor 501 executes various functional applications and data processing by running software programs and modules.

[0103] The receiver 502 and the transmitter 503 can be implemented as a communication component, and the communication component can be a communication chip. Optionally, the communication component can be implemented to include a signal transmission function. That is, the transmitter 503 can be used to transmit a control signal to the image acquisition device and the scanning device, and the receiver 502 can be used to receive the corresponding feedback instruction.

[0104] The memory 504 is connected to the processor 501 via a bus 505 .

[0105] The memory 504 may be used to store at least one instruction, and the processor 501 may be used to execute the at least one instruction to implement each step in the above method embodiment.

[0106] An embodiment of the present invention also provides a computer-readable storage medium, which stores at least one instruction, at least one program, code set or instruction set, which is loaded and executed by a processor to implement the above-mentioned non-spatial database road information storage and positioning method.

[0107] The present invention also provides a computer program product or a computer program, which includes a computer instruction stored in a computer-readable storage medium. A processor of a computer device reads the computer instruction from the computer-readable storage medium, and the processor executes the computer instruction, so that the computer device executes the non-spatial database road information storage and positioning method described in any of the above embodiments.

[0108] Optionally, the computer readable storage medium may include: a read-only memory (ROM), a random access memory (RAM), a solid state drive (SSD), or an optical disk. Among them, the random access memory may include a resistance random access memory (ReRAM) and a dynamic random access memory (DRAM). The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages and disadvantages of the embodiments.

[0109] It should be understood that the specific examples herein are only intended to help those skilled in the art to better understand the present disclosure, rather than to limit the scope of the present invention.

[0110] It is understood that in the various implementations of this specification, the size of the sequence number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the present disclosure.

[0111] It can be understood that the various implementation modes described in this specification can be implemented individually or in combination, and the present disclosure is not limited to this.

[0112] Unless otherwise stated, all technical and scientific terms used in this disclosure have the same meaning as those generally understood by those skilled in the art of the technical field of this specification. The terms used in this specification are only for the purpose of describing specific embodiments and are not intended to limit the scope of this specification. The term "and / or" used in this specification includes any and all combinations of one or more related listed items. The singular forms of "a", "above", and "the" used in this disclosure and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings.

[0113] It can be understood that the processor of the present disclosure can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method implementation method can be completed by the hardware integrated logic circuit or software instructions in the processor. The above processor can be a general processor, a digital signal processor (DigitalSignalProcessor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable GateArray, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the present disclosure can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the present disclosure can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor are combined to perform. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0114] It is understood that the memory in the present disclosure may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (programmable ROM, PROM), an erasable programmable read-only memory (erasable PROM, EPROM), an electrically erasable programmable read-only memory (EEPROM) or a flash memory. The volatile memory may be a random access memory (RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0115] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this specification.

[0116] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method implementation methods and will not be repeated here.

[0117] In the several embodiments provided in this specification, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device implementation described above is only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0118] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0119] In addition, each functional unit in each embodiment of the present specification may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0120] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this specification, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of this specification. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, etc., various media that can store program codes.

[0121] The above is only a specific implementation of this specification, but the protection scope of the present invention is not limited thereto. Any person skilled in the art who is familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in this specification, which should be included in the protection scope of this specification. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims

1. A non-spatial database road information storage and positioning method, characterized in that: The method comprises: S1. Determine road attributes; the road attributes include roads and other roads; S2, entering different maintenance processes according to the different road attributes, if the road attribute is road, executing step S3, if the road attribute is other roads, jumping to step S5; S3, depicting the specific road trajectory of the road in a dotted manner on the map; S4. generating a road trajectory calculation element based on the specific road trajectory; S5, marking the location of the other roads in the map in a dotted manner; S6. Generate POI calculation elements based on the locations of the other roads; S7, retrieving the road trajectory calculation elements according to the positioning electronic coordinates, and determining the road set; S8. Retrieve the POI calculation elements according to the positioning electronic coordinates to determine the set of other roads where the POI is located.

2. The non-spatial database road information storage and positioning method according to claim 1, characterized in that: In step S1: The road includes at least one of a highway, a national highway, a provincial highway, a county highway, a rural highway, an urban expressway, an urban trunk road, an urban secondary trunk road and an urban branch road; The other roads include at least one of community POI point information, gas station POI point information, scenic spot POI point information, and hospital POI point information.

3. The non-spatial database road information storage and positioning method according to claim 1, characterized in that: In step S3: The point drawing method is to mark the starting point and the end point on the map. The track between the starting point and the end point is composed of a series of points, and the points are connected by straight lines. The starting point and the end point are the starting point and the end point of the road.

4. The non-spatial database road information storage and positioning method according to claim 1, characterized in that: In step S4: The road trajectory calculation elements include: calculation of trajectory polygon buffer and calculation of trajectory bounding box; The calculation of the trajectory polygon buffer includes: calculating the trajectory boundary of the area formed by the 20-meter range around the specific road trajectory, and the trajectory boundary is saved in the form of a series of points; The calculation of the trajectory bounding box includes: calculating the minimum latitude coordinate, the maximum latitude coordinate, the minimum longitude coordinate, and the maximum longitude coordinate of the coordinate point based on the trajectory polygon buffer.

5. The non-spatial database road information storage and positioning method according to claim 1, characterized in that: In step S5: The dotting method is to mark the electronic coordinates of the location of the point on the map.

6. The non-spatial database road information storage and positioning method according to claim 4, characterized in that: In step S6: The POI calculation elements include: calculation of POI polygon buffer and calculation of POI bounding box; The calculation of the POI polygon buffer includes: calculating the trajectory boundary of the area formed by the 50-meter range around the location of the other road, and the trajectory boundary is saved in the form of a series of points; The calculation of the POI bounding box includes: calculating the minimum latitude coordinate, the maximum latitude coordinate, the minimum longitude coordinate, and the maximum longitude coordinate of the coordinate point based on the POI polygon buffer.

7. The non-spatial database road information storage and positioning method according to claim 6, characterized in that: Before step S7, the method further includes: Converting the positioning electronic coordinates into the same coordinate system as the trajectory polygon buffer, the POI polygon buffer, the trajectory bounding box, and the POI bounding box according to the coordinate type; The coordinate type includes at least one of: WGS-84 coordinate system, BD-09 coordinate system, and GCJ-02 coordinate system.

8. The non-spatial database road information storage and positioning method according to claim 7, characterized in that: In step S7, the step of retrieving the road trajectory calculation elements according to the positioning electronic coordinates to determine the road set includes: Road condition 1: The electronic coordinates of the positioning are within the trajectory bounding box. If the electronic coordinates of the positioning are (longitude, latitude), and the trajectory bounding box is (minimum longitude, minimum latitude), (maximum longitude, maximum latitude), then the screening condition is minimum longitude <= longitude <= maximum longitude, and minimum latitude <= latitude <= maximum latitude; road condition 2: the electronic coordinates of the positioning are within the trajectory polygon buffer. If the electronic coordinates of the positioning are (longitude, latitude), the screening condition is (longitude, latitude) ∈ trajectory polygon buffer; Road condition 3: Obtain offset coordinates according to the positioning electronic coordinates. The offset coordinates are 30-meter coordinates of the four directions of up, down, left, and right. Repeat road conditions 1 and road conditions 2 for the offset coordinates. Road condition 4: Determine the road set based on road conditions 1 to 4.

9. The non-spatial database road information storage and positioning method according to claim 8, characterized in that: In step S8, the POI calculation elements are retrieved according to the positioning electronic coordinates to determine the set of other roads, including: Other condition 1: The electronic coordinates of the positioning are within the POI bounding box. If the electronic coordinates of the positioning are (longitude, latitude), and the POI bounding box is (minimum longitude, minimum latitude), (maximum longitude, maximum latitude), then the screening condition is minimum longitude <= longitude <= maximum longitude, and minimum latitude <= latitude <= maximum latitude; Other condition 2: The electronic coordinates of the positioning are within the POI polygon buffer. If the electronic coordinates of the positioning are (longitude, latitude), the screening condition is (longitude, latitude)∈POI polygon buffer; Other condition 3: Obtain all POI point information under the administrative division according to the administrative division, and filter out other POI roads with coordinate point distance <= 500 meters according to the coordinate distance; Other condition 4: Determine the set of other roads based on other conditions 1 to 4.

10. A non-spatial database road information storage and positioning device, characterized in that: The device is applied to the non-spatial database road information storage and positioning method according to any one of claims 1 to 9, and the device comprises: The basic road construction module is responsible for basic data entry and processing to meet the calculation needs of the coordinate positioning calculation module, including road trajectory processing and other road point processing; The coordinate positioning calculation module is responsible for matching the positioning electronic coordinates with the road data to determine the roads near the point and other roads; Among them, under the basic road construction module, the road information maintenance process executed includes steps S1 to S6; under the coordinate positioning calculation module, the information determination process executed includes steps S7 to S8.

Images