Open Access
This article is

- freely available
- re-usable

*Robotics*
**2019**,
*8*(4),
98;
https://doi.org/10.3390/robotics8040098

Article

Efficient Closed-Form Task Space Manipulability for a 7-DOF Serial Robot

Chair of Automatic Control Engineering (LSR), Department of Electrical and Computer Engineering, Technical University of Munich (TUM), 80333 Munich, Germany

^{*}

Author to whom correspondence should be addressed.

Received: 29 September 2019 / Accepted: 23 November 2019 / Published: 26 November 2019

## Abstract

**:**

With the increasing demand for robots to react and adapt to unforeseen events, it is essential that a robot preserves agility at all times. While manipulability is a common measure to quantify agility at a given joint configuration, an efficient direct evaluation in task space is usually not possible with conventional methods, especially for redundant robots with an infinite number of Inverse Kinematic solutions. Yet, this is essential for global online optimization of a robot posture. In this work, we derive analytical expressions for a conventional 7-degrees of freedom (7-DOF) serial robot structure, which enable the direct evaluation of manipulability from a reduced task space parametrization. The resulting expressions allow array operation and thus achieve very high computational efficiency with vector-optimized programming languages. This direct and simultaneous calculation of the task space manipulability for large numbers of poses benefits many optimization problems in robotic applications. We show applications in global optimization of robot mounting poses, as well as redundancy resolution with global online optimization w.r.t. manipulability.

Keywords:

manipulability; inverse kinematics function; kinematic optimization; redundant robot; 7-DOF; redundancy resolution## 1. Introduction

It is a common requirement in robotic manipulation tasks to quantify the capabilities of a robot at a given pose. Having such a scalar measure allows comparison of different kinematic configurations in terms of the chosen metric, and can be considered at a path planning as well as at a control level. While these measures are usually defined in terms of a given joint configuration [1,2,3,4,5], the task of the robot is typically not given in this joint space. For a general robot the task space is usually defined in SE(3), i.e., the space of 3D poses consisting of translation and rotation. For many practical problems it is thus relevant to directly evaluate this measure w.r.t. a parametrization of SE(3) rather than the joints. This requires combining the evaluation of the Inverse Kinematic (IK) with the selected capability metric. But direct calculation of the IK is always robot-dependent and general analytic solutions are not possible. This is especially true for redundant robots that have more degrees of freedom (DOF) in joint space than in task space and thus admit an infinite number of IK solutions for a given end-effector pose. While analytic IK solutions are well known for conventional 6-DOF kinematics [6], for general robotic structures numeric IK solvers are applied. However, they require several iterations to find an approximated joint configuration for a given end-effector pose. This is sufficient for calculating single poses, but it is inefficient for optimization problem solvers that require evaluation of large numbers of poses. This especially prevents time-critical computation of global optima. Expressions that can be evaluated directly are thus superior for fast computation. While an analytical IK for a general robot structure does not exist, our work focuses on the most commonly used articulated 6- and 7-DOF robot serial kinematics. Yet, the 6 axis version can be viewed as a finite set of particular null space solutions of the 7-DOF.

#### 1.1. Contribution

In this work, we develop a set of computationally efficient closed-form expressions to evaluate the task space manipulability of a 7-DOF serial robot structure, i.e., the mapping from a task space parametrization directly a manipulability measure. The main contributions of this work consist of:

- a new parametrization of the state- and null space that results in concise IK expressions with symmetric structure in the individual components
- analytical closed-form expressions from task space to manipulability measure w.r.t. joint limits, which allow array operation in vector-optimized programming languages. Note that array operation is also called Vectorization in e.g., MATLAB. It refers to the exploitation of Single Instruction Multiple Data (SIMD) instructions of modern Central Processing Unit (CPUs) and allows to operate on multiple data points simultaneously.
- sensitivity analysis of manipulability in task space
- real-time capable application for evaluating the task space manipulability of the entire null space, for globally optimal redundancy resolution w.r.t. manipulability of single poses and full trajectories on SE(3)

#### 1.2. Related Work

For this concise review, we group previous work on the topic into the three areas: (1) performance measures in robotics, (2) direct methods for IK evaluation and algorithmic strategies on the velocity level, and (3) approaches for optimizing manipulability.

#### 1.2.1. Performance Measures

Arguably the most common performance measure for robot structures is the manipulability measure defined by Yoshikawa [1]. It is proportional to the volume of an ellipsoid, spanned by directional capabilities of a kinematic structure to generate velocities in task space at a given joint configuration. It is purely kinematic and does not consider any dynamic components. Yoshikawa also proposed a dynamic manipulability ellipsoid [2] on the acceleration level, for cases where dynamic effects cannot be neglected. This formulation was improved by Chiacchio et al. [3] to correctly account for gravity. A new formulation of a dynamic manipulability ellipsoid that better depicts the real manipulator capabilities in terms of task space accelerations was proposed by Chiacchio [4].

Besides manipulability on the velocity and acceleration levels due to mere kinematic relations, it is essential for practical applications to also consider joint limits as constraints directly on the position level. Vahrenkamp et al. [5] extended Yoshkawa’s basic manipulability, by directly integrating joint limit penalization into the definition of the kinematic velocity Jacobian. This is achieved via a joint limit potential function.

Bong-Huan Jun et al. [7] introduce a task-oriented manipulability measure. While Yoshikawa’s original measure [1] denotes the manipulability of the whole manipulator system, [7] considers manipulability w.r.t. to sub-tasks that only affect parts of the task space, e.g., axis specific tasks. Karim Abdel-Malek and Wei Yu [8] proposed an alternative dexterity measure for robot placement that does not depend on explicit IK solutions. They analyze an augmented Jacobian matrix that does not only hold information about position and orientation, but also joint limits of the end-effector. It represents the reachable workspace with surface patches and is computationally very demanding.

Our work has the aim of developing closed-form solutions that allow efficient array operation. For this reason, the task space manipulability formulation developed in this work applies Yoshikawa’s original measure from [1]. Because its definition uses a determinant to map the joints to a scalar metric, it thus allows expansion to a continuous polynomial expression for efficient evaluation.

#### 1.2.2. Inverse Kinematics

The IK problem of serial robot structures can be solved very elegantly on the velocity level, due to the linear relation of joint and task space velocities. However, numeric integration of the resulting joint velocities to joint angles needs stabilization against numerical drift and thus results in an iterative scheme. Originally proposed by Wolovich and Elliot [9], this group of IK solvers is nowadays typically referred to as Closed-Loop Inverse Kinematic (CLIK) solvers. Colomé and Torras [10] give an overview of the most common CLIK solvers, with an additional experimental comparison in terms of convergence, numerical error, singularity handling, joint limit avoidance, and the capability of reaching secondary goals. Antonelli [11] conducted a stability analysis of priority-based kinematic CLIK algorithms for redundant kinematics. He provides sufficient conditions for the control gains. While different stabilization schemes for CLIK solvers are proposed, the choice of gain parameters used in the control structure is rarely addressed. In practice these parameters are often empirically tuned. Bjoerlykhaug [12] proposes the use of a genetic algorithm for optimizing the feedback gain used in CLIK solvers, in order to minimize iteration cycles and maximize accuracy. In an experimental evaluation, he achieved a 50% decrease in computation time through his feedback gain tuning. Reiter et al. [13] propose a strategy for finding higher-order time-optimal IK solutions for redundant robots. They lay out solutions for fourth-order time derivatives of joint trajectories, applying a multiple shooting optimization method. This higher-order continuous differentiability is especially important for application on elastic mechanisms.

Siciliano [14] gives a tutorial on early common online IK algorithms. He states the important features of a direct inverse kinematics function, i.e., repeatability, cyclicity, or cyclic behaviour, and online applicability. Shimizu et al. [15] outline an analytical IK computation for a 7-DOF serial robot. The approach directly parametrizes the end-effector pose with Cartesian coordinates for translation and a rotation matrix for orientation. However, the use of the 2-quadrant atan function, as opposed to the 4-quadrant atan2 function, results in two problems. For one, the entire task space is not covered, and two, it results in discontinuous joint functions w.r.t. the null space parameter and thus leads to discontinuous IK solutions and corresponding null space limitations. A similar strategy, but extended to the entire domain, is proposed by Faria et al. [16]. They propose a position-based IK solution for a 7-DOF serial manipulator with joint limit and singularity avoidance.

Besides approaches that use kinematic insight of a structure, several machine learning algorithms are also considered in the literature. A detailed review is beyond the scope of this work, but we want to give a concise overview of research activities. D’Souza et al. [17] apply a locally weighted projection regression to learn the IK of a 30-DOF humanoid robot. This maps the non-convex problem onto a locally convex problem that is suitable for direct learning. Tejomurtula and Kak [18], as well as Köker et al. [19], applied artificial neural networks for finding an IK mapping for 3-DOF robots and showed the feasibility of the problem using conventional error-backpropagation and Kohonen networks. Sariyildiz et al. [20] compare support vector regression and artificial neural networks for learning IK mappings of a 7-DOF serial robot. They find that support vector regression is less prone to local minima and requires very few training data. Genetic algorithms were already early applied by Parker et al. [21]. They pointed out low positioning accuracy, but emphasize its simplicity in application. Köker [22] proposes a hybrid approach combining Elman neural networks with genetic algorithms. He was able to significantly improve accuracy for IK solutions of a 6-DOF mechanism in comparison to pure neural networks. Very recently, Dereli et al. [23] proposed a strategy to apply quantum behaved particle swarm optimization for finding IK solutions of a 7-DOF serial robot.

The IK expressions developed in this work are similar to the analytical approaches in [15,16] in terms of parametrizing the null space as arm angle. However, the new task space parametrization that we introduce results in more concise and, more importantly, fully vectorizable expressions that allow efficient array operations. In contrast to existing approaches in the literature, this computational advantage makes our approach suitable for simultaneous evaluation of a large number of poses.

#### 1.2.3. Optimizing Manipulability

In conventional industrial contexts, optimizing cycling time is always of interest. Several publications deal with this problem, e.g., Kamrani et al. [24] use the Response Surface Method [25] to optimize robot placement w.r.t. cycling time. Chan and Dubey [26], as well as Dariush et al. [27], use a projection method of the joint limit gradient potential function. This is used for local manipulability optimization on the velocity level. Dufour and Suleiman [28] present an approach of integrating the manipulability index into an optimization-based IK solver, by using linear approximations of the nonlinear manipulability measure with numeric gradient calculations at every time step. Jin et al. [29] mention the difficulty of real-time manipulability optimization that is related to a high computational burden since the manipulability is a non-convex function to the joint angles of a robotic arm. Due to the capability of high-speed parallel distributed processing, they propose an approach using dynamic neural networks in order to implement manipulability optimization in real-time. Conducting computer simulations, they show that the proposed method raises the manipulability by almost 40% on average compared to existing methods.

Besides local optimization of a given joint configuration, for many robotic tasks it is required to include manipulability as criteria for optimization of the whole trajectory. Lee [30] shows that a required motion can be approximated by a series of manipulability ellipsoids. Guilamo et al. [31] present an algorithm for trajectory generation that maximizes the volume of the manipulability ellipsoid. Yoshikawa [1] already observed that the optimal postures of various manipulators form the viewpoint of manipulability, and often show resemblance of those naturally taken by human arms. This motivates the idea of manipulability transfer using a learning by demonstration strategy that is introduced by Rozo et al. [32]. Their approach allows robots to learn and reproduce a continuous set of manipulability ellipsoids by an expert’s demonstration. In order to encode and retrieve those ellipsoids, they apply Gaussian Mixture Models and Gaussian Mixture Regression. In Jaquier et al. [33] the same authors exploit tensor-based representation, to consider that manipulability ellipsoids lie on the manifold of symmetric positive definite matrices. Faroni et al. [34] present an approach that maximizes the average manipulability of the overall task. Their method is based on the optimization of a cost function that depends on various points along a predetermined path. In particular, if the task of the manipulator is known a priori, this approach provides global manipulability optimization.

An approach for directly quantifying manipulability of a redundant robot in task space is proposed by Zacharias et al. [35]. They introduce a capability map, to guide the decision on how to place a mobile robot relative to an object. It is a sampling-based approach, based on the manipulability index. While the approach reveals in which regions the robot is capable of grasping objects from different angles, the information of optimal approaching directions is lost.

The task space manipulability approach in this work enables for the first time global manipulability optimization with real-time capabilities, due to its efficient formulation.

#### 1.3. Outline

The remainder of the paper is organized as follows. The problem of a closed-loop task space manipulation framework is outlined in Section 2. In Section 3, the derivation of all analytical mappings is explained. Evaluation and analysis of the resulting task space manipulability is discussed in Section 4 and applied in global optimization formulations in Section 5. We conclude the work and outline future directions of development in Section 6.

## 2. Problem Formulation

Given a n-DOF serial robot, its forward kinematics
maps the joints $\mathit{q}$ onto the 3D end-effector pose $\mathit{z}$ at a particular null space solution parametrized by $\mathit{\lambda}$. To quantify the capability of moving in the SE(3) task space at a given joint configuration $\mathit{q}$, a manipulability metric function
is applied. A proper choice of parametrization for $\mathit{z}$ and $\mathit{\lambda}$ assures the existence of the inverse function

$$\begin{array}{c}\hfill \mathrm{FK}:\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{n}\to \mathrm{SE}\left(3\right)\times {\mathbb{R}}^{n-6},\phantom{\rule{1.em}{0ex}}\mathit{q}\mapsto (\mathit{z},\mathit{\lambda})\end{array}$$

$$\mathrm{M}:\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{n}\to {\mathbb{R}}^{1},\phantom{\rule{1.em}{0ex}}\mathit{q}\mapsto \mu $$

$$\begin{array}{c}\hfill \mathrm{IK}:\mathrm{SE}\left(3\right)\times {\mathbb{R}}^{n-6}\to {\mathbb{R}}^{n},\phantom{\rule{1.em}{0ex}}(\mathit{z},\lambda )\mapsto {\mathrm{FK}}^{-1}(\mathit{z},\lambda )=:\mathit{q}.\end{array}$$

We define the task space manipulability as the direct mapping
of a desired pose $\mathit{z}$ in task space onto the manipulability measure $\mu $, considering all null space solutions parametrized by $\mathit{\lambda}$. $(\mathrm{M}\circ \mathrm{IK})(\mathit{z},\mathit{\lambda})$ denotes the function composition $\mathrm{M}\left(\mathrm{IK}\right(\mathit{z},\mathit{\lambda}\left)\right)$. Figure 1 illustrates the task space manipulability for a certain end-effector pose $\mathit{z}$. Considering real-time critical online applications and feasibility of global optimization formulations, the development of the task space manipulability map can be broken down into three problems:

$$\mathrm{M}\circ \mathrm{IK}:\phantom{\rule{1.em}{0ex}}\mathrm{SE}\left(3\right)\times {\mathbb{R}}^{n-6}\to {\mathbb{R}}^{1},\phantom{\rule{1.em}{0ex}}(\mathit{z},\mathit{\lambda})\mapsto \mu $$

**Problem****1:**- Find a parametrization of the task- and null space that exploits the kinematic structure for concise expressions.
**Problem****2:**- Find closed-form expressions for all mappings from task space to manipulability that allow efficient array operation in vector-optimized programming languages.
**Problem****3:**- Let $\mathcal{Q}\subset {\mathbb{R}}^{7}$ be the space of admissible joint configurations. Find an analytical expression of the range of the null space solutions $\mathsf{\Lambda}\left(\mathit{z}\right):=\{\mathit{\lambda}\in {\mathbb{R}}^{n-6}\phantom{\rule{0.277778em}{0ex}}|\phantom{\rule{0.277778em}{0ex}}\mathrm{IK}(\mathit{z},\mathit{\lambda})\in \left(Q\right)\}$, for which the inverse kinematics function $\mathrm{IK}(\phantom{\rule{0.166667em}{0ex}}\xb7\phantom{\rule{0.166667em}{0ex}},\mathit{\lambda})$ results in an admissible joint configuration $\mathit{q}\in \mathcal{Q}$.

