Next Article in Journal
A Novel 3D Ring-Based Flapper Valve for Soft Robotic Applications
Next Article in Special Issue
Mechatronic Model of a Compliant 3PRS Parallel Manipulator
Previous Article in Journal
Multi-Domain Dynamic Modelling of a Low-Cost Upper Limb Rehabilitation Robot
Previous Article in Special Issue
Feasibility and Performance Validation of a Leap Motion Controller for Upper Limb Rehabilitation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Robot Arm Design Optimization Method by Using a Kinematic Redundancy Resolution Technique

by
Omar W. Maaroof
1,*,
Mehmet İsmet Can Dede
2 and
Levent Aydin
3
1
Mechatronics Engineering Department, University of Mosul, Mosul 41002, Iraq
2
Department of Mechanical Engineering, İzmir Institute of Technology, Gülbahçe Mahallesi, Urla, Izmir 35430, Turkey
3
Department of Mechanical Engineering, İzmir Katip Çelebi University, A.O.S.B. Mahallesi, Çiğli, Izmir 35620, Turkey
*
Author to whom correspondence should be addressed.
Robotics 2022, 11(1), 1; https://doi.org/10.3390/robotics11010001
Submission received: 15 November 2021 / Revised: 15 December 2021 / Accepted: 19 December 2021 / Published: 22 December 2021

Abstract

:
Redundancy resolution techniques have been widely used for the control of kinematically redundant robots. In this work, one of the redundancy resolution techniques is employed in the mechanical design optimization of a robot arm. Although the robot arm is non-redundant, the proposed method modifies robot arm kinematics by adding virtual joints to make the robot arm kinematically redundant. In the proposed method, a suitable objective function is selected to optimize the robot arm’s kinematic parameters by enhancing one or more performance indices. Then the robot arm’s end-effector is fixed at critical positions while the redundancy resolution algorithm moves its joints including the virtual joints because of the self-motion of a redundant robot. Hence, the optimum values of the virtual joints are determined, and the design of the robot arm is modified accordingly. An advantage of this method is the visualization of the changes in the manipulator’s structure during the optimization process. In this work, as a case study, a passive robotic arm that is used in a surgical robot system is considered and the task is defined as the determination of the optimum base location and the first link’s length. The results indicate the effectiveness of the proposed method.

1. Introduction

Optimization methods have been employed in a wide range of areas from economical sciences to design processes in engineering applications. All optimization techniques depend on the numerical and/or algorithmic approach. With the improvement and availability of powerful computers, many techniques for optimization studies are presented. Such methods can be listed as genetic algorithms (GA) [1], Ant Colony Optimization (ACO) [2], and Particle Swarm Optimization (PSO) method [3]. These methods are categorized as modern and nontraditional optimization methods. However, optimization techniques have rewards and drawbacks. Various modifications to improve these techniques have been a focus of many studies. The readers are directed to related resources on methods of optimization and comparative studies such as the study in [4] as well as the review study of the seven stochastic optimization methods that are preferred in optimization of industrial designs [5].
All systems that require an optimum design are inherently redundant. In robotics, among the other possible redundancy of components, kinematic redundancy has been an attractive research area since kinematically redundant robot arms may be used to perform additional task/s while performing their main tasks. This is due to the infinite number of solutions received for the inverse kinematics analysis of a redundant robot resulting in an infinite number of configurations of the robot for the same end-effector pose. Consequently, the motions of the links of a robot that are not affecting the motion of the end-effector are named “self-motion” by Nakamura [6]. The algorithms that are developed to regulate the self-motion of the redundant manipulators for a specific aim are called redundancy resolution techniques.
In this study, a design optimization method is formulated specifically for robot manipulators by using Denavit–Hartenberg parameters. The proposed optimization method adopts a redundancy resolution technique for a kinematically non-redundant manipulator. In this new method, an originally non-redundant manipulator is modified to be a redundant manipulator by including virtual joints. Hence, the employment of a redundancy resolution technique is possible for this modified redundant manipulator. The type and location of the added virtual joints are selected by the designer for selectively optimizing the specific parameters of the robot manipulator. The current approach immerses the robot mechanism designer into the optimization process by providing the convergence steps as design parameters continuously change to their optimal values. Hence, the optimization process becomes more intuitive to the robot mechanism designer than the optimization methods involving randomness. This intuitive approach is our motivation in carrying out this study and the main novelty of this work.
The structural optimization process is carried out, considering the design constraints, to validate the applicability of this new technique. Design optimization procedures followed in the design of industrial robot manipulators [7] and the design of haptic devices [8] are utilized in this present work in terms of analyzing the requirements, stating the problem, assigning design constraints, and nominating objective functions. Consequently, performance indices such as manipulability and condition number can be utilized to evaluate kinematic and/or dynamic performances of manipulators [9]. Specifically, in this present work, the objective function that is used in redundancy resolution via null-space optimization is derived by using the modified form of these two indices.
The case scenario selected for this work is the passive arm of a surgical robotic system called NeuRoboScope [10] as shown in Figure 1. In this system, the passive arm is required to be backdriven by the surgeon to the designated locations of the surgical workspace with minimal effort. Therefore, its performance measures related to both kinematic and dynamic manipulability are studied in this paper as objective functions to test the proposed optimization technique. In the next sections, after a brief review of redundancy resolution techniques, the mechanical design optimization technique is described and the passive arm mechanism of the NeuRoboScope system is introduced. Related to this specific case scenario, the design constraints that are used in modifying the problem as the optimization of a two degree-of-freedom (DoF) planar manipulator are explained. This modification also facilitated the understanding and verification of the method described in this paper since the two-DoF planar manipulator is an extensively studied manipulator in the literature. The optimization procedure for this case scenario is explained along with the modifications of the well-known performance indices that are used in this study. Finally, simulations that are carried out to determine the optimal design of the mechanical structure are presented and discussions are given on the obtained results.

2. A Brief Review of Redundancy Resolution Techniques

A variety of redundancy resolution methods have been introduced in the literature such as the Jacobian pseudo-inverse method, weighted pseudo-inverse method, and singularity robustness method (damped least-squares DLS). All those redundancy resolution methods are grouped as Jacobian-based.
By adding constraints in the form of additional tasks to redundancy resolution, the infinite number of solutions is narrowed down to a specific/bounded solution. This is exactly equivalent to establishing design constraints in design optimization techniques. To incorporate an additional task, which is usually called the subtask, to the resolution process of kinematic redundancy, a null-space-based method can be applied. In this method, the gradient of a differentiable objective function is projected in the null-space of the Jacobian matrix so that it does not affect the main task. Here, the main task is the task that is usually assigned as the tracking of the end-effector’s motion trajectory.
Another method of redundancy resolution is the decomposition method which decomposes joint-space variables into two groups (two minor Jacobian matrices) as they are related to the main task and the additional task. Afterward, constraint objective equality is utilized as an implicit function to reduce the gradient of optimization objective function [11]. This method has the attribute of eliminating the unnecessary intensive computation of pseudo-inverse which increases the efficiency of calculation time.
In the task augmentation null-space-based method, the Jacobian matrix is extended by the addition of an auxiliary task [12] to result in a square augmented Jacobian matrix. In this method, the pseudo inverse is not to be used [13] and the kinematic solution is no longer redundant.
Multi-task priority is another null-space-based method [14,15]. In this method, other than the Jacobian matrix related to the main task, for each additional subtask, another Jacobian matrix exists. The self-motion of the first subtask is projected to the null-space of the main task’s Jacobian matrix. The motion of the second subtask is projected into the null-space of the first subtask’s Jacobian matrix. In the same means, other lower-order priority subtasks can be embedded in the earlier subtask that has higher priority.
Among possible secondary tasks, the extra DoFs have been used for obstacle avoidance in [16], mechanical joint-limit avoidance in [17], minimization of joint velocities and accelerations in [18], and reducing interaction forces in physical human-robot interaction in [19]. In [20], the manipulability measure was used, and dynamic manipulability was introduced in [21]. Most methods for resolving redundancy in manipulation involve defining an objective function to satisfy specific additional tasks. In accordance, in the proposed optimization technique presented in this paper, those objective functions are used as potential performance indices to assign design constraints in the optimization problems for structural design of manipulators.

