Non-singular assembly mode changing trajectories in the workspace for the 3-RPS parallel robot

Having non-singular assembly modes changing trajectories for the 3-RPS parallel robot is a well-known feature. The only known solution for defining such trajectory is to encircle a cusp point in the joint space. In this paper, the aspects and the characteristic surfaces are computed for each operation mode to define the uniqueness of the domains. Thus, we can easily see in the workspace that at least three assembly modes can be reached for each operation mode. To validate this property, the mathematical analysis of the determinant of the Jacobian is done. The image of these trajectories in the joint space is depicted with the curves associated with the cusp points

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace

International audienceA classification of a family of 3-revolute (3R) positining manipulators is established. This classification is based on the topology of their workspace. The workspace is characterized in a half-cross section by the singular curves. The workspace topology is defined by the number of cusps and nodes that appear on these singular curves. The design parameters space is shown to be divided into nine domains of distinct workspace topologies, in which all manipulators have similar global kinematic properties. Each separating surface is given as an explicit expression in the DH-parameters

Uniqueness domains and non singular assembly mode changing trajectories

Parallel robots admit generally several solutions to the direct kinematics problem. The aspects are associated with the maximal singularity free domains without any singular configurations. Inside these regions, some trajectories are possible between two solutions of the direct kinematic problem without meeting any type of singularity: non-singular assembly mode trajectories. An established condition for such trajectories is to have cusp points inside the joint space that must be encircled. This paper presents an approach based on the notion of uniqueness domains to explain this behaviour

A general method for the numerical computation of manipulator singularity sets

The analysis of singularities is central to the development and control of a manipulator. However, existing methods for singularity set computation still concentrate on specific classes of manipulators. The absence of general methods able to perform such computation on a large class of manipulators is problematic because it hinders the analysis of unconventional manipulators and the development of new robot topologies. The purpose of this paper is to provide such a method for nonredundant mechanisms with algebraic lower pairs and designated input and output speeds. We formulate systems of equations that describe the whole singularity set and each one of the singularity types independently, and show how to compute the configurations in each type using a numerical technique based on linear relaxations. The method can be used to analyze manipulators with arbitrary geometry, and it isolates the singularities with the desired accuracy. We illustrate the formulation of the conditions and their numerical solution with examples, and use 3-D projections to visualize the complex partitions of the configuration space induced by the singularities.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness under contract DPI2010-18449, and by a Juan de la Cierva contract supporting the fourth author.Peer Reviewe

Robots, computer algebra and eight connected components

Answering connectivity queries in semi-algebraic sets is a long-standing and challenging computational issue with applications in robotics, in particular for the analysis of kinematic singularities. One task there is to compute the number of connected components of the complementary of the singularities of the kinematic map. Another task is to design a continuous path joining two given points lying in the same connected component of such a set. In this paper, we push forward the current capabilities of computer algebra to obtain computer-aided proofs of the analysis of the kinematic singularities of various robots used in industry. We first show how to combine mathematical reasoning with easy symbolic computations to study the kinematic singularities of an infinite family (depending on paramaters) modelled by the UR-series produced by the company ``Universal Robots''. Next, we compute roadmaps (which are curves used to answer connectivity queries) for this family of robots. We design an algorithm for ``solving'' positive dimensional polynomial system depending on parameters. The meaning of solving here means partitioning the parameter's space into semi-algebraic components over which the number of connected components of the semi-algebraic set defined by the input system is invariant. Practical experiments confirm our computer-aided proof and show that such an algorithm can already be used to analyze the kinematic singularities of the UR-series family. The number of connected components of the complementary of the kinematic singularities of generic robots in this family is $8$