In this work, we investigate in detail the case of a 7-DOF serial robot kinematics in conventional Spherical-Revolute-Spherical (S-R-S) structure, such as the KUKA LBR series. In this context, S-R-S refers to a kinematic 7-DOF structure with alternating revolute joints, of which the rotation axes of the first and last 3 joints intersect. These two groups of intersecting axes behave kinematically like a spherical joint and are often referred to as shoulder and wrist. This type of kinematic structure leads to a 1-dimensional null space of solutions and thus $\lambda \in {\mathbb{R}}^{1}$.

## 3. Technical Approach

This section outlines the derivation of the closed-form task space manipulability for the considered special case of a 7-DOF serial robot kinematics. We first discuss the chosen manipulability mapping and possible reductions in joint space. Motivated by these reductions, we propose a task space projection onto a parameter space, which yields concise expressions for the IK. Figure 2 summarizes all developed mappings that are developed in this section. The section concludes with an analytic definition of the admissible null space at a given parameter end-effector pose.

Notational Notes

Scalars are written in plain lower case, vectors in bold-face lower case. Matrices are bold-face upper case, while plain upper case symbols refer to coordinate frames, mathematical spaces, and sets.

For vector indices, we use the common anthropomorphic analogy of a human arm. We refer to the origin of the kinematic as base B, and to positions of joint 2, joint 4, and joint 6 as shoulder S, elbow E, and wrist W respectively. Body-fixed frames of the individual robot links are numbered 1 to 7 and relate to the bodies after the corresponding joints. The end-effector will be referred to as tool T.

Coordinate transformation matrices are written as ${\mathit{A}}_{kj}$ with 2 indices and are read from right to left, e.g., ${\mathit{A}}_{43}$ transforms the coordinate system from body-fixed frame of joint ${q}_{3}$ to joint ${q}_{4}$, whereas vector indices are read from left to right and their reference frame is written as left-hand side subscript. The notation ${}_{B}{\mathit{r}}_{SW}$ thus describes a vector $\mathit{r}$ pointing from shoulder S to wrist W, expressed in base frame B. Cartesian base vectors of the coordinate systems are written as ${}_{}\widehat{\mathit{x}}{,}_{}\widehat{\mathit{y}}$, and ${}_{}\widehat{\mathit{z}}$. If a vector does not have a lower left index, it always refers to the base B.

#### 3.1. Manipulability Measure

The central equation in robot kinematics is the linear forward velocity kinematic map
that relates general joint space velocities $\dot{\mathit{q}}\in {\mathbb{R}}^{n}$ to task space velocities $\dot{\mathit{z}}\in {\mathbb{R}}^{6}$, where the linear map ${}_{}\mathit{J}\left(\mathit{q}\right)\in {\mathbb{R}}^{6\times n}$ describes the velocity propagation from joint to task space at a given joint configuration $\mathit{q}\in {\mathbb{R}}^{n}$. It is defined by the kinematic chain and represents the derivative
hence it is often referred to as Robot Jacobian.

$$\begin{array}{c}\hfill \dot{\mathit{z}}(\mathit{q},\dot{\mathit{q}}):{=}_{}\mathit{J}\left(\mathit{q}\right)\dot{\mathit{q}}\end{array}$$

$$\begin{array}{c}\hfill {}_{}\mathit{J}\left(\mathit{q}\right)=\frac{\partial \dot{\mathit{z}}(\mathit{q},\dot{\mathit{q}})}{\partial \dot{\mathit{q}}},\end{array}$$

Yoshikawa’s manipulability measure [1], which we use in this work, is defined as
and is a measure, proportional to the volume of the velocity manipulability ellipsoid

$$\mathrm{M}:\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{n}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}\mathit{q}\mapsto \sqrt{det\left(\mathit{J}\left(\mathit{q}\right)\mathit{J}{\left(\mathit{q}\right)}^{\top}\phantom{\int}\right)}=:\mu $$

$$\begin{array}{cc}\hfill {\dot{\mathit{q}}}^{\top}\dot{\mathit{q}}& =1\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\dot{\mathit{z}}}^{\top}{{(}_{}{\mathit{J}}_{}{\mathit{J}}^{\top})}^{-1}\dot{\mathit{z}}& =1.\hfill \end{array}$$

Note that (7) does not consider hardware-related joint limits. However, joint configurations that violate these constraints must not be considered.

Zlatanov et al. [36] explain that the forward velocity kinematic map (5) is not sufficient for exhaustive characterization of the singularities of a manipulator. Further, Staffetti et al. [37] show that many of these often-used manipulability indices are not invariant to change of reference frames, scale, or physical units. However, the big advantage of Yoshikawa’s original manipulability metric is the fact that it can be expanded to a polynomial expression and thus qualifies for computationally efficient array operation. Further, derivatives can be calculated analytically. As outlined by Staffetti et al. [37], it is not a true metric for distance to a singularity but nonetheless serves as a relative comparison of manipulability qualities between joint configurations [38].

For a n-DOF serial robot kinematics, we refer to the $i=[1,n]$ absolute angular and translational velocities of the individual links, i.e., the velocity between the robot base B and the body-fixed frame of link i, as ${}_{}{\mathit{\omega}}_{Bi}$ and ${}_{}{\mathit{v}}_{Bi}$. Expressed w.r.t. the link frame i, the velocities of the kinematic chain are calculated with
where $p=i-1$ is the predecessor link of i and $(\times )$ denotes the cross product ${\mathbb{R}}^{3}\times {\mathbb{R}}^{3}\to {\mathbb{R}}^{3}$. In the following, manipulability refers to Yoshikawa’s manipulability measure [1].

$$\begin{array}{cc}\hfill {}_{i}{\mathit{\omega}}_{Bi}& ={\mathit{A}}_{}{ip}_{p}{\mathit{\omega}}_{Bp}{+}_{i}{\mathit{\omega}}_{pi}\hfill \end{array}$$

$$\begin{array}{cc}\hfill {}_{i}{\mathit{v}}_{Bi}& ={\mathit{A}}_{}ip\left({}_{p}{\mathit{v}}_{Bp}{+}_{p}{\mathit{\omega}}_{Bp}{\times}_{p}{\mathit{r}}_{pi}\right),\hfill \end{array}$$

#### 3.1.1. Reduction of First Joint

While Yoshikawa’s manipulability measure is not invariant w.r.t. scale or physical units, it is in fact invariant to change of reference frames.

**Proof.**

Given a vector of joint velocities $\dot{\mathit{q}}$ and task space velocities $\dot{\mathit{z}}$ w.r.t. to a reference frame A, the Jacobian matrix
is used to define the manipulability index

$$\begin{array}{c}\hfill {}_{A}\mathit{J}\left(\mathit{q}\right)=\frac{{\partial}_{A}\dot{\mathit{z}}(\mathit{q},\dot{\mathit{q}})}{\partial \dot{\mathit{q}}}\end{array}$$

$$A\mu \left(\mathit{q}\right)=\sqrt{det\left({}_{A}\mathit{J}{\left(\mathit{q}\right)}_{A}\mathit{J}{\left(\mathit{q}\right)}^{\top}\phantom{\int}\right)}.$$

If this manipulability index is expressed in terms of a new reference frame B via the block transformation matrix
consisting of rotation matrices ${\mathit{A}}_{BA}$, the manipulability index reads

$$\begin{array}{c}\hfill {\mathit{A}}_{BA}^{\mathrm{blk}}\left(\mathit{q}\right)=\left[\begin{array}{cc}{\mathit{A}}_{BA}\left(\mathit{q}\right)& \mathit{0}\\ \mathit{0}& {\mathit{A}}_{BA}\left(\mathit{q}\right)\end{array}\right],\end{array}$$

$$\begin{array}{c}\hfill {}_{B}\mathit{\mu}\left(\mathit{q}\right)=\sqrt{det\left({\mathit{A}}_{BA}^{\mathrm{blk}}{\left(\mathit{q}\right)}_{A}\mathit{J}\left(\mathit{q}\right){\left({\mathit{A}}_{BA}^{\mathrm{blk}}{\left(\mathit{q}\right)}_{A}\mathit{J}\left(\mathit{q}\right)\right)}^{\top}\phantom{\int}\right)}.\end{array}$$

Considering the fact that Euclidean transformation matrices have $det\left({\mathit{A}}_{}\phantom{\int}\right)=1$, we find
i.e., the manipulability measure $\mu $ is invariant to change of reference frames. □

$$\begin{array}{c}\hfill {}_{B}\mathit{\mu}\left(\mathit{q}\right)=\sqrt{det\left({}_{A}\mathit{J}{\left(\mathit{q}\right)}_{A}\mathit{J}{\left(\mathit{q}\right)}^{\top}\phantom{\int}\right)}{=}_{A}\mathit{\mu}\left(\mathit{q}\right)\end{array}$$

If the reference frame is chosen to be fixed to any link after the first joint, it results in an expression for the manipulability measure that is independent of the first joint. This results from the fact that the first joint rotates the whole kinematic structure including the reference frame, but does not alter any geometric relations.

We consequently choose to formulate the Jacobian matrix w.r.t. to the end-effector frame, as this does not only lead to the independence of ${q}_{1}$, but also results in the most concise expression.

#### 3.1.2. Reduction of Last Joint

For a special case of a 7-DOF serial kinematic, the parameter space of the manipulability can be further reduced. This special case consists of kinematic structures, whose origin of the end-effector frame lies on the rotation axis of the last joint ${q}_{n}$. The purely angular contribution of ${q}_{n}$ does not alter the kinematic configuration but only rotates the reference frame and with it the manipulability ellipsoid. The shape of the ellipsoid is not affected and so ${q}_{n}$ can also not influence the manipulability measure.

#### 3.1.3. Closed-Form Expression

Exploiting these two reductions by formulating the ${}_{T}\mathit{J}$ w.r.t. to the end-effector frame T and assuming the tool center point (TCP) along the last joint axis, it is possible to expand the entire determinant expression of the matrix ${}_{T}{\mathit{J}}_{T}{\mathit{J}}^{\top}\in {\mathbb{R}}^{6\times 6}$ from (7) to a symbolic polynomial expression using, e.g., MATLAB Symbolic Math Toolbox™. The advantage being that, unlike the original matrix expression, the polynomial form allows array operation in vector-optimized programming languages. This enables simultaneous evaluation of an entire set of joint configurations. The full manipulability function is listed in Appendix A.

#### 3.2. Task Space Parametrization

The decision of choosing a parametrization for the SE(3) pose, as well as the 1D null space, is essential for the derivation of concise analytical formulations. We propose the following parameter requirements (PR) for a suitable parametrization in regard to the IK functions. The parameter set must

- PR1:
- uniquely define the null space parameter for the entire space of SE(3).
- PR2:
- result in a minimal number of parameters for the components of the IK vector map $\mathit{p}\mapsto \mathit{q}$.
- PR3:
- allow direct application of the above-mentioned reductions.

Different approaches for null space parametrization were proposed in the literature. The redundancy is either directly parametrized by a redundant joint [39,40], or more commonly by a joint-independent arm angle [15,41]. Shimizu et al. [15] argued that joint-based parametrization is not suitable for the discussed 7-DOF S-R-S mechanism due to possible ambiguous results. Kreutz-Delgado et al. [41] define the arm angle as the angle between an arm and a reference plane. The arm plane is spanned by shoulder, elbow, and wrist locations. The reference plane is defined by a fixed vector and the vector from shoulder to wrist. Shimizu et al. [15] point out arithmetic singularities in the original definition whenever the two vectors are collinear. They enhance the robustness of the definition by defining the reference plane in terms of a particular solution ${q}_{3}\stackrel{!}{=}0$, which resembles the solution of conventional non-redundant 6-DOF mechanisms. While this definition is unique w.r.t. the conservative joint limits of their analyzed robot structure, it is ambiguous whenever the reduced non-redundant 6-DOF mechanism admits multiple configurations that result in the same end-effector pose.

In this work, we introduce a parametrization that fulfills all the above-discussed parameter requirements. Figure 3 illustrates the following discussion. Independent of a desired end-effector pose, positions of the base B and shoulder S are always stationary, where
with link lengths of the base link ${l}_{B}$ and the first link ${l}_{1}$. Additionally, defining a desired end-effector pose relative to the robot base in SE(3), consisting of ${}_{B}{\mathit{r}}_{BT}$ for translation and ${\mathit{A}}_{TB}$ for orientation, determines not only the location of the tool-center-point T but also the wrist position
with link lengths ${l}_{6}$ and ${l}_{7}$, and a potential tool length ${l}_{T}$. This wrist position is used for define the translational component of the end-effector pose $\mathit{z}$. The position ${}_{B}{\mathit{r}}_{SW}$ is parametrized by spherical coordinates $({r}_{\mathrm{ref}},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}})$ with coordinate plane ${}_{B}{\widehat{\mathit{x}}}_{}\widehat{\mathit{z}}$, origin S and ${}_{B}\widehat{\mathit{z}}$ as polar axis. The parameters are radius ${r}_{\mathrm{ref}}$, longitudinal angle ${\gamma}_{\mathrm{ref}}$, and azimuthal angle ${\beta}_{\mathrm{ref}}$. Note that ${\gamma}_{\mathrm{ref}}$ and ${\beta}_{\mathrm{ref}}$ directly align with the rotation axis of ${q}_{1}$ and ${q}_{2}$. These two angles also define the reference frame R with

$$\begin{array}{c}\hfill {}_{B}{\mathit{r}}_{BS}:={({l}_{B}+{l}_{1})}_{}\widehat{\mathit{z}}\end{array}$$

$$\begin{array}{c}\hfill {}_{B}{\mathit{r}}_{BW}:{=}_{B}{\mathit{r}}_{BT}-{\mathit{A}}_{B6}{({l}_{6}+{l}_{7}+{l}_{T})}_{}\widehat{\mathit{z}},\end{array}$$

$$\begin{array}{c}\hfill {\mathit{A}}_{RB}({\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}}):={\mathit{A}}_{y}\left({\beta}_{\mathrm{ref}}\right){\mathit{A}}_{z}\left({\gamma}_{\mathrm{ref}}\right).\end{array}$$

The orientation is parametrized along a consecutive Euler angle sequence $Z\to {Y}^{{}^{\prime}}\to {Z}^{{}^{\u2033}}$, which again corresponds to the sequence of the joint structure. However, instead of directly parametrizing ${\mathit{A}}_{TB}$, we parametrize the end-effector orientation with respect to the reference frame, i.e.,

$$\begin{array}{c}\hfill {\mathit{A}}_{TR}({\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}}):={\mathit{A}}_{z}\left({\psi}_{\mathrm{EE}}\right){\mathit{A}}_{y}\left({\beta}_{\mathrm{EE}}\right){\mathit{A}}_{z}\left({\gamma}_{\mathrm{EE}}\right).\end{array}$$

Regarding the stated parameter requirement PR2, this makes the IK functions of the wrist angles $({q}_{5},{q}_{6},{q}_{7})$ as independent of the shoulder parameters $({r}_{\mathrm{ref}},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}})$ as possible, as will be seen in the IK Section 3.3.

The 1D null space is parametrized by the arm angle $\lambda $. In contrst to Shimizu et al. [15] we do not define the arm angle w.r.t. to the non-redundant solution ${q}_{3}\stackrel{!}{=}0$, but w.r.t. to the introduced reference frame R. Let $\lambda $ be the arm angle, which defines a new frame L with
such that the negative frame base vector $\left({-}_{L}\widehat{\mathit{x}}\right)$ points in direction of the elbow E. This uniquely defines the null space parameter as required in PR1. The full set of parameters is thus given with tuple $(\mathit{p},\lambda )\in {\mathbb{R}}^{6}\times \mathbb{R}$, consisting of the parameter vector
and arm angle $\lambda $. The individual parameter range definitions are
and form the parameter space $\mathcal{P}\subset {\mathbb{R}}^{7}$. Note that the two parameters ${\gamma}_{\mathrm{ref}}$ and ${\psi}_{\mathrm{EE}}$ solely affect joints ${q}_{1}$ and ${q}_{7}$, which do not influence manipulability. The task space manipulability developed in this work can thus without loss of information be represented by the reduced parameter vector ${\mathit{p}}^{\mathrm{red}}\in {\mathcal{P}}^{\mathrm{red}}\subset {\mathbb{R}}^{4}$ consisting of

