Numerical computation and avoidance of manipulator singularities

This thesis develops general solutions to two open problems of robot kinematics: the exhaustive computation of the singularity set of a manipulator, and the synthesis of singularity-free paths between given configurations. Obtaining proper solutions to these problems is crucial, because singularities generally pose problems to the normal operation of a robot and, thus, they should be taken into account before the actual construction of a prototype. The ability to compute the whole singularity set also provides rich information on the global motion capabilities of a manipulator. The projections onto the task and joint spaces delimit the working regions in such spaces, may inform on the various assembly modes of the manipulator, and highlight areas where control or dexterity losses can arise, among other anomalous behaviour. These projections also supply a fair view of the feasible movements of the system, but do not reveal all possible singularity-free motions. Automatic motion planners allowing to circumvent problematic singularities should thus be devised to assist the design and programming stages of a manipulator. The key role played by singular configurations has been thoroughly known for several years, but existing methods for singularity computation or avoidance still concentrate on specific classes of manipulators. The absence of methods able to tackle these problems on a sufficiently large class of manipulators is problematic because it hinders the analysis of more complex manipulators or the development of new robot topologies. A main reason for this absence has been the lack of computational tools suitable to the underlying mathematics that such problems conceal. However, recent advances in the field of numerical methods for polynomial system solving now permit to confront these issues with a very general intention in mind. The purpose of this thesis is to take advantage of this progress and to propose general robust methods for the computation and avoidance of singularities on non-redundant manipulators of arbitrary architecture. Overall, the work seeks to contribute to the general understanding on how the motions of complex multibody systems can be predicted, planned, or controlled in an efficient and reliable way.Aquesta tesi desenvolupa solucions generals per dos problemes oberts de la cinemàtica de robots: el càlcul exhaustiu del conjunt singular d'un manipulador, i la síntesi de camins lliures de singularitats entre configuracions donades. Obtenir solucions adequades per aquests problemes és crucial, ja que les singularitats plantegen problemes al funcionament normal del robot i, per tant, haurien de ser completament identificades abans de la construcció d'un prototipus. La habilitat de computar tot el conjunt singular també proporciona informació rica sobre les capacitats globals de moviment d'un manipulador. Les projeccions cap a l'espai de tasques o d'articulacions delimiten les regions de treball en aquests espais, poden informar sobre les diferents maneres de muntar el manipulador, i remarquen les àrees on poden sorgir pèrdues de control o destresa, entre d'altres comportaments anòmals. Aquestes projeccions també proporcionen una imatge fidel dels moviments factibles del sistema, però no revelen tots els possibles moviments lliures de singularitats. Planificadors de moviment automàtics que permetin evitar les singularitats problemàtiques haurien de ser ideats per tal d'assistir les etapes de disseny i programació d'un manipulador. El paper clau que juguen les configuracions singulars ha estat àmpliament conegut durant anys, però els mètodes existents pel càlcul o evitació de singularitats encara es concentren en classes específiques de manipuladors. L'absència de mètodes capaços de tractar aquests problemes en una classe suficientment gran de manipuladors és problemàtica, ja que dificulta l'anàlisi de manipuladors més complexes o el desenvolupament de noves topologies de robots. Una raó principal d'aquesta absència ha estat la manca d'eines computacionals adequades a les matemàtiques subjacents que aquests problemes amaguen. No obstant, avenços recents en el camp de mètodes numèrics per la solució de sistemes polinòmics permeten ara enfrontar-se a aquests temes amb una intenció molt general en ment. El propòsit d'aquesta tesi és aprofitar aquest progrés i proposar mètodes robustos i generals pel càlcul i evitació de singularitats per manipuladors no redundants d'arquitectura arbitrària. En global, el treball busca contribuir a la comprensió general sobre com els moviments de sistemes multicos complexos es poden predir, planificar o controlar d'una manera eficient i segur

On the determination of cusp points of 3-R\underline{P}R parallel manipulators

This paper investigates the cuspidal configurations of 3-RPR parallel manipulators that may appear on their singular surfaces in the joint space. Cusp points play an important role in the kinematic behavior of parallel manipulators since they make possible a non-singular change of assembly mode. In previous works, the cusp points were calculated in sections of the joint space by solving a 24th-degree polynomial without any proof that this polynomial was the only one that gives all solutions. The purpose of this study is to propose a rigorous methodology to determine the cusp points of 3-R\underline{P}R manipulators and to certify that all cusp points are found. This methodology uses the notion of discriminant varieties and resorts to Gr\"obner bases for the solutions of systems of equations

A modal approach to hyper-redundant manipulator kinematics

This paper presents novel and efficient kinematic modeling techniques for “hyper-redundant” robots. This approach is based on a “backbone curve” that captures the robot's macroscopic geometric features. The inverse kinematic, or “hyper-redundancy resolution,” problem reduces to determining the time varying backbone curve behavior. To efficiently solve the inverse kinematics problem, the authors introduce a “modal” approach, in which a set of intrinsic backbone curve shape functions are restricted to a modal form. The singularities of the modal approach, modal non-degeneracy conditions, and modal switching are considered. For discretely segmented morphologies, the authors introduce “fitting” algorithms that determine the actuator displacements that cause the discrete manipulator to adhere to the backbone curve. These techniques are demonstrated with planar and spatial mechanism examples. They have also been implemented on a 30 degree-of-freedom robot prototype

