Target positioning method and system based on multi-point coordinates and distances, electronic equipment and storage medium

Abstract

The invention discloses a multi-point coordinate and distance-based target positioning method and system, electronic equipment and a storage medium, and the method comprises the steps: obtaining an information set of a plurality of collection points, and then constructing a possible annular region graph of a target point relative to each collection point; according to the method, a plurality of acquisition points are acquired, and circular ring area graphs corresponding to the plurality of acquisition points are subjected to intersection combination, so that combinations without intersections are effectively filtered, the number of times of code repeated judgment and cyclic calculation is greatly reduced, especially when a large amount of acquisition point data is processed, the data calculation and analysis efficiency is remarkably improved, and the rapid and real-time positioning requirement can be well met. Moreover, the intersection combination is subjected to intersection subdivision operation by adopting the minimum intersection principle, and the positioning result of the target point is determined according to the credibility result of the subdivided minimum intersection, so that the position area of the target point can be quickly and accurately positioned, the positioning information of the target point can be obtained only by inputting the information of the acquisition point in the whole process, and the expandability is high.

Description

Technical Field

[0001] The present invention relates to the field of geographic location positioning technology, and in particular to a target positioning method and system based on multi-point coordinates and distances, electronic equipment, and a computer-readable storage medium. Background Art

[0002] At present, geolocation technology is widely used in application scenarios such as determining the geographic location of users on social media platforms and locating goods in the field of logistics and distribution. The existing geolocation analysis method is to locate the target point through multi-point coordinates and distance information. Specifically, the coordinates of multiple known collection points and their distance ranges to the target point (such as 0-50m, 50-100m, etc.) are used to draw a circular range boundary on the map, and then the possible location range of the target account is determined based on the intersection of multiple range boundaries, thereby calculating the specific location of the target point. The accuracy of the intersection is related to the number of times the intersection is collected by the collection point. However, when processing a large number of collection points, since the algorithm needs to perform complex calculations and intersection analysis based on the data of multiple collection points, the data analysis time is long, and it is difficult to meet the needs of fast and real-time positioning. Summary of the invention

[0003] The present invention provides a target positioning method and system based on multi-point coordinates and distances, an electronic device, and a computer-readable storage medium, which can shorten data analysis time, improve data calculation and analysis efficiency, well meet the needs of fast and real-time positioning, and can also quickly and accurately locate the location area of ​​the target point.

[0004] According to one aspect of the present invention, a target positioning method based on multi-point coordinates and distances is provided, comprising the following contents:

[0005] Acquire a set of information of multiple collection points, wherein the information of each collection point includes the geographical coordinates of the collection point, the distance range from the collection point to the target point, and the collection time;

[0006] Construct a circular area graph where the target point may exist relative to each collection point based on the information of each collection point;

[0007] Intersection combination of circular area graphics corresponding to multiple collection points;

[0008] The minimum intersection principle is used to perform intersection subdivision operations on the intersection combination to obtain multiple minimum intersections;

[0009] The credibility of each minimum intersection is obtained, and the positioning result of the target point is determined according to the credibility result.

[0010] Furthermore, the process of constructing a circular area graphic of the target point that may exist relative to each collection point according to the information of each collection point includes the following contents:

[0011] With the geographic coordinates of each collection point as the center, the minimum distance range as the inner circle radius, and the maximum distance range as the outer circle radius, draw a circular area graphic where the target point may exist relative to each collection point, and output the outer circle point coordinate set and inner circle point coordinate set of each circular area graphic.

[0012] Furthermore, the process of performing intersection combination on the circular area graphics corresponding to the multiple collection points includes the following contents:

[0013] At least three collection points are selected from the multiple collection points, and all possible intersection sets between the circular area graphics corresponding to the at least three collection points are calculated.

[0014] Furthermore, the process of performing intersection subdivision operation on the intersection combination by adopting the minimum intersection principle to obtain multiple minimum intersections includes the following contents:

