For the application of parallel robots in the grinding industry, a parallel robot equipped with a constant force actuator that produces a constant force for grinding is designed. To study the characteristics of the parallel robot’s spatial positions and poses, the inverse solutions of the moving platform’s spatial positions and poses as well as the workspace where objects were ground were established by using DH parameters and geometric methods. The experimental results showed that the workspace where objects were ground was a cylinder with a cross section similar to a symmetric circular sector. To analyze the characteristics of the forces produced by the parallel robotic system, the dynamics equation was established via the Newton–Euler method to verify the rationality of the force decoupling design. Theoretical calculation combined with simulation and experimental analyses confirmed the viability of the theoretical analyses which lay a theoretical foundation for the design, manufacture and control of the parallel robotic system proposed in this paper.
An algorithm for automatically planning trajectories designed for painting large objects is proposed in this paper to eliminate the difficulty of painting large objects and ensure their surface quality. The algorithm was divided into three phases, comprising the target point acquisition phase, the trajectory planning phase, and the UR5 robot inverse solution acquisition phase. In the target point acquisition phase, the standard triangle language (STL) file, algorithm of principal component analyses (PCA), and k-dimensional tree (k-d tree) were employed to obtain the point cloud model of the car roof to be painted. Simultaneously, the point cloud data were compressed as per the requirements of the painting process. In the trajectory planning phase, combined with the maximum operating space of the UR5 robot, the painting trajectory of the target points was converted into multiple traveling salesman problem (TSP) models, and each TSP model was created with a genetic algorithm (GA). In the last phase, in conformity with the singularities of the UR5 robot’s motion space, the painting trajectory was divided into a recommended area trajectory and a non-recommended area trajectory and created by the analytical method and sequential quadratic programming (SQP). Finally, the proposed algorithm for painting large objects was deployed in a simulation experiment. Simulation results showed that the accuracy of the algorithm could meet the requirements of painting technology, and it has promising engineering practicability.
15 December 2022 in Mathematical Problems in Engineering
In industrial automation, an important task of robot system is to grasp moving objects. In order to grasp the moving target on the conveyor belt in the shortest time, this paper proposes a method of location prediction and interception grasping of the target object, and puts forward the corresponding time-optimal grasping point search algorithm. In order to reduce the motion impact of the manipulator and meet the kinematic constraints, the velocity planning curve of the normalized quintic polynomial was adopted to plan the motion of the manipulator in the joint space. In order to express the algorithm more clearly, the position-time function of the moving object and the position-time virtual function of the robot are introduced, and the time optimal grasping point appears at the intersection of the two functions. Finally, the method is verified by simulation analysis.