$$\begin{array}{c}\hfill {\mathit{A}}_{LB}({\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},\lambda ):={\mathit{A}}_{z}\left(\lambda \right){\mathit{A}}_{RB}({\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}}),\end{array}$$

$$\begin{array}{c}\hfill \mathit{p}:={\left[{r}_{\mathrm{ref}},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}}\right]}^{\top}\end{array}$$

$$\begin{array}{c}\hfill \begin{array}{cccc}\hfill {r}_{\mathrm{ref}}\in [& \hfill {r}_{\mathrm{ref}}^{\mathrm{min}},& {r}_{\mathrm{ref}}^{\mathrm{max}}\hfill & ]\\ \hfill {\gamma}_{\mathrm{ref}}\in [& \hfill -\pi ,& +\pi \hfill & ]\\ \hfill {\beta}_{\mathrm{ref}}\in [& \hfill 0,& +\pi \hfill & ]\\ \hfill {\gamma}_{\mathrm{EE}}\in [& \hfill -\pi ,& +\pi \hfill & ]\\ \hfill {\beta}_{\mathrm{EE}}\in [& \hfill 0,& +\pi \hfill & ]\\ \hfill {\psi}_{\mathrm{EE}}\in [& \hfill -\pi ,& +\pi \hfill & ]\\ \hfill \lambda \in [& \hfill -\pi ,& +\pi \hfill & ]\end{array}\end{array}$$

$$\begin{array}{c}\hfill {\mathit{p}}^{\mathrm{red}}:={\left[{r}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}}\right]}^{\top}.\end{array}$$

This complies with the stated requirement PR3. The presented parametrization is the fundamental core for the concise mappings developed in the remaining section.

#### 3.2.1. Task Space Projection

We refer to the extraction of the parameter vector $\mathit{p}={\left[{r}_{\mathrm{ref}},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}}\right]}^{\top}$ from a given end-effector pose $\mathit{z}\in \mathrm{SE}\left(3\right)$ as Task Space Projection. Without loss of generality, we assume the pose $\mathit{z}\in \mathrm{SE}\left(3\right)$ is described with Cartesian Coordinates $(x,y,z)$ for translation ${}_{B}{\mathit{r}}_{BT}$ together with a Rotation matrix ${\mathit{A}}_{TB}$ for orientation. As a reference matrix for extracting the parameter space angles $({\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}})$ we state the rotation matrix for a general $ZYZ$ Euler sequence
that shows that we can define a mapping ${\mathrm{eul}}_{ZYZ}:\mathrm{SE}\left(3\right)\to {\mathbb{R}}^{3}$ as
that extracts the Euler angles from a rotation matrix in SE(3). The operator ${\left[\phantom{\int}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\xb7\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\right]}_{(i,j)}$ returns the element at row i and column j of a matrix.

$$\begin{array}{c}{\mathit{A}}_{zyz}(\gamma ,\beta ,\psi ):={\mathit{A}}_{z}\left(\psi \right){\mathit{A}}_{y}\left(\beta \right){\mathit{A}}_{z}\left(\gamma \right)=\hfill \\ \hfill \text{\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}}\left(\begin{array}{ccc}\mathrm{c}\left(\beta \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left(\gamma \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left(\psi \right)-\mathrm{s}\left(\gamma \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\psi \right)& \mathrm{c}\left(\gamma \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\psi \right)+\mathrm{c}\left(\beta \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left(\psi \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\gamma \right)& -\mathrm{c}\left(\psi \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\beta \right)\\ -\mathrm{c}\left(\psi \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\gamma \right)-\mathrm{c}\left(\beta \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left(\gamma \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\psi \right)& \mathrm{c}\left(\gamma \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left(\psi \right)-\mathrm{c}\left(\beta \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\gamma \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\psi \right)& \mathrm{s}\left(\beta \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\psi \right)\\ \mathrm{c}\left(\gamma \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\beta \right)& \mathrm{s}\left(\beta \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\gamma \right)& \mathrm{c}\left(\beta \right)\end{array}\right)\end{array}$$

$$\begin{array}{c}\hfill {\mathrm{eul}}_{ZYZ}:\phantom{\rule{1.em}{0ex}}\mathrm{SE}\left(3\right)\to {\mathbb{R}}^{3},\phantom{\rule{1.em}{0ex}}{\mathit{A}}_{zyz}\mapsto \left[\begin{array}{c}\mathrm{atan}2\left({\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(3,2)}\phantom{\rule{0.277778em}{0ex}},\phantom{\rule{0.166667em}{0ex}}{\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(3,1)}\right)\\ arccos\left({\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(3,3)}\right)\\ \mathrm{atan}2\left({\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(2,3)}\phantom{\rule{0.277778em}{0ex}},\phantom{\rule{0.166667em}{0ex}}-{\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(1,3)}\right)\end{array}\right]=:\left[\begin{array}{c}\gamma \\ \beta \\ \psi \end{array}\right]\end{array}$$

The Task Space Projection
consists of the mappings
With the shoulder-wrist vector
and the rotation matrix
derived from the desired task space pose. Rotation ${\mathit{A}}_{7T}$ is the constant rotation matrix from body fixed frame of link 7 to the TCP frame.

$$\begin{array}{c}\hfill \mathrm{TSP}:\phantom{\rule{1.em}{0ex}}\mathrm{SE}\left(3\right)\to {\mathbb{R}}^{6},\phantom{\rule{1.em}{0ex}}\mathit{z}\mapsto \mathit{p}\end{array}$$

$$\begin{array}{cc}\hfill {r}_{\mathrm{ref}}\left(\mathit{z}\right)& :={\u2225{}_{B}\mathit{r}{}_{SW}\u2225}_{2}\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\beta}_{\mathrm{ref}}\left(\mathit{z}\right)& :=\frac{\pi}{2}-arctan\frac{{\left[{}_{B}\mathit{r}{}_{SW}\right]}_{\left(3\right)}}{{\left[{}_{B}\mathit{r}{}_{SW}\right]}_{\left(1\right)}}\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\gamma}_{\mathrm{ref}}\left(\mathit{z}\right)& :=\mathrm{atan}2\left({\left[{}_{B}\mathit{r}{}_{SW}\right]}_{\left(2\right)},{\left[{}_{B}\mathit{r}{}_{SW}\right]}_{\left(1\right)}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left[\begin{array}{c}{\gamma}_{\mathrm{EE}}\\ {\beta}_{\mathrm{EE}}\\ {\psi}_{\mathrm{EE}}\end{array}\right]\left(\mathit{z}\right)& :={\mathrm{eul}}_{ZYZ}\left({\mathit{A}}_{7R}(\mathit{z},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}})\right).\hfill \end{array}$$

$$\begin{array}{c}\hfill \begin{array}{cc}\hfill {}_{B}\mathit{r}{}_{SW}& :={}_{B}\mathit{r}{}_{BR}-{}_{B}\mathit{r}{}_{BS}\hfill \\ \hfill \phantom{\rule{1.em}{0ex}}& \phantom{:}={}_{B}\mathit{r}{}_{BT}-{\mathit{A}}_{B6\text{}6}\widehat{\mathit{z}}({l}_{6}+{l}_{7}+{l}_{T}){-}_{B}\widehat{\mathit{z}}({l}_{B}+{l}_{1}).\hfill \end{array}\end{array}$$

$$\begin{array}{c}\hfill {\mathit{A}}_{7R}(\mathit{z},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}}):={\mathit{A}}_{7T}{\mathit{A}}_{TB}\left(\mathit{z}\right){\mathit{A}}_{BR}({\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}}),\end{array}$$

#### 3.2.2. Task Space Surjection

We refer to the inverse mapping, i.e., from the parameter vector $\mathit{p}$ to the task space pose $\mathit{z}$, as Task Space Surjection (TSS)

$$\begin{array}{c}\hfill \mathrm{TSS}:\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{6}\to \mathrm{SE}\left(3\right),\phantom{\rule{1.em}{0ex}}\mathit{p}\mapsto \mathit{z}.\end{array}$$

The relations are given with
using the established definitions in the previous sections.

$$\begin{array}{cc}\hfill {}_{B}{\mathit{r}}_{BT}& :={({l}_{B}+{l}_{1})}_{B}\widehat{\mathit{z}}+{\mathit{A}}_{BR}({\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}})\left({}_{R}\widehat{\mathit{z}}{r}_{\mathrm{ref}}+{\mathit{A}}_{R7}({\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}})({l}_{6}+{l}_{7}+{\mathit{A}}_{7T}{l}_{T})\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathit{A}}_{TB}& :={\mathit{A}}_{7T}{\mathit{A}}_{7R}({\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}}){\mathit{A}}_{RB}({\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}})\hfill \end{array}$$

#### 3.3. Inverse Kinematics

In this section we derive closed-form expressions for the IK map. After discussing the choice of the default manipulator configuration, we derive the individual IK mappings of the robot joints. Corresponding to the S-R-S structure, we group the joints into shoulder angles $\{{q}_{1},{q}_{2},{q}_{3}\}$, the elbow angle $\left\{{q}_{4}\right\}$, and wrist angles $\{{q}_{5},{q}_{6},{q}_{7}\}$.

#### 3.3.1. Manipulator Configuration

Due to the possible reconfiguration of the robot kinematics, i.e., whenever 3 revolute joint axes intersect in one point, with 2 being coaxial and the third being perpendicular to the links, there exists an alternative configuration
that results in the same FK. In the 7-DOF S-R-S structure considered in this work, this is the case for the tuples $({q}_{1},{q}_{2},{q}_{3})$, $({q}_{3},{q}_{4},{q}_{5})$, and $({q}_{5},{q}_{6},{q}_{7})$. Therefore, defining only the end-effector pose as well as the elbow position results in 8 possible configurations. Of course, it is important to derive an IK map that results in one specific configuration for the entire parameter space. The following derivation is designed to yield in a configuration as depicted in Figure 3 for the default case ${q}_{1}={q}_{3}={q}_{5}=0$. This is achieved by choosing the joint angle ranges

$$\begin{array}{c}\hfill \mathrm{FK}({\mathrm{coaxial}}_{1},\mathrm{perpendicular},{\mathrm{coaxial}}_{2})=\mathrm{FK}({\mathrm{coaxial}}_{1}+\pi ,-{\mathrm{perpendicular}}_{2},{\mathrm{coaxial}}_{2}+\pi )\end{array}$$

$$\begin{array}{c}\hfill \begin{array}{cccc}{q}_{1}\in [& \hfill -\pi ,& +\pi \hfill & ]\\ {q}_{2}\in [& \hfill 0,& +\pi \hfill & ]\\ {q}_{3}\in [& \hfill -\pi ,& +\pi \hfill & ]\\ {q}_{4}\in [& \hfill 0,& +\pi \hfill & ]\\ {q}_{5}\in [& \hfill -\pi ,& +\pi \hfill & ]\\ {q}_{6}\in [& \hfill 0,& +\pi \hfill & ]\\ {q}_{7}\in [& \hfill -\pi ,& +\pi \hfill & ].\end{array}\end{array}$$

We refer to this definition as ${\mathcal{Q}}_{\mathrm{sc}}\subset {\mathbb{R}}^{7}$, i.e., the space of joints in standard configuration.

#### 3.3.2. Elbow Angles

The central geometric shape to express the arm portion of joints is the triangle $\overline{SEW}$ as depicted in Figure 3. It is fully defined by the parameter ${r}_{\mathrm{ref}}$, as well as the robot related constant link lengths

$$\begin{array}{cc}\hfill {r}_{SE}& :={l}_{3}+{l}_{4}\hfill \end{array}$$

$$\begin{array}{cc}\hfill {r}_{EW}& :={l}_{5}+{l}_{6}.\hfill \end{array}$$

The law of cosines in this triangle allows direct calculation of joint 4
as well as the adjoint angles
and

$$\begin{array}{cc}\hfill {r}_{\mathrm{ref}}^{2}& ={r}_{SE}^{2}+{r}_{EW}^{2}-{r}_{SE}{r}_{EW}cos\left(\pi -{q}_{4}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {q}_{4}\left({r}_{\mathrm{ref}}\right)& :=\pi -arccos\left(\frac{{r}_{SE}^{2}+{r}_{EW}^{2}-{r}_{\mathrm{ref}}^{2}}{2{r}_{SE}{r}_{EW}}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {r}_{SE}& ={r}_{\mathrm{ref}}^{2}+{r}_{EW}^{2}-{r}_{\mathrm{ref}}{r}_{EW}cos\left({\theta}_{S}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\theta}_{S}\left({r}_{\mathrm{ref}}\right)& :=arccos\left(\frac{{r}_{\mathrm{ref}}^{2}+{r}_{EW}^{2}-{r}_{SE}}{2{r}_{\mathrm{ref}}{r}_{EW}}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {r}_{EW}& ={r}_{\mathrm{ref}}^{2}+{r}_{SE}^{2}-{r}_{\mathrm{ref}}{r}_{SE}cos\left({\theta}_{W}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\theta}_{W}\left({r}_{\mathrm{ref}}\right)& :=arccos\left(\frac{{r}_{\mathrm{ref}}^{2}+{r}_{SE}^{2}-{r}_{EW}}{2{r}_{\mathrm{ref}}{r}_{SE}}\right).\hfill \end{array}$$

The latter are used to define alternative rotation frame compositions for the derivation of the remaining joints. See Figure 4 for an overview of the relations between all introduced coordinate frames.

#### 3.3.3. Shoulder Angles

Reusing the $ZYZ$ Euler sequence extraction function (24) makes it possible to directly define the IK function of the shoulder angles $\{q1,q2,q3\}$. The parameter-related frames R and L (cf. Figure 4) are used to compose the transformation matrix
and extract

$$\begin{array}{c}\hfill {\mathit{A}}_{3B}(\mathit{p},\lambda ):={\mathit{A}}_{y}\left(-{\theta}_{W}\right){\mathit{A}}_{z}\left(\lambda \right){\mathit{A}}_{RB}\left({\beta}_{\mathrm{ref}},{\gamma}_{\mathrm{ref}}\right)\end{array}$$

$$\begin{array}{c}\hfill \left[\begin{array}{c}{q}_{1}\\ {q}_{2}\\ {q}_{3}\end{array}\right](\mathit{p},\lambda ):={\mathrm{eul}}_{ZYZ}\left({\mathit{A}}_{3B}(\mathit{p},\lambda )\right).\end{array}$$

#### 3.3.4. Wrist Angles

Analogously to the shoulder angles, the wrist angles $\{{q}_{5},{q}_{6},{q}_{7}\}$ can be calculated by composing the transformation matrix
and extracting the wrist angles with

$$\begin{array}{c}\hfill {\mathit{A}}_{74}(\mathit{p},\lambda ):={\mathit{A}}_{7R}\left({\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}}\right){\mathit{A}}_{z}(-\lambda ){\mathit{A}}_{y}\left(-{\theta}_{S}\right)\end{array}$$

$$\begin{array}{c}\hfill \left[\begin{array}{c}{q}_{5}\\ {q}_{6}\\ {q}_{7}\end{array}\right](\mathit{p},\lambda ):={\mathrm{eul}}_{ZYZ}\left({\mathit{A}}_{74}\left(\mathit{p}\right)\right).\end{array}$$

#### 3.3.5. Overview

All closed-form expressions resulting from the IK mapping are fully listed in Appendix B. The parameter dependencies of the individual function components are
and show the low dimensional dependency as required by PR2. Note that parameters ${\gamma}_{\mathrm{ref}}$ and ${\psi}_{\mathrm{EE}}$ do solely influence ${q}_{1}$ and ${q}_{7}$ resp., and thus do not influence manipulability. Further, in this formulation the shoulder and wrist joints result in equivalent mappings, with symmetrical assignments. Their relations are given as

$$\begin{array}{cccc}\hfill {\mathrm{IK}}_{1}& :\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{4}\to {\mathbb{R}}^{1},\phantom{\rule{1.em}{0ex}}\hfill & \hfill ({\theta}_{\mathrm{S}}\left({r}_{\mathrm{ref}}\right),{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},\lambda )& \mapsto {q}_{1}\hfill \end{array}$$

$$\begin{array}{cccc}\hfill {\mathrm{IK}}_{2}& :\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{3}\to {\mathbb{R}}^{1},\phantom{\rule{1.em}{0ex}}\hfill & \hfill ({\theta}_{\mathrm{S}}\left({r}_{\mathrm{ref}}\right),{\beta}_{\mathrm{ref}},\lambda )& \mapsto {q}_{2}\hfill \end{array}$$

$$\begin{array}{cccc}\hfill {\mathrm{IK}}_{3}& :\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{3}\to {\mathbb{R}}^{1},\phantom{\rule{1.em}{0ex}}\hfill & \hfill ({\theta}_{\mathrm{S}}\left({r}_{\mathrm{ref}}\right),{\beta}_{\mathrm{ref}},\lambda )& \mapsto {q}_{3}\hfill \end{array}$$

$$\begin{array}{cccc}\hfill {\mathrm{IK}}_{4}& :\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{1}\to {\mathbb{R}}^{1},\phantom{\rule{4.em}{0ex}}\hfill & \hfill \left({r}_{\mathrm{ref}}\right)& \mapsto {q}_{4}\hfill \end{array}$$

$$\begin{array}{cccc}\hfill {\mathrm{IK}}_{5}& :\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{3}\to {\mathbb{R}}^{1},\phantom{\rule{1.em}{0ex}}\hfill & \hfill ({\theta}_{\mathrm{W}}\left({r}_{\mathrm{ref}}\right),{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}}-\lambda )& \mapsto {q}_{5}\hfill \end{array}$$

$$\begin{array}{cccc}\hfill {\mathrm{IK}}_{6}& :\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{3}\to {\mathbb{R}}^{1},\phantom{\rule{1.em}{0ex}}\hfill & \hfill ({\theta}_{\mathrm{W}}\left({r}_{\mathrm{ref}}\right),{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}}-\lambda )& \mapsto {q}_{6}\hfill \end{array}$$