[0015] Determine whether any two intersections in the intersection combination intersect. If they do, obtain the intersection area coordinate information and the difference area coordinate information, and split the difference area into multiple independent difference areas according to the difference area coordinate information, and use the intersection area coordinate information and the multiple independent difference area coordinate information to replace the coordinate information of the original two intersections; repeat recursively until there is no intersection and inclusion relationship in the intersection combination, and obtain multiple independent minimum intersections.

[0016] Furthermore, the process of obtaining the trustworthiness of each minimum intersection includes the following:

[0017] For each minimum intersection, obtain the coordinate information of all its edge points, determine the positional relationship between the coordinates of each edge point and the circular area graphic of each collection point, and if all the edge points belong to the circular area graphic of a certain collection point, then determine that the minimum intersection is covered by the circular area graphic of the collection point, and use the number of times the minimum intersection is covered by the circular area graphic of the collection point as the trustworthiness; repeat continuously to obtain the trustworthiness of all minimum intersections.

[0018] Furthermore, after obtaining the information set of multiple collection points, the following contents are also included:

[0019] The information sets of multiple collection points are grouped according to the date of collection time, and the groups with the number of collection points less than a preset value are filtered out, and the remaining collection point group information sets are output.

[0020] Furthermore, the following contents are also included:

[0021] Different colors are used to represent different levels of trustworthiness, and the positioning results of the target points are output visually.

[0022] In addition, the present invention also provides a target positioning system based on multi-point coordinates and distances, comprising:

[0023] A collection point information acquisition module is used to acquire information sets of multiple collection points, wherein the information of each collection point includes the geographical coordinates of the collection point, the distance range from the collection point to the target point, and the collection time;

[0024] A ring area graphic construction module is used to construct a ring area graphic where the target point may exist relative to each collection point according to the information of each collection point;

[0025] An intersection combination calculation module is used to perform intersection combination on the circular area graphics corresponding to multiple collection points;

[0026] A minimum intersection subdivision module is used to perform intersection subdivision operations on intersection combinations using the minimum intersection principle to obtain multiple minimum intersections;

[0027] The trustworthiness calculation module is used to obtain the trustworthiness of each minimum intersection and determine the positioning result of the target point according to the trustworthiness result.

[0028] In addition, the present invention also provides an electronic device, including a processor and a memory, wherein the memory stores a computer program, and the processor executes the steps of the above method by calling the computer program stored in the memory.

[0029] In addition, the present invention also provides a computer-readable storage medium for storing a computer program for performing target positioning based on multi-point coordinates and distances, wherein the computer program executes the steps of the method described above when running on a computer.

[0030] The present invention has the following beneficial effects:

[0031] The target positioning method based on multi-point coordinates and distances of the present invention first constructs a circular area graphic in which the target point may exist relative to each collection point after obtaining the information set of multiple collection points, and then effectively filters the combination without intersection by performing intersection combination on the circular area graphics corresponding to the multiple collection points, and excludes the area with low probability of existence of the target point, which greatly reduces the number of code repetition judgments and loop calculations, thereby greatly shortening the data analysis time, especially when processing a large number of collection point data, significantly improving the efficiency of data calculation and analysis, and can well meet the needs of fast and real-time positioning. In addition, the intersection combination is subdivided by the minimum intersection principle to obtain multiple minimum intersections, and the positioning result of the target point is determined according to the trustworthiness result of the minimum intersection after subdivision, so that the position area of ​​the target point can be quickly and accurately located. The entire process only needs to input the information of the collection point to obtain the positioning information of the target point, and it also has the advantage of strong scalability.

[0032] In addition, the target positioning system based on multi-point coordinates and distances of the present invention also has the above advantages.

[0033] In addition to the above-described purposes, features and advantages, the present invention has other purposes, features and advantages. The present invention will be further described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] The drawings constituting a part of this application are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:

[0035] Figure 1 It is a flowchart of a target positioning method based on multi-point coordinates and distances according to a preferred embodiment of the present application;

[0036] Figure 2 is a schematic diagram of performing an intersection subdivision operation in a preferred embodiment of the present application;

[0037] Figure 3 is a schematic diagram of trustworthiness calculation in a preferred embodiment of the present application;

[0038] Figure 4 It is another flowchart of the target positioning method based on multi-point coordinates and distances of the preferred embodiment of the present application;