3. Description of the New Mechanical Design Optimization Method for Robot Manipulators

To resolve the redundancy in robot manipulators, first, the manipulator has to be kinematically redundant with respect to the requirements of the task. That is the DoF of the manipulator n should be higher than the DoF needed for the task m . In the proposed optimization method, if n = m , by including p number of virtual joints, the modified robot arm has n + p DoF and becomes a redundant one. The additional virtual joint variables represent the design parameters of a manipulator. In the structural synthesis of a robot arm, design parameter/s can be any Denavit–Hartenberg (DH) [22] parameter/s shown in Figure 2 other than the joint variable. Hence, (1) for link k that is connected to link k 1 via a revolute joint, the possible design parameters are the effective link length a k , the twist angle α k and the relative offset between the two links defined along the revolute joint’s axis of rotation d k (2) for link k that is connected to link k 1 via a prismatic joint, the possible design parameters are the effective link length a k , the twist angle α k and the relative rotation between the two links defined about the prismatic joint’s motion axis passing from the DH joint center θ k . When a virtual joint is included in the manipulator’s mechanism to change the design parameter/s, the self-motion of the robot arm becomes a consequence of the change of the selected design parameter/s.
As a next step, a suitable objective function to be minimized or maximized should be selected to optimize the selected design parameters, which are, in this case, the added virtual joints. The objective functions are generally selected to represent a performance index defined for robot manipulators such as manipulability or condition number. However, the designer can also formulate an objective function based on the requirements of the manipulator’s task.
The aim in this method is to calculate the optimal values of the virtual joints by maximizing or minimizing the objective function via a redundancy resolution algorithm and thus, selecting optimal design parameters. However, for the redundancy resolution algorithm to control the self-motion of the manipulator, joints should move at a finite rate. This means enough time should be provided during the optimization so that the self-motion of the manipulator is completed, and the optimal values of the design parameters are obtained. To ensure that there is enough time for self-motion of the manipulator to be completed, the end-effector of the manipulator is fixed to a specific pose and the convergence of the parameters is observed. This specific pose may be selected as a critical or most visited pose of the manipulator. In this way it is possible to observe the changes in the design parameters as the optimization process is carried out. Consequently, the designer can gain insight into the effect of the design parameters on the performance of the manipulator.

4. Optimization Methodology Described for the Passive Arm of the NeuRoboScope System

In this section, the robot manipulator’s mechanism that is selected as a case study is introduced. Later, the structural synthesis optimization of this robot arm mechanism is explained by defining the specific optimization procedure applied in this case scenario.

4.1. Mechanism of the Robotic Manipulator and the Description of the Case Scenario

The manipulator that is considered for the case scenario is designed as a passive arm of the NeuRoboScope surgical system (Figure 1). The NeuRoboScope system is designated to work alongside the surgeon assisting him/her by handling the camera system, the endoscope, throughout the surgery. The passive arm carries an active arm mounted on its last link and the endoscope is attached to the active arm.
The passive arm has six revolute joints that are not actuated. The surgeon is expected to backdrive the passive arm to locate the active arm at some desired poses during the surgery. Accordingly, the joints of the passive arm are equipped with brake systems to maintain their angular positions when desired by the surgeon.
The passive arm’s kinematic architecture is shown in Figure 3. The first two revolute joints are for the planar motion on the horizontal plane. Third and fourth revolute joints have axes parallel to the horizontal plane and they are interrelated to each other with a parallelogram loop so that θ 3 + θ 4 = 2 π . The other three joints compose the wrist mechanism that is responsible for adjusting the orientation of the active arm’s base located at the last link of the passive arm. In Figure 3, MP is identified as the manipulation point at which the ease of manipulation of the passive arm is designated to be calculated.
DH parameters of the passive arm are provided in Table 1. In this table, a 1 length is kept as to be designed (TBD) on purpose since in the case study, this is the link length that is selected to be optimized for this manipulator. The eighth row of this table indicates the coordinate frame selected for the active arm’s motion definition.
The position of MP is assigned as the maneuvering point which is essential for being a critical consideration for optimization.
p M P = a 1 u 1 ( 1 ) + d 2 u 3 ( 1 ) + a 2 u 1 ( 2 ) + a 3 u 1 ( 3 ) + a 4 u 1 ( 4 )
In Equation (1), d 2 ,   a 2 ,   a 3 , and a 4 are assigned as fixed parameters. The only variable is the design parameter that is selected for this optimization study which is the effective link length of the first link, a 1 .
The joint variables are θ 1 ,   θ 2 ,   θ 3 , and θ 4 , three of which are independent parameters so that the position in the Cartesian space is to be considered as moving on a horizontal plane as related to θ 1 and θ 2 . Apart from that, θ 3 is related to the vertical motion and it is selected as a constant value as explained previously. In this way, the passive arm is reduced into a planar revolute-revolute (RR) manipulator. Consequently, the length of the new second link is calculated as a 2 * = a 2 + a 4 + a 3 cos θ 3 .
The position of the MP is assigned as a constraint for design. Concerning that this position on the horizontal plane and the base of the passive arm is fixed at a specific point on the surgery table, two possible configurations can be calculated as elbow-up and elbow-down. Any one of the two solutions can be selected to find the initial position for each of θ 1 and θ 2 during the optimization study. The inverse kinematics solutions are not presented here since it is trivial for a planar two DoF revolute-jointed arm.
For verifying and testing the objective function on the actual passive arm, the original Jacobian matrix is a J ^ 2 × 2 matrix for the planar arm with two DoF. However, for optimization study, virtual joints are added to the original passive arm and the Jacobian matrix is modified as J ^ 2 × 4 2 × 4 and J ^ 2 × 3 2 × 3 . The case with the two virtual joints ( J ^ 2 × 4 ) includes a prismatic joint acting along the y-axis and its positive direction motion is defined along u 2 ( 0 ) axis by a virtual joint parameter Y 0 . The other virtual joint in the two-virtual joint case ( J ^ 2 × 4 ) and the single-virtual joint case ( J ^ 2 × 3 ) is the prismatic joint included to change the effective link length, a 1 . The dimension of the Jacobian matrix is related to the DoF of the workspace and DoF of the original or modified passive arm. In Equations (2)–(4), Jacobian matrices with two virtual joints, one virtual joint, and no virtual joints are presented, respectively.
J ^ 2 × 4 = [ 0 c 1 a 1 s 1 ( a 2 + a 4 + a 3 c 3 ) s 12 ( a 2 + a 4 + a 3 c 3 ) s 12 1 s 1 a 1 c 1 + ( a 2 + a 4 + a 3 c 3 ) c 12 ( a 2 + a 4 + a 3 c 3 ) c 12 ]
J ^ 2 × 3 = [ c 1 a 1 s 1 ( a 2 + a 4 + a 3 c 3 ) s 12 ( a 2 + a 4 + a 3 c 3 ) s 12 s 1 a 1 c 1 + ( a 2 + a 4 + a 3 c 3 ) c 12 ( a 2 + a 4 + a 3 c 3 ) c 12 ]
J ^ 2 × 2 = [ a 1 s 1 ( a 2 + a 4 + a 3 c 3 ) s 12 ( a 2 + a 4 + a 3 c 3 ) s 12 a 1 c 1 + ( a 2 + a 4 + a 3 c 3 ) c 12 ( a 2 + a 4 + a 3 c 3 ) c 12 ]  
In the equations above, s k = sin θ k and c k = cos θ k for k = 1 , 2 , 3 , and s 12 = sin ( θ 1 + θ 2 ) and c 12 = cos ( θ 1 + θ 2 ) .

