13 research outputs found
An Automated Conversion Between Selected Robot Kinematic Representations
This paper presents a methodology that forms an automated tool for robot
kinematic representation conversion, called the RobKin Interpreter. It is a set
of analytical algorithms that can analyze an input robot representation,
express the joints globally in matrix form, and map to other representations
such as standard Denavit-Hartenberg parameters, Roll-Pitch-Yaw angles with
translational displacement, and Product of Exponentials with a possibility to
generate a URDF (Universal Robot Description Format) file from any of them. It
works for revolute and prismatic joints and can interpret even arbitrary
kinematic structures that do not have orthogonally placed joints
Multirepresentations and multiconstraints approach to the numerical synthesis of serial kinematic structures of manipulators
This paper presents a set of algorithms for the synthesis of kinematic structures of serial manipulators using multiple constraint formulation and provides a performance comparison of different kinematic representations, the Denavit-Hartenberg notation, the Product of Exponentials (screws), and Roll-Pitch-Yaw angles with translation parameters. Synthesis is performed for five given tasks, and both revolute and prismatic joints can be synthesized. Two different non-linear programming optimization algorithms were used to support the findings. The results are compared and discussed. Data show that the choice of the constraint design method has a significant impact on the success rate of optimization convergence. The choice of representation has a lower impact on convergence, but there are differences in the optimization time and the length of the designed manipulators. Furthermore, the best results are obtained when multiple methodologies are used in combination. An arbitrary manipulator was designed and assembled based on a trajectory in the collision environment to demonstrate the advantages of the proposed methodology. The input/output data and synthesis methodology algorithms are provided through an open repository.Web of Science10689516893
Initial estimation of kinematic structure of a robotic manipulator as an input for its synthesis
Researchers often deal with the synthesis of the kinematic structure of a robotic manipulator to determine the optimal manipulator for a given task. This approach can lower the cost of the manipulator and allow it to achieve poses that might be unreachable by universal manipulators in an existing constrained environment. Numerical methods are broadly used to find the optimum design but they often require an estimated initial kinematic structure as input, especially if local-optimum-search algorithms are used. This paper presents four different algorithms for such an estimation using the standard Denavit-Hartenberg convention. Two of the algorithms are able to reach a given position and the other two can reach both position and orientation using Bezier splines approximation and vector algebra. The results are demonstrated with three chosen example poses and are evaluated by measuring manipulability and the total link length of the final kinematic structures.Web of Science118art. no. 354
Algebraic Analysis of a 3-RUU Parallel Manipulator
International audienceConstraint equations of a parallel manipulator can be used to analyze their kinematic behaviour. This paper deals with the determination of the algebraic constraint equations of a 3-RUU parallel manipulator with two approaches. The first one is based on the manipulator geometry and the second one uses the Linear Implicitization Algorithm. The obtained constraint equations through the former approach can be given a geometrical interpretation while the latter approach is less prone to missing physical constraints. Both the ideals of constraint polynomials should lead to the same variety. Furthermore, the simplest set of equations is chosen to solve the direct kinematics problem. For the manipulator under study, it turns out that its direct kinematics problem leads to a factorisable univariate polynomial and a translational operation mode appears