Two-dimensional GIS deviation correction method
By using two-dimensional GIS deviation correction method in the underground personnel positioning system of coal mines, adding virtual nodes and calculating the shortest distance, the problem of positioning coordinate deviation is solved, and the precise positioning of underground operators and the smoothness of map interfaces is improved.
Patent Information
- Application Number
- CN202410600967.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-05-15
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2044-05-15
AI Technical Summary
In the underground personnel positioning system of coal mines, due to signal shielding and interference, the positioning coordinates of the operators are deviated and cannot be accurately displayed on the GIS map, which affects the manager's real-time understanding and response to the personnel's location.
The two-dimensional GIS deviation correction method is adopted to obtain the curves of the downhole tunnel and preset key nodes, add virtual nodes, and calculate the shortest distance to determine the positioning point, which significantly improves the positioning accuracy and deviation correction efficiency.
It realizes accurate positioning of underground operators, significantly improves the smoothness of the map visual interface, and ensures managers' accurate understanding and timely response to personnel locations.
Smart Images

Figure CN118552652B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of underground personnel positioning, in particular to a two-dimensional GIS deviation correction method. Background Art
[0002] The importance of personnel positioning system in coal mine operation is self-evident. It can help monitor the location of underground workers in real time.
[0003] Coal mines are located in remote areas, with crisscross underground tunnels, wide and complex distribution of equipment and workers, and high mobility. Information exchange between ground and underground workers is difficult. Therefore, it is particularly important to grasp the location distribution and working conditions of underground workers in real time, dynamically and accurately, and to achieve precise positioning management of personnel.
[0004] The equipment of the personnel positioning system needs to run for a long time in the harsh coal mine environment, and there may be problems such as signal shielding and interference, which leads to deviations in the positioning coordinates of the operators, resulting in the inability to accurately display the operators in the tunnel (i.e., the curve representing the tunnel on the GIS map). As a result, managers cannot accurately understand the location of the operators and cannot take timely countermeasures. Summary of the invention
[0005] In order to solve at least one technical problem in the prior art, an embodiment of the present invention provides a two-dimensional GIS correction method for efficiently correcting the positioning coordinates of underground workers and visually displaying them on a two-dimensional map of the mine. To achieve the above technical objectives, the technical solution adopted by the embodiment of the present invention is:
[0006] The embodiment of the present invention provides a two-dimensional GIS correction method, comprising the following steps:
[0007] Step S10, obtaining a curve representing an underground tunnel and key nodes preset on the curve;
[0008] Step S20, adding virtual nodes to the curved section of the curve according to the key nodes on the curve and the preset density factor, the key nodes and the virtual nodes together constitute the nodes on the curve for positioning;
[0009] Step S30, connecting each adjacent node on the curve to obtain a plurality of sub-line segments; calculating the distance from the point to be corrected to each sub-line segment in the order of the nodes, obtaining the minimum distance from the point to be corrected to each sub-line segment as the minimum distance from the point to be corrected to the curve;
[0010] Step S40, traverse all curves, obtain the shortest distance among the minimum distances from the point to be corrected to each curve, and use the curve corresponding to the shortest distance as the positioning curve; use the sub-line segment corresponding to the shortest distance as the positioning segment, determine the positioning point of the point to be corrected on the positioning segment and display it.
[0011] Furthermore, the adding of virtual nodes to the curved section of the curve according to the key nodes on the curve and the preset density factor includes:
[0012] Step S201, calculating the arc length L between the current key node and the next key node;
[0013] Step S202, dividing the arc length L by the density factor and rounding the result to obtain the number M of virtual nodes that need to be added between the current key node and the next key node;
[0014] Step S203, draw a tangent line of the curve at the current key node, select a temporary point on the tangent line along the growth direction of the curve, the length from the temporary point to the current key node is half of the arc length L between the current key node and the next key node, and the intersection of the vertical line of the tangent line from the temporary point and the curve is a virtual node;
[0015] Step S204, taking the virtual node obtained in the previous step as the current virtual node, and calculating the arc length between the current virtual node and the next key node;
[0016] Step S205, draw a tangent line of the curve at the current virtual node, select a temporary point on the tangent line along the growth direction of the curve, the length from the temporary point to the current virtual node is half the arc length between the current virtual node and the next key node, and the intersection of the vertical line of the tangent line from the temporary point and the curve is a virtual node;
[0017] Step S206, repeating steps S204 to S205 until all virtual nodes between the current key node and the next key node are added.
[0018] Furthermore, the calculation of the distance from the point to be corrected to each sub-line segment includes: calculating the foot point of the perpendicular from the point to be corrected to the sub-line segment; if the foot point of the perpendicular is on the sub-line segment itself, then taking the perpendicular distance from the point to be corrected to the foot point of the perpendicular to the sub-line segment as the distance from the point to be corrected to the sub-line segment; if the foot point of the perpendicular is on the extension line of the sub-line segment, then calculating the distance from the point to be corrected to the nodes at both ends of the sub-line segment; and taking the smaller of the distances from the point to be corrected to the nodes at both ends of the sub-line segment as the distance from the point to be corrected to the sub-line segment.
[0019] Furthermore, the sub-segment corresponding to the shortest distance is used as the positioning segment, and the positioning point of the point to be corrected is determined on the positioning segment, including: if the foot point of the perpendicular from the point to be corrected to the positioning segment is on the positioning segment itself, then the foot point of the perpendicular is used as the positioning point; if the foot point of the perpendicular from the point to be corrected to the positioning segment is on the extension line of the positioning segment, then the node corresponding to the smaller distance from the point to be corrected to the nodes at both ends of the positioning segment is used as the positioning point.
[0020] Furthermore, the number M of virtual nodes that need to be added between the current key node and the next key node is 2 to 5.
[0021] The technical solution provided by the embodiment of the present invention has the following beneficial effects:
[0022] 1) It is possible to more accurately position the correction point (i.e. the operator) on the curve representing the underground tunnel or approximately on the curve.
[0023] 2) The correction efficiency is high and can significantly improve the smoothness of the map visualization interface. BRIEF DESCRIPTION OF THE DRAWINGS
[0024] Figure 1 4 is a flow chart of the deviation correction method in an embodiment of the present invention.
[0025] Figure 2 It is a curve schematic diagram showing an underground tunnel in an embodiment of the present invention. DETAILED DESCRIPTION
[0026] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.
[0027] In the description of the embodiments of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicating the orientation or positional relationship, are based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and "third" are used for descriptive purposes only and cannot be understood as indicating or implying relative importance.
[0028] In the description of the embodiments of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, it can also be the internal connection of two components, it can be a wireless connection, or it can be a wired connection. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0029] In addition, the technical features involved in the different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.
[0030] GIS maps can visualize the topography of the entire mine in the form of a two-dimensional map. On the GIS map, each tunnel under the mine is represented as a curve composed of multiple nodes. The two-dimensional GIS correction method proposed in this application is to accurately correct the positioning coordinates of the operating personnel to the curve (or approximately on the curve).
[0031] The embodiment of the present invention proposes a two-dimensional GIS correction method, comprising the following steps:
[0032] Step S10, obtaining a curve representing an underground tunnel and key nodes preset on the curve;
[0033] On the GIS map, the curves representing the underground tunnels are predefined and can be displayed on the GIS map. Some key nodes are usually preset on these curves; however, the number of key nodes is relatively sparse, especially in the curved sections of the curves. Too sparse key nodes are not conducive to the precise positioning of operators; in this embodiment, the operators call them points to be corrected on the GIS map;
[0034] Step S20, adding virtual nodes to the curved section of the curve according to the key nodes on the curve and the preset density factor, the key nodes and the virtual nodes together constitute the nodes on the curve for positioning;
[0035] The curved segments on the curve can be determined based on the slope changes of adjacent key nodes;
[0036] The specific steps include:
[0037] Step S201, calculating the arc length L between the current key node and the next key node;
[0038] exist Figure 2 In the embodiment shown, the key nodes on the curve include nodes a1, a2, a3, a4, a5, and a6, and these key nodes are distributed along the growth direction of the curve; it is assumed that a virtual node is added to the curved section between adjacent key nodes a3 and a4; the arc length L between the current key node a3 and the next key node a4 is calculated, which can be specifically calculated by integration;
[0039] Step S202, dividing the arc length L by the density factor and rounding the result to obtain the number M of virtual nodes that need to be added between the current key node and the next key node;
[0040] The density factor can be pre-set according to the conditions of the lanes and the number of key nodes; Figure 2 In the embodiment shown, it is assumed that the number M of virtual nodes added between adjacent key nodes a3 and a4 is 2; the number M can usually be 2 to 5;
[0041] Step S203, draw a tangent line of the curve at the current key node, select a temporary point on the tangent line along the growth direction of the curve, the length from the temporary point to the current key node is half of the arc length L between the current key node and the next key node, and the intersection of the vertical line of the tangent line from the temporary point and the curve is a virtual node;
[0042] exist Figure 2 In the embodiment shown, a tangent line of the curve is drawn at the current key node a3, and a temporary point a3′ is taken on the tangent line along the growth direction of the curve. The length from the temporary point a3′ to the current key node a3 is half of the arc length L between the current key node a3 and the next key node a4. The intersection of the vertical line drawn from the temporary point a3′ and the curve is a virtual node b1.
[0043] Step S204, taking the virtual node obtained in the previous step as the current virtual node, and calculating the arc length between the current virtual node and the next key node;
[0044] exist Figure 2 In the illustrated embodiment, the virtual node b1 obtained in the previous step is used as the current virtual node, and the arc length between the current virtual node b1 and the next key node a4 is calculated;
[0045] Step S205, draw a tangent line of the curve at the current virtual node, select a temporary point on the tangent line along the growth direction of the curve, the length from the temporary point to the current virtual node is half the arc length between the current virtual node and the next key node, and the intersection of the vertical line of the tangent line from the temporary point and the curve is a virtual node;
[0046] exist Figure 2 In the embodiment shown, a tangent line of the curve is drawn at the current virtual node b1, and a temporary point b1′ is taken on the tangent line along the growth direction of the curve. The length from the temporary point b1′ to the current virtual node b1 is half the arc length between the current virtual node b1 and the next key node a4. The intersection of the vertical line drawn from the temporary point b1′ and the curve is a virtual node b2.
[0047] Step S206, repeating steps S204 to S205 until all virtual nodes between the current key node and the next key node are added;
[0048] The above virtual node addition process can adapt to the shape and degree of curvature of the curved section of the curve, and the distribution of virtual nodes is more reasonable;
[0049] Step S30, connecting each adjacent node on the curve to obtain a plurality of sub-line segments; calculating the distance from the point to be corrected to each sub-line segment in the order of the nodes, obtaining the minimum distance from the point to be corrected to each sub-line segment as the minimum distance from the point to be corrected to the curve;
[0050] In this step, the adjacent nodes on the curve are connected to obtain multiple sub-segments, where each adjacent node includes a key node and a virtual node. For the straight line segment of the curve, the sub-segments obtained by connecting the adjacent nodes coincide with the straight line segment. For example, Figure 2 For the curved segment of the curve, the sub-segment obtained by connecting adjacent nodes does not coincide with the curved segment of the curve, for example Figure 2 Nodes a3 and b1 in
[0051] In this step, the calculation of the distance from the point to be corrected to each sub-line segment includes: calculating the foot point of the perpendicular from the point to be corrected to the sub-line segment, if the foot point of the perpendicular is on the sub-line segment itself, taking the perpendicular distance from the point to be corrected to the foot point of the perpendicular of the sub-line segment as the distance from the point to be corrected to the sub-line segment, if the foot point of the perpendicular is on the extension line of the sub-line segment, calculating the distance from the point to be corrected to the nodes at both ends of the sub-line segment, and taking the smaller of the distances from the point to be corrected to the nodes at both ends of the sub-line segment as the distance from the point to be corrected to the sub-line segment;
[0052] exist Figure 2 In the embodiment shown, the foot point c1′ of the perpendicular from the point c1 to be corrected to the sub-segment a2a3 is on the sub-segment itself, and the distance of the perpendicular from the point c1 to be corrected to the foot point c1′ of the perpendicular from the sub-segment a2a3 is taken as the distance from the point c1 to be corrected to the sub-segment; the foot point c1′′ of the perpendicular from the point c1 to be corrected to the sub-segment a3b1 is on the extension line of the sub-segment a3b1, and the distance of c1a3 and the distance of c1b1 are calculated, and the smaller distance between the two is taken as the distance from the point c1 to be corrected to the sub-segment a3b1;
[0053] Step S40, traverse all curves, obtain the shortest distance among the minimum distances from the point to be corrected to each curve, and use the curve corresponding to the shortest distance as the positioning curve; use the sub-line segment corresponding to the shortest distance as the positioning segment, determine the positioning point of the point to be corrected on the positioning segment and display it;
[0054] Specifically, the sub-segment corresponding to the shortest distance is used as the positioning segment, and the positioning point of the point to be corrected is determined on the positioning segment, including: if the foot point of the perpendicular from the point to be corrected to the positioning segment is on the positioning segment itself, the foot point of the perpendicular is used as the positioning point; if the foot point of the perpendicular from the point to be corrected to the positioning segment is on the extended line of the positioning segment, the node corresponding to the smaller distance between the point to be corrected and the nodes at both ends of the positioning segment is used as the positioning point;
[0055] exist Figure 2 In the embodiment shown, if the foot point of the perpendicular from the point to be corrected c1 to the positioning segment is on the positioning segment itself, the foot point c1′ is used as the positioning point; in another embodiment, if the foot point of the perpendicular from the point to be corrected c1 to the positioning segment is on the extension line of the positioning segment, the node corresponding to the smaller distance between the point to be corrected c1 and the nodes at both ends of the positioning segment is used as the positioning point;
[0056] In the curved section of the curve, since a number of virtual nodes have been reasonably added, the length of the positioning section is significantly shorter than the entire curved section. After the point to be corrected is corrected to the positioning section, although sometimes (such as the foot point) the positioning point of the point to be corrected does not coincide with the curved section of the curve, it is already very close to the curved section of the curve, and the coordinate difference is very small.
[0057] At present, most map visualizations in the industry use the OpenLayers library package, which supports tiled layers, vector layers, and is easy to customize and expand; however, the correction provided by OpenLayers is time-consuming and does not support multi-threading, making it easy for the concurrency of the personnel positioning system to reach a bottleneck. The correction method proposed in this application greatly improves the correction efficiency.
[0058] Finally, it should be noted that the above specific implementation methods are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the embodiments, those skilled in the art should understand that the technical solution of the present invention can be modified or replaced by equivalents without departing from the spirit and scope of the technical solution of the present invention, which should be included in the scope of the claims of the present invention.
Claims
1. A two-dimensional GIS deviation correction method, characterized in that: The following steps are involved: Step S10, obtaining a curve representing an underground tunnel and key nodes preset on the curve; Step S20, adding virtual nodes to the curved section of the curve according to the key nodes on the curve and the preset density factor, the key nodes and the virtual nodes together constitute the nodes on the curve for positioning; Step S30, connecting each adjacent node on the curve to obtain a plurality of sub-line segments; calculating the distance from the point to be corrected to each sub-line segment in the order of the nodes, obtaining the minimum distance from the point to be corrected to each sub-line segment as the minimum distance from the point to be corrected to the curve; Step S40, traverse all curves, obtain the shortest distance among the minimum distances from the point to be corrected to each curve, and use the curve corresponding to the shortest distance as the positioning curve; use the sub-line segment corresponding to the shortest distance as the positioning segment, determine the positioning point of the point to be corrected on the positioning segment and display it; The adding of virtual nodes to the curved section of the curve according to the key nodes on the curve and the preset density factor includes: Step S201, calculating the arc length L between the current key node and the next key node; Step S202, dividing the arc length L by the density factor and rounding the result to obtain the number M of virtual nodes that need to be added between the current key node and the next key node; Step S203, draw a tangent line of the curve at the current key node, select a temporary point on the tangent line along the growth direction of the curve, the length from the temporary point to the current key node is half of the arc length L between the current key node and the next key node, and the intersection of the vertical line of the tangent line from the temporary point and the curve is a virtual node; Step S204, taking the virtual node obtained in the previous step as the current virtual node, and calculating the arc length between the current virtual node and the next key node; Step S205, draw a tangent line of the curve at the current virtual node, select a temporary point on the tangent line along the growth direction of the curve, the length from the temporary point to the current virtual node is half the arc length between the current virtual node and the next key node, and the intersection of the vertical line of the tangent line from the temporary point and the curve is a virtual node; Step S206, repeating steps S204 to S205 until all virtual nodes between the current key node and the next key node are added.
2. The two-dimensional GIS deviation correction method according to claim 1, characterized in that: The method of calculating the distance from the point to be corrected to each sub-line segment includes: calculating the foot point of the perpendicular from the point to be corrected to the sub-line segment; if the foot point of the perpendicular is on the sub-line segment itself, the distance of the perpendicular from the point to be corrected to the foot point of the perpendicular of the sub-line segment is used as the distance from the point to be corrected to the sub-line segment; if the foot point of the perpendicular is on the extension line of the sub-line segment, the distance from the point to be corrected to the nodes at both ends of the sub-line segment is calculated; and the smaller of the distances from the point to be corrected to the nodes at both ends of the sub-line segment is used as the distance from the point to be corrected to the sub-line segment.
3. The two-dimensional GIS deviation correction method according to claim 1, characterized in that: The method of taking the sub-segment corresponding to the shortest distance as the positioning segment and determining the positioning point of the point to be corrected on the positioning segment includes: if the foot point of the perpendicular from the point to be corrected to the positioning segment is on the positioning segment itself, then the foot point of the perpendicular is taken as the positioning point; if the foot point of the perpendicular from the point to be corrected to the positioning segment is on the extension line of the positioning segment, then the node corresponding to the smaller distance between the point to be corrected and the nodes at both ends of the positioning segment is taken as the positioning point.
4. The two-dimensional GIS deviation correction method according to claim 1, characterized in that: The number M of virtual nodes that need to be added between the current key node and the next key node is 2 to 5.