4.2. Design Optimization Constraints

NeuRoboScope system is designed to be used in a minimally invasive pituitary tumor surgery. In this surgery, the natural openings through the nostrils are used to insert surgical tools. Hence, the passive arm of NeuRoboScope system is back-driven manually by the surgeon while the surgeon places the endoscope in and out of the nostril. Concerning this special use of the passive arm, design constraints are defined below.
  • The surgeon can insert the endoscope from either nostril.
  • The endoscope and the active robot arm should not interfere with the surgeon’s hands, and they should not block the surgeon’s view of the monitor, see Figure 4.
  • The passive arm should locate the active arm inside the surgery workspace by approaching from behind the patient’s head.
  • The passive arm should be fixed to the surgery table.
  • Physical dimensions of the links should not be large, and they should not be heavy, but they should be rigid enough to compose an inertial frame for the active arm when their brakes at the joints of the passive arm are activated.
  • There should be no actuators on the joints of the passive robot arm.
  • When the passive arm’s brakes are released, the surgeon should be able to move the endoscope freely while the endoscope is still attached to the active robot arm.
A study can be carried out for all of the DH parameters, excluding the joint variables, of the passive arm. However, in this study, the passive arm’s motion on the horizontal plane is considered to facilitate the demonstration of the optimization method. Accordingly, from this point on, the kinematics of the passive arm are reduced to a 2-DoF planar robot arm with two revolute joints. Design parameters that are considered are the effective link length of the first link and the ground frame’s origin, which is the location that the passive arm is fixed on the surgery table.

4.3. Optimization through Mechanical Redundancy

Depending on the previously defined design constraints, the requirements for the passive arm are set for the optimization procedure by considering the necessities and conditions of the surgery:
  • The surgeon should have minimal effort when he/she intends to push the active robot arm in or away from the surgery zone.
  • The parallelogram loop in the passive robot arm is utilized with no modifications since it is designed with counter-spring for gravity compensation. This linkage is responsible for providing vertical motion of the base of the active arm.
  • The optimization is related only to the ease of manipulation only on the horizontal plane.
  • The fixing point position on the y-axis (with respect to reference-frame in Figure 5) is selected as a possible design parameter, which is related to another design parameter that is the first link’s length.
  • MP position is fixed at the coordinate (−20, −30) cm (which can be considered as an average position of workspace required by the surgeon) relative to the reference frame in Figure 5.
  • The effective link length of the first link should be limited depending on its manufacturability, final weight and allowed compliant displacements due to loads.
  • The linear density of the first link is taken as follows: mass/length = 1 kg/m.
  • The third joint variable θ 3 in Figure 3 is fixed at −30° which is the condition when the endoscope is located just above the patient’s nostrils.
Since the objective of the optimization is to ease the manipulation at MP, which is denoted in Figure 3, forward and inverse kinematics, and the Jacobian matrix calculations are presented for MP. Hence, these calculations are used for the proposed optimization method.

5. Implementation of the New Optimization Strategy

When there is kinematic redundancy, there is a free motion of the mechanism even if the end-effector is fixed. This so-called self-motion happens in the null space of the Jacobian matrix. In the implementation of the proposed optimization strategy, this property is used. However, to use this property, the non-redundant passive arm must be modified to have more joints.
For the case with two virtual joints, the DoF of the RR planar arm is increased by 2. Consequently, a 4-DoF PRPR planar arm operating for a 2-DoF planar task is formed. Since the objective is to find optimum design parameters, these new joint variables ( Y 0 and a 1 ) are included in the control of the self-motion of the resultant redundant arm.
Although a designer is free to choose any redundant manipulator controller, a previously designed controller for redundant robot manipulators is utilized for this optimization task [18]. However, only the kinematic part of this controller is used in this work. This controller is used to control both the main task in task-space, earlier defined by the MP point’s position x ¯ in horizontal plane, and a desired subtask by adjusting the joints’ motion in the null space.
An error term is defined as e ¯ = x ¯ d x ¯ as the tracking error, and x ¯ d is defined as the desired position/trajectory in task-space. The designed controller is presented in Equation (5) where K ^ v and K ^ p are diagonal constant feedback gain matrices related to the proportional-derivative (PD) controller of the main task.
q ¯ ¨ = J ^ + ( x ¯ ¨ d + K ^ v e ¯ ˙ + K ^ p e ¯ J ^ ˙ q ¯ ˙ ) + β ¯ ¨ N
The column of joint variables in position level are denoted as q ¯   n , where n , from now on, is the summation of actual and virtual joints in this approach. We consider that a vector function z ¯ ( . ) n is calculated as a gradient of optimization objective function f ( q ¯ ) for a specific optimization objective function (which may be time-dependent function, including design constraints, etc.), and joint velocities in the null space are required to track the projection of z ¯ onto the null space of J ^ . Since I ^ n J ^ + J ^ projects vectors onto the null space of J ^ , this can be formulated in an error signal calculation as presented in Equation (6), which converges to zero. Here, J ^ + represents the pseudo-inverse of J ^ and I ^ n   n × n is the identity matrix.
e ¯ ˙ N = ( I ^ n J ^ + J ^ ) z ¯ β ¯ ˙ N
Assuming the manipulator does not go through a singularity condition, it is needed to design β ¯ ¨ N to obtain the desired result for the subtask objective. β ¯ ¨ N is determined as;
β ¯ ¨ N = ( I ^ n J ^ + J ^ ) z ¯ ˙ ( J ^ + J ^ ˙ J ^ + + J ^ + ) J ^ z ¯ + K ^ N e ¯ ˙ N
In Equation (7), K ^ N is a diagonal positive definite feedback matrix. This designed control law guarantees that the error will be bounded and converged to zero [18]. After the description of the controller to be used in the proposed optimization method, the performance indices that are used to formulate the objective function are explained in the next subsections. It should be noted that instead of the performance metrics mentioned below, the objective function can be developed by considering other performance metrics and/or their variations.

