A robot arm execution path planning method for complex space measurement tasks
By building a spatial compression model and optimizing path planning using reinforcement learning, the problem of low efficiency and poor quality of path planning in complex spaces is solved, and efficient and smooth path planning is achieved.
Patent Information
- Application Number
- CN202411166504.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-23
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-08-23
AI Technical Summary
Existing robotic arm path planning methods are inefficient and poor path quality in complex spaces, especially in high-dimensional spaces with high computational costs, uneven sampling and unsmooth paths.
By building a spatial compression model, eliminating invalid space, and using iterative step length to build a tree-shaped topology network of adjacent nodes, combining reinforcement learning and higher-order curve fitting, optimizing path planning, reducing computational volume and improving path smoothness.
It improves the efficiency and quality of path planning, reduces the complexity and calculation of path search, quickly finds the solution area, realizes the smoothing of paths and the optimization of turning angles, and solves the problems of uneven sampling and low efficiency.
Smart Images

Figure CN118682780B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of robot arm path planning, and in particular to a robot arm execution path planning method for complex space measurement tasks. Background Art
[0002] In the field of robotic arm path planning, mastering efficient and reliable motion planning is the cornerstone and prerequisite for multi-degree-of-freedom robots to achieve motion intelligence. It is crucial for industrial manufacturing defect detection, agricultural harvestable crop surveys, drone bridge structure inspections, minimally invasive surgery planning, and robotic micromanipulation.
[0003] The existing technical motion planning methods mainly include: graph search method, intelligent optimization method, and sampling-based planning method. The graph search method is a method that uses an efficient search framework to traverse the workspace and find the optimal solution. It is suitable for two-dimensional space optimization, but its performance depends on the selected resolution, and the computational cost increases exponentially in high-dimensional space; the intelligent optimization method is based on learning and uses machine learning technology to solve optimization problems. It is suitable for path planning in unknown environments, but there are problems such as slow convergence and large memory requirements; the sampling-based planning method is suitable for high-degree-of-freedom problems, but there are problems such as blindness, uneven sampling, and uneven paths.
[0004] Therefore, there is an urgent need for a robot arm execution path planning method for complex space measurement tasks to improve the efficiency of robot arm path planning and improve the path quality. Summary of the invention
[0005] In order to solve the above technical problems, the present invention provides a method for robot arm execution path planning for complex space measurement tasks, which can improve the efficiency of robot arm path planning and improve the path quality.
[0006] The present invention provides a method for executing a path planning of a manipulator for a measurement task in a complex space, comprising the following steps:
[0007] S1. Determine the measurement space of the robot arm ;
[0008] S2, determine the starting point and target point of the robot path;
[0009] S3, determining the measurement space by collision algorithm Obstacle space and free space ;
[0010] Determine the proportion of obstacle space in the measurement space;
[0011] The calculation formula of the ratio is: , ;
[0012] S4, constructing a space compression model, compressing the measurement space, and eliminating invalid space in the measurement space;
[0013] Wherein, S4 specifically includes: when λ>0.5, constructing a first model to compress the measurement space;
[0014] When λ≤0.5, a hyperellipsoid model is constructed to compress the measurement space;
[0015] S5, in the compressed measurement space Within, through the preset iteration step, a tree-shaped connection topology network of adjacent nodes is constructed to find candidate paths connecting the starting point and the target point;
[0016] S6. Establish a reinforcement learning driven model for the candidate path data set, and use the objective equation of the shortest path or the shortest time to find the required path;
[0017] S7, performing high-order curve fitting on the demand path to achieve smoothing of the demand path and obtain a final path;
[0018] S8, performing discretization processing according to the final path obtained in step S7, using an inverse kinematics algorithm to solve and calculate the joint angles of the robotic arm, determining the angles of each joint of the robotic arm, and obtaining the joint paths of each joint moving in space;
[0019] S9. Calculate whether there is interference between the paths of each joint and the obstacle space. If so, adjust the parameters of the space compression model and return to S4 to re-execute. If not, complete the path control of the robot from the starting point to the target point based on the joint paths of each joint moving in space obtained in S8.
[0020] Furthermore, the first model is:
[0021] ;
[0022] Among them, k1 is the boundary value of the measurement space, k1=max -min ; k2, k3, k4, k5, k6 are constants related to the starting point and the target point; is a random number that conforms to uniform distribution; is the compression factor, ,in, is a constant.
[0023] Furthermore, the super ellipsoid model is:
[0024] ;
[0025] Where a0 is the major axis, , x i As the starting point, x g is the target point; a1 is the central axis, ; a2 is the short axis, , c(t) is the path length obtained last time; (x0, y0, z0) is the starting point coordinates.
[0026] Furthermore, the S5 is characterized by comprising:
[0027] S51, preset iteration step , that is, the distance of each expanded node during the search process is ;
[0028] S52, starting from the starting point, initializing the first node;
[0029] S53, according to the preset iteration step , explore new nodes around the current node;
[0030] S54, connecting the new node to the current node to construct a tree-shaped connection topology network of adjacent nodes.
[0031] Furthermore, the S51 is characterized in that it further comprises:
[0032] Preset Threshold , indicating that the distance between the new node and the target point is less than or equal to the threshold When , it is considered to have reached the target point and no longer executes the loop step; the search range is the compressed measurement space .
[0033] Furthermore, the S53 specifically includes:
[0034] S531, assuming the current node is x n (t);
[0035] S532, respectively calculate the relationship between all nodes in the adjacent node tree connection topology network and the current node x n (t) and select the node with the closest distance as the nearest point x f (t), by x f (t) Extend the new node backward;
[0036] S533, determine the new node x by calculation n (t+1), the formula is:
[0037] ;
[0038] Among them, x r(t) is the pre-selected point that may become the next node;
[0039] S534, repeat the above steps to determine the new node x n (t+1) Whether the distance to the target point is less than the threshold If yes, stop repeating; if no, continue to execute steps S431~S434.
[0040] Furthermore, the S7 specifically includes:
[0041] S71. Select the type and order of the high-order curve according to the complexity, curvature change, and smoothness requirements of the required path;
[0042] S72, using key points or nodes of the demand path as control points for high-order curve fitting;
[0043] S73. Using the selected type and order of the high-order curve and the control points, high-order curve fitting is performed to generate a curve representing a smoothed path of the demand path, which is the final path.
[0044] Furthermore, the S8 specifically includes:
[0045] S81, initializing structural parameters of the robot arm, the structural parameters including: connecting rod length, connecting rod twist, connecting rod offset and joint angle;
[0046] S82, discretizing the final path into a discrete point sequence, and using the discrete point sequence as the path points of the robot arm movement;
[0047] S83, according to the mechanical arm structural parameters and the path points, using the inverse kinematics algorithm to calculate the angle value that each joint of the mechanical arm corresponding to each path point needs to reach;
[0048] S84. Based on the result of the inverse kinematics algorithm, a trajectory of the angle of each joint of the robotic arm changing with time is generated, which is the movement process of the robotic arm from the starting position to the target position.
[0049] The embodiments of the present invention have the following technical effects:
[0050] 1. By constructing and applying a spatial compression model, invalid space is removed and the search for invalid space is simplified, the complexity and amount of calculation of path search are effectively reduced, and the efficiency of path planning is improved.
[0051] 2. Through the preset iteration step, a tree-shaped connection topology network of adjacent nodes is constructed, and the sampling planning method guided by the target point is used to accelerate the convergence speed. The solution area can be quickly found in the compressed measurement space, thereby solving the uneven sampling and improving the efficiency of path planning.
[0052] 3. By introducing reinforcement learning methods, traversing the solution domain to achieve local adjustment of the path, and complementing the path planning method, while accelerating the convergence speed, find the optimal or suboptimal solution of the path to meet the needs.
[0053] 4. Combined with Bezier curve fitting, the path turning corners are smoothed, so that the output path is smooth and has fewer turning points. BRIEF DESCRIPTION OF THE DRAWINGS
[0054] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0055] Figure 1 It is a flow chart of a method for executing a path planning of a manipulator for a complex space measurement task provided by an embodiment of the present invention;
[0056] Figure 2 is a schematic diagram of a path smoothing geometric relationship provided by an embodiment of the present invention;
[0057] Figure 3 A robot measurement system is provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0058] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be described clearly and completely below. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work belong to the scope of protection of the present invention.
[0059] Figure 1 1 is a flow chart of a method for executing a path planning of a manipulator for a complex space measurement task provided by an embodiment of the present invention. Figure 1 , including:
[0060] S1. Determine the measurement space of the robot arm ;
[0061] Optionally, use 3D laser point cloud scanning technology to obtain multi-dimensional information of the measurement environment, restore the measurement scene based on the 3D reconstruction algorithm, and determine the measurement space of the robot arm. , passed to the control end for path planning of the measurement task.
[0062] S2, determine the starting point and target point of the robot path;
[0063] Specifically, the initial position of the robot arm in the measurement space at which it starts to perform the task and the final position it needs to reach to perform the task are determined according to specific task requirements.
[0064] S3, determining the measurement space by collision algorithm Obstacle space and free space ;
[0065] Determine the proportion of obstacle space in the measurement space;
[0066] The calculation formula of the ratio is: , ;
[0067] The ratio of the obstacle space to the measurement space , which measures the complexity of the measurement space and its impact on the difficulty of planning the path.
[0068] S4, constructing a space compression model, compressing the measurement space, and eliminating invalid space in the measurement space;
[0069] Wherein, S4 specifically includes: when λ>0.5, constructing a first model to compress the measurement space;
[0070] When λ≤0.5, a hyperellipsoid model is constructed to compress the measurement space.
[0071] Inappropriate compression space will hinder the path finding and evolve the problem into a more complex narrow space path search. Therefore, by setting a threshold for the complexity of the measurement space, the space compression model is constructed in two cases, and the corresponding space compression model is selected for space compression according to different measurement spaces; when λ>0.5, it means that the measurement space is not only full of intricate three-dimensional structures, but also interspersed with narrow and obstacle-filled channel environments. The first model is selected to compress the space; when λ≤0.5, it means that the measurement space has a low obstacle density, and the hyperellipsoid model is selected to compress the space.
[0072] Furthermore, the first model is:
[0073] ;
[0074] Among them, k1 is the boundary value of the measurement space, k1=max -min ; k2, k3, k4, k5, k6 are constants related to the starting point and the target point; is a random number that conforms to uniform distribution; is the compression factor, ,in, is a constant.
[0075] Furthermore, the super ellipsoid model is:
[0076] ;
[0077] Where a0 is the major axis, , x i As the starting point, x g is the target point; a1 is the central axis, ; a2 is the short axis, , c(t) is the final path length obtained last time; (x0, y0, z0) is the starting point coordinates;
[0078] Specifically, when using the hyperellipsoid model to achieve space compression, the lengths of the major axis (a0), median axis (a1), and minor axis (a2) of the ellipsoid are not fixed, but are dynamically adjusted based on the path length c(t) obtained last time. This adjustment ensures that the search space can be gradually reduced as the search process proceeds, thereby improving search efficiency.
[0079] The implementation method of space compression using the hyperellipsoid model is as follows:
[0080] Ellipsoid adjustment based on path length: Through the iterative cycle, each iteration updates the axis length parameter of the ellipsoid according to the path length obtained in the previous iteration. When the path length decreases, it means that there is a better path in the search space, so the ellipsoid will shrink its range accordingly to more closely surround the potential optimal path.
[0081] ;
[0082] in, , For the initial path that satisfies the environmental constraints and task constraints, x j and x j+1 are two adjacent points on the initial path, θ is a joint angle of the robot, and n is the number of joints, that is, the degree of freedom of the robot.
[0083] By projecting the hyperellipsoid model expression in three-dimensional space onto the xy plane, we can get the expression in two-dimensional space. This projection not only simplifies the problem, but also makes it possible to perform path search on the two-dimensional plane. At the same time, projection can further limit the scope of the search space and achieve space compression.
[0084] In order to make the super ellipsoid cover the starting and ending positions and adapt to the search requirements in a high-dimensional environment, the position and posture of the ellipsoid are adjusted through rotation and translation operations during the execution of the algorithm. These operations enable the super ellipsoid to adapt to changes in the search space more flexibly and further improve the search efficiency.
[0085] Optionally, if the rotation axis and rotation angle are known, the rotation matrix can be obtained by Rodrigues's Formula:
[0086] ;
[0087] in , u and v represent the vectors from the origin of the coordinate axis to the center point and starting point of the ellipsoid, respectively. .
[0088] S5, in the compressed measurement space In the example, a tree-shaped topological network of adjacent nodes is constructed through a preset iteration step to find candidate paths connecting the starting point and the target point. All candidate paths are used to form a candidate path data set, including:
[0089] S51, preset iteration step , that is, the distance of each expanded node during the search process is ;
[0090] Also includes: Preset Thresholds , indicating that the distance between the new node and the target point is less than or equal to the threshold When , it is considered to have reached the target point and no longer executes the loop step; the search range is the compressed measurement space .
[0091] S52, starting from the starting point, initializing the first node;
[0092] S53, according to the preset iteration step , explore new nodes around the current node, including:
[0093] S531, assuming the current node is x n (t);
[0094] S532, respectively calculate the relationship between all nodes and random points x in the adjacent node tree connection topology network n (t) and select the node with the closest distance as the nearest point x f (t), by x f (t) Extend the new node backward;
[0095] S533, determine the new node x by calculation n (t+1), the formula is:
[0096] ;
[0097] Among them, x r (t) is the pre-selected point that may become the next node;
[0098] S534, repeat the above steps to determine the new node x n (t+1) Whether the distance to the target point is less than the threshold If yes, stop repeating; if no, continue to execute steps S431~S434.
[0099] S54, connecting the new node to the current node to construct a tree-shaped connection topology network of adjacent nodes.
[0100] S6. Establish a reinforcement learning driven model for the candidate path data set, and use the objective equations of shortest path and shortest time to find the required path;
[0101] Preferably, when selecting a reinforcement learning algorithm, a Q-learning reinforcement learning method can be used to find the required path in the candidate paths, specifically including:
[0102] S61, initialize the Q table and set the number of iterations;
[0103] S62. Determine the environment and state of the intelligent agent:
[0104] S63, select an action, according to the ε-greedy strategy, select an action a in the current state s;
[0105] S64. Design a reward function so that the agent tends to choose the path with the shortest path or the shortest time. The reward function can be set to the negative value of the path length or the negative value of the time consumption, so that the agent minimizes these indicators during the learning process.
[0106] S65, execute the action and observe the reward, execute the selected action a, and observe the reward R and new state s' returned by the environment;
[0107] S66. Use the Q-learning update formula to update the Q value in the Q table. The Q-learning update formula is: , where Q(s,a) represents the Q value of taking action a in state s, α is the learning rate, and R is the observed reward. is the discount factor, s' is the next state, and a' is the optimal action in the next state;
[0108] S67, update the state to the new state s', and repeat steps S53 to S55 until the number of iterations is reached.
[0109] S7, performing high-order curve fitting on the demand path to achieve smoothing of the demand path and obtain a final path, specifically including:
[0110] S71. Selecting an appropriate type and order of a high-order curve according to the complexity, curvature change, and smoothness requirements of the required path;
[0111] S72, using key points or nodes of the demand path as control points for high-order curve fitting;
[0112] S73. Using the selected type and order of the high-order curve and the control points, high-order curve fitting is performed to generate a curve representing a smoothed path of the demand path, which is the final path.
[0113] Preferably, the demand path is fitted using a Bezier curve to achieve smoothing of the demand path and obtain the final path, which specifically includes:
[0114] Through the above path planning method, a set of valid nodes from the starting point to the target point can be found in the measurement space. The path generated by connecting these nodes is composed of multiple straight line segments. After the introduction of the robot joint model, the segmented planning path needs to be further smoothed to meet the rotation angle constraint of the robot in the polar coordinate system. The curve fitting method can reduce the change of the direction and shape of the initial path, will not destroy the existing constraints, and can meet the constraints of curvature compliance.
[0115] Figure 2 is a schematic diagram of a path smoothing geometric relationship provided by an embodiment of the present invention, such as Figure 2 As shown, given points P0, P1, ..., , its Bezier curve formula is:
[0116] ;
[0117] is a parameter whose value varies between 0 and 1 and is used to determine the position on the curve.
[0118] exist and Used to fit the curve, with control points The curvature of the design path is expressed as:
[0119] ;
[0120] The smoothed equations (straight lines and curves, characterized by time as the independent variable) are divided into two linear combinations: spatial straight lines and fitting curves. Referring to the expression of the parametric equation of a two-dimensional plane straight line, the spatial straight line can be expressed as:
[0121] ;
[0122] Where (x0, y0, z0) represents the starting point of the space segment in the coordinate system. is the distance from one end of the line segment to the other end, Indicates the angle between the straight line and the x-axis in the xy coordinate system, in degrees. It represents the ratio of the projection of a line on the z-axis to the projection of the line on the xy plane.
[0123] S8, discretizing the final path obtained in step S7, using inverse kinematics to calculate the joint angles of the robot arm, determining the angles of each joint of the robot arm, and finally obtaining the joint trajectory of the joint moving in space, and obtaining the joint path of each joint moving in space. Specifically including:
[0124] S81, initializing structural parameters of the robot arm, the structural parameters including: connecting rod length, connecting rod twist, connecting rod offset and joint angle;
[0125] S82, discretizing the final path into a discrete point sequence, and using the discrete point sequence as the path points for the robot arm movement.
[0126] S83, according to the mechanical arm structural parameters and the path points, using the inverse kinematics algorithm to calculate the angle value that each joint of the mechanical arm corresponding to each path point needs to reach;
[0127] The relative position and posture relationship between the robot and other multi-link mechanisms is described by the MD-H method, namely the Modified Denavit-Hartenberg method. These transformation matrices are calculated based on the MD-H parameters, which include link length, link twist, link offset and joint angle. By combining these transformation matrices, the total transformation matrix from the base coordinate system to the end effector coordinate system can be obtained, thereby describing the overall position and posture of the robot at a given joint angle.
[0128] S84. Based on the result of the inverse kinematics solution, a trajectory of the angles of each joint of the robot arm changing with time is generated, which is the movement process of the robot arm from the starting point to the target.
[0129] S9. Calculate whether there is interference between the paths of each joint and the obstacle space. If so, adjust the parameters of the space compression model and return to S4 to re-execute. If not, complete the path control of the robot from the starting point to the target point based on the joint paths of each joint moving in space obtained in S8.
[0130] Specifically, it calculates whether there is interference between each joint path and the obstacle space. The calculation method is as follows:
[0131] Any two adjacent points on the joint path are represented as q1, q2, and obstacles are represented by a box envelope [cx min ,cx max ,cy min ,cy max ](boundary value) to perform collision detection, that is, to determine the intersection of lines and surfaces; by discretizing the joint path, each point on the path is detected to determine the interference between the joint path and the obstacle.
[0132] The parameter sigma is used to represent the discretized step; according to the parameter sigma, the detection point q is calculated, and its position can be expressed as q=singma×q1+(1-singma)×q2;
[0133] Determine whether point q is in the obstacle space: determine the coordinates of q, q (q x ,q y ,q z ); Set m as the safety distance, which is used to determine whether there is enough distance between the joint path and the obstacle to avoid collision, that is, it is considered that there is interference between the two within this distance.
[0134] If p x >=cx min And p x <=cx max +u and p y >=cy min And p y <=cy max +u and p z >=cz min And p z <=cz max +u), where u represents the safety distance, then it is judged that there is interference between each joint path and the obstacle space, otherwise it is judged that there is no interference between each joint path and the obstacle space.
[0135] In order to illustrate the application advantages of the path planning method provided by the present invention, a robot measurement system is designed. Figure 3 As shown in the figure, the robot measurement system consists of a measurement robot, an obstacle environment controller, a target ball and a laser tracker. The effective working radius of the selected robot is 815 mm, and its joint range can rotate ±360 degrees. The obstacle environment is composed of multiple rectangles, and the laser tracker is a FARO Vantage laser tracker. The experimental process is as follows: a simulation environment is built in MATLAB, and a scale model copy is constructed according to the map setting of the measurement space for precise measurement. The measurement results are shown in Table 1:
[0136] Table 1 Measurement results
[0137]
[0138] By introducing the first model and the hyperellipsoid model, the measurement space of path planning is re-divided, which reduces the blindness of sampling search and improves the consistency of path planning solutions, and the standard deviation of path quality is improved by 59.63%. n The formula of (t+1) provides a sampling method for re-given new path points, improves the goal orientation, and reduces the average length of the planned path by 29.59% and the sampling points by 88.36% compared with the traditional RRT. It can be seen that the path planning method provided by the present invention solves the problems of blindness, low efficiency and poor consistency of solution of the path search of the robot arm in a complex environment.
[0139] It should be noted that the terms used in the present invention are only for describing specific embodiments, rather than limiting the scope of the present application. As shown in the present specification, unless the context clearly indicates an exception, the words "one", "a", "a kind of" and / or "the" do not specifically refer to the singular, but may also include the plural. The terms "include", "comprise" or any other variant thereof are intended to cover non-exclusive inclusion, so that the process, method or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method or device. In the absence of more restrictions, the elements defined by the sentence "include one..." do not exclude the presence of other identical elements in the process, method or device including the elements.
[0140] It should also be noted that the terms "center", "up", "down", "left", "right", "vertical", "horizontal", "inside", "outside", 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 a limitation on the present invention. Unless otherwise clearly specified and limited, the terms "installed", "connected", "connected", etc. 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 an indirect connection through an intermediate medium, or it can be a connection between the two elements. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0141] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the technical solutions of the embodiments of the present invention.
Claims
1. A method for executing a path planning of a manipulator for a complex space measurement task, characterized in that: The steps include: S1. Determine the measurement space of the robot arm ; S2, determine the starting point and target point of the robot path; S3, determining the measurement space by collision algorithm Obstacle space and free space ; Determine the proportion of obstacle space in the measurement space; The calculation formula of the ratio is: , ; S4, constructing a space compression model, compressing the measurement space, and eliminating invalid space in the measurement space; Wherein, S4 specifically includes: when λ>0.5, constructing a first model to compress the measurement space; When λ≤0.5, a hyperellipsoid model is constructed to compress the measurement space; The first model is: ; Among them, k1 is the boundary value of the measurement space, k1=max -min ; k2, k3, k4, k5, k6 are constants related to the starting point and the target point; is a random number that conforms to uniform distribution; is the compression factor, ,in, is a constant; The hyperellipsoid model is: ; Where a0 is the major axis, , x i As the starting point, x g is the target point; a1 is the central axis, ; a2 is the short axis, , c(t) is the path length obtained last time, (x0, y0, z0) is the starting point coordinates; S5, in the compressed measurement space Within, through the preset iteration step, a tree-shaped connection topology network of adjacent nodes is constructed to find candidate paths connecting the starting point and the target point, and all candidate paths constitute a candidate path data set; S6. Establish a reinforcement learning driven model for the candidate path data set, and use the objective equations of shortest path and shortest time to find the required path; S7, performing high-order curve fitting on the demand path to achieve smoothing of the demand path and obtain a final path; S8, performing discretization processing according to the final path obtained in step S7, using the inverse kinematics algorithm to solve and calculate the joint angles of the robotic arm, determining the angles of each joint of the robotic arm, and obtaining the joint paths of each joint moving in space; S9. Calculate whether there is interference between the paths of each joint and the obstacle space. If so, adjust the parameters of the space compression model and return to S4 to re-execute. If not, complete the path control of the robot from the starting point to the target point based on the joint paths of each joint moving in space obtained in S8.
2. The method for executing a path planning of a manipulator for a complex space measurement task according to claim 1, characterized in that: The S5 specifically includes: S51, preset iteration step , that is, the distance of each expanded node during the search process is ; S52, starting from the starting point, initializing the first node; S53, according to the preset iteration step , explore new nodes around the current node; S54, connecting the new node to the current node to construct a tree-shaped connection topology network of adjacent nodes.
3. The method for executing a path planning of a manipulator for a complex space measurement task according to claim 2, characterized in that: The S51 further includes: Preset Threshold , indicating that the distance between the new node and the target point is less than or equal to the threshold When , it is considered to have reached the target point and no longer executes the loop step; the search range is the compressed measurement space .
4. The method for executing a path planning of a manipulator for a complex space measurement task according to claim 2, characterized in that: The S53 specifically includes: S531, assuming the current node is x n (t); S532, respectively calculate the relationship between all nodes in the adjacent node tree connection topology network and the current node x n (t) and select the node with the closest distance as the nearest point x f (t), by x f (t) Extend the new node backward; S533, determine the new node x by calculation n (t+1), the formula is: ; Among them, x r (t) is the pre-selected point that may become the next node; S534, repeat the above steps to determine the new node x n (t+1) Whether the distance to the target point is less than the threshold If yes, stop repeating; if no, continue to execute steps S431~S434.
5. The method for executing a path planning of a manipulator for a complex space measurement task according to claim 1, characterized in that: The S7 comprises: S71. Select the type and order of the high-order curve according to the complexity, curvature change, and smoothness requirements of the required path; S72, using key points or nodes of the demand path as control points for high-order curve fitting; S73. Using the selected type and order of the high-order curve and the control points, high-order curve fitting is performed to generate a curve representing a smoothed path of the demand path, which is the final path.
6. The method for executing a path planning of a manipulator for a complex space measurement task according to claim 1, characterized in that: The S8 comprises: S81, initializing structural parameters of the robot arm, the structural parameters including: connecting rod length, connecting rod twist, connecting rod offset and joint angle; S82, discretizing the final path into a discrete point sequence, and using the discrete point sequence as the path points of the robot arm movement; S83, according to the mechanical arm structural parameters and the path points, using the inverse kinematics algorithm to calculate the angle value that each joint of the mechanical arm corresponding to each path point needs to reach; S84. Based on the result of the inverse kinematics algorithm, a trajectory of the angles of each joint of the robotic arm changing with time is generated, which is the movement process of the robotic arm from the starting point to the target position.