$$\begin{array}{cccc}\hfill {\mathrm{IK}}_{7}& :\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{4}\to {\mathbb{R}}^{1},\phantom{\rule{1.em}{0ex}}\hfill & \hfill ({\theta}_{\mathrm{W}}\left({r}_{\mathrm{ref}}\right),{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}}-\lambda )& \mapsto {q}_{7}\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathrm{IK}}_{5}& ={\mathrm{IK}}_{3}({\theta}_{\mathrm{W}}\left({r}_{\mathrm{ref}}\right),{\beta}_{\mathrm{EE}},{\gamma}_{\mathrm{EE}}-\lambda )\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathrm{IK}}_{6}& ={\mathrm{IK}}_{2}({\theta}_{\mathrm{W}}\left({r}_{\mathrm{ref}}\right),{\beta}_{\mathrm{EE}},{\gamma}_{\mathrm{EE}}-\lambda )\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathrm{IK}}_{7}& ={\mathrm{IK}}_{1}({\theta}_{\mathrm{W}}\left({r}_{\mathrm{ref}}\right),{\psi}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\gamma}_{\mathrm{EE}}-\lambda ).\hfill \end{array}$$

This is an interesting geometrical insight that results from the chosen parameter set.

#### 3.4. Forward Kinematics

Although not used in the task space manipulability mapping, we state—for the sake of completeness—the forward mapping
using the developed relations from the previous section on the IK problem. From the elbow angle ${q}_{4}$ and the relation (33), ${r}_{\mathrm{ref}}$ is mapped by

$$\begin{array}{c}\hfill \mathrm{FK}:\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{7}\to {\mathbb{R}}^{6}\times \mathbb{R},\phantom{\rule{1.em}{0ex}}\mathit{q}\mapsto (\mathit{p},\lambda )\end{array}$$

$${r}_{\mathrm{ref}}\left({q}_{4}\right):=\sqrt{{r}_{SE}^{2}+{r}_{EW}^{2}-{r}_{SE}{r}_{EW}cos\left(\pi -{q}_{4}\right)}.$$

The Euler angle extraction function (24) allows again a concise definition of the remaining mappings. The shoulder joints $\{{q}_{1},{q}_{2},{q}_{3}\}$ with the adjoint shoulder angle ${\theta}_{\mathrm{S}}\left({r}_{\mathrm{ref}}\right)$ from (35) parametrize
where

$$\begin{array}{cc}\hfill \left[\begin{array}{c}{\gamma}_{\mathrm{ref}}\\ {\beta}_{\mathrm{ref}}\\ \lambda \end{array}\right]\phantom{\rule{1.em}{0ex}}& :={\mathrm{eul}}_{ZYZ}\left({\mathit{A}}_{LB}(\mathit{q},{r}_{\mathrm{ref}})\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathit{A}}_{LB}(\mathit{q},{r}_{\mathrm{ref}})& :={\mathit{A}}_{y}\left({\theta}_{\mathrm{S}}\left({r}_{\mathrm{ref}}\right)\right){\mathit{A}}_{z}\left({q}_{3}\right){\mathit{A}}_{y}\left({q}_{2}\right){\mathit{A}}_{z}\left({q}_{1}\right).\hfill \end{array}$$

Analogously, the wrist joints $\{{q}_{5},{q}_{6},{q}_{7}\}$ and the adjoint wrist angle ${\theta}_{\mathrm{W}}\left({r}_{\mathrm{ref}}\right)$ from (37) define the end-effector parameters
where

$$\begin{array}{cc}\hfill \left[\begin{array}{c}\lambda +{\gamma}_{\mathrm{EE}}\\ {\beta}_{\mathrm{EE}}\\ {\psi}_{\mathrm{EE}}\end{array}\right]\phantom{\rule{1.em}{0ex}}& :={\mathrm{eul}}_{ZYZ}\left({\mathit{A}}_{7L}(\mathit{q},{r}_{\mathrm{ref}}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathit{A}}_{7L}(\mathit{q},{r}_{\mathrm{ref}})& :={\mathit{A}}_{z}\left({q}_{7}\right){\mathit{A}}_{y}\left({q}_{6}\right){\mathit{A}}_{z}\left({q}_{5}\right){\mathit{A}}_{y}(-{\theta}_{\mathrm{W}}\left({r}_{\mathrm{ref}}\right)).\hfill \end{array}$$

The composition of rotations is in accordance with the structural relation depicted in Figure 4. This concludes the FK problem.

#### 3.5. Admissible Parameter Space

The compact analytical expressions also allow solving analytically for an upper and lower bound of $\lambda $, given maximal joint angles ${q}_{i}^{\mathrm{max}}$. Let $\mathcal{Q}:=\left\{\mathit{q}\phantom{\rule{0.277778em}{0ex}}|\phantom{\rule{0.277778em}{0ex}}\mathit{q}\in {\mathcal{Q}}_{\mathrm{sc}}\phantom{\rule{0.277778em}{0ex}},\phantom{\rule{0.277778em}{0ex}}|{q}_{i}|\le {q}_{i}^{\mathrm{max}}\right\}$ be the space of admissible joint configurations. In this section, we determine the space of admissible parameters

$$\begin{array}{c}\hfill \mathcal{A}:=\left\{(\mathit{p},\lambda )\phantom{\rule{0.277778em}{0ex}}|\phantom{\rule{0.277778em}{0ex}}\mathrm{IK}(\mathit{p},\lambda )\in \mathcal{Q}\right\}.\end{array}$$

Recall the definition of the parameter vector $\mathit{p}:={\left[{r}_{\mathrm{ref}},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}}\right]}^{\top}$ from (20). Only ${r}_{\mathrm{ref}}$ is of linear nature and thus has a limited range. The remaining parameters describe angles and hence need not be limited. While ${\mathrm{IK}}_{4}$ directly relates joint limits of the elbow joint with the admissible range of ${r}_{\mathrm{ref}}$, the null space parameter $\lambda $ is related to all remaining joints. Each of which can potentially exclude partitions of the full range of $\lambda $. The set of admissible parameters $\mathcal{A}$ must consider all joint limits and results from the intersection
of the n individual joint-related portions.

$$\begin{array}{c}\hfill \mathcal{A}=\bigcap _{i=1}^{n}{\mathcal{A}}_{i}\phantom{\rule{0.277778em}{0ex}},\end{array}$$

#### 3.5.1. Shoulder-Wrist Distance ${r}_{\mathrm{ref}}$

Elbow joint 4 directly limits the parameter ${r}_{\mathrm{ref}}$. Solving (43d) for ${r}_{\mathrm{ref}}$ gives
and defines the lower and upper bounds
with the upper boundary ${r}_{\mathrm{ref}}\left(0\right)$ being the stretched out configuration of the robot. This defines
as the admissible parameter set w.r.t. joint 4.

$$\begin{array}{c}\hfill {r}_{\mathrm{ref}}\left({q}_{4}\right):=\sqrt{{r}_{SE}^{2}+{r}_{EW}^{2}-2{r}_{SE}{r}_{EW}cos\left(\pi -{q}_{4}\right)}\end{array}$$

$$\begin{array}{c}\hfill \begin{array}{ccc}{r}_{\mathrm{ref}}\left({q}_{4}^{\mathrm{max}}\right)& \le {r}_{\mathrm{ref}}\le & {r}_{\mathrm{ref}}\left(0\right)\end{array}\end{array}$$

$$\begin{array}{c}\hfill {\mathcal{A}}_{4}:=\left\{(\mathit{p},\lambda )\in \mathcal{P}\phantom{\rule{1.em}{0ex}}|\phantom{\rule{1.em}{0ex}}\sqrt{{r}_{SE}^{2}+{r}_{EW}^{2}-2{r}_{SE}{r}_{EW}cos\left(\pi -{q}_{4}^{\mathrm{max}}\right)}\le {r}_{\mathrm{ref}}\le {r}_{SE}+{r}_{EW}\right\}\end{array}$$

#### 3.5.2. Null Space Parameter $\lambda $

All remaining joints, i.e., shoulder joints $\{{q}_{1},{q}_{2},{q}_{3}\}$ and wrist joints $\{{q}_{5},{q}_{6},{q}_{7}\}$, limit parts of the null space parameter $\lambda $. The 4-quadrant $\mathrm{atan}2\left(\phantom{\rule{0.166667em}{0ex}}\xb7\phantom{\rule{0.166667em}{0ex}}\right)$ functions from (43), however, are difficult to symbolically rewrite in terms of $\lambda $ due to there piecewise definition. To circumvent this, we further introduce IK mappings that calculate the absolute joint angles. We define the extraction map of absolute values of the Euler sequence $|{\mathrm{eul}}_{ZYZ}|:\mathrm{SE}\left(3\right)\to {\mathbb{R}}_{+}^{3}$ as
which is used to find the absolute angles of the shoulder and wrist joints
analogously to the mapping ${\mathrm{eul}}_{ZYZ}$ from the previous Section 3.3. See Appendix C for the full definition of the absolute valued IK functions. Note that the mappings admit the same symmetrical assignments between the shoulder and wrist portion as the actual IK mapping discussed in Section 3.3.5.

$$\begin{array}{c}\hfill |{\mathrm{eul}}_{ZYZ}|:\phantom{\rule{1.em}{0ex}}\mathrm{SE}\left(3\right)\to {\mathbb{R}}_{+}^{3},\phantom{\rule{1.em}{0ex}}{\mathit{A}}_{zyz}\mapsto \left[\begin{array}{c}arccos\left(\frac{{\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(3,1)}}{sin\left(arccos\left({\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(3,3)}\right)\right)}\right)\\ arccos\left({\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(3,3)}\right)\\ arccos\left(\frac{-{\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(1,3)}}{sin\left(arccos\left({\left[\phantom{\int}{\mathit{A}}_{zyz}\left(\mathit{z}\right)\right]}_{(3,3)}\right)\right)}\right)\end{array}\right]=:\left[\begin{array}{c}|\gamma |\\ |\beta |\\ |\psi |\end{array}\right]\end{array}$$