5.1. Manipulability Ellipsoid and Singular Value Decomposition (SVD)

Manipulability of a selected point in a mechanical linkage can be represented as a scalar value related to the area/volume of velocity ellipse/ellipsoid calculated at this point. It is first developed in [20] and introduced as a performance index. Since the motion of any point on a mechanical linkage can be related to the motion of the joints by the Jacobian matrix, the scalar representation of the manipulability index M p is provided in the following equation.
M p = d e t ( J ^ J ^ T )
In addition to the manipulability index shown in Equation (8), another manipulability measure in Equation (9) was also formulated by Paul and Stevenson [23] as follows
M p = | d e t ( J ^ ) | .
The objective set when using the manipulability index is to maximize this value via changing the positions of joints by staying inside the null-space when MP is fixed at the desired position. During this motion, the effective link length of the first link ( a 1 ) and the position of the fixing point of the passive arm ( Y 0 ) will be changing to reach the optimum value in this optimization.
Singular value decomposition on the matrix J ^ J ^ T is used to solve for singular values of J ^ , which also represents the semi-axes of manipulability ellipse during the simulation. The rank of J ^ represents the number of singular values, which is two in this case because in the formulation of the objective function, the Jacobian matrix is related to the original manipulator.

5.2. The Modified Condition Number

Another way to represent force/motion relation of a point in the workspace of a mechanism is done by a scalar number called condition number [24]. Manipulability represents ease of manipulation of the end-effector at a certain location of the workspace and the condition number relates the length of the maximum and minimum axes of manipulability ellipse achieved along with different directions at that specific location of the end-effector. The condition number is represented by the ratio of the maximum singular value to the minimum singular value of the Jacobian matrix, which represents the radii of the manipulability ellipse. The distance between any point on the ellipse and its center was defined in [25] as the velocity transmission ratio on one specific direction of motion of the end-effector. In an ideal case, the performance index is 1, which means at that specific point, the velocity transmission ratio is the same in all directions and a circle will be representing the manipulability.
Force condition number and velocity condition number are calculated in similar ways. Salisbury and Craig [24] introduced force condition number as the amplification of the relative force error at the task-space to the relative torque error at the joint-space. While Merlet [26] described a velocity condition number using relative motion error in joint-space and relative motion error in the task-space.
In this work, the difference between the maximum and minimum singular values of the Jacobian matrix ( σ m a x and σ m i n , respectively) is used instead of the condition number and it will be referred as the modified condition number from this point on. The objective function shown in Equation (10) is used in the optimization procedure to be minimized to a minimum value or if possible zero value.
C n = σ m a x σ m i n

5.3. Generalized Inertia Matrix

To include a dynamic orientated design constraint for the design of the passive arm, the dynamic model of the arm is studied via finding its dynamic equation of motion and the generalized inertia matrix. This is essential to find the dominant part of design parameters in the relation between the forces displayed at the end-effector and the consequent motion of the manipulator. In this work, since the end-effector is moved at a slow rate, Coriolis and centripetal forces, and the viscous frictional forces are neglected. Consequently, the remaining part of the dynamic equation is shown below.
τ ¯ = M ^ q ¯ ¨
In Equation (11), τ ¯ is the column of actuator torques/forces acting on the joints and M ^ is the generalized inertia matrix. To represent Equation (11) in the task-space, where the interaction is taking place, the task-space forces are mapped to the joint space forces by using the Jacobian matrix as follows:
τ ¯ = J ^ T F ¯ .
Here, in Equation (12), F ¯ is the external forces acting at the end-effector. For the slow-motion of the end-effector, where q ¯ ˙ 0 , we consider q ¯ ¨ = J ^ 1 x ¯ ¨ . Subsequently,
J ^ T F ¯ = M ^ J ^ 1 x ¯ ¨ .
As a result of this expression in Equation (13), mapped generalized inertia matrix ( m G I M ) M ^ G is defined in the task-space as shown in Equation (14).
J ^ T M ^ J ^ 1 = M ^ G
The dynamic performance of the passive arm can be represented by the ellipse (in the case of the 2-DoF manipulator) which can be plotted for the eigenvalues and eigenvectors of M ^ G matrix [27]. On the other hand, the dynamic manipulability (the determinant of J ^ M ^ 1 ) as defined in [21] by Yoshikawa relates the loads at actuators to the acceleration output at end-effector as shown in Equation (15).
x ¯ ¨ = J ^ M ^ 1 τ ¯
For the design optimization study of the passive arm, the objective is to minimize the resistance shown to the operator during he/she backdrives the arm, which can be termed as the mechanical impedance [28] of the passive arm. By doing so, the end-effector can be moved freely inside its workspace with minimum force reflected to the user. This can be achieved by either minimizing the determinant of the numerator part of M ^ G in Equation (14) hence the generalized inertia matrix ImN (previously defined as M ^ ), and/or maximizing the determinant of denominator part of M ^ G , which corresponds to the manipulability index ImD since det ( J ^ T J ^ ) = det ( J ^ J ^ T ) . In this work, the mapped generalized inertia matrix M ^ G and its abovementioned numerator ( ImN ) and denominator parts ( ImD ) are used as indicators of the dynamic performance measure while selecting the objective function.

6. Simulation Tests and Results

Two simulation tests are conducted to verify the presented approach. Two design parameters are used for both tests. The Jacobian matrix developed for the MP of the actual passive arm (RR manipulator version) is used to determine the desired objective function that is related to the modified condition number. All tests are carried out in Matlab Simulink setting the fixed step calculation frequency to 100 Hz with an ODE3 solver. The fixed position of MP is selected as a design constraint on the horizontal planar workspace at −20, −30 cm for this particular scenario of the presented case study, which is determined relative to the frame described in Figure 5. In all the tests, the initial value of the first link is chosen as a 1 = 30 cm and the initial value of fixing position (first joint’s axis location) along the y-axis is selected to be Y 0 = 0 cm. The other parameters of the passive arm are assigned as fixed parameters.

6.1. Simulation Test with the Modified Condition Number Performance Index

In this test, the modified condition number and the manipulability index is calculated to visualize the effect of the optimization. Both the fixing point of the manipulator along the y-axis and the first link’s length are selected as design parameters.
By using the modified condition number, which is presented in Equation (10), as the only performance index in forming the objective function f ( q ¯ ) = C n , singular values are forced to be equal during the optimization procedure due to the minimization of the objective function. As a result, the manipulability ellipse is forced to be a circle and the robot arm moves into an isotropic pose as can be seen in Figure 6.
This result is the same result that is presented and discussed in [29]. The obtained results are exactly as expected for the isotropic pose. The optimal length of the first link came out to be a 1 = 38.47 cm which is equal to a 1 = a 2 2 . The fixing point position converged to a position at Y 0 = 11.57 cm. It is observed in Figure 7 that the manipulability index decreases while the modified condition number index increases which is making maximum and minimum singular values to be equal.
As another consideration of the optimization process, the variation of inertial properties of the manipulator is investigated. In Figure 8a, it can be noticed that the determinant of the mapped generalized inertia matrix (mGIM) is increased because of this optimization. This is due to the increase in the first link length and decrease in overall manipulability. In addition, the determinant of the generalized inertia matrix (the numerator of mGIM) is increased as can be seen in Figure 8b, which is represented by ImN in this figure. ImD represents manipulability (the denominator of mGIM). As the objective function is minimized, the modified condition number becomes zero since in this work, it is described as the difference between the maximum and minimum singular value of the manipulability matrix.
During the optimization process, design parameters could converge to constant values. As shown in Figure 8c, the length of the first link is increased due to this optimization, which leads to a decrease in manipulability and as a result increase in the determinant of m G I M . This can be considered as a drawback but the objective in using the modified condition number is to result in an isotropic pose in terms of manipulability index.

