Time optimal motion control will only find industrial applications if the optimal motions can actually be performed by standard industrial robots. This is not ensured by any optimal motion planning scheme proposed up to now. The limiting aspect rendering all these schemes impractical is the insufficient continuity of the motion trajectories. In this paper, time optimal path following along a predefined end-effector path is addressed for kinematically redundant robots, where non-redundant robots are included as special cases. As prerequisite explicit expressions for the higher-order inverse kinematics are presented. Kinematic redundancy is resolved and exploited within the trajectory planning using the joint space decomposition and a novel pseudoinverse-based solution of the higher-order inverse kinematics. The approaches are demonstrated for two examples of kinematically redundant manipulators performing time-optimal motions along prescribed end-effector paths in compliance with technological constraints. The optimization results are experimentally validated.

After three decades of computational multibody system (MBS) dynamics, current research is centered at the development of compact and user-friendly yet computationally efficient formulations for the analysis of complex MBS. The key to this is a holistic geometric approach to the kinematics modeling observing that the general motion of rigid bodies and the relative motion due to technical joints are screw motions. Moreover, screw theory provides the geometric setting and Lie group theory the analytic foundation for an intuitive and compact MBS modeling. The inherent frame invariance of this modeling approach gives rise to very efficient recursive \(O ( n ) \) algorithms, for which the so-called “spatial operator algebra” is one example, and allows for use of readily available geometric data. In this paper, three variants for describing the configuration of tree-topology MBS in terms of relative coordinates, that is, joint variables, are presented: the standard formulation using body-fixed joint frames, a formulation without joint frames, and a formulation without either joint or body-fixed reference frames. This allows for describing the MBS kinematics without introducing joint reference frames and therewith rendering the use of restrictive modeling convention, such as Denavit–Hartenberg parameters, redundant. Four different definitions of twists are recalled, and the corresponding recursive expressions are derived. The corresponding Jacobians and their factorization are derived. The aim of this paper is to motivate the use of Lie group modeling and to provide a review of different formulations for the kinematics of tree-topology MBS in terms of relative (joint) coordinates from the unifying perspective of screw and Lie group theory.

Screw and Lie group theory allows for user-friendly modeling of multibody systems (MBS), and at the same they give rise to computationally efficient recursive algorithms. The inherent frame invariance of such formulations allows to use arbitrary reference frames within the kinematics modeling (rather than obeying modeling conventions such as the Denavit–Hartenberg convention) and to avoid introduction of joint frames. The computational efficiency is owed to a representation of twists, accelerations, and wrenches that minimizes the computational effort. This can be directly carried over to dynamics formulations. In this paper, recursive \(O ( n ) \) Newton–Euler algorithms are derived for the four most frequently used representations of twists, and their specific features are discussed. These formulations are related to the corresponding algorithms that were presented in the literature. Two forms of MBS motion equations are derived in closed form using the Lie group formulation: the so-called Euler–Jourdain or “projection” equations, of which Kane’s equations are a special case, and the Lagrange equations. The recursive kinematics formulations are readily extended to higher orders in order to compute derivatives of the motions equations. To this end, recursive formulations for the acceleration and jerk are derived. It is briefly discussed how this can be employed for derivation of the linearized motion equations and their time derivatives. The geometric modeling allows for direct application of Lie group integration methods, which is briefly discussed.

The mobility of a linkage is determined by the constraints imposed on its members. The geometric constraints define the configuration space (c-space) variety as the geometric entity in which the finite mobility of a linkage is encoded. The aim of a local kinematic analysis of a linkage is to deduce its finite mobility, in a given configuration, from the local c-space geometry. In this paper, a method for the local analysis is presented adopting the concept of the tangent cone to a variety. The latter is an algebraic variety approximating the c-space. It allows for investigating the mobility in regular as well as singular configurations. The instantaneous mobility is determined by the constraints, rather than by the c-space geometry. Shaky and underconstrained linkages are prominent examples that exhibit a permanently higher instantaneous than finite DOF even in regular configurations. Kinematic singularities, on the other hand, are reflected in a change of the instantaneous DOF. A c-space singularity as a kinematic singularity, but a kinematic singularity may be a regular point of the c-space. The presented method allows to identify c-space singularities. It also reveals the ith-order mobility and allows for a classification of linkages as overconstrained and underconstrained. The method is applicable to general multiloop linkages with lower pairs. It is computationally simple and only involves Lie brackets (screw products) of instantaneous joint screws. The paper also summarizes the relevant kinematic phenomena of linkages.

This paper presents a new dynamic programming (DP) approach to the optimal path following problem. The method rests on an interpolation in the phase plane so that the resulting joint accelerations and joint torques are continuous. This allows for taking into account limits on the joint jerks and torque rates in addition to joint velocities, accelerations, torques, and the mechanical power. Most methods proposed in the literature yield values of optimal trajectories at discrete sampling times so that this must be interpolated subsequently to the trajectory optimization. This causes violations of the joint jerk and torque rate limits. The proposed method does not suffer from this problem, which is a main feature of this approach. Unlike most of the previously proposed methods, joint jerk and torque rate limits are addressed with a reasonable increase in the computation time of DP algorithms. Special attention is given to experimental validation of the optimization results. The presented experimental results confirm the importance of taking the motor torque characteristics as well as the Coulomb and viscous friction into account. Neglecting these effects (as most previous publications did) leads to trajectories that cannot be performed by real manipulators. Apart from DP, other approaches with smaller computation times exist. However, most of these methods are either limited to the time optimal case (which might not always be the desired criterion) and are not able to handle all earlier mentioned constraints or cannot take into account viscous friction effects. Apart from that a sequential convex programming (SCP) approach exists, which accounts for the same constraints as the presented approach. Therefore, the proposed DP approach is compared to this SCP method and an example is presented where the time optimal trajectory is performed by a real manipulator.

Parallel mechanisms are increasingly being used as modular subsystem units in various robots and man-machine interfaces for their superior stiffness, payload-to-weight ratio, and dynamic properties. This leads to series-parallel hybrid robotic systems that are challenging to model and control due to the presence of various closed loops. Most model-based kinematic and dynamic modeling tools resolve loop closure constraints numerically and hence suffer from inefficiency and accuracy issues. Additionally, they do not exploit the modularity in robot design. In this paper, we present a modular and analytical approach toward kinematic and dynamic modeling of series-parallel hybrid robots. This approach has been implemented in a software framework called hybrid robot dynamics (hyrodyn) and its application is demonstrated with the help of a series-parallel hybrid humanoid robot recently developed at DFKI-RIC.