$$\begin{array}{cc}\hfill \left[\begin{array}{c}|{q}_{1}+{\gamma}_{\mathrm{ref}}|\\ |{q}_{2}|\\ |{q}_{3}|\end{array}\right](\mathit{p},\lambda )& :=|{\mathrm{eul}}_{ZYZ}|\left({\mathit{A}}_{3B}(\mathit{p},\lambda )\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left[\begin{array}{c}|{q}_{5}|\\ |{q}_{6}|\\ |{q}_{7}+{\psi}_{\mathrm{EE}}|\end{array}\right](\mathit{p},\lambda )& :=|{\mathrm{eul}}_{ZYZ}|\left({\mathit{A}}_{74}(\mathit{p},\lambda )\right)\hfill \end{array}$$

Due to the concise formulations of the IK (55a), all functions can be solved for the null space parameter $\lambda $. By substituting the joint parameters with their respective limit, closed-form expressions are formed that deliver ${s}_{i}$ candidates for lambda ranges
according to the $i=[1,7]$ joints. For ${q}_{2}$ and ${q}_{6}$, the respective middle joints of the shoulder and wrist angle tuples $({q}_{1},{q}_{2},{q}_{3})$ and $({q}_{5},{q}_{6},{q}_{7})$, we directly find ${s}_{2}={s}_{6}=2$ symmetric solutions for a positive and negative null space limit. However, solving the remaining mappings from IK (55a) for $\lambda $, results in more solution candidates. This results from the fact that, depending on the parameter configuration, these joints have the potential for cyclic behaviour for a linear increase in $\lambda $ at a fixed pose (discussed in [15]). Joints ${q}_{3}$ and ${q}_{5}$ can thus reach up to ${s}_{3}={s}_{5}=4$ null space angles marking a joint limit. The first joint ${q}_{1}$ and last joint ${q}_{7}$ do also offer up to 4 critical values for $\lambda $, however, due to additional additive parameters ${\gamma}_{\mathrm{ref}}$ and ${\psi}_{\mathrm{EE}}$ resp., it is necessary to additionally consider solutions for $|-{q}_{1}+{\gamma}_{\mathrm{ref}}|$ and $|-{q}_{7}+{\gamma}_{\mathrm{ref}}|$. These solutions are evaluated with ${\mathit{\lambda}}_{1}^{lim}(\mathit{p}{|}_{-{\gamma}_{\mathrm{ref}}},{q}_{1}^{\mathrm{max}})$ and ${\mathit{\lambda}}_{7}^{lim}(\mathit{p}{|}_{-{\psi}_{\mathrm{EE}}},{q}_{7}^{\mathrm{max}})$. Consequently, ${s}_{1}={s}_{7}=8$ solution candidates for the first and last joint of the kinematic have to be considered.

$$\begin{array}{c}\hfill {\mathit{\lambda}}_{i}^{lim}:\phantom{\rule{1.em}{0ex}}{\mathbb{R}}^{7}\times \mathbb{R}\to {\mathbb{C}}^{{s}_{i}},\phantom{\rule{1.em}{0ex}}(\mathit{p},{q}_{i}^{\mathrm{max}})\mapsto {\mathit{\lambda}}_{i}^{lim}(\mathit{p},{q}_{i}^{\mathrm{max}})\phantom{\rule{1.em}{0ex}}\forall i\in [1,7]\setminus 4\end{array}$$

Besides knowing the value of a critical limit, it is further essential for many applications to know if it expresses an upper or a lower limit. Similar to the approach in [16], the partial derivatives of the null space range mappings ${\mathit{\lambda}}_{i}^{lim}$ w.r.t. the corresponding joint angle limit are used to characterize each limit candidate. For every $\ell \in {\mathit{\lambda}}_{i}^{lim}$, the corresponding partial derivative is evaluated to decide

$$\begin{array}{c}\hfill \ell \in \left\{\begin{array}{cc}\phantom{\rule{4.pt}{0ex}}\mathrm{is}\phantom{\rule{4.pt}{0ex}}\mathrm{upper}\phantom{\rule{4.pt}{0ex}}\mathrm{limit}\phantom{\rule{4.pt}{0ex}}\hfill & \mathrm{if}\phantom{\rule{4.pt}{0ex}}\mathrm{sign}\left(\ell \right)\frac{\partial {\mathit{\lambda}}_{i}^{lim}}{\partial {q}_{i}^{\mathrm{max}}}>0\hfill \\ \phantom{\rule{4.pt}{0ex}}\mathrm{is}\phantom{\rule{4.pt}{0ex}}\mathrm{lower}\phantom{\rule{4.pt}{0ex}}\mathrm{limit}\phantom{\rule{4.pt}{0ex}}\hfill & \mathrm{if}\phantom{\rule{4.pt}{0ex}}\mathrm{sign}\left(\ell \right)\frac{\partial {\mathit{\lambda}}_{i}^{lim}}{\partial {q}_{i}^{\mathrm{max}}}<0\hfill \\ \phantom{\rule{4.pt}{0ex}}\mathrm{is}\phantom{\rule{4.pt}{0ex}}\mathrm{no}\phantom{\rule{4.pt}{0ex}}\mathrm{limit}\phantom{\rule{4.pt}{0ex}}\hfill & \mathrm{otherwise}.\hfill \end{array}\right.\end{array}$$

In a second step, all solution candidates in ${\mathit{\lambda}}_{i}^{lim}$ are tested for validity, to define the sets of actual upper and lower null space limit angles

$$\begin{array}{cc}\hfill {\mathcal{L}}_{i}^{\mathrm{up}}\left(\mathit{p}\right)& :=\left\{\lambda \in {\mathit{\lambda}}_{i}^{lim}\phantom{\rule{0.277778em}{0ex}}|\phantom{\rule{0.277778em}{0ex}}\lambda \in \mathbb{R}\phantom{\rule{0.277778em}{0ex}}\wedge \phantom{\rule{0.277778em}{0ex}}|{\mathrm{IK}}_{i}(\mathit{p},\lambda )|={q}_{i}^{\mathrm{max}}\phantom{\rule{0.277778em}{0ex}}\wedge \phantom{\rule{0.277778em}{0ex}}\mathrm{sign}\left(\lambda \right)\frac{\partial \lambda}{\partial {q}_{i}^{\mathrm{max}}}>0\right\}\phantom{\rule{1.em}{0ex}}\forall i\in [1,7]\setminus 4\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathcal{L}}_{i}^{\mathrm{low}}\left(\mathit{p}\right)& :=\left\{\lambda \in {\mathit{\lambda}}_{i}^{lim}\phantom{\rule{0.277778em}{0ex}}|\phantom{\rule{0.277778em}{0ex}}\lambda \in \mathbb{R}\phantom{\rule{0.277778em}{0ex}}\wedge \phantom{\rule{0.277778em}{0ex}}|{\mathrm{IK}}_{i}(\mathit{p},\lambda )|={q}_{i}^{\mathrm{max}}\phantom{\rule{0.277778em}{0ex}}\wedge \phantom{\rule{0.277778em}{0ex}}\mathrm{sign}\left(\lambda \right)\frac{\partial \lambda}{\partial {q}_{i}^{\mathrm{max}}}<0\right\}\phantom{\rule{1.em}{0ex}}\forall i\in [1,7]\setminus 4.\hfill \end{array}$$

These upper and lower limits form j pairwise ranges ${\mathsf{\Lambda}}_{i,j}$ and define the remaining admissible parameter sets
related to shoulder and wrist joints.

$${\mathcal{A}}_{i}:=\left\{(\mathit{p},\lambda )\in \mathcal{P}\phantom{\rule{1.em}{0ex}}|\phantom{\rule{1.em}{0ex}}\lambda \in \bigcup _{j}{\mathsf{\Lambda}}_{i,j}\right\}\phantom{\rule{1.em}{0ex}}\forall i\in [1,7]\setminus 4\phantom{\rule{0.277778em}{0ex}},$$

The full intersection set $\mathcal{A}$, as defined in (50), may consist of several separate regions. Directly evaluating all critical values of $\lambda $ is especially interesting whenever planning a continuous path in task space. We apply the admissible parameter space in application Section 5.1.3 and Section 5.2.2. All full function definitions of the limit candidates ${\mathit{\lambda}}_{i}^{lim}$ are summarized in Appendix D.

## 4. Results

This section contains an evaluation of the task space manipulability framework developed in this work. We first give a run-time comparison to show the computational advantage of our closed-form expression in comparison to general numerical solutions. We show that uniform sampling in the new parameter space results in a superior probability distribution of the manipulability in comparison with direct sampling in joint space. Further, the sensitivity of the manipulability measure w.r.t. the parameters is analyzed.

#### 4.1. Accuracy

#### 4.2. Run-Time Comparison

Complete evaluation of the closed-form IK and M mapping as single expressions allows automatic code generation of the symbolic expressions with e.g., the MATLAB Coder™ toolbox. These expressions allow array operations, or vectorization in MATLAB, such that a large number of solutions can be evaluated simultaneously. This leads to a significant computational boost, compared to algorithms that rely on matrix arithmetic and consequently have to sequentially evaluate multiple evaluations in programmatic loops. This property makes it further straightforward to calculate the task space manipulability of multiple samples on a powerful Graphics Processing Unit (GPU). The following run-time comparison was conducted in MATLAB 2019a, on a computer with Intel(R) Core(TM) i9-9900X CPU @ $3.50$ $\mathrm{G}$$\mathrm{Hz}$, 128 $\mathrm{G}$ memory, and a NVIDIA TITAN V graphics card.

Besides different versions of our presented algorithm, we also tested the run-time of [15], representing typical analytical IK approaches in the literature, and the nonlinear optimization-based IK algorithm from the Robotics System Toolbox™ for MATLAB, representing iterative solver approaches. Figure 5 shows a run-time comparison of calculating the manipulability measures
of N random samples ${\mathit{p}}_{n}$.

$$\begin{array}{c}\hfill {\mu}_{n}:=(\mathrm{M}\circ \mathrm{IK})\left({\mathit{p}}_{n}\right),\phantom{\rule{1.em}{0ex}}\mathrm{for}\phantom{\rule{4.pt}{0ex}}n=[1,N]\end{array}$$

As expected, the iterative optimization algorithm (applying BFGS Gradient Projection with solution tolerance 0.01) is the computationally most expensive solution method. It required an average of 37 iterations per pose and did not allow for direct selection of the arm angle. Two orders of magnitude faster and in addition producing exact inverse solutions are the analytical IK solvers found in the literature. They rely on matrix calculus and thus a for-loop structure for evaluation of multiple poses.

Our approach, which is entirely reduced to direct individual expressions, is over 10 times faster when implemented with the same conventional for-loop structure. Already for 200 evaluated samples, a simultaneous vectorized evaluation achieves another performance increase of factor 10. At the maximal evaluated amount of 10

^{7}samples, vectorization enables an even 50 times faster computation, compared to the implementation using for-loops. The advantage of calculating the task space manipulability on a GPU starts at an amount of 10^{5}sample points. For a smaller number of samples, the overhead of initializing the data on the GPU does not pay off. Processing 10^{7}samples, calculations on the GPU are 10 times faster then vectorized treatment on the CPU, and even 700 times faster than for conventional loop structures.Note that all time measurements include the generation of random samples on the CPU and GPU respectively.Considering real-time application for a robot with a typical 1 $\mathrm{k}$$\mathrm{Hz}$ sampling rate, our approach allows evaluation of 1000 end-effector poses for their task space manipulability.

#### 4.3. Sampling in Task Space

Not having to calculate the IK in an iterative fashion as done by CLIK solvers, evaluating manipulability directly in task space is computationally not much more expensive than directly calculating manipulability in joint space. However, choosing a different space for sampling random poses do have an influence on the probability distribution of resulting manipulability measures.

Before analyzing this difference, we first discuss the used sampling strategies. For a fair comparison, we cover the entire space without consideration of possible limits on the individual joints or parameters.

Let $u\in \mathbb{R}$ be a random number drawn from a uniform distribution in the range of $[0,1]$. Uniform sampling in joint space is straightforward with
due to the independence of its joints $\mathit{q}\in {\mathbb{R}}^{7}$.

$$\begin{array}{cc}\hfill {q}_{i}^{\mathrm{uniform}}& :\phantom{\rule{1.em}{0ex}}\mathbb{R}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}u\mapsto -\pi +2\pi u\phantom{\rule{1.em}{0ex}}\phantom{\rule{1.em}{0ex}}\forall i\in [1,7]\hfill \end{array}$$

For a random end-effector pose sample $({\mathit{p}}^{\mathrm{red}},\lambda )={[{r}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},\lambda ]}^{\top}$ from the parameter space, one can choose the same strategy
with respective scaling for the linear parameter ${r}_{\mathrm{ref}}$. However, this naive form of sampling does not lead to a uniform distribution of samples in the task space SE(3), due to the interdependence of the coordinate components.

$$\begin{array}{cc}\hfill {p}_{1}^{\mathrm{naive}}& :\phantom{\rule{1.em}{0ex}}\mathbb{R}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}u\mapsto {r}_{\mathrm{ref}}^{\mathrm{min}}+({r}_{\mathrm{ref}}^{\mathrm{max}}-{r}_{\mathrm{ref}}^{\mathrm{min}})u\hfill \end{array}$$

$$\begin{array}{cc}\hfill {p}_{i}^{\mathrm{naive}}& :\phantom{\rule{1.em}{0ex}}\mathbb{R}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}u\mapsto -\pi +2\pi u\phantom{\rule{1.em}{0ex}}\phantom{\rule{1.em}{0ex}}\forall i\in [2,5]\hfill \end{array}$$

Recall that the first two parameters ${r}_{\mathrm{ref}}$ and ${\beta}_{\mathrm{ref}}$ describe translation in polar coordinates. Unlike in Cartesian coordinates, the base vectors are not constant. Consequently, direct uniform sampling of the radial coordinate ${r}_{\mathrm{ref}}$, leads to sparser sampling further from the origin, due to the increasing circumference proportionally to ${r}_{\mathrm{ref}}$. Proper uniform sampling of the translational part can be achieved by

$$\begin{array}{cc}\hfill {p}_{1}^{\mathrm{uniform}}& :\phantom{\rule{1.em}{0ex}}\mathbb{R}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}u\mapsto \sqrt{{\left({r}_{\mathrm{ref}}^{\mathrm{min}}\right)}^{2}+\left({\left({r}_{\mathrm{ref}}^{\mathrm{max}}\right)}^{2}-{\left({r}_{\mathrm{ref}}^{\mathrm{min}}\right)}^{2}\right)u}\hfill \end{array}$$

$$\begin{array}{cc}\hfill {p}_{2}^{\mathrm{uniform}}& :\phantom{\rule{1.em}{0ex}}\mathbb{R}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}u\mapsto -\pi +2\pi u.\hfill \end{array}$$

An efficient method of uniform sampling on SO(3), i.e., 3D orientations, is proposed by Kuffner [43]. Uniform sampling of the individual angles of the Euler sequence results in a bias towards the polar regions of the unit sphere. He proposes to use an arctan function on the second angle to compensate for this bias. Uniform sampling of the end-effector orientation, parametrized by ${\gamma}_{\mathrm{EE}}$ and ${\beta}_{\mathrm{EE}}$, is thus achieved with

$$\begin{array}{cc}\hfill {p}_{3}^{\mathrm{uniform}}& :\phantom{\rule{1.em}{0ex}}\mathbb{R}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}u\mapsto -\pi +2\pi u\hfill \end{array}$$

$$\begin{array}{cc}\hfill {p}_{4}^{\mathrm{uniform}}& :\phantom{\rule{1.em}{0ex}}\mathbb{R}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}u\mapsto arccos\left(1-2u\right).\hfill \end{array}$$

The last portion in our parameter tuple $(\mathit{p},\lambda )$ is the null space parameter $\lambda $ that is independent and thus remains
Figure 6 illustrates the uniform sampling of the task space applying the uniform sampling strategy (63).

$$\begin{array}{cc}\hfill {p}_{5}^{\mathrm{uniform}}& :\phantom{\rule{1.em}{0ex}}\mathbb{R}\to \mathbb{R},\phantom{\rule{1.em}{0ex}}u\mapsto -\pi +2\pi u.\hfill \end{array}$$

The above-discussed sampling strategies are now analyzed in conjunction with their respective mapping to the manipulability measure. Figure 7 shows the approximated cumulative distribution function (CDF) of manipulability resulting from 10

^{7}random samples. It shows that random sampling in joint space according to (61) is more likely to result in a joint configuration with poor manipulability of the robot. Uniform sampling in parameter space (63) produces much fewer joint configurations with poor manipulability, while at the same time more configurations with high manipulability. Naive sampling in parameter space (61) performs similarly good in the low manipulability section. However, it produces also fewer configurations with high manipulability. Considering a conventional 6-DOF robot, i.e., fixing the null space parameter $\lambda $ to 0 or $\pi $, results in a slightly better probability density function (PDF) than for the discussed 7-DOF mechanism. This is a surprising result, as it is always argued that the redundancy improves manipulability. While it is true that the additional DOF has the potential to improve performance measures, poor exploitation might achieve the opposite.Kuhlemann et al. [44] showed in different use-cases that the seventh DOF of the KUKA LBR iiwa increased the average dexterity by 16% in comparison to a conventional 6 DOF KUKA KR 10. Both the shortcomings of the naive parameter sampling strategy and the apparent advantage of the 6-DOF mechanism are discussed in Section 4.4.4.

The average normalized manipulabilities achieved are 37% for uniform joint space sampling, 43% for naive parameter space sampling, and 50% for uniform sampling in parameter space. All numbers are w.r.t. the maximal encountered manipulability.

#### 4.4. Parameter Sensitivity Analysis of Manipulability in Parameter Space

The sensitivity of the task space manipulability w.r.t. its parameters are analyzed by generating 10

^{7}random samples according to (63). These samples represent a uniform distribution of task space configurations. Figure 8 shows the bi-variate histograms of manipulability $\mu ({\mathit{p}}^{\mathrm{red}},\lambda )$ w.r.t. to the individual parameters.Colors approximate the PDF of $\mu ({r}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},\lambda )$ at fixed values of the respective parameter. For all parameter values we find unimodal distributions, i.e., distributions with a single maxima.

#### 4.4.1. Translation Parameters ${r}_{\mathrm{ref}}$ and ${\beta}_{\mathrm{ref}}$

The PDF of $\mu $ along the shoulder-wrist distance ${r}_{\mathrm{ref}}$ shows a preferred value of $0.57$ $\mathrm{m}$. Although a manipulability optimizing configuration cannot be found at this given value, the mode of the corresponding PDF, i.e., its local maxima, has the highest value of manipulability. Further, the probability of good manipulation is decreasing with ${r}_{\mathrm{ref}}$ towards the workspace singularity, i.e., a fully stretched arm of robot configuration.

The polar angle ${\beta}_{\mathrm{ref}}$ between the vertical and the shoulder-wrist reference vector has the highest manipulability mode at $\frac{\pi}{2}\phantom{\rule{0.166667em}{0ex}}$$\mathrm{rad}$, although manipulability maximizing configurations are not found. For values approaching 0 and $\pi \phantom{\rule{0.166667em}{0ex}}$$\mathrm{rad}$, i.e., placing the wrist in line with the axis of base joint ${q}_{1}$, typically cause so-called shoulder singularities on conventional 6-DOF robots. While the 7-DOF kinematics do not necessarily result in a kinematic singularity, high manipulability is not possible either.

#### 4.4.2. Orientation Parameters ${\gamma}_{\mathrm{EE}}$ and ${\beta}_{\mathrm{EE}}$

The third parameter ${\gamma}_{\mathrm{EE}}$, which describes a rotation around the shoulder-wrist vector, is the only one that seems to cause little variation in the manipulability PDF and does not allow a conclusion over a preferred configuration.

