
3.2 Singular Configurations  
It can be shown that matrix A is singular when 
vectors 
r
4
 and r
5
 (i.e. links AC and BC) are parallels; 
in such case the manipulator is on a parallel 
singularity. On the other hand, in Equation 3 it can 
be observed that matrix 
B losses its full rank when 
r
2
 and r
4
, or r
3
 and r
5
, become orthogonal and the 
manipulator verifies a serial singularity. These 
conditions are satisfied by the singular 
configurations shown in Figure 4. In cases (a) and 
(b) of this Figure, which correspond to parallel 
singularities, we observe that not any component of 
force being perpendicular to the links AC and BC 
can be supported by the point C of the manipulator; 
consequently such point could move, even if the 
actuators are braked. On the other hand, in case (c), 
when the manipulator is on a serial singularity, the 
point C cannot be displaced by the manipulator. 
Clearly, the aforementioned difficulties to control 
the manipulator, associated with both categories of 
singularities, are not desirables during the 
completion of a task and they should be avoided. 
It can also be noted on the one hand that 
r
1
 has 
no influence on matrix A; and on the other hand, 
such a vector cannot produce a reduction of the rank 
of  
B. 
4  KINETOSTATIC INDEX OF 
PERFORMANCE 
 The behavior of the Condition Number of the 
Jacobian matrix for the assisted manipulator is 
examined in this Section. This index has been 
largely applied in both parallel and serial 
manipulators (i.e. Angeles and Lopez-Cajun, 1992; 
Majou et. al., 2002); it bounds the error propagation 
from the joint velocities to the operational velocities. 
Consequently, it should be minimized in order to 
preserve a suitable accuracy of velocity and applied 
force of the end effector.  
For the assisted manipulator, we analyze the 
condition number of  
J=A
-1
B,  which can be 
obtained from: 
m
M
λ
λ
κ
=(J)
      ,                           (8) 
where 
M
 and 
m
 are, respectively, the maximum 
and  the  minimum singular values of  
J.  When  κ(J) 
becomes one, then the Jacobian matrix is qualified 
as isotropic, and the manipulator achieves an ideal 
configuration    since    its   accuracy   is    the    best. 
On the other hand, the condition number becomes 
infinity on singular configurations. The ideal value 
of κ(
J) can be obtained by the optimal configuration 
only if the design of the manipulator is isotropic 
(Angeles and Lopez-Cajun, 1992). 
5 TRAJECTORY PLANNING 
The trajectory planning problem as considered here 
is established as follows: given a main task for the 
assisted manipulator specified by a desired 
trajectory of the end-effector referred to the mobile 
platform, to obtain the joint trajectories in such a 
way that the manipulator’s configurations define 
values of the condition number of  
J  as small as 
possible during the execution of the task. 
It is assumed that the task is specified in a 
discrete way by a sufficiently large sample of points 
of the desired trajectory. Thus, the process of 
solution can be carried out in the following steps for 
each path-point: 
i)  For  the  point p
i
 of the desired path, propose an 
arbitrary value of the first joint variable ρ
1i
 which 
is a member of the admissible domain of 
configurations. 
ii)  For the current point  p
i
 of the path, solve the 
inverse problem of position to find the values of 
ρ
2i
 and  ρ
3i
  corresponding to the proposed value 
of ρ
1i
 . Note that the pose obtained in this step is 
completely arbitrary. This one, however, will be 
successively improved as described in the next 
step. 
iii) Find the optimum pose 
ρ
i
 which satisfies the 
current path point p
i
 and minimizes the condition 
number of the jacobian matrix. In order to do 
that, in an internal process of this step, 
successively optimal vectors of joint velocities 
z’
i
 in the null space of the jacobian matrix must 
be obtained which allows sequentially improve 
the manipulator’s configuration (starting with 
that obtained in step ii ) satisfying the current 
point p
i 
until obtaining of the optimal pose ρ
i opt
. 
An optimal vector z’
i
 is such that the decreasing 
rate of κ
i
(J
i
) is as large as possible. For each 
optimal vector z’
i
 found in the internal process, 
an improved pose is computed by   
                                  
tΔ+=
•
hi
ii
' ρρρ
 ,           (9) 
where 
 is an arbitrary small time interval, and 
hi
•
ρ
 is computed by applying the projection of the 
GLOBAL OPTIMIZATION OF PERFORMANCE OF A 2PRR PARALLEL MANIPULATOR FOR COOPERATIVE
TASKS
519