6.2. Simulation Test with the Modified Condition Number Performance Index and Generalized Inertia Matrix

In this final test, modified condition number and the numerator part of the mapped generalized inertia matrix, which corresponds to the generalized inertia matrix, are used with selected weights of w 1 = 1 and w 2 = 2 in forming the objective function, respectively. In this way, the objective function is modified to have both the effect of modified condition number and the determinant of the generalized inertia matrix I m N as f ( q ¯ ) = w 1 C n w 2 I m N . As a result, shorter length for the first link is obtained and manipulability ellipse is reshaped as can be noticed in Figure 9. In Figure 6 and Figure 9: (1) the red line indicates the first link, and the black line indicates the second link, (2) the joint centers for the first and second joint are indicated with red and black circles, respectively (3) during the optimization process, the link colors are drawn darker as the links move from their initial states to their final states.
In this optimization procedure, due to the decrease in manipulability, which is shown in Figure 10, and the decrease in the determinant of generalized inertia matrix I m N , which is shown in Figure 11b, the determinant of m G I M , as shown in Figure 11a, is increased more relative to the results presented in Section 6.1. The positive result of this optimization is obtaining a smaller link length for the first link, which is indicated in Figure 11c. Nevertheless, the weights used for the influence of the modified condition number and the inertia matrix on the objective function is critical. The choice of these weights could decrease manipulability in one direction to a value near zero, which would minimize the backdrivability of the manipulator in that direction.

7. Validation of the Proposed Optimum Design Approach