The consecutive rotation angle ${\beta}_{\mathrm{EE}}$ shows a similar influence as the reference angle ${\beta}_{\mathrm{ref}}$. However, the mode of these PDFs is less prominent and tendentiously marks a lower manipulability.

#### 4.4.3. Null Space Parameter $\lambda $

The null space parameter $\lambda $ reveals that the highest manipulabilities can be found at $\lambda =\{0,\pm \pi \}$$\mathrm{rad}$, i.e., the conventional upper and lower elbow configuration of 6-DOF kinematics. Although missing the absolute top manipulability poses, only small deviations of about $\pm 0.1$ $\mathrm{rad}$ from these configurations result in a decrease of the manipulability mode of 25%, i.e., from $0.8$ to $0.6$. Better modes are found at $\lambda =\{\pm \frac{\pi}{2}\}$$\mathrm{rad}$. Not only is their peak at a slightly higher manipulability of $0.85$, but they are also less sensitive to a parameter change in $\lambda $. The latter is especially valuable for staying agile during unforeseen events.

#### 4.4.4. Discussion of Manipulability in Different Sampling Strategies

The different sampling strategies discussed in Section 4.3 result in differences in the approximated CDFs, cf. Figure 7.

#### Naive vs. Uniformly Distributed Sampling

The difference between naive and uniform sampling solely affects parameters ${r}_{\mathrm{ref}}$ and ${\beta}_{\mathrm{EE}}$. That is, the corresponding uniform sampling functions (63a) and (63d) correct the biases of the radial coordinate ${r}_{\mathrm{ref}}$ towards the origin, and the orientation towards the pole regions with azimuthal angle ${\beta}_{\mathrm{EE}}=\{0,\pi \}$$\mathrm{rad}$, respectively. Consequently, these regions are sparser sampled in the uniformly distributed strategy. While this correction is negligible for the range of ${r}_{\mathrm{ref}}$ in this particular robot example, the improvement of the CDF towards better manipulability stems from a sparser sampling of the boundary regions of ${\beta}_{\mathrm{EE}}$. Because exactly these boundaries lack high manipulability poses, as visible in the according bi-variate histogram in Figure 8.

#### 6-DOF vs. 7-DOF Kinematics

According to Section 4.4.3, the apparent slight advantage of uniform distributed sampling of a conventional 6-DOF robot only holds for the over-all manipulability distribution illustrated in Figure 7. The parameter-specific histogram w.r.t. to the arm angle $\lambda $ in Figure 8, on the other hand, reveals that the conventional 6-DOF configurations $\lambda =\{0,\pm \pi \}$$\mathrm{rad}$ do have a good manipulability distribution, but $\lambda =\{\pm \frac{\pi}{2}\}$$\mathrm{rad}$ configurations are preferable. A 7-DOF kinematics hence not only enables agile adaptation of the kinematic structure, but also contains arm angles that have a better PDFs of manipulability than its 6-DOF counterpart. At the same time, other arm angles show higher variability in the histogram and are more prone to decrease performance. An increase in manipulability by the additional DOF thus relies on a well-conceived utilization of such.

#### 4.5. Number of Local Optima

While the analysis shown in the previous section gives insight in the probability distribution of the manipulability measure, it does not allow conclusions on how manipulability changes along the null space. Table 1 lists the number of local optima for a given end-effector pose. It shows that 80% of the robot poses do not have a unique manipulability maximizing null space solution, but up to 4 distinct optima.

## 5. Applications

Two application directions that benefit from the closed-form expressions of the task space manipulability are outlined in this section. First, we demonstrate how global optimization problems can be formulated that profit from massive multi-start point pre-evaluation. Second, we propose a novel way of real-time redundancy resolution on the position level, which enables global manipulability optimization of single poses as well as for provided end-effector trajectories in SE(3).

#### 5.1. Optimal Robot Placement

The analytic results from the previous Section 3 allow formulating interesting questions in terms of optimization problems. We consider the problem of optimal placement of the robot.

#### 5.1.1. Best Overall Robot Configuration

The most basic optimization problem we considere is the question of finding the best overall robot configuration w.r.t. to manipulability. Mathematically, this problem can be stated as an unconstrained optimization problem
directly finding the optimal joint configuration w.r.t. the manipulability measure. The global optimum is found with a multi-start strategy [45], where random samples are drawn from the admissible parameter space $\mathcal{P}$ and used as starting points for local optimizations. Figure 9, left side, shows the results of such a global optimization process with 1000 starting points. Note that the same problem can be formulated in parameter space and does yield the same result. All optimization iterations result in one of 8 equally good global optima, which can be reduced to 4 solutions due to symmetry of the shoulder joint. They further describe configurations in the pure $xz$-plane with $\lambda \in \{0,\pm 180\}$${}^{\circ}$. This is equivalent to the configurations achievable by a conventional 6-DOF robot.

$$\begin{array}{c}\hfill \underset{\mathit{q}}{\mathrm{maximize}}\phantom{\rule{1.em}{0ex}}\mu \left(\mathit{q}\right)\end{array}$$

#### 5.1.2. Best Robot Configuration for Multiple Task Poses

In industrial settings, robots are often required to work at a certain number $i\in {\mathbb{Z}}^{+}$ of different task poses ${\mathit{z}}_{i}$. While the relative distances $\Delta {\mathit{z}}_{i}={\mathit{z}}_{i}-{\mathit{z}}_{1}$ between this poses is defined, the optimal placement of the robot can be found by solving the optimization problem
to find the relative pose $\mathit{z}$ that maximizes the average manipulability of all i poses. Solving this problem directly, results in an infinite number of global poses. These solutions are rotationally symmetric around the base joint ${q}_{1}$ as well as the last joint ${q}_{7}$, as both these joints do not have an influence on the manipulability of the 7-DOF robot structure at consideration (discussed in Section 3.1).

$$\begin{array}{c}\hfill \underset{\mathit{z},\lambda}{\mathrm{maximize}}\phantom{\rule{1.em}{0ex}}\sum _{i}(\mathrm{M}\circ \mathrm{IK}\circ \mathrm{TSP})(\mathit{z}+\Delta {\mathit{z}}_{i},\lambda )\end{array}$$

The complexity of the optimization problem, as well as the number of global optima, can be drastically reduced by formulating the same problem in the lower dimensional parameter space
where ${\mathit{p}}_{i}=\mathrm{TSP}\left({\mathit{z}}_{i}\right)$. The resulting optimal $\mathit{p}$ can eventually be mapped to the corresponding task space parameter $\mathit{z}=\mathrm{TSS}\left(\mathit{p}\right)$. This result is useful for deciding on how to mount a robot relative to a given set of task poses ${\mathit{z}}_{i}$, or recalculating it online if task poses are time-variant and the robot structure is e.g., mounted on a mobile platform.

$$\begin{array}{c}\hfill \underset{\mathit{p},\lambda}{\mathrm{maximize}}\phantom{\rule{1.em}{0ex}}\sum _{i}(\mathrm{M}\circ \mathrm{IK})(\mathit{p}+\Delta {\mathit{p}}_{i},\lambda )\end{array}$$

#### 5.1.3. Optimizing Robot Mounting Positions Regarding a Workspace Envelope

In a modern scenario where robots are not only expected to repetitively execute the same tasks, a set of pre-defined task poses cannot always be formulated. But it is rather necessary for the robot to perform well in a defined workspace volume, e.g., given as a cubical volume $V=[-\Delta \frac{x}{2},+\Delta \frac{x}{2}]\times [-\Delta \frac{y}{2},+\Delta \frac{y}{2}]\times [0,+\Delta z]$. Due to all mappings involved in the task space manipulability being continuous, formulating a cost function for such a volume can be done using Fubini’s theorem [46]. It allows calculation of the volume integral as triple integral. The objective for this optimization problem in task space reads
where the optimal task space volume origin ${\mathit{z}}_{0}$ needs to be found. This optimization can again be transformed to the lower dimensional parameter space
with the condition that the whole Volume projected to parameter space must be within the set of admissible parameters. Figure 9, right side, shows the result of such a global optimization.

$$\begin{array}{c}\begin{array}{cc}\underset{{\mathit{z}}_{0},\lambda}{\mathrm{maximize}}\hfill & \underset{V}{\phantom{\rule{0.277778em}{0ex}}\int \int \int \phantom{\rule{0.277778em}{0ex}}}(\mathrm{M}\circ \mathrm{IK}\circ \mathrm{TSP})({\mathit{z}}_{0}+\mathit{z}(x,y,z),\lambda )\phantom{\rule{0.166667em}{0ex}}\mathrm{d}x\phantom{\rule{0.166667em}{0ex}}\mathrm{d}y\phantom{\rule{0.166667em}{0ex}}\mathrm{d}z\hfill \\ \mathrm{subject}\phantom{\rule{4.pt}{0ex}}\mathrm{to}\phantom{\rule{4.pt}{0ex}}\hfill & \phantom{\rule{1.em}{0ex}}\phantom{\rule{1.em}{0ex}}\mathrm{TSP}\left({\mathit{z}}_{0},+\mathit{z}(x,y,z),\lambda \right)\in \mathcal{A},\hfill \end{array}\hfill \end{array}$$

$$\begin{array}{c}\begin{array}{cc}\underset{{\mathit{p}}_{0},\lambda}{\mathrm{maximize}\phantom{\rule{4pt}{0ex}}}\hfill & \underset{V}{\phantom{\rule{0.277778em}{0ex}}\int \int \int \phantom{\rule{0.277778em}{0ex}}}(\mathrm{M}\circ \mathrm{IK}\circ \mathrm{TSP})(\mathrm{TSS}\left({\mathit{p}}_{0}\right)+\mathit{z}(x,y,z),\lambda )\phantom{\rule{0.166667em}{0ex}}\mathrm{d}x\phantom{\rule{0.166667em}{0ex}}\mathrm{d}y\phantom{\rule{0.166667em}{0ex}}\mathrm{d}z\hfill \\ \mathrm{subject}\phantom{\rule{4.pt}{0ex}}\mathrm{to}\phantom{\rule{4.pt}{0ex}}\hfill & \phantom{\rule{1.em}{0ex}}\phantom{\rule{1.em}{0ex}}\mathrm{TSP}\left(\mathrm{TSS}({\mathit{p}}_{0},\lambda )+\mathit{z}(x,y,z),\lambda \right)\in \mathcal{A}\hfill \end{array}\hfill \end{array}$$

#### 5.2. Redundancy Resolution

Solving for optimal robot poses online is essential for a robot to stay agile at all times. We demonstrate how the task space manipulability expressions developed in this work can be applied for real-time global manipulability optimization of single poses as well as full trajectories. The following run-time evaluations were conducted in MATLAB 2019a, on a computer with Intel(R) Core(TM) i3-7100 CPU @ $3.9$ $\mathrm{G}$$\mathrm{Hz}$ and 32 $\mathrm{GB}$ memory.

#### 5.2.1. Redundancy Resolution for Global Manipulability Optima

Approaches typically found in the literature focus on local optimization of manipulability based on local gradient information. Analysis of the number of existing local optima from Section 4.5, however, revealed that only 20% of end-effector poses have a unique global optimum. The computational advantage of our approach permits evaluating the manipulability of many poses simultaneously. Given a current robot pose $\mathit{z}$, our framework makes it possible to not only locally improve manipulability, but solve
with a representative number of null space solution at a high resolution in real-time. Given the information of this greedy optimization strategy, the close-to-global optimum configuration can simply be picked. Solving for global optima in $0.25$ $\mathrm{m}$$\mathrm{s}$ at a resolution of 1° for $\lambda $ enables application at typical robot sampling rates of 1 $\mathrm{k}$$\mathrm{Hz}$.

$$\begin{array}{c}\hfill \begin{array}{cc}\underset{\lambda}{\mathrm{arg}\phantom{\rule{4.pt}{0ex}}\mathrm{max}\phantom{\rule{4pt}{0ex}}}& (\mathrm{M}\circ \mathrm{IK}\circ \mathrm{TSP})(\mathit{z},\lambda )\end{array}\end{array}$$

Figure 10 shows manipulability of the full null space at a particular configuration.

This is an example of a pose with 4 local optima. If the current configuration of the robot is the solution for the given pose with the null space parameter $\lambda \in [0,85]$${}^{\circ}$, a local optimization will only drive the redundancy resolution into a sub-optimal minima. In contrast, our approach allows finding the globally best configuration w.r.t. the admissible parameter space.

#### 5.2.2. Optimizing Null Space Solution of Given End-Effector Trajectory

Several approaches can be found in the literature that maximize either the volume of a manipulability ellipsoid [31,47,48,49] or a predefined shape of the ellipsoid [33]. Yet all these approaches consider only local optimization.

Finding the best joint configuration for a given pose in task space simplifies to a 1D line search. However, given a full path in SE(3) it is also possible to find an optimal elbow trajectory that maximizes, e.g., the average manipulability while avoiding getting trapped in regions of poor manipulability. Note that a real manipulation task relies on a sophisticated path planner, capable of generating task-related paths that avoid obstacles while potentially fulfilling additional criteria. Knowledge about the task space manipulability, e.g., provided by our approach, may even be exploited by such a planner. This is, however, not the direct scope of this work. Instead, for a minimal working example, we use direct interpolation
between two poses as a simple path planner. Given are two random poses as depicted in Figure 11 to the left. On the right side of Figure 11, a contour plot of the manipulability of the full null space along the trajectory is shown. Red lines indicate not passable values in the null space due to joint limits, cf. Section 3.5. The blue line marks the trajectory that results from local optimization of manipulability. Note that at $s=0.4$, the local optimization hits a joint limit of ${q}_{2}$. We stopped the line here, because it depends on a potential strategy for joint limit avoidance, which is not the scope of this work. A global optimization strategy that has predictive knowledge of the full null space development can exploit an initially sub-optimal path toward negative values of $\lambda $ to circumvent the region of poor manipulability between $s=[0.6,1]$. But this is usually not feasible in an online scenario with conventional global optimization strategies.

$$\begin{array}{c}\hfill \mathit{p}\left(s\right)=s{\mathit{p}}^{\mathrm{start}}+(s-1){\mathit{p}}^{\mathrm{end}}\phantom{\rule{1.em}{0ex}}\mathrm{with}\phantom{\rule{1.em}{0ex}}s=[0,1]\end{array}$$

The computational advantage of our strategy, as seen in Figure 5, allows the computation of such a map with, e.g., a resolution of 100 steps in both parameters, s and $\lambda $, in under 5 $\mathrm{m}$$\mathrm{s}$. In combination with an online trajectory generator directly on SE(3), e.g., [50], this qualifies our task space manipulability approach to be used for predictive online manipulability optimization, e.g., with a receding horizon.

## 6. Conclusions

Today’s demand for adaptive and reactive robot behaviour requires sustaining the agility of a kinematic structure at all times. While manipulability is a common metric in robot research to quantify the capabilities of a robot at a given joint configuration, the robot task is directly defined in end-effector poses, which allows for multiple possible solutions. Unlike common metrics, which do not include the robot IK, a task space manipulability formulation is required to directly map an end-effector pose together with its null space solution onto the manipulability metric.

To achieve reactive robot behaviour, optimization of the null space at given poses must be performed online. In general, this requires efficient evaluation of a large number of configurations, especially in the case of redundant robots. In this work we developed a new closed-form approach for calculating manipulability directly from task space poses, for a redundant 7-DOF S-R-S serial robot kinematics. A novel parametrization of the task- and null space leads to concise IK, as well as admissible parameter mappings, which show symmetry in the structures of their individual expressions. Analysis of the resulting task space manipulability further revealed that the majority of end-effector poses do not have a unique, manipulability-maximizing null space solution. We thus argue that local optimization of the manipulability measure is not sufficient. A global optimization at high sampling frequencies, however, is not feasible with current approaches in the literature. The entire composition of the task space manipulability map proposed in this work allows for efficient array operations that can be exploited in vector-optimized programming languages, as well as GPU computing. Consequently, the simultaneous computation of a large number of poses in real-time is made possible. Our method, therefore, enables global online optimization of manipulability for single poses and even full SE(3) trajectories.

Future work will focus on further application development of our framework. Combining our task space manipulability approach with online planners opens an interesting field of predictive redundancy resolution for global manipulability optimization.

## Author Contributions

Conceptualization, G.H.; methodology, G.H.; software, G.H.; validation, G.H.; formal analysis, G.H.; investigation, G.H.; resources, D.W.; data curation, G.H.; writing–original draft preparation, G.H. and D.W.; writing–review and editing, G.H. and D.W.; visualization, G.H.; supervision, D.W.; project administration, D.W.; funding acquisition, D.W.

## Funding

The research leading to these results has received funding from the Horizon 2020 research and innovation programme under grant agreement №820742 of the project ”HR-Recycler - Hybrid Human-Robot RECYcling plant for electriCal and eLEctRonic equipment”.

## Acknowledgments

The authors would like to thank Adam Horvath, Thomas Hartmann and Christian Ritter for discussions and initial implementations of the results.

## Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

## Abbreviations

The following abbreviations are used in this manuscript:

CDF | cumulative distribution function |

CLIK | Closed-Loop Inverse Kinematic |

CPU | Central Processing Unit |

DOF | degree of freedom |

FK | Forward Kinematic |

GPU | Graphics Processing Unit |

IK | Inverse Kinematic |

M | Manipulability |

probability density function | |

PR | parameter requirements |

SIMD | Single Instruction Multiple Data |

S-R-S | Spherical-Revolute-Spherical |

TCP | tool center point |

TSP | Task Space Projection |

TSS | Task Space Surjection |

## Appendix A. Manipulability

The full manipulability map M, discussed in Section 3.1, is given with $\mu \left(\mathit{q}\right)=\sqrt{det\left({}_{T}{\mathit{J}}_{T}{\mathit{J}}^{\top}\phantom{\int}\right)}$. Note that the Jacobian matrices are formulated w.r.t. the tool frame T at the end-effector. The full symbolic expression for the determinant of the ${\mathbb{R}}^{6\times 6}$ matrix results in the trigonometric polynomial

$$\begin{array}{c}\mu {\left(\mathit{q}\right)}^{2}:=2{{r}_{SE}}^{2}\phantom{\rule{0.166667em}{0ex}}{{r}_{EW}}^{2}\phantom{\rule{0.166667em}{0ex}}\left({\mathrm{c}\left({q}_{4}\right)}^{2}-1\right)\phantom{\rule{0.166667em}{0ex}}(\hfill \\ +{{r}_{SE}}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({q}_{5}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({q}_{6}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}\left({\mathrm{c}\left({q}_{2}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}+{\mathrm{c}\left({q}_{4}\right)}^{2}-\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({q}_{2}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({q}_{4}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}-1\right)\\ +{{r}_{EW}}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({q}_{2}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({q}_{3}\right)}^{2}\left({\mathrm{c}\left({q}_{4}\right)}^{2}+{\mathrm{c}\left({q}_{6}\right)}^{2}-{\mathrm{c}\left({q}_{4}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({q}_{6}\right)}^{2}-1\right)\\ +\left({{r}_{SE}}^{2}+2\phantom{\rule{0.166667em}{0ex}}{r}_{SE}\phantom{\rule{0.166667em}{0ex}}{r}_{EW}\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{4}\right)\right)\left({\mathrm{c}\left({q}_{2}\right)}^{2}+{\mathrm{c}\left({q}_{6}\right)}^{2}-{\mathrm{c}\left({q}_{2}\right)}^{2}{\mathrm{c}\left({q}_{6}\right)}^{2}-1\right)\\ +\left({{r}_{SE}}^{2}\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({q}_{4}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({q}_{6}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{4}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{5}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{6}\right)\phantom{\rule{0.166667em}{0ex}}+{r}_{SE}\phantom{\rule{0.166667em}{0ex}}{r}_{EW}\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({q}_{4}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({q}_{6}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{5}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{6}\right)\right)\left(1-{\mathrm{c}\left({q}_{2}\right)}^{2}\right)\\ +\left(\phantom{\rule{0.277778em}{0ex}}\left({r}_{SE}\phantom{\rule{0.166667em}{0ex}}{r}_{EW}\phantom{\rule{0.166667em}{0ex}}+{{r}_{EW}}^{2}\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{4}\right)\right)\mathrm{s}\left({q}_{2}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({q}_{4}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{2}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({q}_{3}\right)\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.277778em}{0ex}}+{{r}_{EW}}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({q}_{2}\right)}^{2}\phantom{\rule{0.277778em}{0ex}}-{{r}_{EW}}^{2}\phantom{\rule{0.166667em}{0ex}}\right)\left(1-{\mathrm{c}\left({q}_{6}\right)}^{2}\right)\phantom{\rule{0.277778em}{0ex}}\\ \hfill ).\end{array}$$

Note that the manipulability measure $\mu $ does not depend on joints ${q}_{1}$ nor ${q}_{7}$. Further, the link lengths ${}_{}{\mathit{r}}_{BS}$ and ${}_{}{\mathit{r}}_{WT}$ do not affect manipulability.

## Appendix B. Inverse Kinematic Functions from (43)

$$\begin{array}{cc}\hfill {q}_{1}(\mathit{p},\lambda )& :={\gamma}_{\mathrm{ref}}+\mathrm{atan}2\left(-\mathrm{s}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right),\phantom{|}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)-\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {q}_{2}(\mathit{p},\lambda )& :=\mathrm{acos}\left(\phantom{|}\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)+\mathrm{c}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {q}_{3}(\mathit{p},\lambda )& :=\mathrm{atan}2\left(\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left(\lambda \right),\phantom{|}\mathrm{c}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)-\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {q}_{4}(\mathit{p},\lambda )& :=\pi -\mathrm{acos}\left(\frac{\frac{{{r}_{EW}}^{2}}{2}+\frac{{{r}_{SE}}^{2}}{2}-\frac{{{r}_{\mathrm{ref}}}^{2}}{2}}{{r}_{EW}\phantom{\rule{0.166667em}{0ex}}{r}_{SE}}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {q}_{5}(\mathit{p},\lambda )& :=\mathrm{atan}2\left(\mathrm{s}\left({\gamma}_{\mathrm{EE}}-\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{EE}}\right),\phantom{|}\mathrm{s}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{W}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\gamma}_{\mathrm{EE}}-\lambda \right)-\mathrm{c}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right)\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {q}_{6}(\mathit{p},\lambda )& :=\mathrm{acos}\left(\phantom{|}\mathrm{c}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{W}}\right)+\mathrm{s}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\gamma}_{\mathrm{EE}}-\lambda \right)\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill {q}_{7}(\mathit{p},\lambda )& :={\psi}_{\mathrm{EE}}+\mathrm{atan}2\left(-\mathrm{s}\left({\gamma}_{\mathrm{EE}}-\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right),\phantom{|}\mathrm{s}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{W}}\right)-\mathrm{c}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\gamma}_{\mathrm{EE}}-\lambda \right)\right)\hfill \end{array}$$

## Appendix C. Absolute Valued Inverse Kinematics Functions from (55a)

$$\begin{array}{cc}\hfill \left|{q}_{1}(\mathit{p},\lambda )\right|& :={\gamma}_{\mathrm{ref}}+\mathrm{acos}\left(\frac{\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)-\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)}{\sqrt{1-{\left(\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)+\mathrm{c}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\right)}^{2}}}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left|{q}_{2}(\mathit{p},\lambda )\right|& :=\mathrm{acos}\left(\phantom{|}\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)+\mathrm{c}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left|{q}_{3}(\mathit{p},\lambda )\right|& :=\pi -\mathrm{acos}\left(\frac{\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)-\mathrm{c}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)}{\sqrt{1-{\left(\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)+\mathrm{c}\left(\lambda \right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\right)}^{2}}}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left|{q}_{4}(\mathit{p},\lambda )\right|& :=\pi -\mathrm{acos}\left(\frac{\frac{{{r}_{EW}}^{2}}{2}+\frac{{{r}_{SE}}^{2}}{2}-\frac{{{r}_{\mathrm{ref}}}^{2}}{2}}{{r}_{EW}\phantom{\rule{0.166667em}{0ex}}{r}_{SE}}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left|{q}_{5}(\mathit{p},\lambda )\right|& :=\pi -\mathrm{acos}\left(\frac{\mathrm{c}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right)-\mathrm{s}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{W}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\gamma}_{\mathrm{EE}}-\lambda \right)}{\sqrt{1-{\left(\mathrm{c}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{W}}\right)+\mathrm{s}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\gamma}_{\mathrm{EE}}-\lambda \right)\right)}^{2}}}\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left|{q}_{6}(\mathit{p},\lambda )\right|& :=\mathrm{acos}\left(\phantom{|}\mathrm{c}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{W}}\right)+\mathrm{s}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\gamma}_{\mathrm{EE}}-\lambda \right)\right)\hfill \end{array}$$

$$\begin{array}{cc}\hfill \left|{q}_{7}(\mathit{p},\lambda )\right|& :={\psi}_{\mathrm{EE}}+\mathrm{acos}\left(\frac{\mathrm{s}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{W}}\right)-\mathrm{c}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\gamma}_{\mathrm{EE}}-\mathrm{la}\right)}{\sqrt{1-{\left(\mathrm{c}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{W}}\right)+\mathrm{s}\left({\beta}_{\mathrm{EE}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{W}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\gamma}_{\mathrm{EE}}-\mathrm{la}\right)\right)}^{2}}}\right)\hfill \end{array}$$

## Appendix D. Admissible Null Space Parameter Functions from (56)