[0039] Figure 5 It is another flow chart of the target positioning method based on multi-point coordinates and distances of the preferred embodiment of the present application;

[0040] Figure 6 is a schematic diagram for visually displaying positioning results in a preferred embodiment of the present application;

[0041] Figure 7 It is a schematic diagram of the module structure of a target positioning system based on multi-point coordinates and distances according to another embodiment of the present application. DETAILED DESCRIPTION

[0042] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0043] Reference Figure 1 As shown, the preferred embodiment of the present application provides a target positioning method based on multi-point coordinates and distances, including the following contents:

[0044] Step S1: obtaining a set of information of multiple collection points, wherein the information of each collection point includes the geographical coordinates of the collection point, the distance range from the collection point to the target point, and the collection time;

[0045] It can be understood that in step S1, information of multiple collection points is obtained to form an information set, wherein the information of each collection point includes the geographical coordinates of the collection point (i.e., longitude and latitude), the distance range from the collection point to the target point, and the collection time. The distance range from the collection point to the target point is a stepped range value. For example, in the WeChat application scenario, when the nearby people are opened, it can be known that the actual distance from Passerby A is 230m, and the collected distance range is 200-300 meters. The format of the collection time is: yyyy-MM-dd HH:mm:ss, for example: 2024-06-28 00:00:00.

[0046] Step S2: constructing a circular area graph where the target point may exist relative to each collection point based on the information of each collection point;

[0047] It can be understood that in step S2, after inputting the information set of multiple collection points, a circular ring area graphic where the target point may exist relative to each collection point can be constructed based on the information of each collection point. The process of constructing a circular ring area graphic where the target point may exist relative to each collection point based on the information of each collection point includes the following:

[0048] With the geographic coordinates of each collection point as the center, the minimum distance range as the inner circle radius, and the maximum distance range as the outer circle radius, draw a circular area graphic where the target point may exist relative to each collection point, and output the outer circle point coordinate set and inner circle point coordinate set of each circular area graphic.

[0049] Specifically, the process of constructing the ring area graphic is to graphically process the distance range from each collection point to the target point, with the purpose of constructing the area where the target point may exist into a ring graphic. For the target point, the area where it may exist is the ring area with the geographical coordinates of each collection point as the center, the minimum value of the distance range as the inner ring radius, and the maximum value of the distance range as the outer ring radius. After drawing the ring area graphic, the outer circle point coordinate set and the inner circle point coordinate set of the ring area graphic can also be output. For example, the inventor of the present application currently uses 200 points as the point trajectory coordinates of the ring area graphic, and the outer circle point coordinate set is [{x1,y1},{x2,y2},...{x 100 ,y 100}], the coordinate set of the inner circle points is [{x'1,y'1},{x'2,y'2},...{x' 100 ,y' 100}].

[0050] It can be understood that according to the geographic coordinates of each collection point and its distance range to the target point, a circular area where the target point may exist relative to each collection point can be drawn, providing a graphical data basis for subsequent intersection analysis and target positioning.

[0051] Step S3: performing intersection combination on the circular area graphics corresponding to the multiple collection points;

[0052] It can be understood that in step S3, after constructing the circular ring area graphics corresponding to each collection point, the circular ring area graphics corresponding to multiple collection points are combined by intersection, the circular ring area graphics with intersections are screened out, and an intersection set consisting of all intersections is constructed. The process of combining the circular ring area graphics corresponding to multiple collection points by intersection includes the following contents:

[0053] At least three collection points are selected from the multiple collection points, and all possible intersection sets between the circular area graphics corresponding to the at least three collection points are calculated.

[0054] Specifically, the present invention defines that only the intersections between the circular area graphics corresponding to at least three collection points can be regarded as the area where the target point may exist, which effectively filters out the combinations where there is no intersection, excludes the areas where the probability of the target point existing is low, and is conducive to improving the accuracy of the target point positioning. Among them, the number of all possible intersections can be calculated based on the following formula: C(n,k)=n! / k!(n−k)!, where C(n,k) represents the number of all possible intersections, n represents the total number of collection points, and k represents the number of collection points taken out. For example, let k=3 and n=10, then the number of all possible intersections is 120, that is, there are 120 areas where the target point may exist. At the same time, the coordinate information of all intersections can also be obtained.

[0055] Step S4: using the minimum intersection principle to perform intersection subdivision operations on the intersection combination to obtain multiple minimum intersections;

[0056] It can be understood that in step S4, the minimum intersection principle means that there is no intersection or inclusion relationship in the output intersection set, that is, each intersection is an independent and minimum intersection. The process of using the minimum intersection principle to perform intersection subdivision operations on the intersection combination to obtain multiple minimum intersections includes the following:

[0057] Determine whether any two intersections in the intersection combination intersect. If they do, obtain the intersection area coordinate information and the difference area coordinate information, and split the difference area into multiple independent difference areas according to the difference area coordinate information, and use the intersection area coordinate information and the multiple independent difference area coordinate information to replace the coordinate information of the original two intersections; repeat recursively until there is no intersection and inclusion relationship in the intersection combination, and obtain multiple independent minimum intersections.

[0058] Specifically, determine whether any two intersections in the intersection set obtained in step S3 intersect. If they do, calculate the intersection area coordinate information and the difference area coordinate information. Since the difference area may be a polygon set composed of multiple polygons, it is also necessary to split the difference area into multiple independent difference areas, and then use the intersection area coordinate information and the multiple independent difference area coordinate information after splitting to merge into new intersection area coordinate information to replace the original two intersection area coordinate information. Repeat recursively until there is no intersection and inclusion relationship in the intersection set, that is, the minimum intersection subdivision operation is completed. For example, Figure 2 As shown, there is an intersection set with 120 intersections. When intersection A and intersection B have an intersection relationship, the intersection C and the difference between intersection A and intersection B are calculated. The difference is a plurality of combined polygons, that is, it includes a plurality of independent difference areas. The difference is split into difference D, difference E, difference F, and difference G. Then, intersection A and intersection B in the original intersection set are replaced with intersection C, difference D, difference E, difference F, and difference G. Then, the subdivision operation is recursively repeated on the replaced new intersection set.

[0059] Step S5: Obtain the trustworthiness of each minimum intersection, and determine the positioning result of the target point according to the trustworthiness result.

[0060] It can be understood that in step S5, the trustworthiness of each minimum intersection is the number of intersection areas of the target point, that is, the number of times the intersection is covered by the circular area graphic of the collection point, which can also be understood as the number of times the target area is collected by the collection point. The process of obtaining the trustworthiness of each minimum intersection includes the following:

[0061] For each minimum intersection, obtain the coordinate information of all its edge points, determine the positional relationship between the coordinates of each edge point and the circular area graphic of each collection point, and if all the edge points belong to the circular area graphic of a certain collection point, then determine that the minimum intersection is covered by the circular area graphic of the collection point, and use the number of times the minimum intersection is covered by the circular area graphic of the collection point as the trustworthiness; repeat continuously to obtain the trustworthiness of all minimum intersections.

[0062] Specifically, the intersection area coordinate information includes all the edge point coordinate information of the intersection, so it is only necessary to prove that these edge point coordinates exist in the circular ring area graphic of the collection point to prove that the intersection area belongs to the circular ring area graphic of the collection point. Therefore, for each minimum intersection, all its edge point coordinate information is obtained, and then the positional relationship between each edge point coordinate and the circular ring area graphic of each collection point is determined. If all edge points belong to the circular ring area graphic of a certain collection point, it is determined that the minimum intersection is covered by the circular ring area graphic of the collection point, and the number of times the minimum intersection is covered by the circular ring area graphic of the collection point is used as the trustworthiness. Among them, since the point coordinates of the circular ring area graphic of the collection point include the outer circle point coordinate set and the inner circle point coordinate set, it is necessary to determine whether the edge point of the minimum intersection area exists in the outer circle image and outside the inner circle graphic. In addition, since the intersections are all graphics cut out according to the circular ring, when the edge point is on the edge line of the outer circle ring, it is also considered to be in the outer circle ring, and when the point is on the edge line of the inner circle ring, it is also considered to be outside the inner circle ring. In addition, during the calculation process, due to the loss of precision (such as decimal rounding, errors, etc.), the point may be mistakenly judged as not existing in the circle, so it is necessary to add a buffer zone during calculation, that is, when the point exists in the buffer zone of the circle, it is also considered to be in the circle. The current buffer zone latitude and longitude values ​​set by this method are 0.000001. In addition, the circle area graphics of the collection point also have special circumstances. For example, when the distance range from the collection point to the target point is 0~500m, the circle area graphics is a circle, so it is only necessary to judge the positional relationship between the edge point and the circle. For example, Figure 3 As shown in the figure, assuming that there are 5 acquisition points, there are 20 calculated minimum intersections. After completing the trust calculation, the minimum trust should be 3 and the maximum trust should be 5. After completing the trust calculation of all minimum intersections, the minimum intersection with the largest trust can be used as the positioning area of ​​the target point. At the same time, the coordinates of the edge points of each minimum intersection can also be obtained to facilitate function expansion.

[0063] It can be understood that the target positioning method based on multi-point coordinates and distances of this embodiment, after obtaining the information set of multiple collection points, first constructs the circular area graphics where the target point may exist relative to each collection point, and then performs intersection combination on the circular area graphics corresponding to the multiple collection points, effectively filtering the combination without intersection, excluding the area with low probability of existence of the target point, greatly reducing the number of code repetition judgments and loop calculations, thereby greatly shortening the data analysis time, especially when processing a large number of collection point data, significantly improving the efficiency of data calculation and analysis, and can well meet the needs of fast and real-time positioning. In addition, the intersection combination is subdivided by the minimum intersection principle to obtain multiple minimum intersections, and the positioning result of the target point is determined according to the trustworthiness result of the minimum intersection after subdivision, which can quickly and accurately locate the location area of ​​the target point. The entire process only needs to input the information of the collection point to obtain the positioning information of the target point, and it also has the advantage of strong scalability.

[0064] Alternatively, if Figure 4 As shown, the target positioning method based on multi-point coordinates and distances, after obtaining the information set of multiple collection points, further includes the following contents:

[0065] Step S1a: Grouping the information sets of multiple collection points according to the date of collection time, filtering out the groups with the number of collection points less than a preset value, and outputting the remaining collection point group information sets.

[0066] Specifically, after obtaining the information sets of multiple collection points, the information of the collection points is first grouped according to the date of the collection time, and then the groups with less than 3 collection points are filtered out, and then the remaining collection point group information sets are output. For example, there is information on 5 collection points on June 28, 2024, and only 2 collection points on June 27, 2024. The final processed group information set only has the group on June 28, 2024, that is, 2024-06-28:[p1,p2,p3,p4,p5].

[0067] It can be understood that by grouping the information sets according to the date of collection time and eliminating the groups with less than 3 collection points, it is beneficial to subsequently select the grouped information sets according to the collection date to complete the positioning of the target point, thereby realizing the spatiotemporal association. In addition, by eliminating the groups with less than 3 collection points in advance, the amount of data processing for subsequent intersection combination and minimum intersection subdivision operations is reduced, thereby further improving the data processing efficiency.

[0068] Alternatively, if Figure 5 As shown, the target positioning method based on multi-point coordinates and distances also includes the following contents:

[0069] Step S6: Use different colors to represent different trustworthiness, and output the positioning results of the target point visually.