To ease the comparison of our optimization approach, we named our optimization approach as Optimization via Redundancy Resolution (ORR). To show the accuracy of the proposed optimization approach, we compared the results obtained by stochastic optimization algorithms Simulated Annealing (SA) algorithm, Differential Evolution (DE) algorithm, Nelder–Mead (NM) algorithm, Random Search (RS) algorithm, based on four different phenomenological search approaches, and that of ORR for the mechanism design problem we defined. Here, the basic rationale for choosing these algorithms for validation is (i) they have proven their reliability in the solution of mathematical optimization problems, which have been used in many different disciplines, (ii) because they have different phenomenological bases, a solution alternative that an algorithm might miss can be compensated by this way. At this stage, two different optimization scenarios were defined: First, to find the results that minimize only the C n parameter, and in this context, optimize the parameters Y 0 , θ 1 , θ 2 and a 1 under the given nonlinear equality and linear inequality constraints; The second was to define the importance levels of the C n and I m N parameters with the weight values of w 1 and w 2 , to define a new objective function ( w 1 C n + w 2 I m N ) and to use the constraints used in the first scenario. Weights are selected as w 1 = 1 and w 2 = 2 in forming the objective function, respectively. The unit for the distances is m and the unit for the angular positions is rad in description of the two optimization scenarios.
Find design variables: Y 0 , θ 1 , θ 2 , a 1
Scenario 1:
To minimize the objective function: C n ( Y 0 ,   θ 1 ,   θ 2 ,   a 1 )
Scenario 2:
To minimize the objective function: w 1 C n ( Y 0 ,   θ 1 ,   θ 2 ,   a 1 ) + w 2 I m N ( Y 0 ,   θ 1 ,   θ 2 ,   a 1 )
Subjected to: 1 Y 0 0 ,   0 < a 1 < 0.5
a 2 = 0.350 ;
a 3 = 0.216 ;
a 4 = 0.05 ;
θ 3 = 30 π / 180 ;
X 0 = 0 ;
a 2 * = a 2 + a 4 + a 3 cos θ 3 ;
[ X M P , Y M P ] = [ 0.2 , 0.3 ]
X M P = a 1 cos ( θ 1 ) + a 2 * cos ( θ 1 + θ 2 ) ;
Y M P = Y 0 + a 1 sin ( θ 1 ) + a 2 * sin ( θ 1 + θ 2 ) ;
where
C n ( Y 0 , θ 1 , θ 2 , a 1 ) = 1 2 ( ( ( a 1 2 + ( a 1 4 + 1.088 a 1 3 cos ( θ 2 ) + 0.592 a 1 2 cos 2 ( θ 2 ) + 0.161 a 1 cos ( θ 2 ) + 0.022 ) 0.5 + 0.544 a 1 cos ( θ 2 ) + 0.148 ) ( ( a 1 2 ( a 1 4 + 1.088 a 1 3 cos ( θ 2 ) + 0.592 a 1 2 cos 2 ( θ 2 ) + 0.161 a 1 cos ( θ 2 ) + 0.022 0.5 ) + 0.544 a 1 cos ( θ 2 ) + 0.148 ) 0.5 ) 0.5 ) 2
I m N ( Y 0 ,   θ 1 ,   θ 2 ,   a 1 ) = 0.172707 a 1 2 + 0.100746 a 1 3 0.0740175 a 1 2 cos 2 ( θ 2 )  
In the Appendix A, summary information about the working logic of the optimization algorithms we use for validation is given. For more detailed information, you can refer to the relevant reference [5].
For the optimization problems solved for the scenarios, the algorithm options given in Table 2 are used.
The obtained results using the four well-established optimization algorithm’s results are tabulated along with the result obtained by the proposed ORR algorithm. Due to the “RandomSeed” dependency, which is one of the advantages of the NM algorithm, it is possible to produce alternative results when two different choices (5 and 10) are made for this problem. Therefore, the results for two version of NM are also presented. Table 3 and Table 4 present the result obtained for Scenarios 1 and 2, respectively.
In Table 3, the solution obtained in DE algorithm is the positive solution alternative for the RR manipulator. Therefore, the obtained optimization result in DE is identical to the ones obtained via SA, NM2, RS and the proposed ORR algorithm. The result obtained via NM1 algorithm is different than the other ones. However, when the constraint is narrowed to 0.4 Y 0 0 , this algorithm also gives the same result with the others.
When the results in Table 4 are considered, although the proposed ORR approaches to the optimization results of the other well-established algorithms, there is still a considerable difference for the Y 0 value. As ORR is developed based on a control algorithm using redundancy resolution, the convergence to the optimal result can take some time due to the characteristics of the robot mechanism’s controller. The controller can be optimized to converge to the end result faster. To test this, the same controller is used for extended simulation durations. The obtained optimization results for Scenario 2 are presented in Table 5.
It is observed in Table 5 that the design parameters converge to their optimal values as the simulation duration is extended. This convergence trend is expected since in an actual robot control case, it takes a certain amount of time for the robot to move to the desired location.

8. Discussion and Conclusions

A new approach of mechanical optimization of robot manipulators through mechanical redundancy and the use of redundancy resolution algorithm designed for the control of redundant robots is presented in this paper. The advantages of this approach with respect to the other design optimization methods are (1) the possibility of visualization of the robot’s configuration variations during the optimization, (2) selectively optimizing specific structural parameters of the robot manipulator, and (3) during the optimization process, the design parameters are continuously changed until they approach near the optimal results and no randomness exists during the optimization. In this way, the designer can perceive the effects of the selected performance index and the selected structural parameter for optimization.
Figure 12 shows the Pareto chart for two performance indices to be minimized (the modified condition number, C n , and the determinant of the generalized inertia matrix, I m N ), by using the selected design parameters within their design limits of Y 0 = 0.3   m 0   m and a 1 = 0   m 0.4   m with the discrete step size of 0.01 m. Within these ranges, a Pareto set of 961 individual solutions are evaluated for the corresponding performance indices which are presented with “x” mark on the figure. The distribution of the Pareto set shows the opposing requirements of the two performance indices. In this constrained multi-objective optimization problem, the procedure described in test B is selected for observing the new optimization method’s performance via the Pareto set. The execution of the proposed optimization method is printed on the figure which initiates from the point marked with the red circle and follows the blue line to terminate at the red plus mark. The result of the proposed optimization method with two performance indices indicates that its final result on the Pareto Front is located at the lower curve in this Pareto set. This demonstrates that the proposed optimization method guarantees the final solution will be located at the Pareto Front without setting a stopping criterion as in genetic optimization methods. However, the exact location on the lower curve depends on the weighting values ( w 1 and w 2 ) which can be selected depending on the desired performance of the robot manipulator.
In this approach, optimum solutions for various design parameters can be obtained by including these design parameters as virtual joints of a virtually constructed redundant robot. These variables are adjusted in the null-space of the Jacobian matrix through redundancy resolution techniques so that it will not affect the main task or design constraint/s. However, the manipulation directly affects the selected subtask, which is the optimization procedure’s objective function. Thus, the design parameters are optimized according to the selected objective function that includes the selected performance indices of manipulators. A flowchart representing the implementation of this new technique is presented in Figure 13.
The implementation procedure of this new technique is investigated by using a case scenario for determining the fixing point of the base platform and the first link’s length of a surgical robotic system’s passive arm. The main concern for the optimization is increasing the backdrivability of this passive arm. The presented results with various numbers of design parameters and various uses of performance indices in the objective functions verify the applicability of this new method for the mechanical design and optimization of robot manipulators. The validation test results against the well-established optimization algorithms indicate that the proposed optimization algorithm ORR can converge to global optimal results for various robot mechanism design objectives.
One shortcoming of the proposed optimization algorithm is the duration of the optimization process. This shortcoming can be addressed by selecting suitable gains for faster motion of the manipulator and thus, convergence to the optimal results.

Author Contributions

Conceptualization, O.W.M.; methodology, O.W.M. and M.İ.C.D.; software, O.W.M. and L.A.; validation, O.W.M. and L.A.; formal analysis, O.W.M.; investigation, O.W.M.; resources, O.W.M.; data curation, O.W.M. and L.A.; writing—original draft preparation, O.W.M. and M.İ.C.D.; writing—review and editing, M.İ.C.D. and L.A.; visualization, O.W.M. and M.İ.C.D.; supervision, M.İ.C.D.; project administration, M.İ.C.D.; funding acquisition, M.İ.C.D. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by The Scientific and Technological Research Council of Turkey via grant number 115E726.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Acknowledgments

Authors thank the NeuRoboScope project team for their efforts in developing the surgical system.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Nelder–Mead algorithm:
NM is designed firstly for unconstrained optimization problems. Essential steps of the traditional algorithm are Ordering, Centroid, and Transformation. Since our mathematical optimization problem includes nonlinear equality constraints a hybrid form including conventional NM, conjugate gradient, and principle axis methods has been selected. To implement the hybrid approach, NMaximize command as a postprocessor embedded in Mathematica software is performed.
Simulated Annealing algorithm:
A combination of traditional SA and the principle axis algorithm is selected because of inherent nonlinearity of the objective functions and constraints for the presented problem. The main stages of the algorithm are [5]
(1)
Introduce an initial guess z i .
(2)
Generate next point, z i + 1 , in the neighboring point of z i .
(3)
The main goal of step 2 is to obtain smaller radius of the neighborhood for each iteration.
(4)
If g ( z b e s t ) = g ( z i + n ) , z i + n replaces z b e s t and z .
(5)
Boltzmann’s probability distribution function is used to measure the distance between these two points
where
z i : The starting point,
z i + 1 : The next iteration point in the algorithm steps,
g ( z b e s t ) : The fitness function value for z b e s t ,
g ( z i + n ) : The fitness function value for z i + n ,
z i + n : The maximum number of iteration (last) points in the algorithm steps
z b e s t : The best point found so far in the algorithm steps
Differential Evolution algorithm:
DE is a widely used stochastic optimization method and has the stages crossover, population size, and scaling factor to produce the generations. In this problem, we first converted the constrained optimization problem into the canonical form. To ensure convergence, we use an augmented Lagrangian merit function. Mathematica implementation of the DE algorithm follows the procedures:
(1)
Introduce a population of h points.
(2)
Produce randomly generated population points.
(3)
Use the real scaling factor r s F and select Cross-Probability value in the interval [0, 1].
(4)
Compare the difference between the two most recently generated points.
where
h : The number of population points
r s F : The real scaling factor and it scales applied to the difference vector in creating a mate
Random Search algorithm:
RS algorithm is the simplest method utilized for both discrete and continuous optimization problems. However, for our optimization problem a combination of conventional RS and Levenberg–Marquardt algorithms is performed at the final step. This process is important in the evaluation of convergence and provides the merging quality of selected starting points to the local minimum. The main steps of the algorithm are:
(1)
Enter the start parameter.
(2)
Create working group point V k + 1 .
(3)
Update X k + 1 , Q k + 1 for V k + 1
(4)
Compare the difference between the two most recently generated points.
where
V k + 1 : A collection of candidate points
Q k + 1 : Algorithm parameters
X k + 1 : The current iterate

References

  1. Holland, J.H. Genetic Algorithms and the Optimal Allocation of Trials. SIAM J. Comput. 1973, 2, 88–105. [Google Scholar] [CrossRef]
  2. Colorni, A.; Dorigo, M.; Maniezzo, V. Distributed Optimization by Ant Colonies. In Toward a Practice of Autonomous Systems, Proceedings of the First European Conference on Artificial Life, Paris, France, 11–13 December 1991; Varela, F.J., Bourgine, P., Eds.; Elsevier: Paris, France, 1992; pp. 134–142. [Google Scholar]
  3. Kennedy, J.; Eberhart, R. Particle Swarm Optimization (PSO). In Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, 27 November–1 December 1995; pp. 1942–1948. [Google Scholar] [CrossRef]
  4. Ab Wahab, M.N.; Nefti-Meziani, S.; Atyabi, A. A Comprehensive Review of Swarm Optimization Algorithms. PLoS ONE 2015, 10, e0122827. [Google Scholar] [CrossRef] [Green Version]
  5. Erten, H.I.; Deveci, H.A.; Artem, H.S. Stochastic Optimization Methods. In Designing Engineering Structures Using Stochastic Optimization Methods; Aydin, L., Artem, H.S., Oterkus, S., Eds.; CRC Press: Boca Raton, FL, USA, 2020; pp. 10–23. [Google Scholar] [CrossRef]
  6. Nakamura, Y. Advanced Robotics: Redundancy and Optimization, 1st ed.; Addison-Wesley Longman Publishing Co., Inc.: Boston, MA, USA, 1990. [Google Scholar]
  7. Briot, S.; Goldsztejn, A. Topology Optimization of Industrial Robots: Application to a Five-Bar Mechanism. Mech. Mach. Theory 2018, 120, 30–56. [Google Scholar] [CrossRef] [Green Version]
  8. Vulliez, M.; Zeghloul, S.; Khatib, O. Design Strategy and Issues of the Delthaptic, a New 6-DOF Parallel Haptic Device. Mech. Mach. Theory 2018, 128, 395–411. [Google Scholar] [CrossRef] [Green Version]
  9. Iqbal, H.; Aized, T. Workspace Analysis and Optimization of 4-Links of an 8-DOF Haptic Master Device. Rob. Auton. Syst. 2014, 62, 1220–1227. [Google Scholar] [CrossRef]
  10. Dede, M.İ.C.; Kiper, G.; Ayav, T.; Özdemirel, B.; Tatlıcıoğlu, E.; Hanalioglu, S.; Işıkay, İ.; Berker, M. Human–Robot Interfaces of the NeuRoboScope: A Minimally Invasive Endoscopic Pituitary Tumor Surgery Robotic Assistance System. J. Med. Device 2021, 15, 011106. [Google Scholar] [CrossRef]
  11. De Luca, A.; Oriolo, G. The Reduced Gradient Method for Solving Redundancy in Robot Arms. In IFAC 11th Triennial World Gongress; Elsevier: Tallinn, Estonia, 1990; Volume 23, pp. 133–138. [Google Scholar] [CrossRef]
  12. Peng, Z.X.; Adachi, N. Compliant Motion Control of Kinematically Redundant Manipulators. IEEE Trans. Robot. Autom. 1993, 9, 831–836. [Google Scholar] [CrossRef]
  13. Seraji, H. Configuration Control of Redundant Manipulators: Theory and Implementation. IEEE Trans. Robot. Autom. 1989, 5, 472–490. [Google Scholar] [CrossRef]
  14. Nakamura, Y.; Hanafusa, H.; Yoshikawa, T. Task-Priority Based Redundancy Control of Robot Manipulators. Int. J. Rob. Res. 1987, 6, 3–15. [Google Scholar] [CrossRef]
  15. Uzunolu, E.; Tatliciolu, E.; Dede, M.C. A Multi-Priority Controller for Industrial Macro-Micro Manipulation. Robotica 2020, 39, 217–232. [Google Scholar] [CrossRef]
  16. Dede, M.İ.C.; Maaroof, O.W.; Tatlicioğlu, E. A New Objective Function for Obstacle Avoidance by Redundant Service Robot Arms. Int. J. Adv. Robot. Syst. 2016, 13, 48. [Google Scholar] [CrossRef] [Green Version]
  17. Tatlicioğlu, E.; Braganza, D.; Burg, T.C.; Dawson, D.M. Adaptive Control of Redundant Robot Manipulators with Sub-Task Objectives. Robotica 2009, 27, 873–881. [Google Scholar] [CrossRef] [Green Version]
  18. Maaroof, O.W.; Gezgin, E.; Dede, M.İ.C. General Subtask Controller for Redundant Robot Manipulators. In Proceedings of the 2012 12th International Conference on Control, Automation and Systems, Jeju, Korea, 17–21 October 2012; IEEE: Piscataway, NJ, USA, 2012; pp. 1352–1357. [Google Scholar]
  19. Maaroof, O.W.; Dede, M.İ.C. Physical Human-Robot Interaction: Increasing Safety by Robot Arm’s Posture Optimization. In Proceedings of the ROMANSY 21—Robot Design, Dynamics and Control. ROMANSY21 2016. CISM International Centre for Mechanical Sciences (Courses and Lectures), Udine, Italy, 20–23 June 2016; Parenti-Castelli, V., Schiehlen, W., Eds.; Springer: Cham, Switzerland, 2016; Volume 569, pp. 329–337. [Google Scholar] [CrossRef]
  20. Yoshikawa, T. Manipulability and Redundancy Control of Robotic Mechanisms. In Proceedings of the IEEE International Conference on Robotics and Automation, St. Louis, MO, USA, 25–28 March 1985; IEEE: Piscataway, NJ, USA, 1985; pp. 1004–1009. [Google Scholar] [CrossRef]
  21. Yoshikawa, T. Dynamic Manipulability of Robot Manipulators. Trans. Soc. Instrum. Control Eng. 1985, 21, 970–975. [Google Scholar] [CrossRef] [Green Version]
  22. Denavit, J.; Hartenberg, R.S. A Kinematic Notation for Lower Pair Mechanisms Based on Matrices. ASME J. Appl. Mech. 1955, 22, 215–221. [Google Scholar] [CrossRef]
  23. Paul, R.P.; Stevenson, C.N. Kinematics of Robot Wrists. Int. J. Rob. Res. 1983, 2, 31–38. [Google Scholar] [CrossRef]
  24. Salisbury, J.K.; Craig, J.J. Articulated Hands: Force Control and Kinematic Issues. Int. J. Rob. Res. 1982, 1, 4–17. [Google Scholar] [CrossRef]
  25. Chiu, S.L. Task Compatibility of Manipulator Postures. Int. J. Rob. Res. 1988, 7, 13–21. [Google Scholar] [CrossRef]
  26. Merlet, J.-P. Parallel Robots, 2nd ed.; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  27. Asada, H. A Geometrical Representation of Manipulator Dynamics and Its Application to Arm Design. ASME. J. Dyn. Sys. Meas. Control 1983, 105, 131–142. [Google Scholar] [CrossRef]
  28. Colgate, J.E.; Brown, J.M. Factors Affecting the Z-Width of a Haptic Display. In Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, CA, USA, 8–13 May 1994; IEEE: Piscataway, NJ, USA, 1994; pp. 3205–3210. [Google Scholar] [CrossRef]
  29. Yoshikawa, T. Foundations of Robotics: Analysis and Control; MIT Press: Cambridge, MA, USA, 1990. [Google Scholar]
Figure 1. The surgical robotic system for minimal invasive pituitary tumor surgery: NeuRoboScope.
Figure 1. The surgical robotic system for minimal invasive pituitary tumor surgery: NeuRoboScope.
Robotics 11 00001 g001
Figure 2. Possible design parameters defined with respect to a modified DH convention.
Figure 2. Possible design parameters defined with respect to a modified DH convention.
Robotics 11 00001 g002
Figure 3. Kinematic scheme of the passive robot arm.
Figure 3. Kinematic scheme of the passive robot arm.
Robotics 11 00001 g003
Figure 4. The surgery room setting with the monitor, the NeuRoboScope system and the surgeons.
Figure 4. The surgery room setting with the monitor, the NeuRoboScope system and the surgeons.
Robotics 11 00001 g004
Figure 5. Coordinate system fixed on the surgery table (where the unit vector along the x-axis is u 1 ( 0 ) and the unit vector along the y-axis is u 2 ( 0 ) ).
Figure 5. Coordinate system fixed on the surgery table (where the unit vector along the x-axis is u 1 ( 0 ) and the unit vector along the y-axis is u 2 ( 0 ) ).
Robotics 11 00001 g005
Figure 6. Change of the robot arm structure and the manipulability ellipse (printed in blue color) during the optimization routine by using the modified condition number.
Figure 6. Change of the robot arm structure and the manipulability ellipse (printed in blue color) during the optimization routine by using the modified condition number.
Robotics 11 00001 g006
Figure 7. Variation of the manipulability index and singular values during the optimization routine by using the modified condition number.
Figure 7. Variation of the manipulability index and singular values during the optimization routine by using the modified condition number.
Robotics 11 00001 g007
Figure 8. The optimization procedure with the modified condition number: (a) Variation of the generalized inertia matrix, (b) variation of components of the objective function, (c) variation in the values of design parameters.
Figure 8. The optimization procedure with the modified condition number: (a) Variation of the generalized inertia matrix, (b) variation of components of the objective function, (c) variation in the values of design parameters.
Robotics 11 00001 g008
Figure 9. Variation of the robot arm structure and the manipulability ellipse (printed in blue color) during the optimization routine by using the modified condition number and the generalized inertia matrix.
Figure 9. Variation of the robot arm structure and the manipulability ellipse (printed in blue color) during the optimization routine by using the modified condition number and the generalized inertia matrix.
Robotics 11 00001 g009
Figure 10. Variation of the manipulability index and singular values during the optimization process by using the modified condition number and the inertia matrix.
Figure 10. Variation of the manipulability index and singular values during the optimization process by using the modified condition number and the inertia matrix.
Robotics 11 00001 g010
Figure 11. The optimization procedure with modified condition number and inertia matrix: (a) Variation of the generalized inertia matrix, (b) variation of components of the objective function, (c) variation in the values of design parameters.
Figure 11. The optimization procedure with modified condition number and inertia matrix: (a) Variation of the generalized inertia matrix, (b) variation of components of the objective function, (c) variation in the values of design parameters.
Robotics 11 00001 g011
Figure 12. Pareto set and the initiation-termination points of the optimization procedure for test B for minimizing the modified condition number, C n , and the determinant of the generalized inertia matrix, I m N .
Figure 12. Pareto set and the initiation-termination points of the optimization procedure for test B for minimizing the modified condition number, C n , and the determinant of the generalized inertia matrix, I m N .
Robotics 11 00001 g012
Figure 13. Flowchart for the implementation of the new design optimization designated for robot manipulators.
Figure 13. Flowchart for the implementation of the new design optimization designated for robot manipulators.
Robotics 11 00001 g013
Table 1. DH parameters of the passive arm.
Table 1. DH parameters of the passive arm.
k d k θ k a k α k
10 θ 1 TBD0
2 d 2 θ 2 a 2 π / 2
30 θ 3 a 3 0
40 θ 4 a 4 π / 2
5 d 5 θ 5 0 π / 2
60 θ 6 a 6 π / 2
7 d 7 θ 7 0 π / 2
80 δ 8 0 π / 2
Table 2. Corresponding options for the optimization algorithms DE, NM, RS, and SA.
Table 2. Corresponding options for the optimization algorithms DE, NM, RS, and SA.
OptionsDENMRSSA
Crossover fractions0.5---
Random Seed15/1002
Scaling factor0.6---
Tolerance0.0010.0010.0010.001
Contact ratio-0.5--
Expand ratio-2.0--
Reflect ratio-1.0--
Shrink ratio-0.5--
Level iterations---50
Perturbation scale---1.0
Penalty Function--Automatic-
Search Points--2-
Method--Interior Point-
Table 3. The optimization results for Scenario 1 obtained via DE, NM, RS, SA and ORR algorithms.
Table 3. The optimization results for Scenario 1 obtained via DE, NM, RS, SA and ORR algorithms.
Optimization AlgorithmObjective Function Y 0   ( cm ) θ 1   ( rad ) θ 2   ( rad ) a 1   ( cm )
SA2.21008 × 10−14−11.56−1.611−2.35638.48
DE1.21496 × 10−13−11.563.0792.35638.48
NM18.39033 × 10−15−48.441.6112.35638.48
NM22.21008 × 10−14−11.56−1.611−2.35638.48
RS2.21008 × 10−14−11.56−1.611−2.35638.48
ORR5.03038 × 10−9−11.57−1.611−2.35638.47
Table 4. The optimization results for Scenario 2 obtained via DE, NM, RS, SA and ORR algorithms.
Table 4. The optimization results for Scenario 2 obtained via DE, NM, RS, SA and ORR algorithms.
Optimization AlgorithmObjective Function Y 0   ( cm ) θ 1   ( rad ) θ 2   ( rad ) a 1   ( cm )
SA0.0363314−30.00−1.998−2.40828.50
DE0.0363314−30.001.9982.40828.50
NM10.0363314−29.997−1.998−2.40828.49
NM20.0363314−29.9941.9982.40828.50
RS0.0363314−30.001.9982.40828.50
ORR0.036349−26.57−1.835−2.39828.55
Table 5. The optimization results for Scenario 2 obtained via ORR algorithm for different simulation durations.
Table 5. The optimization results for Scenario 2 obtained via ORR algorithm for different simulation durations.
Method—DurationObjective Function Y 0   ( cm ) θ 1   ( rad ) θ 2   ( rad ) a 1   ( cm )
ORR—200 s0.0363496−26.57 −1.835 −2.398 28.55
ORR—300 s0.0363404−27.22 −1.864 −2.402 28.54
ORR—400 s0.0363369−27.63 −1.883 −2.404 28.53
ORR—500 s0.0363351−27.92 −1.897 −2.405 28.52
ORR—800 s0.0363329−28.48 −1.923−2.406 28.51
ORR—1600 s0.0363317−29.22 −1.959−2.408 28.50
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Maaroof, O.W.; Dede, M.İ.C.; Aydin, L. A Robot Arm Design Optimization Method by Using a Kinematic Redundancy Resolution Technique. Robotics 2022, 11, 1. https://doi.org/10.3390/robotics11010001

AMA Style

Maaroof OW, Dede MİC, Aydin L. A Robot Arm Design Optimization Method by Using a Kinematic Redundancy Resolution Technique. Robotics. 2022; 11(1):1. https://doi.org/10.3390/robotics11010001

Chicago/Turabian Style

Maaroof, Omar W., Mehmet İsmet Can Dede, and Levent Aydin. 2022. "A Robot Arm Design Optimization Method by Using a Kinematic Redundancy Resolution Technique" Robotics 11, no. 1: 1. https://doi.org/10.3390/robotics11010001

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop