A spindle rotation planning method for a double-wire laying robot system on opposite sides
By performing spindle rotation planning in the double-wire laying robot system, it is decomposed into dual-robot and single-robot tasks. The dynamic programming algorithm is used to solve the problems of low spindle processing efficiency and singular points in the existing technology, and a more efficient laying process is achieved. .
Patent Information
- Application Number
- CN202210770460.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-06-30
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2042-06-30
AI Technical Summary
The existing double-wire laying robot spindle processing method is inefficient, does not fully utilize the robot performance, and fails to avoid singular points, resulting in low laying efficiency.
A spindle rotation planning method is adopted. By obtaining the silk laying trajectory, discrete path points and spindle angles, calculating the wrist point position, performing inverse kinematics solutions, decomposing it into dual robot and single robot laying tasks, using dynamic programming algorithms and target functions For the shortest total displacement time of joint changes, avoid unreachable and singular points, and plan the spindle rotation.
It improves the laying efficiency, avoids unreachable and singular points, exerts the maximum joint speed performance of the robot, and shortens the displacement time.
Smart Images

Figure CN115291566B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of automated composite material forming, and in particular to a spindle rotation planning method for a heterolateral double-wire laying robot system. Background Art
[0002] Automatic placement technology is an important means to achieve high-performance digital manufacturing of composite materials. It is also the fastest-growing advanced manufacturing technology in recent years. However, the composite material placement process faces the contradiction between low equipment placement efficiency and limited prepreg life cycle. In order to balance the complexity of manufacturing composite components and high placement productivity, dual-station placement equipment has become a hot spot in the research of modern composite product manufacturing. Therefore, it is very meaningful to carry out research on the relevant planning of dual-wire placement robots.
[0003] There are many application scenarios for the double wire laying robot. If the robot is located on both sides of the mold, it is a double wire laying robot on the opposite side. In most cases, the mold has a spindle and can perform rotational motion. For a given wire laying trajectory on the mold, the entire laying motion is completed by the spindle motion and the double wire laying robot. Therefore, when considering the entire laying process, not only the robot needs to be considered, but the spindle processing is also crucial.
[0004] The patent specification with the publication number CN110614632A discloses a multi-robot wire laying trajectory distribution design method, which groups and matches all single-layer trajectories according to the number of wire laying heads on a rotating workpiece, and adaptively corrects them, so as to achieve simultaneous laying of multiple heads and greatly improve the wire laying efficiency. In this scheme, the grouping and matching of trajectories ensures that the trajectories in the same group can be laid at the same time, for example, two trajectories laid simultaneously by two wire laying heads are a group; adaptive correction means that the number of trajectory points and the length of movement of the trajectories in the same group may be different. In order to ensure that the trajectories in the same group have the effect of synchronous wire laying, the trajectories in the group are required to start laying at the same time and end laying at the same time. For this purpose, it is necessary to make necessary trajectory point corrections to the trajectories, that is, increase or decrease the number of trajectory points.
[0005] The patent specification with publication number CN110472290A discloses a multi-robot wire-laying geodesic trajectory design method, which performs trajectory design based on the triangular discrete grid of the surface, including: taking a point on the component; taking the point as the starting point, generating geodesic trajectories to both ends respectively; taking the current trajectory as the reference trajectory, rotating the trajectory circumferentially around the axis or the center of gravity line to obtain the second, third... respectively; projecting all trajectories onto the mold surface to form a covering trajectory, and completing the geodesic wire-laying trajectory design of the rotational-body-like component; converting the trajectory into mechanical language, and controlling the wire-laying machine to complete the covering wire-laying forming of the workpiece.
[0006] At present, there are still relatively few spindle processing methods for dual-wire laying robots, and the two applications mentioned above do not have relevant designs. Generally, simple processing methods are used, such as rotating the end trajectory points of the robots on both sides to the same height, or keeping the end trajectory points of one robot at the same height as the spindle center, and using this as the spindle rotation angle. This processing method is simple to calculate and easy to implement, but it does not fully utilize the performance of the robot, nor does it avoid the robot singularity, resulting in low efficiency in the actual laying process. Summary of the invention
[0007] The purpose of the present invention is to provide a spindle rotation planning method for a double-wire laying robot system on the opposite side, which can give full play to the robot performance when performing spindle planning, avoid singular points, and improve laying efficiency.
[0008] A method for planning the main axis rotation of a double-wire laying robot system on opposite sides comprises the following steps:
[0009] Step 1: Obtain the wire laying trajectory, discretize it according to a fixed step size, and extract the path points;
[0010] Step 2: The spindle rotation angle is discretized to construct a discrete space representing the corresponding relationship between the path points and the discrete spindle angles;
[0011] Step 3: Calculate the wrist point position corresponding to each path point so that the center of the robot base and the wrist point remain collinear;
[0012] Step 4: Based on inverse kinematics calculation, obtain the principal axis discrete angle that makes the path point reachable and non-singular;
[0013] Step 5: According to the length of the laying paths on both sides, the laying task is divided into double-robot laying and single-robot laying;
[0014] Step 6: For the dual robot placement, a dynamic programming algorithm is used to plan the main axis rotation with the shortest total displacement time of joint changes as the objective function and reachability and singularity avoidance as constraints;
[0015] Step 7: For single robot placement, the goal is to minimize the displacement time of the joints of adjacent discrete points, and the constraints are reachability and singularity avoidance. The main axis angle of the current discrete point is determined by knowing the main axis angle of the previous discrete point.
[0016] Step eight, splice the spindle angle values of the two placement task plans to obtain the complete movement of the spindle during the placement process.
[0017] Preferably, the wrist point position is determined by offsetting the discrete point along the normal vector direction by the distance from the end to the wrist point. When the dual robots lay out each discrete point, the wrist point position corresponding to each point is calculated by this method. For the same discrete point, when the robot mobile base is flush with the robot wrist point, that is, the center of the robot base is always collinear with the wrist point, the adjustable angle of the robot spindle is the largest.
[0018] Preferably, the discrete space consists of two dimensions: path discreteness and principal axis angle discreteness, wherein the path discrete subspace is obtained by combining the discrete point sets of the two paths, and the two paths are discretized with equal step sizes, then the discrete point P i (i=1,2,...,n) and P i '(i=1,2,...,m), according to P1 and P1', P2 and P2', ..., P m and P m 'Order correspondence; Since the sizes of the two discrete spaces are different, the space with corresponding relationship is processed by dual robots, and the remaining discrete space is processed by single robot.
[0019] As a preferred method, the robot corresponding to the trajectory, the discrete point position of the path, the discrete angle of the main axis, and the base position are known, and the robot inverse kinematics is solved to obtain the robot joint angle q corresponding to each discrete point of the path and the discrete angle of the main axis. i (i=1,2,...,6), and exclude robot-unreachable and robot-singular positions in the discrete space.
[0020] Preferably, the dual robots move the same distance in the same time while laying their respective paths.
[0021] Preferably, when all the main axis angles corresponding to one or more discrete points in the dual-robot discrete space are marked as unreachable, the current two wire-laying trajectories cannot be laid at the same time, and two wire-laying trajectories need to be reselected.
[0022] Preferably, the dual-robot discrete space applies dynamic programming to search for the spindle angle corresponding to the minimum joint transformation time of adjacent discrete points. The objective function is to minimize the total displacement time while avoiding unreachable and singular positions, and finally obtain the spindle angle corresponding to the same discrete points on the two trajectories.
[0023] Further preferably, the dual robots can both execute at the maximum joint speed, and the time required for each joint axis to change between two adjacent discrete points is: The time required for the wire laying head to pass through adjacent discrete points is the movement time of the slowest joint among all joints T = max (T i ).
[0024] Preferably, the spindle angle calculation method corresponding to each discrete point in the discrete space of the single robot is used. When calculating from the previous discrete point to the current discrete point, the spindle angle value corresponding to the minimum movement time T of the slowest joint among the robot joints is the optimal angle, while meeting the requirements of motion reachability and obstacle avoidance.
[0025] Beneficial effects of the present invention:
[0026] First, the discrete points of the trajectory are combined with the spindle angle to establish a relationship and construct a discrete space. Then, the wrist position corresponding to each discrete point is calculated so that the robot always remains collinear with the base, and the inverse kinematics is solved. For each joint value, the unreachable and singular positions are analyzed. According to the corresponding situation of the dual-robot laying trajectory, the discrete space is decomposed into dual-robot and single-robot discrete spaces. Finally, for the two laying tasks, corresponding algorithms are introduced with different objective functions to plan the rotational motion of the spindle. In the planning process, not only the unreachable and joint singularity are avoided, but also the maximum joint speed performance of the robot can be brought into play, the displacement time in the ideal laying process is shortened as much as possible, and the efficiency is improved. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] Figure 1 A flowchart of the spindle rotation planning of a double-wire laying robot system on the opposite side according to an embodiment of the present invention;
[0028] Figure 2 A schematic diagram of extracting discrete points with fixed step length on a given trajectory according to an embodiment of the present invention;
[0029] Figure 3 This is a schematic diagram of the adjustable range of the main axis when the mobile base is aligned with the wrist point according to an embodiment of the present invention;
[0030] Figure 4 It is a schematic diagram of the adjustable range of the main axis when the mobile base is not aligned with the wrist point according to an embodiment of the present invention;
[0031] Figure 5 A schematic diagram of a planning method for aligning a mobile base with a wrist point according to an embodiment of the present invention;
[0032] Figure 6 A schematic diagram of marking unreachable and singular positions of a discrete space robot according to an embodiment of the present invention;
[0033] Figure 7 Schematic diagram of a discrete point grouping and pairing strategy on two laying tracks according to an embodiment of the present invention;
[0034] Figure 8 Schematic diagram of the discrete space of the dual robots and the single robot in an embodiment of the present invention. DETAILED DESCRIPTION
[0035] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0036] A spindle rotation planning method for a dual-wire laying robot system on opposite sides Figure 1 This application takes the application of this method to two Comau robots laying a complex profile mold revolving body as an example to illustrate, and specifically includes the following steps:
[0037] Step 1: Obtain the wire placement trajectory to be laid on the mold and assign it to the corresponding robot. Figure 2 , the wire laying trajectory extracts discrete points in sequence according to a fixed step size.
[0038] Step 2: The spindle rotation angle is discretized within the stroke according to a fixed rotation angle Δθ, which is recorded as a set of discrete angles.
[0039] θ k =θ1+(k-1)Δθ;k=1,2,...,u
[0040] Among them, u=(θ max -θ min ) / Δθ.
[0041] In step 1, each discrete point on the wire laying trajectory corresponds to the set of discrete angles, and a discrete space about the discrete points and the main axis angle is obtained.
[0042] Step 3: For the discrete points in step 1, offset along the normal vector to obtain the wrist point position. For the same discrete point, when the center of the robot's mobile base is aligned with the robot's wrist point, that is, the line connecting the wrist point and the center of the base is always perpendicular to the guide rail, the robot's wrist point can reach the maximum adjustable angle of the corresponding spindle. Figure 3 , the envelope represents the reachable range of the robot wrist when the mobile base is in the current position, the black circle represents the wrist corresponding to the current discrete point rotated 360 degrees around the main axis, and the intersection of the black circle and the envelope represents the adjustable angle range of the main axis when the wrist is reachable. n Point is the current discrete point of placement. The corresponding wrist point position is calculated through the above process. When the center of the robot's mobile base is aligned with the wrist point, the spindle rotation can be adjusted to an angle of ∠AOB. When the center of the robot's mobile base is not aligned with the wrist point, refer to Figure 4At the robot's location, the spindle can rotate at an adjustable angle of ∠COD, ∠AOB is greater than ∠COD, and it is also easy to get a rule that the farther the center of the mobile base is from the wrist point, the smaller the spindle can adjust the angle range. Therefore, when the dual robots lay out each discrete point, the base adopts a planning strategy that is flush with its wrist point, see Figure 5 .
[0043] Step 4: For the discrete space of step 2, the robot, discrete points, spindle discrete angles, and base positions corresponding to the known trajectory are solved to obtain the robot joint angle q corresponding to each path discrete point and spindle discrete angle. i (i=1,2,...,6), and exclude the robot's unreachable and robot's singular positions in the discrete space through the obtained joint angle analysis, and mark them, see Figure 6 .
[0044] It should be noted that the robot unreachable in the discrete space here means that there is no solution or the joint angle of the solution exceeds the robot joint angle limit during the inverse kinematics solution process; the robot singular position treatment here is divided into wrist singularity, joint singularity and internal singularity. However, in the specific placement process, wrist singularity mainly occurs, that is, the joint angle q5 is 0. When the joint angle q5 is close to 0, the joint performance is still relatively poor. Therefore, the singular area is defined as the joint angle q5 in the range of -5 degrees to 5 degrees.
[0045] Step 5: The two trajectories laid by the two robots are processed according to steps 2 to 4 to obtain their corresponding discrete spaces. The discrete spaces are merged to form two dimensions: path discreteness and main axis angle discreteness. The path discrete subspace is obtained by merging the discrete point sets of the two paths. The two paths are discretized with equal step lengths. Then the discrete points P on the two trajectories are i (i=1,2,...,n) and P j '(j=1,2,...,m), according to P1 and P1', P2 and P2', ..., P m and P m 'Order correspondence, see Figure 7 Since the lengths of the two laying paths are different, the number of points discretized according to the same step length is different, and the long path segment will have residual path points P i (i=m+1,...,n) does not match, which will also cause the lengths of the two discrete spaces to be different in the direction of the discrete points. The following processing is performed for this: the space with corresponding relationships is processed as a dual robot, and the remaining discrete space is processed as a single robot corresponding to the trajectory. See Figure 8 .
[0046] Specifically, when all the spindle angles corresponding to one or more discrete points in the dual robot placement task are marked as unreachable, the current two wire placement trajectories cannot be placed at the same time, and two wire placement trajectories need to be reselected and the process from step one to step five needs to be repeated.
[0047] Step 6: For the dual-robot placement task, during the placement process, each discrete point can have multiple spindle angles to choose from. Only one of the angles is selected, and the spindle angles corresponding to each discrete point are selected in turn to form an acyclic directed graph. A dynamic programming algorithm is used to search for the spindle angle corresponding to the minimum joint transformation time of adjacent discrete points. The objective function is to minimize the total displacement time of joint changes while avoiding unreachable and singular positions. The specific process is as follows:
[0048] It is known that the corresponding joint angles of two adjacent discrete points on the path are and The movement speed of the terminal wire laying head is set to v, and the discrete step length of the path points is set to L, then the movement time Δt=L / v, and the average angular velocity of the joint movement is represented by the joint displacement within a period of time.
[0049]
[0050] The maximum angular velocity allowed for each joint axis of the Comau robot is make Combining the above formula, we can get
[0051]
[0052] Among them, fv i Indicates the degree of speed utilization of the robot joint axis i.
[0053] It is necessary to give full play to the robot's speed utilization during the placement process. Assuming that the robot can execute at the maximum joint speed during the placement process, the time required for the change of each joint axis between two adjacent discrete points is
[0054]
[0055] The dual robot has a total of 12 joint axes. Combined with the evaluation of all axes, the joint axis that takes the longest time to move is used as the standard, that is, the time required for the wire laying head to pass through adjacent discrete points is the movement time of the slowest joint among all joints T = max (T i ).
[0056] Using the idea of dynamic programming, for one of the discrete points in the discrete space, there are u different spindle angles that can be matched. Excluding unreachable and singular position points, there are u1 spindle angles left, which correspond to u1 joint values. Similarly, for the previous point of the discrete point, there are u2 spindle angles and joint values. For each spindle angle value of the discrete point, there are u2 motion times T. There are n discrete point groups and n-1 adjacent discrete point arc length segments in the entire dual robot discrete space, that is, the spindle angles corresponding to n discrete points need to be selected, corresponding to n-1 different motion times T.
[0057] By applying dynamic programming, a target trajectory is searched so that the sum of the different motion times T corresponding to the spindle angle values selected at discrete points on the target trajectory is the smallest compared with other values. Thus, the spindle angles corresponding to each discrete point of the dual robots are planned.
[0058] Step seven, through the dynamic programming in step six, the spindle angle corresponding to the last discrete point of the dual robots can be determined. For the path point calculation method of the single robot placement task, when calculating from the previous discrete point to the current discrete point, the spindle angle value corresponding to the minimum movement time T of the slowest joint among the six robot joints is the optimal angle, which also meets the requirements of motion accessibility and obstacle avoidance.
[0059] Step 8: The spindle values obtained by the dual robot and single robot in step 6 and step 7 are spliced together to obtain the corresponding spindle angles of all discrete points on the two simultaneously laid trajectories, regardless of length. When the robot end moves along the trajectory, the spindle angle value corresponding to the current position can be known, thus completing the spindle rotation planning of the opposite-side dual-wire laying robot system.
[0060] Although the present invention has been described in detail with reference to the aforementioned embodiments, it is still possible for those skilled in the art to modify the technical solutions described in the aforementioned embodiments, or to make equivalent substitutions for some of the technical features therein. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A spindle rotation planning method for a double-wire laying robot system on opposite sides. The following steps are involved: Step 1: Obtain the wire laying trajectory, discretize it according to a fixed step size, and extract the path points; Step 2: The spindle rotation angle is discretized to construct a discrete space representing the corresponding relationship between the path points and the discrete spindle angles; The discrete space is composed of two dimensions: path discreteness and principal axis angle discreteness. The path discrete subspace is obtained by merging the discrete point sets of the two paths, and the two paths are discretized with equal step lengths. Then the discrete point P i (i=1,2,...,n) and P i '(i=1,2,...,m), according to P 1 and P 1 '、P 2 and P 2 ', ..., P m and P m 'Order correspondence; the space with corresponding relationship is processed by double robots, and the remaining discrete space is processed by single robot; The spindle rotation angle is discretized according to a fixed rotation angle Δθ within the stroke, which is recorded as a set of discrete angles. Each discrete point on the wire laying trajectory in step 1 corresponds to the set of discrete angles, and a discrete subspace of the spindle rotation angle is obtained. Step 3: Calculate the wrist point position corresponding to each path point so that the center of the robot base and the wrist point remain collinear; Step 4: Based on inverse kinematics calculation, obtain the principal axis discrete angle that makes the path point reachable and non-singular; Step 5: According to the length of the laying paths on both sides, the laying task is divided into double-robot laying and single-robot laying; Step 6: For the dual robot placement, a dynamic programming algorithm is used to plan the main axis rotation with the shortest total displacement time of joint changes as the objective function and reachability and singularity avoidance as constraints; Step 7: For single robot placement, the goal is to minimize the displacement time of the joints of adjacent discrete points, and the constraints are reachability and singularity avoidance. The main axis angle of the current discrete point is determined by knowing the main axis angle of the previous discrete point. Step eight, splice the spindle angle values of the two placement task plans to obtain the complete movement of the spindle during the placement process.
2. The spindle rotation planning method of the opposite-side double-fiber laying robot system according to claim 1, It is characterized in that The wrist point position is determined by offsetting the discrete point along the normal vector direction from the end to the wrist point.
3. The spindle rotation planning method of the opposite-side double-fiber laying robot system according to claim 1, It is characterized in that Given the robot corresponding to the trajectory, the discrete points on the path, the discrete angles of the main axis, and the position of the base, the inverse kinematics of the robot is solved to obtain the robot joint angle q corresponding to each discrete point on the path and the discrete angle of the main axis. i (i=1,2,...,6), and the obtained joint angles are analyzed to eliminate the robot's unreachable and singular positions in the discrete space.
4. The spindle rotation planning method of the opposite-side double-laying robot system according to claim 1, It is characterized in that When laying out their respective paths, the two robots move the same distance in the same time.
5. The spindle rotation planning method of the opposite-side double-fiber laying robot system according to claim 1, It is characterized in that When all the main axis angles corresponding to one or more discrete points in the dual robot discrete space are marked as unreachable, the current two wire laying trajectories cannot be laid at the same time, and two wire laying trajectories need to be reselected.
6. The spindle rotation planning method of the opposite-side double-laying robot system according to claim 1, It is characterized in that The dual-robot discrete space applies dynamic programming to search for the spindle angle corresponding to the minimum joint transformation time of adjacent discrete points. The objective function is to minimize the total displacement time while avoiding unreachable and singular positions, and finally obtain the spindle angle corresponding to the same discrete points on the two trajectories.
7. The spindle rotation planning method of the opposite-side double-laying robot system according to claim 1, It is characterized in that The dual robots can both execute at the maximum joint speed, and the time required for each joint axis to change between two adjacent discrete points is: The time required for the wire laying head to pass through adjacent discrete points is the movement time of the slowest joint among all joints T = max (T i ).
8. The spindle rotation planning method of the opposite-side double-laying robot system according to claim 1, It is characterized in that The spindle angle calculation method corresponding to each discrete point in the discrete space of a single robot is used to calculate the optimal spindle angle value when calculating the distance from the previous discrete point to the current discrete point, so that the movement time T of the slowest joint in the robot joints is minimized, while meeting the requirements of motion reachability and obstacle avoidance.
Citation Information
Patent Citations
Multi-robot fiber placement geodesic line track design method
CN110472290A
Multi-robot wire laying track distribution design method
CN110614632A
Method for digital control processing of arc-shaped end teeth based on calibration of machining accuracy indexes
CN101733482A
Cutter path generating method for double blade head processing of turbine long blade profile
CN102096391A
Double head placement post-processing method
CN108375956A