An algebraic method to check the singularity-free paths for parallel robots

Trajectory planning is a critical step while programming the parallel manipulators in a robotic cell. The main problem arises when there exists a singular configuration between the two poses of the end-effectors while discretizing the path with a classical approach. This paper presents an algebraic method to check the feasibility of any given trajectories in the workspace. The solutions of the polynomial equations associated with the tra-jectories are projected in the joint space using Gr{\"o}bner based elimination methods and the remaining equations are expressed in a parametric form where the articular variables are functions of time t unlike any numerical or discretization method. These formal computations allow to write the Jacobian of the manip-ulator as a function of time and to check if its determinant can vanish between two poses. Another benefit of this approach is to use a largest workspace with a more complex shape than a cube, cylinder or sphere. For the Orthoglide, a three degrees of freedom parallel robot, three different trajectories are used to illustrate this method.Comment: Appears in International Design Engineering Technical Conferences & Computers and Information in Engineering Conference , Aug 2015, Boston, United States. 201

Workspace and Singularity analysis of a Delta like family robot

Workspace and joint space analysis are essential steps in describing the task and designing the control loop of the robot, respectively. This paper presents the descriptive analysis of a family of delta-like parallel robots by using algebraic tools to induce an estimation about the complexity in representing the singularities in the workspace and the joint space. A Gr{\"o}bner based elimination is used to compute the singularities of the manipulator and a Cylindrical Algebraic Decomposition algorithm is used to study the workspace and the joint space. From these algebraic objects, we propose some certified three dimensional plotting describing the the shape of workspace and of the joint space which will help the engineers or researchers to decide the most suited configuration of the manipulator they should use for a given task. Also, the different parameters associated with the complexity of the serial and parallel singularities are tabulated, which further enhance the selection of the different configuration of the manipulator by comparing the complexity of the singularity equations.Comment: 4th IFTOMM International Symposium on Robotics and Mechatronics, Jun 2015, Poitiers, France. 201

Fast Manipulability Maximization Using Continuous-Time Trajectory Optimization

A significant challenge in manipulation motion planning is to ensure agility in the face of unpredictable changes during task execution. This requires the identification and possible modification of suitable joint-space trajectories, since the joint velocities required to achieve a specific endeffector motion vary with manipulator configuration. For a given manipulator configuration, the joint space-to-task space velocity mapping is characterized by a quantity known as the manipulability index. In contrast to previous control-based approaches, we examine the maximization of manipulability during planning as a way of achieving adaptable and safe joint space-to-task space motion mappings in various scenarios. By representing the manipulator trajectory as a continuous-time Gaussian process (GP), we are able to leverage recent advances in trajectory optimization to maximize the manipulability index during trajectory generation. Moreover, the sparsity of our chosen representation reduces the typically large computational cost associated with maximizing manipulability when additional constraints exist. Results from simulation studies and experiments with a real manipulator demonstrate increases in manipulability, while maintaining smooth trajectories with more dexterous (and therefore more agile) arm configurations.Comment: In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS'19), Macau, China, Nov. 4-8, 201

A General Numerical Method for Hyper-Redundant Manipulator Inverse Kinematics

Hyper-redundant robots have a very large or infinite degree of kinematic redundancy. A generalized resolved-rate technique for solving hyper-redundant manipulator inverse kinematics using a backbone curve is introduced. This method is applicable even in cases when explicit representation of the backbone curve intrinsic geometry cannot be written in closed form. Problems of end-effector trajectory tracking which were previously intractable can now be handled with this technique. Examples include configurations generated using the calculus of variations. The method is naturally parallelizable for fast digital and/or analog computation

Kinematically redundant robot manipulators

Research on control, design and programming of kinematically redundant robot manipulators (KRRM) is discussed. These are devices in which there are more joint space degrees of freedom than are required to achieve every position and orientation of the end-effector necessary for a given task in a given workspace. The technological developments described here deal with: kinematic programming techniques for automatically generating joint-space trajectories to execute prescribed tasks; control of redundant manipulators to optimize dynamic criteria (e.g., applications of forces and moments at the end-effector that optimally distribute the loading of actuators); and design of KRRMs to optimize functionality in congested work environments or to achieve other goals unattainable with non-redundant manipulators. Kinematic programming techniques are discussed, which show that some pseudo-inverse techniques that have been proposed for redundant manipulator control fail to achieve the goals of avoiding kinematic singularities and also generating closed joint-space paths corresponding to close paths of the end effector in the workspace. The extended Jacobian is proposed as an alternative to pseudo-inverse techniques

Dynamics of the Orthoglide parallel robot

Recursive matrix relations for kinematics and dynamics of the Orthoglide parallel robot having three concurrent prismatic actuators are established in this paper. These are arranged according to the Cartesian coordinate system with fixed orientation, which means that the actuating directions are normal to each other. Three identical legs connecting to the moving platform are located on three planes being perpendicular to each other too. Knowing the position and the translation motion of the platform, we develop the inverse kinematics problem and determine the position, velocity and acceleration of each element of the robot. Further, the principle of virtual work is used in the inverse dynamic problem. Some matrix equations offer iterative expressions and graphs for the input forces and the powers of the three actuators