A path planning method for hole inspection robot in blasting environment
By improving the A* algorithm and Bezier curve optimization, the problems of redundant inflection points and path non-smoothness in traditional path planning are solved, and efficient path planning of hole test robots in blasting environments is realized, which improves the feasibility and safety of the path.
Patent Information
- Application Number
- CN202210897919.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-07-28
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2042-07-28
AI Technical Summary
In the blasting environment, traditional A* algorithms are used to plan paths of hole test robots with many invalid expansion points, unnecessary inflection points of the path, and not smooth enough, resulting in increased path search time and poor path feasibility.
The improved A* search algorithm is used to combine estimation weights and map grid spacing values to reduce redundant inflection points through inflection point distribution type and pre-node optimization process, and use the Bezier curve to optimize the path trajectory smoothly, generating few inflection points, excellent path length, and smooth A good global cruise path.
It significantly improves the path planning efficiency and reliability of the hole inspection robot in a blasting environment, reduces the number of turns and path complexity, ensures the smoothness and feasibility of the cruise path, and improves the safety and working efficiency of the gun hole inspection.
Smart Images

Figure CN115145284B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of robot path planning, and in particular to a path planning method for a hole inspection robot in a blasting environment. Background Art
[0002] With the continuous deepening of safety production standardization work and the continuous improvement of the safety requirements of drilling and blasting operations by industry management departments, it has become an urgent practical requirement and task to conduct real-time management of the entire process of open-pit mine drilling, blasting, and acceptance. In actual operations, the charge is not loaded immediately after drilling, because factors such as drill powder sliding in may cause changes in the depth of the blasthole. Therefore, the depth of the blasthole needs to be measured before loading, which is the hole inspection work. In the past, most of the hole inspection work was done manually. After the drilling in the blasting area was completed, the blasting professionals carried out hole inspection according to the hole layout map. The holes must be cleaned and inspected one by one, and the hole depth, hole spacing, row spacing and inclination angle must be recorded. If there is a change in the above blasting parameters and the drilling design, a series of work needs to be done, such as appropriate waste hole drilling, calculation of single hole charge and charge type, and hole plugging treatment.
[0003] Since blasting has strict requirements on the quality of blastholes, traditional manual borehole inspection requires not only the borehole inspectors to have professional knowledge of blasting borehole inspection and rich practical operation experience, but also to be able to cope with various uncertain emergencies. Under such conditions, manual borehole inspection gradually exposed obvious drawbacks, such as large borehole data errors, poor working environment, and numerous borehole inspection steps and heavy workload, which affected the safety and quality of drilling and blasting operations. Therefore, an automatic borehole inspection robot is used to perform automatic cruising based on unmanned driving, and uses autonomous navigation, image recognition, multi-sensor fusion technology and other technologies to inspect boreholes and efficiently provide accurate data, thereby replacing manual borehole inspection. In the process of automatic borehole inspection, the borehole inspection robot is required to carry the detection device and maintain a stable movement speed and regular movement trajectory when traveling in the blasting site. Therefore, path planning between each borehole is a necessary link before borehole inspection. Quickly planning a safe and feasible path to each borehole based on environmental information is one of the core technologies and important research issues of the borehole inspection robot.
[0004] At present, the path planning algorithm with wide application and high path finding efficiency in autonomous mobile robots is the A* search algorithm, which can provide a globally feasible path under the premise of finding the target point. However, there is still room for improvement in the application of the traditional A* algorithm, such as large expansion invalid space, long search time, and many path turning points. Domestic and foreign scholars have also conducted many improvement studies on this. For example, Wei Shan et al. improved the estimated cost of the heuristic function in the A* algorithm, reducing the number of search nodes, but the number of turning nodes in the final path is still too many; KE Da et al. proposed an A* algorithm with a variable step size to find a path with fewer steps, but there are many turning points, turning close to obstacles, and easy collisions; Kong Jili et al. improved the A* algorithm using a two-way search mechanism, reducing the number of search nodes by alternating searches from the starting point and the target point, but the improvement effect is poor in a larger environment and the number of turns is not optimized.
[0005] In summary, although scholars have done a lot of research on the A* algorithm, there are still many invalid expansion points, unnecessary turning points, and insufficient smoothness in the application of the borehole inspection robot's cruising path planning in a specific blasting environment, which leads to increased pathfinding time and poor path feasibility. Summary of the invention
[0006] Purpose of the invention: In view of the above shortcomings, the present invention provides a path planning method for a hole inspection robot in a blasting environment, so that the hole inspection robot can quickly plan a path with few turning points, excellent path length and good smoothness between multiple blast holes before drilling and blasting, thereby facilitating accurate hole inspection on the hole inspection robot, increasing the safety and reliability of blast hole inspection in a blasting environment, and improving the work efficiency of blast hole inspection.
[0007] Technical solution: To solve the above problems, the present invention provides a path planning method for a hole inspection robot in a blasting environment, which specifically includes the following steps:
[0008] (1) Scan and model the working environment of the borehole inspection robot and establish a two-dimensional environmental grid map of the blasting area;
[0009] (2) Determine the starting point of the hole inspection robot in the two-dimensional environmental grid map of the blasting area and all the blasthole positions and postures, and determine the order of blasthole inspection according to the set blasthole sorting rules;
[0010] (3) Using the improved A* search algorithm, the paths between adjacent blast holes are gradually searched in the order of blast hole inspection from the starting point of the two-dimensional environmental grid map of the blasting area, and the cruising paths between several adjacent blast holes and the turning information table corresponding to all nodes in the cruising path are obtained; the cruising paths between adjacent blast holes are spliced to obtain the global cruising initial path;
[0011] (4) According to the turning information table of each cruise path, the turning point of the global cruise initial path is judged, and the turning point information is extracted into the turning point list in the order of the nodes of the global cruise initial path, and the starting point and the end point of the global cruise initial path are added to the first and last positions in the turning point list; according to the turning point distribution type, the distribution type of each three adjacent elements in the turning point list is judged in sequence, and the pre-node index value is calculated according to the judged distribution type to obtain the pre-node position; it is judged whether the pre-node is an obstacle. If there is no obstacle at the pre-node and the path nodes where the pre-node is located are all obstacles, the pre-node is used to replace the central element of the original three elements to complete the turning point optimization; otherwise, the original element is kept unchanged; the path turning point backtracking processing is performed on all the optimized turning points to update the global cruise path; the path where the pre-node is located is the path between the pre-node and the non-central element of the original three elements.
[0012] Furthermore, the inflection point distribution type is:
[0013]
[0014] Where p1, p2, and p3 are the index values corresponding to the coordinates of the three adjacent elements in each judgment cycle of the inflection point, n 0 is the number of grids in a column along the vertical axis in the environmental grid map; labels ①-⑧ correspond to a type of inflection point distribution respectively;
[0015] The calculation formula of the pre-node index value is:
[0016] p * =p3-(p2-p1)
[0017] In the formula, p * It is the index value corresponding to the pre-node.
[0018] Furthermore, the method further comprises the steps of:
[0019] (5) The updated global cruising path is smoothly optimized by using a Bezier curve to obtain an optimized global cruising path of the hole inspection robot; the Bezier curve formula is:
[0020]
[0021] In the formula, j represents the order of the curve, Pi represents the control point in the curve, and t represents the control parameter of the curve;
[0022]
[0023] Furthermore, the step (3) of using the improved A* search algorithm to gradually search the paths between adjacent blastholes in the order of blasthole inspection from the starting point of the two-dimensional environmental grid map of the blasting area specifically includes:
[0024] (3.1) Create an open list and a closed list, and add the starting point of the hole inspection robot at the two-dimensional environmental grid map of the blasting area to the open list;
[0025] (3.2) Expand the neighboring nodes from the starting point, and continue to put the newly expanded nodes into the open list;
[0026] (3.3) The cost of the expanded new node is calculated according to the cost function formula and the Manhattan distance calculation method, and the expansion point with the smallest cost is put into the open list and into the closed list; the cost function F(n) of the node expansion is:
[0027] F(n)=G(n)+H(n)
[0028] G(n)=G(n-1)+m
[0029] H(n)=m×w(n)×(|goalpos x -n x |+|goalpos y -n y |)
[0030] In the formula, G(n) is the actual cost of the starting node to the current node n, H(n) is the estimated cost of the current node n to the target blasthole node; G(n-1) represents the actual cost between the parent node of node n and the starting point; m represents the grid spacing setting value; w(n) represents the valuation weight; goalpos x Indicates the horizontal coordinate of the target blasthole node, goalpos y Indicates the ordinate of the target blasthole node; n x Represents the horizontal coordinate of node n, n y Represents the ordinate of node n;
[0031] (3.4) Determine whether the open list contains the target blasthole posture node. If so, add the node to the closed list to perform initial path backtracking to find the cruise path. Otherwise, continue to select the expansion point with the smallest cost in the open list to expand the new node until the open list contains the target blasthole posture node; the target blasthole posture node refers to the blasthole posture node adjacent to the starting point;
[0032] (3.5) According to the borehole inspection sequence, the currently found target borehole posture node is used as the starting point, and the corresponding next borehole node in the borehole inspection sequence is used as the target borehole posture node. Steps (3.2) to (3.4) are repeated until the cruising path between the last two boreholes in the borehole inspection sequence is found.
[0033] Furthermore, in the step (3.2), the adjacent node expansion adopts a four-directional node expansion method, that is, expansion is performed in four directions of the top, bottom, left, and right of the current expanded node.
[0034] Furthermore, the cost is calculated by marking occupied nodes in the step (3.3); specifically: a cost list is created, and before expanding adjacent nodes, all nodes in the cost list are marked as occupied, indicating that the expanded node positions in the four adjacent directions are all occupied; if any of the current expansion points has an obstacle and is an infeasible point, the corresponding position in the cost list maintains the initial marking state and does not enter the subsequent cost calculation; if the current expansion point is a feasible point, the actual calculated cost replaces the initial cost list marking state, and at the same time, when selecting the node with the minimum cost in the open list and putting it into the closed list, the nodes in the open list that are kept in the initial marking state are not considered.
[0035] Furthermore, the blasthole sorting rule described in step (2) is set in descending or ascending order according to the values of the horizontal and vertical coordinates in the two-dimensional environmental grid map of the blasting area where the blastholes are located.
[0036] In addition, the present invention also provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of any of the above methods when executing the computer program. A computer-readable storage medium stores a computer program, wherein the computer program implements the steps of any of the above methods when executed by the processor.
[0037] Beneficial effect: Compared with the prior art, the path planning method for a borehole inspection robot in a blasting environment described in the present invention has the following significant advantages: 1. An improved A* algorithm is used to gradually search the paths between blastholes in a certain order from the starting position point, and evaluation weights are introduced and the map grid spacing value setting is considered to improve the path-finding efficiency. After traversing all the blasthole nodes in the map, the paths between the blastholes are spliced; the paths are processed by turning point backtracking through the distribution type and pre-node optimization process to further reduce redundant turning points, and the number of turns is reduced while ensuring the optimal path length; 2. Taking into account the continuity of the motion process, path trajectory smoothing is added, and then the turning point backtracking method is used to update the local path and then merge the Bezier curve for smoothing, so as to finally obtain the global blasthole inspection path. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] Figure 1 Shown is a flow chart of the method of the present invention;
[0039] Figure 2 The figure shows the blasting environment map generated by the SLAM mapping algorithm of the present invention;
[0040] Figure 3Shown is a schematic diagram of blasthole arrangement of the present invention;
[0041] Figure 4 Shown is a schematic diagram of the inflection point distribution type;
[0042] Figure 5 The figure shows the comparison of experimental results of different algorithms in the embodiment;
[0043] Figure 6 The figure shows the path comparison diagram after inflection point optimization and smoothing in the embodiment;
[0044] Figure 7 Shown is a schematic diagram of performing pre-node optimization;
[0045] Figure 8 Shown is a schematic diagram of the grid index arrangement. DETAILED DESCRIPTION
[0046] The technical solution of the present invention is further described below in conjunction with the accompanying drawings.
[0047] like Figure 1 As shown, the present invention adopts a path planning method for a hole inspection robot in a blasting environment, which specifically includes the following steps:
[0048] Step 1: Scan and model the working environment of the hole inspection robot and establish a two-dimensional environmental grid map of the blasting area.
[0049] Specifically, a laser radar sensor is used to model the working environment of the borehole inspection robot, and a laser mapping algorithm Gmapping based on SLAM technology is used to establish a complete and high-precision two-dimensional environmental grid map in the blasting area. The generated environmental grid map is in pgm format. Figure 2 As shown, the states of the grid map include a black occupied state, a white idle state, and a gray unknown state. In the established environment grid map, the areas where the blast holes are located and the obstacle areas are both in a black occupied state.
[0050] Step 2: Figure 3 As shown, the starting point of the hole inspection robot in the two-dimensional environmental grid map of the blasting area and all the blasthole positions are determined, and the order of blasthole inspection is determined according to the blasthole sorting rules.
[0051] When planning the path according to the position of the blastholes, the hole sorting rules are as follows: 1. The x-axis coordinates are in descending or ascending order; 2. The y-axis coordinates are in descending or ascending order; 3. The sum of x+y is in descending or ascending order; 4. The "Z" line is obtained; 5. The distance between two adjacent holes is the smallest; 6. When the distance between two adjacent holes is too large, it means that the direction needs to be changed and the path needs to be adjusted.
[0052] Step 3: Use the improved A* search algorithm to gradually search the paths between adjacent blastholes in the order of blasthole inspection from the starting point of the two-dimensional environmental grid map of the blasting area. Specifically,
[0053] (1) Create an open list and a closed list, and add the starting point of the hole inspection robot at the two-dimensional environmental grid map of the blasting area to the open list;
[0054] (2) Expand the neighboring nodes from the starting point, and continue to put the expanded new nodes into the open list. If the open list is empty, it means that the cruising path planning for the next blasthole cannot be carried out. If the open list is not empty, proceed to the next step.
[0055] The adjacent node expansion method adopts a four-directional node expansion method, expanding in four directions of the top, bottom, left, and right of the current expansion node;
[0056] (3) Calculate the cost of the new node to be expanded according to the cost function formula and the Manhattan distance calculation method, and put the expansion point with the smallest cost into the open list and into the closed list; the cost function F(n) of the node expansion is:
[0057] F(n)=G(n)+H(n)
[0058] G(n)=G(n-1)+m
[0059] H(n)=m×w(n)×(|goalpos x -n x |+|goalpos y -n y |)
[0060] In the formula, G(n) is the actual cost of the starting node to the current node n, H(n) is the estimated cost of the current node n to the target blasthole node; G(n-1) represents the actual cost between the parent node of node n and the starting point; m represents the grid spacing setting value; w(n) represents the valuation weight; goalpos x Indicates the horizontal coordinate of the target blasthole node, goalpos y Indicates the ordinate of the target blasthole node; n x Represents the horizontal coordinate of node n, n y Represents the ordinate of node n;
[0061] Among them, during the four-way expansion of adjacent child nodes, the occupied node marking method is used to replace the expansion of occupied nodes in the original A* algorithm; specifically, before creating a cost list and expanding adjacent nodes, the cost list is marked as occupied, indicating that the expanded node positions in the four adjacent directions are all occupied. If any of the currently expanded new nodes has an obstacle that is an infeasible point, the corresponding position in the cost list remains in the initial marking state and does not enter the subsequent cost calculation; if the current expansion point is a feasible point, the actual calculated cost of its parent node is stored to replace the initial cost list marking state, and at the same time, when selecting the node with the minimum cost in the open list and putting it into the closed list, the nodes in the open list that are kept in the initial marking state are not considered.
[0062] (4) Determine whether the open list contains the target blasthole posture node, which refers to the blasthole posture node adjacent to the starting point; if the target blasthole posture node is included, add the node to the closed list to perform initial path backtracking to find the cruising path, otherwise continue to select the expansion point with the smallest cost in the open list to expand the new node until the open list contains the target blasthole posture node;
[0063] (5) According to the borehole inspection sequence, the currently found target borehole posture node is used as a new starting point in turn, and the next borehole node corresponding to the new starting point in the borehole inspection sequence is used as a new target borehole posture node. Steps (2) to (3) are repeated until the cruising path between the last two boreholes in the borehole inspection sequence is found.
[0064] According to the above search results, several sections of cruise paths between adjacent blast holes are obtained, and the cruise paths between adjacent blast holes are spliced to obtain the global cruise initial path.
[0065] Step 4: Identify the turning points of the global cruise initial path, extract all the turning point information into the turning point list, optimize the turning points in the turning point list according to the turning point distribution type and the pre-node optimization process; after the turning point is optimized, update the local path where the turning point is located, and finally update the global cruise path.
[0066] (1) In the process of using the improved A* algorithm to find the borehole posture nodes, the expanded nodes will be given steering information, so all nodes in the global cruise initial path have corresponding path steering information lists. Traverse the initial path node list to determine the path turning points, that is, by judging the steering information before and after the path point, whether the point is a turning point is determined, and finally all the turning points are stored in the turning point list in the order of all the nodes in the global cruise initial path;
[0067] (2) Add the starting point and the task point to the first and last positions of the initial inflection point list, select the inflection point list and select three adjacent elements in turn to put them into the judgment list, and judge the distribution type of the three inflection points according to the inflection point distribution type; there are eight inflection point distribution types, namely:
[0068]
[0069] Where p1, p2, and p3 are the index values corresponding to the coordinates of three adjacent inflection points in each judgment cycle of the inflection point, n 0 is the number of grids in a column in the vertical direction of the environmental grid map;
[0070] like Figure 4 As shown, ①-④ in the above formula correspond to Figure 4 In Figure 4 (a) Figure 4 (b) Figure 4 (c) Figure 4 (d); ①-④ in the formula are respectively Figure 4 (a) Figure 4 (b) Figure 4 (c) Figure 4 In (d), the directions of the paths are all reversed.
[0071] (3) Pre-node optimization process:
[0072] Before performing pre-node optimization, you need to specify the grid index value first. The index value in the grid map is calculated as follows: Figure 8 As shown in the figure, a grid map of unknown state with a size of n*n, whose origin coordinate is O(0,0), and the unit length of each grid is 1. The numbers represent the center index value of the grid's lower left corner coordinate in the map. If n is 10, and the lower left corner coordinate of a grid is S(x,y), then the calculation formula for the corresponding grid index value is:
[0073] Index=x*n+y+1
[0074] (3.1) The pre-node index value is calculated by the result of the distribution type judgment; taking distribution type ① as an example, if the distribution types of the three adjacent elements in the inflection point list currently judged belong to distribution type ①; Figure 7 As shown, the index value of the pre-node is calculated by the index values corresponding to the coordinates of three adjacent inflection points, and the pre-node is the node expected to be expanded. The formula is:
[0075] p * =p3-(p2-p1)
[0076] In the formula, p * It is the index value corresponding to the pre-node.
[0077] (3.2) Obtain the pre-node index value p by calculation * Get the position of the current corresponding pre-node; determine whether there is an obstacle at the pre-node. If there is no obstacle, continue to determine whether there is an obstacle in the path between the pre-node and the corresponding turning points of p3 and p1. If there is no obstacle, it indicates that the path is feasible; then select the pre-node to replace the original turning point p2 to reduce some unnecessary turning points in the path; if there is an obstacle at the pre-node or there is an obstacle on the path where the pre-node is located, keep the original turning point unchanged.
[0078] (3.3) Perform path turning point backtracking on all the optimized turning points and update the global cruising path.
[0079] Step 5: After the inflection point optimization, the updated global cruise path is integrated with the Bezier curve to perform path trajectory smoothing optimization to obtain the final cruise path of the hole inspection robot. The general parameter formula of the Bezier curve can be expressed as:
[0080]
[0081] In the formula, j represents the order of the curve, Pi represents the control point in the curve, and t represents the control parameter of the curve;
[0082]
[0083] Specifically, the present invention simulates and analyzes the improved A* algorithm to test its effectiveness in a complex multi-obstacle environment. The simulation experiment environment is Matlab R2018b. The starting point and the end point are set in two complex scene maps of size 20x20, the obstacle ratio is 30%, the spacing setting value m is 10, and the corresponding valuation weight w(n) in the algorithm introducing the valuation weight is 3; the A* algorithm, the improved algorithm after adding turning optimization (traditional improved A* algorithm) and the improved algorithm of the present invention are experimentally verified in the above experimental environment, and the experimental data are analyzed and compared as shown in Table 1 below;
[0084] Table 1 Experimental results analysis table
[0085]
[0086] Combining the experimental charts, we can see that Figure 5 In the complex environment shown, first, Figure 5 (b) shows that the traditional improved algorithm after adding turning optimization fails to achieve inflection point optimization; secondly, Figure 5 (a) Figure 5 (b) Figure 5(c) The corresponding A* algorithm, the traditional improved A* algorithm, and the improved algorithm of this paper respectively have obvious advantages in the path planning time, the number of turning points, and the number of expansion points. On the basis of the better path, the path complexity can be further reduced, and the final path is more feasible. In addition, the path smoothing effect between the starting point and the target point path is as follows: Figure 6 As shown, the method of the present invention is applied to the path search between various blastholes by a hole inspection robot in a blasting environment, and finally a stable and low-complexity feasible path for the hole inspection robot to cruise to each blasthole can be obtained.
Claims
1. A path planning method for a hole inspection robot in a blasting environment, characterized in that: The steps include: (1) Scan and model the working environment of the borehole inspection robot and establish a two-dimensional environmental grid map of the blasting area; (2) Determine the starting point of the hole inspection robot in the two-dimensional environmental grid map of the blasting area and all the blasthole positions and postures, and determine the order of blasthole inspection according to the set blasthole sorting rules; (3) Using the improved A* search algorithm, the paths between adjacent blast holes are gradually searched in the order of blast hole inspection from the starting point of the two-dimensional environmental grid map of the blasting area, and the cruising paths between several adjacent blast holes and the steering information table corresponding to all nodes in the cruising path are obtained; the cruising paths between adjacent blast holes are spliced to obtain the global cruising initial path; (4) According to the turning information table of each cruise path, the turning point of the global cruise initial path is judged, and the turning point information is extracted in sequence into the turning point list according to the front and back order of the global cruise initial path nodes, and the starting point and the end point of the global cruise initial path are added to the first and last positions in the turning point list; according to the turning point distribution type, the distribution type of each three adjacent elements in the turning point list is judged in sequence, and the pre-node index value is calculated according to the judged distribution type to obtain the pre-node position; whether there is an obstacle at the pre-node, if there is no obstacle at the pre-node and the path nodes where the pre-node is located are all unobstructed, then the pre-node is used to replace the central element of the original three elements to complete the turning point optimization; otherwise, the original element is kept unchanged; Perform path turning point backtracking processing on all the inflection points after optimization, and update the global cruising path; the path where the pre-node is located is the path between the pre-node and the non-central element of the original three elements; The inflection point distribution type formula in step (4) is: Where p1, p2, and p3 are the index values corresponding to the coordinates of the three adjacent elements in each judgment cycle of the inflection point, n 0 is the number of grids in a column along the vertical axis in the environmental grid map; labels ①-⑧ correspond to a type of inflection point distribution respectively; The calculation formula of the pre-node index value is: p * =p3-(p2-p1) In the formula, p * is the index value corresponding to the pre-node; Also includes the steps: (5) The updated global cruising path is smoothly optimized using a Bezier curve to obtain an optimized global cruising path of the hole inspection robot; the formula of the Bezier curve is: In the formula, j represents the order of the curve, Pi represents the control point in the curve, and t represents the control parameter of the curve; The step (3) of using the improved A* search algorithm to gradually search the paths between adjacent blastholes in the order of blasthole inspection from the starting point of the two-dimensional environmental grid map of the blasting area specifically includes: (3.1) Create an open list and a closed list, and add the starting point of the hole inspection robot at the two-dimensional environmental grid map of the blasting area to the open list; (3.2) Expand the neighboring nodes from the starting point, and continue to put the newly expanded nodes into the open list; (3.3) The cost of the expanded new node is calculated according to the cost function formula and the Manhattan distance calculation method, and the expansion point with the smallest cost is put into the open list and into the closed list; the cost function F(n) of the node expansion is: F(n)=G(n)+H(n) G(n)=G(n-1)+m H(n)=m×w(n)×(|goalpos x -n x |+|goalpos y -n y |) In the formula, G(n) is the actual cost of the starting node to the current node n, H(n) is the estimated cost of the current node n to the target blasthole node; G(n-1) represents the actual cost between the parent node of node n and the starting point; m represents the grid spacing setting value; w(n) represents the valuation weight; goalpos x Indicates the horizontal coordinate of the target blasthole node, goalpos y Indicates the ordinate of the target borehole node; n x Represents the horizontal coordinate of node n, n y Represents the ordinate of node n; (3.4) Determine whether the open list contains the target blasthole posture node. If so, add the node to the closed list to perform initial path backtracking to find the cruise path. Otherwise, continue to select the expansion point with the smallest cost in the open list to expand the new node until the open list contains the target blasthole posture node; the target blasthole posture node refers to the blasthole posture node adjacent to the starting point; (3.5) According to the borehole inspection sequence, the currently found target borehole posture node is used as the new starting point, and the corresponding next borehole node in the borehole inspection sequence is used as the new target borehole posture node. Steps (3.2) to (3.4) are repeated until the cruising path between the last two boreholes in the borehole inspection sequence is found.
2. The path planning method for a hole inspection robot in a blasting environment according to claim 1 is characterized in that: In the step (3.2), the adjacent node expansion adopts a four-directional node expansion method, that is, expansion is performed in four directions of the top, bottom, left, and right of the current expansion node.
3. The path planning method for a hole inspection robot in a blasting environment according to claim 2 is characterized in that: In the step (3.3), the cost is calculated by occupying the node mark; specifically: Create a cost list, and before expanding adjacent nodes, mark all cost lists as occupied, indicating that the expanded node positions in the four adjacent directions are all occupied; if any current expansion point has an obstacle and is an infeasible point, the corresponding position in the cost list remains in the initial marking state and does not enter the subsequent cost calculation; if the current expansion point is a feasible point, the actual calculated cost will replace the initial cost list marking state, and when selecting the node with the minimum cost in the open list and putting it into the closed list, the nodes in the open list that remain in the initial marking state are not considered.
4. The path planning method for a hole inspection robot in a blasting environment according to claim 1, characterized in that: The blast hole sorting rule described in step (2) is set in descending or ascending order according to the horizontal and vertical coordinate values in the two-dimensional environmental grid map of the blasting area where the blast holes are located.
5. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of any one of the methods of claim 1 to claim 4 when executing the computer program.
6. A computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the method according to any one of claims 1 to 4.