[0070] Specifically, the purpose of this step is to visualize the output results, using different colors to represent different levels of trust, so that the trust of each minimum intersection is clear at a glance, and the minimum intersection area with the highest trust can be quickly found, that is, the location area of ​​the target point. For example, the inventor of the present application uses Amap as the background, adds a polygonal cover as the judgment area, and adds colors according to a color ladder for different levels of trust. The current color ladder is green (color code: #00FF00) - red (color code: #FF0000), and then uses a conversion method to convert it into a hex color code with adjustable color depth, to achieve a gradual change from green (low trust) to red (high trust), and adds a click effect to each intersection. When clicking, you can view the number of times the intersection has been collected and the area of ​​the area, as shown below. Figure 6 shown.

[0071] In addition, if Figure 7 As shown, another embodiment of the present invention further provides a target positioning system based on multi-point coordinates and distances, preferably using the target positioning method based on multi-point coordinates and distances as described above, including:

[0072] A collection point information acquisition module is used to acquire information sets of multiple collection points, wherein the information of each collection point includes the geographical coordinates of the collection point, the distance range from the collection point to the target point, and the collection time;

[0073] A ring area graphic construction module is used to construct a ring area graphic where the target point may exist relative to each collection point according to the information of each collection point;

[0074] An intersection combination calculation module is used to perform intersection combination on the circular area graphics corresponding to multiple collection points;

[0075] A minimum intersection subdivision module is used to perform intersection subdivision operations on intersection combinations using the minimum intersection principle to obtain multiple minimum intersections;

[0076] The trustworthiness calculation module is used to obtain the trustworthiness of each minimum intersection and determine the positioning result of the target point according to the trustworthiness result.

[0077] It can be understood that the target positioning system based on multi-point coordinates and distances of this embodiment, after obtaining the information set of multiple collection points, first constructs the circular area graphics where the target point may exist relative to each collection point, and then performs intersection combination on the circular area graphics corresponding to the multiple collection points, effectively filtering the combination without intersection, excluding the area with low probability of existence of the target point, greatly reducing the number of code repetition judgments and loop calculations, thereby greatly shortening the data analysis time, especially when processing a large number of collection point data, significantly improving the efficiency of data calculation and analysis, and can well meet the needs of fast and real-time positioning. In addition, the intersection combination is subdivided by the minimum intersection principle to obtain multiple minimum intersections, and the positioning result of the target point is determined according to the trustworthiness result of the minimum intersection after subdivision, which can quickly and accurately locate the location area of ​​the target point. The entire process only needs to input the information of the collection point to obtain the positioning information of the target point, and it also has the advantage of strong scalability.

[0078] In addition, the target positioning system based on multi-point coordinates and distances also includes:

[0079] The information grouping and filtering module is used to group the information sets of multiple collection points according to the date of collection time, filter out the groups with less than a preset number of collection points, and output the remaining collection point group information sets.

[0080] In addition, the target positioning system based on multi-point coordinates and distances also includes:

[0081] The visualization display module is used to use different colors to represent different trustworthiness and to visualize the positioning results of the target point.

[0082] It can be understood that the various modules of the system embodiment correspond to the various steps of the above method embodiment, so the specific principles of each module will not be repeated here, and the corresponding references can be made to the various steps of the above method embodiment.

[0083] In addition, another embodiment of the present invention further provides an electronic device, including a processor and a memory, wherein the memory stores a computer program, and the processor executes the steps of the above method by calling the computer program stored in the memory.

[0084] In addition, another embodiment of the present invention further provides a computer-readable storage medium for storing a computer program for performing target positioning based on multi-point coordinates and distances, wherein the computer program executes the steps of the method described above when running on a computer.

[0085] Common computer-readable storage media include: floppy disks, flexible disks, hard disks, magnetic tapes, any other magnetic media, CD-ROMs, any other optical media, punch cards, paper tapes, any other physical media with patterns of holes, random access memory (RAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), flash-erasable programmable read-only memory (FLASH-EPROM), any other memory chip or cartridge, or any other medium that can be read by a computer. Instructions can further be transmitted or received by a transmission medium. The term transmission medium may include any tangible or intangible medium that can be used to store, encode or carry instructions for execution by a machine, and includes digital or analog communication signals or intangible media that facilitate communication of the above instructions. Transmission media include coaxial cables, copper wire, and optical fiber, including the wires of a bus used to transmit a computer data signal.

[0086] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes. The schemes in the embodiments of the present application may be implemented in various computer languages, for example, object-oriented programming language Java and literal scripting language JavaScript, etc.

[0087] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0088] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0089] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0090] Although the preferred embodiments of the present application have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the present application.

[0091] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