$$\begin{array}{c}{\mathit{\lambda}}_{1}^{lim}({\theta}_{\mathrm{S}},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},{q}^{\mathrm{max}}):=\hfill \\ \hfill \left\{\begin{array}{c}\hfill \pm \left(\pi -\mathrm{acos}\left(\frac{\sqrt{{\mathrm{s}\left({\theta}_{\mathrm{S}}\right)}^{2}-{\mathrm{s}\left({\gamma}_{\mathrm{ref}}-{q}^{\mathrm{max}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)}^{2}}+\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\left(1-{\mathrm{c}\left({\gamma}_{\mathrm{ref}}-{q}^{\mathrm{max}}\right)}^{2}\right)}{\left|\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\right|\phantom{\rule{0.166667em}{0ex}}\left|\mathrm{c}\left({\gamma}_{\mathrm{ref}}-{q}^{\mathrm{max}}\right)\right|\phantom{\rule{0.166667em}{0ex}}{\mathrm{s}\left({\theta}_{\mathrm{S}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}\left({\mathrm{s}\left({\gamma}_{\mathrm{ref}}-{q}^{\mathrm{max}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)}^{2}-1\right)}\right)\right)\\ \hfill \pm \left(\mathrm{acos}\left(\frac{\sqrt{{\mathrm{s}\left({\theta}_{\mathrm{S}}\right)}^{2}-{\mathrm{s}\left({\gamma}_{\mathrm{ref}}-{q}^{\mathrm{max}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)}^{2}}+\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\left({\mathrm{c}\left({\gamma}_{\mathrm{ref}}-{q}^{\mathrm{max}}\right)}^{2}-1\right)}{\left|\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\right|\phantom{\rule{0.166667em}{0ex}}\left|\mathrm{c}\left({\gamma}_{\mathrm{ref}}-{q}^{\mathrm{max}}\right)\right|\phantom{\rule{0.166667em}{0ex}}{\mathrm{s}\left({\theta}_{\mathrm{S}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}\left({\mathrm{s}\left({\gamma}_{\mathrm{ref}}-{q}^{\mathrm{max}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)}^{2}-1\right)}\right)\right)\end{array}\right\}\end{array}$$

$$\begin{array}{c}\hfill {\mathit{\lambda}}_{2}^{lim}({\theta}_{\mathrm{S}},{\beta}_{\mathrm{ref}},{q}^{\mathrm{max}}):=\left\{\begin{array}{c}\pm \phantom{\rule{0.277778em}{0ex}}\mathrm{acos}\left(\frac{\mathrm{c}\left({q}^{\mathrm{max}}\right)-\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)}{\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)}\right)\end{array}\right\}\end{array}$$

$$\begin{array}{c}{\mathit{\lambda}}_{3}^{lim}({\theta}_{\mathrm{S}},{\beta}_{\mathrm{ref}},{q}^{\mathrm{max}}):=\hfill \\ \hfill \left\{\begin{array}{c}\hfill \pm \left(\pi -\mathrm{acos}\left(\frac{\sqrt{-{\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)}^{2}-{\mathrm{c}\left({q}^{\mathrm{max}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({\theta}_{\mathrm{S}}\right)}^{2}+{\mathrm{c}\left({q}^{\mathrm{max}}\right)}^{2}+{\mathrm{c}\left({\theta}_{\mathrm{S}}\right)}^{2}}+\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\left(1-{\mathrm{c}\left({q}^{\mathrm{max}}\right)}^{2}\right)}{\left|\mathrm{c}\left({q}^{\mathrm{max}}\right)\right|\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\left({\mathrm{s}\left({q}^{\mathrm{max}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{s}\left({\theta}_{\mathrm{S}}\right)}^{2}-1\right)}\right)\right)\\ \hfill \pm \left(\mathrm{acos}\left(\frac{\sqrt{-{\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)}^{2}-{\mathrm{c}\left({q}^{\mathrm{max}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{c}\left({\theta}_{\mathrm{S}}\right)}^{2}+{\mathrm{c}\left({q}^{\mathrm{max}}\right)}^{2}+{\mathrm{c}\left({\theta}_{\mathrm{S}}\right)}^{2}}+\mathrm{c}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{c}\left({\theta}_{\mathrm{S}}\right)\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\theta}_{\mathrm{S}}\right)\left({\mathrm{c}\left({q}^{\mathrm{max}}\right)}^{2}-1\right)}{\left|\mathrm{c}\left({q}^{\mathrm{max}}\right)\right|\phantom{\rule{0.166667em}{0ex}}\mathrm{s}\left({\beta}_{\mathrm{ref}}\right)\phantom{\rule{0.166667em}{0ex}}\left({\mathrm{s}\left({q}^{\mathrm{max}}\right)}^{2}\phantom{\rule{0.166667em}{0ex}}{\mathrm{s}\left({\theta}_{\mathrm{S}}\right)}^{2}-1\right)}\right)\right)\end{array}\right\}\end{array}$$

$$\begin{array}{cc}\hfill {\mathit{\lambda}}_{5}^{lim}({\theta}_{\mathrm{W}},{\beta}_{\mathrm{EE}},{q}^{\mathrm{max}})& :={\gamma}_{\mathrm{EE}}-{\mathit{\lambda}}_{3}^{lim}({\theta}_{\mathrm{W}},{\beta}_{\mathrm{EE}},{q}^{\mathrm{max}})\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathit{\lambda}}_{6}^{lim}({\theta}_{\mathrm{W}},{\beta}_{\mathrm{EE}},{q}^{\mathrm{max}})& :={\gamma}_{\mathrm{EE}}-{\mathit{\lambda}}_{2}^{lim}({\theta}_{\mathrm{W}},{\beta}_{\mathrm{EE}},{q}^{\mathrm{max}})\hfill \end{array}$$

$$\begin{array}{cc}\hfill {\mathit{\lambda}}_{7}^{lim}({\theta}_{\mathrm{W}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{q}^{\mathrm{max}})& :={\gamma}_{\mathrm{EE}}-{\mathit{\lambda}}_{1}^{lim}({\theta}_{\mathrm{W}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{q}^{\mathrm{max}}).\hfill \end{array}$$

## References

- Yoshikawa, T. Manipulability of robotic mechanisms. Int. J. Rob. Res.
**1985**, 4, 3–9. [Google Scholar] [CrossRef] - Yoshikawa, T. Dynamic manipulability of robot manipulators. In Proceedings of the 1985 IEEE International Conference on Robotics and Automation, St. Louis, MO, USA, 25–28 March 1985; pp. 1033–1038. [Google Scholar]
- Chiacchio, P.; Chiaverini, S.; Sciavicco, L.; Siciliano, B. Influence of gravity on the manipulability ellipsoid for robot arms. J. Dyn. Syst. Meas. Contr.
**1992**, 114, 723–727. [Google Scholar] [CrossRef] - Chiacchio, P. A new dynamic manipulability ellipsoid for redundant manipulators. Robotica
**2000**, 18, 381–387. [Google Scholar] [CrossRef] - Vahrenkamp, N.; Asfour, T.; Metta, G.; Sandini, G.; Dillmann, R. Manipulability analysis. In Proceedings of the 12th IEEE-RAS International Conference on Humanoid Robots (Humanoids 2012), Osaka, Japan, 29 November–1 December 2012; pp. 568–573. [Google Scholar]
- Waldron, K.J.; Schmiedeler, J. Kinematics. In Springer Handbook of Robotics, 2nd ed.; Siciliano, B., Khatib, O., Eds.; Springer: Cham, Switzerland, 2016; pp. 11–36. [Google Scholar]
- Jun, B.H.; Lee, P.M.; Kim, S. Manipulability analysis of underwater robotic arms on ROV and application to task-oriented joint configuration. J. Mech. Sci. Technol.
**2008**, 22, 887–894. [Google Scholar] [CrossRef] - Abdel-Malek, K.; Yu, W.; Yang, J. Placement of Robot Manipulators to Maximize Dexterity. Int. J. Rob. Autom.
**2004**, 19, 6–14. [Google Scholar] [CrossRef] - Wolovich, W.A.; Elliott, H. A computational technique for inverse kinematics. In Proceedings of the 23rd IEEE Conference on Decision and Control, Las Vegas, NV, USA, 12–14 December 1984; pp. 1359–1363. [Google Scholar]
- Colomé, A.; Torras, C. Closed-loop inverse kinematics for redundant robots: Comparative assessment and two enhancements. IEEE/ASME Trans. Mechatron.
**2014**, 20, 944–955. [Google Scholar] [CrossRef] - Antonelli, G. Stability analysis for prioritized closed-loop inverse kinematic algorithms for redundant robotic systems. IEEE Trans. Rob.
**2009**, 25, 985–994. [Google Scholar] [CrossRef] - Bjoerlykhaug, E. A Closed Loop Inverse Kinematics Solver Intended for Offline Calculation Optimized with GA. Robotics
**2018**, 7, 7. [Google Scholar] [CrossRef] - Reiter, A.; Müller, A.; Gattringer, H. On Higher Order Inverse Kinematics Methods in Time-Optimal Trajectory Planning for Kinematically Redundant Manipulators. IEEE Trans. Ind. Inf.
**2018**, 14, 1681–1690. [Google Scholar] [CrossRef] - Siciliano, B. Kinematic Control of Redundant Robot Manipulators: A Tutorial. J. Intell. Rob. Syst.
**1990**, 3, 201–212. [Google Scholar] [CrossRef] - Shimizu, M.; Kakuya, H.; Yoon, W.K.; Kitagaki, K.; Kosuge, K. Analytical inverse kinematic computation for 7-DOF redundant manipulators with joint limits and its application to redundancy resolution. IEEE Trans. Rob.
**2008**, 24, 1131–1142. [Google Scholar] [CrossRef] - Faria, C.; Ferreira, F.; Erlhagen, W.; Monteiro, S.; Bicho, E. Position-based kinematics for 7-DoF serial manipulators with global configuration control, joint limit and singularity avoidance. Mech. Mach. Theory
**2018**, 121, 317–334. [Google Scholar] [CrossRef] - D’Souza, A.; Vijayakumar, S.; Schaal, S. Learning inverse kinematics. In Proceedings of the 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Maui, HI, USA, 29 October–3 November 2001; Volume 1, pp. 298–303. [Google Scholar]
- Tejomurtula, S.; Kak, S. Inverse kinematics in robotics using neural networks. Inf. Sci.
**1999**, 116, 147–164. [Google Scholar] [CrossRef] - Köker, R.; Öz, C.; Çakar, T.; Ekiz, H. A study of neural network based inverse kinematics solution for a three-joint robot. Rob. Autom. Syst.
**2004**, 49, 227–234. [Google Scholar] [CrossRef] - Sariyildiz, E.; Ucak, K.; Oke, G.; Temeltas, H.; Ohnishi, K. Support Vector Regression based inverse kinematic modeling for a 7-DOF redundant robot arm. In Proceedings of the 2012 International Symposium on Innovations in Intelligent Systems and Applications, Trabzon, Turkey, 2–4 July 2012; pp. 1–5. [Google Scholar]
- Parker, J.K.; Khoogar, A.R.; Goldberg, D.E. Inverse kinematics of redundant robots using genetic algorithms. In Proceedings of the 1989 International Conference on Robotics and Automation (ICRA), Scottsdale, AZ, USA, 14–19 May 1989; pp. 271–276. [Google Scholar]
- KöKer, R. A genetic algorithm approach to a neural-network-based inverse kinematics solution of robotic manipulators based on error minimization. Inf. Sci.
**2013**, 222, 528–543. [Google Scholar] [CrossRef] - Dereli, S.; Köker, R. A meta-heuristic proposal for inverse kinematics solution of 7-DOF serial robotic manipulator: Quantum behaved particle swarm algorithm. Artif. Intell. Rev.
**2019**, 1–16. [Google Scholar] [CrossRef] - Kamrani, B.; Berbyuk, V.; Wäppling, D.; Feng, X.; Andersson, H. Optimal usage of robot manipulators. In Robot Manipulators; IntechOpen: London, UK, 2010. [Google Scholar]
- Myers, R.H.; Montgomery, D.C.; Anderson-Cook, C.M. Response Surface Methodology: Process and Product Optimization Using Designed Experiments, 4th ed.; John Wiley & Sons: Hoboken, NJ, USA, 2016. [Google Scholar]
- Chan, T.F.; Dubey, R.V. A weighted least-norm solution based scheme for avoiding joint limits for redundant joint manipulators. Trans. Rob. Autom.
**1995**, 11, 286–292. [Google Scholar] [CrossRef] - Dariush, B.; Hammam, G.B.; Orin, D. Constrained resolved acceleration control for humanoids. In Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Taiwan, 18–22 October 2010; pp. 710–717. [Google Scholar]
- Dufour, K.; Suleiman, W. On integrating manipulability index into inverse kinematics solver. In Proceedings of the 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Vancouver, BC, Canada, 24–28 September 2017; pp. 6967–6972. [Google Scholar]
- Jin, L.; Li, S.; La, H.M.; Luo, X. Manipulability optimization of redundant manipulators using dynamic neural networks. IEEE Trans. Ind. Electron.
**2017**, 64, 4710–4720. [Google Scholar] [CrossRef] - Lee, S. Dual redundant arm configuration optimization with task-oriented dual arm manipulability. Trans. Rob. Autom.
**1989**, 5, 78–97. [Google Scholar] [CrossRef] - Guilamo, L.; Kuffner, J.; Nishiwaki, K.; Kagami, S. Manipulability optimization for trajectory generation. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Orlando, FL, USA, 15–19 May 2006; pp. 2017–2022. [Google Scholar]
- Rozo, L.; Jaquier, N.; Calinon, S.; Caldwell, D.G. Learning manipulability ellipsoids for task compatibility in robot manipulation. In Proceedings of the 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Vancouver, BC, Canada, 24–28 September 2017; pp. 3183–3189. [Google Scholar]
- Jaquier, N.; Rozo, L.D.; Caldwell, D.G.; Calinon, S. Geometry-aware Tracking of Manipulability Ellipsoids. In Proceedings of the Proceedings Robotics: Science and Systems, Pittsburgh, PA, USA, 26–30 June 2018. [Google Scholar]
- Faroni, M.; Beschi, M.; Visioli, A.; Tosatti, L.M. A global approach to manipulability optimisation for a dual-arm manipulator. In Proceedings of the 2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA), Berlin, Germany, 6–9 September 2016; pp. 1–6. [Google Scholar]
- Zacharias, F.; Borst, C.; Wolf, S.; Hirzinger, G. The capability map: A tool to analyze robot arm workspaces. Int. J. Humanoid Rob.
**2013**, 10, 1350031. [Google Scholar] [CrossRef] - Zlatanov, D.; Fenton, R.G.; Benhabib, B. Singularity analysis of mechanisms and manipulators via a velocity-equation model of the instantaneous kinematics. In Proceedings of the International Conference on Robotics and Automation (ICRA), San Diego, CA, USA, 8–13 May 1994; Volume 2, pp. 980–985. [Google Scholar]
- Staffetti, E.; Bruyninckx, H.; De Schutter, J. On the invariance of manipulability indices. In Advances in Robot Kinematics; Lenarčič, J., Thomas, F., Eds.; Springer: Dordrecht, The Netherlands, 2002; pp. 57–66. [Google Scholar]
- Gotlih, K.; Troch, I. Base invariance of the manipulability index. Robotica
**2004**, 22, 455–462. [Google Scholar] [CrossRef] - Lee, S.; Bejczy, A.K. Redundant arm kinematic control based on parameterization. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Sacramento, CA, USA, 9–11 April 1991; pp. 458–465. [Google Scholar]
- Tondu, B. A closed-form inverse kinematic modelling of a 7R anthropomorphic upper limb based on a joint parametrization. In Proceedings of the 2006 6th IEEE-RAS International Conference on Humanoid Robots, Genova, Italy, 4–6 December 2006; pp. 390–397. [Google Scholar]
- Kreutz-Delgado, K.; Long, M.; Seraji, H. Kinematic analysis of 7-DOF manipulatorsiter. Int. J. Rob. Res.
**1992**, 11, 469–481. [Google Scholar] [CrossRef] - Goldenberg, A.; Benhabib, B.; Fenton, R. A complete generalized solution to the inverse kinematics of robots. J. Rob. Autom.
**1985**, 1, 14–20. [Google Scholar] [CrossRef] - Kuffner, J.J. Effective sampling and distance metrics for 3D rigid body path planning. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), New Orleans, LA, USA, 26 April–1 May 2004; pp. 3993–3998. [Google Scholar]
- Kuhlemann, I.; Jauer, P.; Ernst, F.; Schweikard, A. Robots with seven degrees of freedom: Is the additional DoF worth it? In Proceedings of the 2016 2nd International Conference on Control, Automation and Robotics (ICCAR), Hong Kong, China, 28–30 April 2016; pp. 80–84. [Google Scholar]
- Dixon, L.C.W. The Global Optimization Problem. An Introduction. Toward Global Optim.
**1978**, 2, 1–15. [Google Scholar] - Fubini, G. Sugli integrali multipli. Rend. Acc. Naz. Lincei
**1907**, 16, 608–614. [Google Scholar] - Chiacchio, P. Exploiting redundancy in minimum-time path following robot control. In Proceedings of the 1990 American Control Conference, San Diego, CA, USA, 23–25 May 1990; pp. 2313–2318. [Google Scholar]
- Chiu, S. Control of redundant manipulators for task compatibility. In Proceedings of the 1987 IEEE International Conference on Robotics and Automation (ICRA), Raleigh, NC, USA, 31 March–3 April 1987; Volume 4, pp. 1718–1724. [Google Scholar]
- Somani, N.; Rickert, M.; Gaschler, A.; Cai, C.; Perzylo, A.; Knoll, A. Task level robot programming using prioritized non-linear inequality constraints. In Proceedings of the 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Daejeon, Korea, 9–14 October 2016; pp. 430–437. [Google Scholar]
- Huber, G.; Wollherr, D. An Online Trajectory Generator on SE(3) for Human Robot Collaboration. Robotica
**2019**. accepted. [Google Scholar] [CrossRef]

**Figure 1.**Illustration of the task space manipulability at a given end-effector pose. The null space of this 7-DOF S-R-S kinematics consists of the free elbow position (joint 4) along a circle. This position defines the direction of the forearm, i.e., the vector from the shoulder to the wrist. The colored fan shows all possible forearm poses with the corresponding manipulability color-coded from dark red (very bad) to light green (optimal). Colorless areas of the fan mark areas that violate joint constraints.

**Figure 2.**Relation of task space $\mathit{z}$, parameter space $\mathit{p}$, joint space $\mathit{q}$, and manipulability metric $\mu $. The mappings are referred to as Task Space Projection (TSP) and Task Space Surjection (TSS), Forward Kinematic (FK) and Inverse Kinematic (IK), and Manipulability (M).

**Figure 3.**Parametrization of the Task Space. Positions of Base B and Shoulder S are fixed. Translation reference parameters $({r}_{\mathrm{ref}},{\gamma}_{\mathrm{ref}},{\beta}_{\mathrm{ref}})$ define the position of the Wrist W. The end-effector parameters $({\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},{\psi}_{\mathrm{EE}})$ describe the rotation from reference frame R to tool frame T as consecutive $Z\to {Y}^{{}^{\prime}}\to {Z}^{{}^{\u2033}}$ Euler angles. The null space is parametrized with $\lambda $. It defines the position of the elbow E via relative rotation between the elbow oriented frame L and frame R.

**Figure 4.**Reference frames and their relations. The blue frames B to T are fixed to the corresponding body-fixed coordinate systems of the robot links. Orange frames R and L are additional reference frames for the introduced parameter space. The arrows mark the rotations between the frames of reference.

**Figure 5.**Run-time comparison of processing N poses w.r.t. their task space manipulability. Considered are the MATLAB robotics IK solver based on nonlinear optimization, the analytical IK solver by Shimizu et al. [15], and the presented approach in three versions: a conventional sequential loop structure, as well as vectorized evaluation on the central processing unit (CPU) and graphics processing unit (GPU).

**Figure 6.**Uniform distributed sampling of the task space (2000 samples). (

**a**) End-effector translation; (

**b**) End-effector orientation.

**Figure 7.**Approximated cumulative distribution function (CDF) from a histogram of manipulability w.r.t. different sampling strategies (10

^{7}samples).

**Figure 8.**Bi-variate histograms of $\mu ({r}_{\mathrm{ref}},{\beta}_{\mathrm{ref}},{\gamma}_{\mathrm{EE}},{\beta}_{\mathrm{EE}},\lambda )$ w.r.t. to the individual parameters, based on 10

^{7}uniformly distributed parameter space samples. Colors are normalized along with the particular value of the parameter on the x-axis.

**Figure 9.**Results of the task space manipulability optimization of a robot mounting pose. (

**a**): Overall best robot configuration. There are a total of 8 global optima with equal manipulability ${\mu}_{\mathrm{max}}=0.143$. From 1000 random initial starting points, 83% of the optimization runs converged to one of the global optima. (

**b**): Optimizing relative pose w.r.t. a workspace envelope of size $(\Delta x,\Delta y,\Delta z)=(0.4,0.4,0.3)\mathrm{m}$. Note that the cubic volume is projected onto the parameter space, hence the distortion in the illustration. The resulting configuration for pose ${\mathit{z}}_{0}$, again lies fully on the $xz$-plane. However, unlike the single best pose, only one single optimum is found.

**Figure 10.**Multiple local optima of manipulability $\mu $ in the null space of ${\mathit{p}}^{\mathrm{red}}={[0.6,0.7,1.4,0.7]}^{\top}$.

**Figure 11.**Null space manipulability over a parameter trajectory. The 3D plot

**(a)**shows an exemplary start $\mathit{p}(s=0)$ and end configuration $\mathit{p}(s=1)$. The contour plot

**(b)**shows the manipulability $\mu (\mathit{p},\lambda )$ of the full null space. Red lines mark the limits $\lambda (\mathit{p},{q}_{\mathrm{max}})$ of the admissible null space region. The numbers refer to the invoking joint. Blue circles mark desired ${\lambda}^{d}(s=0)$ and ${\lambda}^{d}(s=1)$, and the blue line marks a trajectory as it would be chosen by local optimization of ${\lambda}_{\mathrm{max}}\left(\mathit{p}\right)$.

# optima | 1 | 2 | 3 | 4 |
---|---|---|---|---|

percentage | 20% | 41% | 27% | 12% |

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).