[0092] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A target positioning method based on multi-point coordinates and distances, characterized in that: Includes the following: Acquire information sets of multiple collection points, wherein the information of each collection point includes the geographic coordinates of the collection point, the distance range from the collection point to the target point, and the collection time; Construct a circular area graph where the target point may exist relative to each collection point based on the information of each collection point; Perform intersection combination on the circular area graphics corresponding to multiple collection points; The minimum intersection principle is used to perform intersection subdivision operations on the intersection combination to obtain multiple minimum intersections; The trustworthiness of each minimum intersection is obtained, and the positioning result of the target point is determined based on the trustworthiness result.

2. The target positioning method based on multi-point coordinates and distances as claimed in claim 1, characterized in that: The process of constructing a circular area graphic of the target point relative to each collection point according to the information of each collection point includes the following contents: With the geographic coordinates of each collection point as the center, the minimum distance range as the inner circle radius, and the maximum distance range as the outer circle radius, draw a circular area graphic where the target point may exist relative to each collection point, and output the outer circle point coordinate set and inner circle point coordinate set of each circular area graphic.

3. The target positioning method based on multi-point coordinates and distances as claimed in claim 1, characterized in that: The process of performing intersection combination on the circular area graphics corresponding to the multiple collection points includes the following contents: At least three collection points are selected from the multiple collection points, and all possible intersection sets between the circular area graphics corresponding to the at least three collection points are calculated.

4. The target positioning method based on multi-point coordinates and distances as claimed in claim 1, characterized in that: The process of performing intersection subdivision operation on the intersection combination by adopting the minimum intersection principle to obtain multiple minimum intersections includes the following contents: Determine whether any two intersections in the intersection combination intersect, and if they do intersect, obtain the intersection area coordinate information and the difference area coordinate information, and split the difference area into multiple independent difference areas according to the difference area coordinate information, and use the intersection area coordinate information and the multiple independent difference area coordinate information to replace the original coordinate information of the two intersections; Repeat recursively until there is no intersection or inclusion relationship in the intersection combination, and obtain multiple independent minimum intersections.

5. The target positioning method based on multi-point coordinates and distances as claimed in claim 1, characterized in that: The process of obtaining the trustworthiness of each minimum intersection includes the following: For each minimum intersection, obtain the coordinate information of all its edge points, determine the positional relationship between the coordinates of each edge point and the circular area graphic of each collection point, and if all the edge points belong to the circular area graphic of a certain collection point, then determine that the minimum intersection is covered by the circular area graphic of the collection point, and use the number of times the minimum intersection is covered by the circular area graphic of the collection point as the trustworthiness; repeat continuously to obtain the trustworthiness of all minimum intersections.

6. The target positioning method based on multi-point coordinates and distances as claimed in claim 1, characterized in that: After obtaining the information set of multiple collection points, the following contents are also included: The information sets of multiple collection points are grouped according to the date of collection time, and the groups with the number of collection points less than a preset value are filtered out, and the remaining collection point group information sets are output.

7. The target positioning method based on multi-point coordinates and distances as claimed in claim 1, characterized in that: Also included are the following: Different colors are used to represent different levels of trustworthiness, and the positioning results of the target points are output visually.

8. A target positioning system based on multi-point coordinates and distances, characterized in that: include: A collection point information acquisition module is used to acquire information sets of multiple collection points, wherein the information of each collection point includes the geographical coordinates of the collection point, the distance range from the collection point to the target point, and the collection time; A ring area graphic construction module is used to construct a ring area graphic where the target point may exist relative to each collection point according to the information of each collection point; An intersection combination calculation module is used to perform intersection combination on the circular area graphics corresponding to multiple collection points; A minimum intersection subdivision module is used to perform intersection subdivision operations on intersection combinations using the minimum intersection principle to obtain multiple minimum intersections; The trustworthiness calculation module is used to obtain the trustworthiness of each minimum intersection and determine the positioning result of the target point according to the trustworthiness result.

9. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores a computer program, and the processor executes the steps of the method according to any one of claims 1 to 7 by calling the computer program stored in the memory.

10. A computer-readable storage medium for storing a computer program for locating a target based on multi-point coordinates and distances, characterized in that: When the computer program is run on a computer, the steps of the method according to any one of claims 1 to 7 are executed.

Images