Prerpints.org logo
Preprint
Article

Design Optimization of a Parallel-Serial Manipulator Considering Stiffness Criteria

This version is not peer-reviewed.

Submitted:

05 November 2024

Posted:

06 November 2024

You are already at the latest version

A peer-reviewed article of this preprint also exists.

Abstract
In this paper, we analyze stiffness and perform geometrical optimization of a parallel-serial manipulator with five degrees of freedom (5-DOF). The manipulator includes a 3-DOF redundantly actuated planar parallel mechanism, whose stiffness determines the stiffness of the whole mechanical system. First, we establish the kinematic and stiffness models of the mechanism and define its stiffness matrix. Two components of this matrix and the inverse of its condition number are chosen as stiffness indices. Next, we introduce an original two-step procedure for workspace analysis. In the first step, the chord method is used to find the workspace boundary. In the second step, the workspace is sampled inside the boundary by solving the point-in-polygon problem. After that, we derive stiffness maps and compute the average stiffness indices for various combinations of design variables. The number of these variables is reduced to two geometrical parameters, simplifying the representation and interpretation of the obtained results. Finally, we formulate the multi-objective design optimization problem, whose main goal is to maximize the lateral stiffness of the mechanism. We solve this problem using a hierarchical (ε-constraint) method. As a result, the lateral stiffness with optimized geometrical parameters has increased by 54.1 % compared to the initial design.
Keywords: 
Subject: 
Engineering  -   Mechanical Engineering

supplementary.avi (11.58MB )

1. Introduction

Parallel-serial (hybrid) manipulators are mechanical systems composed of parallel and serial kinematic chains. These manipulators combine the features of both parallel and serial mechanisms. The parallel part improves the manipulator motion accuracy and stiffness, and the serial part enlarges its workspace. These advantages have caused the development of parallel-serial manipulators for diverse applications, including machining [1,2], medicine [3,4], pick-and-place operations [5,6], haptic devices [7,8], and humanoid robots [9,10].
Design optimization, also known as dimensional, parametric, or geometrical synthesis, represents an important stage in developing parallel-serial manipulators. It aims to find dimensions of the manipulator links suitable for its specific operation. These dimensions are usually determined by solving an optimization problem, which tries to minimize or maximize one or multiple objective functions [11].
Scholars have used various performance metrics as these objective functions when they designed parallel-serial manipulators. For example, Xu et al. [12] maximized the workspace volume of a 3-DOF polishing parallel mechanism attached to a 6-DOF industrial robot. Gao et al. [13] optimized the design of a 4-DOF hybrid robotic leg by maximizing the conditioning index, which reflects the kinematic performance. A similar approach was applied to a 5-DOF machining manipulator in paper [14], whose authors reduced a constrained nonlinear optimization problem to a nonlinear algebraic equation.
The articles above focused on a single-objective dimensional synthesis. In other studies, scholars considered various performance metrics and performed multi-objective optimization. Thus, Jin et al. [15] optimized the design of a 5-DOF hybrid machine tool and considered workspace volume and the global conditioning index as performance metrics. The authors combined these metrics into a single objective using the weighting sum method. Xu et al. [16] maximized the motion range and load-bearing capacity of a 3-DOF parallel-serial rotary platform but did not specify the optimization procedure. Zou et al. [6] optimized the design of a 4-DOF pick-and-place robot by maximizing its workspace volume and manipulability metrics. The authors obtained the Pareto front of optimal solutions using the non-dominated sorting genetic algorithm II (NSGA-II). Zhang et al. [17] estimated the performance of a 5-DOF hybrid machine tool using motion/force transmission indices. The optimal geometry was chosen by analyzing performance atlases. Another 5-DOF parallel-serial machining robot was considered in paper [18], whose authors optimized its design using transmission indices and a metric of dynamic performance. The authors determined the optimal parameters using the parameter-finiteness normalization method. Yu et al. [19] also applied kinematic and dynamic metrics to the dimensional synthesis of 5-DOF spray-painting equipment. These metrics were combined into a weighted sum, and the authors used a genetic algorithm to find the optimal solution.
Stiffness metrics indicate the manipulator ability to withstand external loads, and they have also been used in the dimensional synthesis of parallel-serial robots. For example, Dong et al. [20] optimized the design of a 5-DOF hybrid machining robot and considered its lateral stiffness and the ratio of the robot workspace to its footprint. The authors used the weighting sum method and selected the optimal dimensions of the robot by analyzing performance charts. Li et al. [21] combined a stiffness index with a kinematic index and performed dimensional synthesis of another 5-DOF machine tool. The authors also used the weighting sum method and solved the optimization problem with NSGA-II. A similar approach was applied by Xu et al. [22], who optimized the geometry of a 5-DOF parallel-serial polishing machine and considered the global stiffness index and the workspace volume as performance metrics. Gao and Zhang [23] performed the four-objective optimization of another 5-DOF hybrid machine tool and analyzed the same metrics together with dexterity and manipulability indices. Using NSGA-II, the authors computed Pareto fronts of optimal solutions and then determined a comprehensive performance index. Deng et al. [24] applied the same tools to optimize the geometry of a 5-DOF parallel-serial labeling robot. Finally, we would like to mention paper [25], whose authors performed a multi-objective optimization of a 7-DOF hybrid manipulator for the vacuum vessel assembly of a fusion reactor. The objective functions included the global stiffness index and two indices of dynamic performance. The authors also used NSGA-II to derive the Pareto front of optimal solutions and compared their results with the weighting sum method.
This article focuses on the design optimization of another 5-DOF parallel-serial robot, which we have recently introduced in paper [26]. The dimensional synthesis will aim to enhance the robot stiffness and find the optimal values of its geometrical parameters. The current article represents the extended version of our previous work [27], and its major contributions include:
  • Establishing the kinematic and stiffness models of the considered manipulator.
  • Reducing the number of design variables to two geometrical parameters.
  • Developing an original procedure for workspace analysis, combining the chord method with subsequent sampling, transformed into a point-in-polygon problem.
  • Solving the multi-objective optimization problem with a hierarchical method.
The rest of the paper has the following structure. Section 2 describes the manipulator design and formulates the dimensional synthesis problem. Section 2 establishes the kinematic and stiffness models and considers the algorithms to find the manipulator workspace and solve the multi-objective design optimization problem. Section 4 performs simulations and presents numerical results. Section 5 discusses the results and features of the developed techniques and mentions directions for future studies. Section 6 recaps the entire study.

2. Manipulator Design and Problem Formulation

Figure 1 shows a computer model and a prototype of the considered manipulator. Its main component is a planar parallel mechanism with four branches. Each branch includes cylinder 3 and piston 4, which form the actuated prismatic joint. The cylinders are attached to plate 2 with revolute joints, and the pistons are attached to platform 5 with revolute joints as well. The revolute joints on either side of platform 5 have collinear axes. The parallel mechanism provides platform 5 with three DOFs relative to plate 2: two translational DOFs along the O y and O z axes and one rotational DOF about the O x axis. Plate 2 is attached rigidly to two synchronously actuated carriages. These carriages translate the plate and the parallel mechanism relative to base 1 along the O x axis. Finally, end-effector 6 rotates relative to platform 5. Therefore, the manipulator and its end-effector have five DOFs, including three translational and two rotational DOFs.
The planar parallel mechanism has redundant actuation: four linear drives control the three DOFs of platform 5. This redundancy serves multiple purposes. First, it prevents singular configurations where the platform can gain uncontrolled freedom. Second, it enhances the mechanism stiffness. Finally, the symmetrical design of the manipulator makes it more suitable for practical applications. Among them are additive technologies like selective laser sintering or 3D printing. For example, Figure 1a represents end-effector 6 as a laser beam unit.
Figure 1b shows the manipulator prototype. Here, the end-effector imitates this laser beam unit with similar weight and dimensions. The video in the Supplementary Materials demonstrates the prototype in action, with the end-effector tip tracing a curve on a sphere.
Our computer simulations and experiments have shown that the manipulator is not stiff in the lateral direction (along the O y axis). The stiffness in this direction is determined by the stiffness of the parallel mechanism, whose geometrical parameters were not chosen correctly. Thus, it becomes necessary to perform the dimensional synthesis of the mechanism and identify these parameters, which is the main goal of this article. The following section will explain the procedure for solving the synthesis problem in more detail.

3. Dimensional Synthesis

The mechanism dimensional synthesis involves computing the geometrical parameters of its links to optimize some performance metrics [11]. Section 3.1, Section 3.2 and Section 3.3 will discuss these parameters and metrics applied to the considered mechanism. Next, Section 3.4 will introduce the methods of workspace analysis, which is a necessary step in solving the dimensional synthesis problem. Finally, Section 3.5 will transform this problem into a multi-objective optimization problem and present an algorithm to solve it.

3.1. Geometrical Parameters

The primary goal of the dimensional synthesis considered in this paper is to choose manipulator geometrical parameters to increase its lateral stiffness. As stated in Section 2, this is the planar parallel mechanism whose parameters influence this stiffness. In this regard, the rest of our analysis will focus on this 3-DOF mechanism and ignore two remaining DOFs that do not affect the dimensional synthesis: translation along the O x axis and the end-effector rotation relative to the platform.
The geometrical parameters of the mechanism include the lengths of its links and the coordinates of the joint axes. We assume the platform dimensions and the stroke length of the linear drives are already specified from the preceding workspace analysis [26] and prototyping (Figure 1b). The only variable geometrical parameters are coordinates p A i of plate revolute joints A i , i = 1 , ⋯ , 4 (Figure 2a). We consider the planar case, so each vector p A i has two unknown components—there are eight unknown parameters in total. Since the mechanism has a symmetrical design, we can reduce the number of these parameters to three. They include variables y 1 and y 2 , which define the y coordinates of the joints, and variable h, which defines the z coordinate of the upper joint (Figure 2a).
Furthermore, we can reduce the number of variables from three to two if we consider the following auxiliary condition. In the lowest configuration of the mechanism, each branch has a length of q min . Points A i of two adjacent branches belong to a circle with radius q min centered at points B i , the centers of the platform revolute joints, which coincide for these two branches (Figure 2b). We can use Pythagoras’ theorem to compute height H of point B i in the considered configuration as a function of variable y 1 :
H = q min 2 − ( y 1 − w / 2 ) 2 ,
where w is a width of the platform, which is known from the mechanism design.
Now, we can use Equation (1) and express variable h as a function of y 1 and y 2 :
h = H − q min 2 − ( y 2 − w / 2 ) 2 .
Thus, we have reduced the number of variables in the dimensional synthesis problem from eight components of vectors p A i , i = 1 , ⋯ , 4 , to two parameters y 1 and y 2 , defining the mechanism geometry. The synthesis problem in this paper involves determining these parameters considering stiffness criteria, whose model is established in Section 3.3. This model will need a Jacobian matrix of the mechanism, and the next subsection will present the required kinematic relations.

3.2. Kinematic Model

This subsection aims to derive kinematic relations, which are prerequisite for developing a stiffness model and solving the dimensional synthesis problem. The first task is to solve the inverse kinematic problem, i.e., to determine displacements in the mechanism joints for the specified posture of its end-effector. We can describe the latter by parameters y and z, which are the coordinates of end-effector tip C, and angle φ , which determines the end-effector orientation (Figure 3). The joint displacements include stroke q i of the linear drive and angles α i and β i in the passive revolute joints of the i-th branch, i = 1 , ⋯ , 4 .
First, we can compute stroke q i from the equation that relates the coordinates of points A i and B i :
q i 2 = ( p A i − p B i ) 2 ,
where p A i and p B i are the position vectors of points A i and B i in base reference frame O y z :
p A 1 = − y 1 0 , p A 2 = − y 2 h , p A 3 = y 1 0 , p A 4 = y 2 h ,
p B i = y z + p C B i = y z + cos ( φ ) − sin ( φ ) sin ( φ ) cos ( φ ) r C B i , r C B 1 = r C B 2 = l C D − w / 2 , r C B 3 = r C B 4 = l C D w / 2 .
Coordinates p A i in Equation (4a) depend on the mechanism geometry, and we compute them according to Figure 2 and Equations (1) and (2). Coordinates p B i in Equation (4b) depend on the end-effector posture and parameters w and l C D , which are the platform width and the distance between points C and D, respectively (Figure 3).
Let s ^ i be a unit vector parallel to line A i B i :
s ^ i = 1 q i ( p B i − p A i ) = s i y s i z .
Now, we can determine the remaining angles in the passive revolute joints as follows:
α i = atan2 ( s i z , s i y ) , β i = π + φ − α i ,
where atan2 is the two-argument arctangent function [28] (ch. 6).
Thus, we have expressed displacements in all joints of the mechanism in terms of the end-effector configuration, defined by parameters y, z, and φ . The next step of the kinematic analysis is to derive the Jacobian matrix of the mechanism, which relates infinitesimal displacements δ q i , i = 1 , ⋯ , 4 , in the actuated joints and infinitesimal displacements δ y , δ z , and δ φ of the end-effector. For this purpose, we differentiate both sides of Equation (3). Considering Equation (5) and rearranging the terms, we get:
δ q i = s ^ i T δ p C B i = s ^ i T det p C B i s ^ i δ y δ z δ φ = j i T δ p .
Vector p in the equation above includes the end-effector coordinates, while vector j i is a planar “version” of the Plücker coordinates of line A i B i , where the third component is a moment of this line about point C [29]. Combining Equations (7) for all branches, we get:
δ q = J δ p ,
where q = [ q 1 q 2 q 3 q 4 ] T is a vector of actuated coordinates; J = [ j 1 j 2 j 3 j 4 ] T is the 4 × 3 Jacobian matrix of the mechanism. The matrix is rectangular because of the redundant actuation. We will use this matrix in the stiffness model considered in the next subsection.

3.3. Stiffness Model

Scholars have proposed various models and measures to analyze the stiffness of parallel mechanisms [30]. The links of the considered mechanism are made of duraluminum, and we assume their stiffness dominates the stiffness of the drives. This is a typical assumption for stiffness modeling of planar parallel mechanisms [31]. Therefore, we will apply a conventional stiffness model where the drives are the only source of compliance [32].
To derive the stiffness model, we consider a static configuration of the mechanism when its drives are locked. Our goal is to find a relation that connects the load exerted to the end-effector with its displacements caused by this load. Let w be a wrench applied at end-effector tip C. This wrench summarizes all possible external forces and torques acting on the end-effector. We can express it component-wise as w = [ f y f z τ x ] T , where f y , f z , and τ x represent the forces along the O y and O z axes and the torque about the O x axis. When wrench w acts on the mechanism end-effector, the latter rotates by angle δ φ about the O x axis, and its tip C displaces by δ y and δ z along the O y and O z axes. We can combine these displacements into vector δ p = [ δ y δ z δ φ ] T . At the same time, the i-th drive of the mechanism, i = 1 , ⋯ , 4 , will generate torque τ i proportional to stroke elongation δ q i :
τ i = c δ q i ,
where c is a drive stiffness, which we assume identical for each drive.
These torques must balance wrench w , so we can write [32]:
w = J T τ ,
where τ = [ τ 1 τ 2 τ 3 τ 4 ] T and J is the Jacobian matrix derived in the previous subsection. Combining Equations (8), (9), and (10), we get the desired expression:
w = c J T J δ p = K δ p ,
where K = c J T J is a stiffness matrix of the mechanism.
Finally, we can rewrite the obtained equation in a component-wise form:
f y f z τ x = k y ⋯ ⋯ ⋯ k z ⋯ ⋯ ⋯ k φ δ y δ z δ φ ,
where parameters k y and k z characterize the mechanism stiffness along the O y and O z axes, respectively; parameter k φ characterizes the rotational stiffness of the mechanism about the O x axis; “⋯” indicate other components of stiffness matrix K that characterize the “cross-coupled” stiffness.
As discussed in Section 2, the dimensional synthesis problem considered in this paper aims to enhance the lateral stiffness of the mechanism. This is parameter k y that characterizes this stiffness. However, maximizing this parameter can decrease the mechanism stiffness in other directions, as well as its overall stiffness. In this regard, we will consider two additional stiffness indices. The first one is parameter k z characterizing the vertical stiffness. The second one is inverse condition number k − 1 = λ min / λ max of stiffness matrix K characterizing the overall stiffness of the mechanism, where λ min and λ max are the minimum and maximum eigenvalues of matrix K .
The reason that we consider the inverse condition number is because it varies between zero and one, which gives more representative results. The closer its value is to zero, the lower the mechanism stiffness is, and vice versa. One should note from Equation (7) that Jacobian matrix J is nonhomogeneous in units. Therefore, stiffness matrix K will be nonhomogeneous in units too. This nonhomogeneity can lead to incorrect results when computing parameter k − 1 . To overcome this issue, we use a standard trick and normalize the last column of Jacobian matrix J by a characteristic length [11] (ch. 2), which we set equal to the length of C B i . Thus, we compute inverse condition number k − 1 for normalized stiffness matrix K n = c J n T J n , where J n is the normalized Jacobian matrix whose rows j n i T , i = 1 , ⋯ , 4 , have the following representation:1
j n i T = s ^ i T det p C B i s ^ i ∥ p C B i ∥ .
Since the Jacobian matrix depends on the mechanism posture, indices k y , k z , and k − 1 will also depend on this posture. To estimate the mechanism stiffness, we will compute the average values of these indices over the mechanism workspace:
k ¯ y = ∫ W k y d W W , k ¯ z = ∫ W k z d W W , k ¯ − 1 = ∫ W k − 1 d W W ,
where W is the workspace area.
In practice, it is usually difficult to evaluate the integrals in Equation (14). The standard way to overcome this issue is to sample the workspace and take the average values of the stiffness indices evaluated in the discrete points [11] (ch. 1). The denser the discrete points are, the more accurate results we get. The following subsection will present the algorithm to determine the mechanism workspace and perform this sampling.

3.4. Workspace Analysis

Solving the dimensional synthesis problem requires computing the mechanism workspace for various combinations of geometrical parameters y 1 and y 2 and evaluating indices k ¯ y , k ¯ z , and k ¯ − 1 over the obtained workspace. Since the mechanism end-effector has three DOFs (two translational and one rotational), there are several types of workspaces [30]. In this paper, we will focus on translation workspaces—the set of the end-effector postures (coordinates y and z) where it has fixed orientation (fixed angle φ ).
The standard approach to determine the workspace in dimensional synthesis problems is to sample the coordinate space around the end-effector, solve inverse kinematics for each sampled point, and check the joint constraints. For the considered mechanism, we can express these constraints by the following conditions:
q min ≤ q i ≤ q max , α min ≤ α i ≤ α max , β min ≤ β i ≤ β max , i = 1 , ⋯ , 4 ,
where “min” and “max” mean the minimum and maximum values of the corresponding joint displacements, which we assume identical for each branch.
Thus, the workspace analysis involves sampling the y − z coordinate space, applying Equations (3)–(6) derived in Section 3.2, and checking conditions in Equation (15). We need to repeat this procedure for each combination of parameters y 1 and y 2 . This can be computationally expensive, because the accurate results need dense sampling, increasing the computation time.
In this regard, we propose an alternative approach for the workspace analysis. First, we will use the chord method [26,33] to find the workspace boundary, and then we will sample the workspace inside the obtained boundary. The chord method is an optimization-based computationally effective tool, which allows determining the boundary of non-convex workspaces as well. The subsequent paragraphs will outline the applied techniques.

3.4.1. Finding a Point on the Boundary

The first step in computing the workspace is to find a boundary point. First, we select point U 0 for which we know it will be inside the workspace (Figure 4). This choice is often self-evident, and we can set coordinates u 0 of point U 0 to be approximately near the expected workspace center:
u 0 = 0 ( q min + q max ) / 2 − l C D .
After that, we consider a ray starting from point U 0 in a direction defined by unit vector n ^ 0 (Figure 4). Let U be a point on this ray with coordinates u = [ y z ] T . If we “move” point U along the ray, the first point for which a solution to the inverse kinematic problem violates any joint constraint will be the boundary point. We can define the corresponding optimization problem that computes the coordinates of this point:
max u ∥ u − u 0 ∥ , s . t . q min ≤ q i ( u ) ≤ q max , i = 1 , ⋯ , 4 , α min ≤ α i ( u ) ≤ α max , i = 1 , ⋯ , 4 , β min ≤ β i ( u ) ≤ β max , i = 1 , ⋯ , 4 , y min ≤ y ≤ y max , ( u − u 0 ) T n ^ 0 = ∥ u − u 0 ∥ .
In the optimization problem above, we compute joint displacements q i , α i , and β i using inverse kinematics and Equations (3)–(6).2 Inequality y min ≤ y ≤ y max is an auxiliary condition that limits the workspace width and comes from practical considerations. The last equality condition in problem (17) ensures that point U remains on the ray.
To solve this problem, we define the initial guess as u 0 + δ 0 n ^ 0 , where δ 0 is a small step along the ray. A solution to the optimization problem gives us coordinates u 1 of point U 1 that belongs to the workspace boundary. It will be the starting point for constructing the whole boundary using the chord method, as discussed further.

3.4.2. Tracing the Boundary

Starting at point U 1 , we determine other points U 2 , U 3 , ⋯ on the boundary by successive circular searches with constant chord length d. For example, let U j be a boundary point with coordinates u j and n ^ j be a unit vector directed outside the workspace (Figure 5a). We consider arbitrary point U with coordinates u = [ y z ] T , which stays on a circle with radius d centered at point U j . Vector t j = u − u j directs from U j to U and forms angle ψ with vector n ^ j :
ψ = acos n ^ j T t j ∥ t j ∥ , if σ ≥ 0 , 2 π − acos n ^ j T t j ∥ t j ∥ , if σ < 0 ,
where σ = n j y t j z − n j z t j y , with n j y , n j z , t j y , and t j z being the corresponding components of vectors n ^ j and t j . Parameter σ is used to select the angle between these vectors in a counter-clockwise direction (Figure 5b).
To find the next point on the workspace boundary (point U j + 1 ), we “move” point U along the circle and solve the inverse kinematic problem for coordinates u until any joint constraint is violated, which indicates that we have found the boundary point. This procedure is equivalent to minimizing angle ψ , and it corresponds to the following optimization problem:
min u ψ , s . t . q min ≤ q i ( u ) ≤ q max , i = 1 , ⋯ , 4 , α min ≤ α i ( u ) ≤ α max , i = 1 , ⋯ , 4 , β min ≤ β i ( u ) ≤ β max , i = 1 , ⋯ , 4 , y min ≤ y ≤ y max , ( u − u j ) 2 = d 2 .
The last equality condition in the optimization problem above ensures that point U j belongs to the circle. We define the initial guess as u j − δ n ^ j , where δ is a small step “inside” the workspace. A solution to this problem gives us coordinates u j + 1 of point U j + 1 . We can now compute t j = u j + 1 − u j (the blue arrows in Figure 5a) and define unit vector n ^ j + 1 for the next circular search:
n ^ j + 1 = cos ( atan2 ( t j z , t j y ) − π / 2 ) sin ( atan2 ( t j z , t j y ) − π / 2 ) .
We solve optimization problem (19) consecutively for j = 1 , 2 , ⋯ , starting with point U 1 and vectors n ^ 1 = n ^ 0 and u 1 , obtained after solving problem (17). The algorithm terminates with point U n when the following conditions are satisfied:
∥ u n − u 1 ∥ ≤ d and ∥ u n − u 2 ∥ ≤ d .
As a result, we have got a set of coordinates u 1 , ⋯ , u n of n points U 1 , ⋯ , U n that define the workspace boundary. The smaller chord length d is, the more precise boundary we will get. Paper [33] discusses other issues of the chord method in more detail. Now, we can sample the workspace inside the boundary using the method discussed next.

3.4.3. Sampling Inside the Boundary

To the sample the workspace inside the obtained boundary, we first determine the rectangle that envelops this boundary. Let V 1 V 2 V 3 V 4 be this rectangle, whose vertices have coordinates v 1 , ⋯ , v 4 (Figure 6). We compute these coordinates as follows:
v 1 = min j ( y j ) min j ( z j ) , v 2 = max j ( y j ) min j ( z j ) , v 3 = max j ( y j ) max j ( z j ) , v 4 = min j ( y j ) max j ( z j ) ,
where y j and z j are the corresponding components of vector u j , j = 1 , ⋯ , n .
After that, we sample the O y z plane inside the rectangle. Let d y and d z be the sample steps along the O y and O z axes (Figure 6). We determine numbers n y and n z of samples along these axes using the following expressions:
n y = v 2 y − v 1 y d y , n z = v 3 z − v 2 z d z ,
where v 1 y , v 2 y , v 2 z , and v 3 z are the corresponding components of vectors v 1 , v 2 , and v 3 ; ⌈ ⋯ ⌉ is the ceiling function that gives the lowest integer greater or equal to its argument.
Thus, we have sampled rectangle V 1 V 2 V 3 V 4 into points P l m with coordinates p l m :
p l m = v 1 + ( l − 1 ) d y ( m − 1 ) d z , l = 1 , ⋯ , n y , m = 1 , ⋯ , n z .
The next step is to check which sample points stay inside the workspace boundary, i.e., which points are inside polygon U 1 U 2 ⋯ U n . For this purpose, we will follow the procedure proposed by Hormann and Agathos [34], whose details are outlined below.
Let P l m be a point under consideration. This point defines four quadrants in the O y z plane, as shown in Figure 7a. For each polygon vertex (boundary point) U j , j = 1 , ⋯ , n , we assign number a j ∈ { 0 , 1 , 2 , 3 } , whose value depends on the quadrant of point U j . Next, for each polygon edge U j U j + 1 , we compute number b j = a j + 1 − a j .3 Finally, we calculate number ω using the following algorithm:
ω = 0 for j = 1 , ⋯ , n switch b j : − 3 : ω = ω + 1 3 : ω = ω − 1 − 2 : if f ( j ) > 0 : ω = ω + 1 2 : if f ( j ) < 0 : ω = ω − 1 return ω
where
f ( j ) = det u j − p l m u j + 1 − p l m .
Algorithm (25) actually determines how many times the ray starting at point P l m and directing along the O y axis intersects polygon edges, considering the “direction” of these edges. The resulting value of number ω can be either 0 or 1. If ω = 1 , point P l m is inside the polygon, i.e., inside the workspace boundary. Function f ( j ) , applied to vertices U j and U j + 1 in opposite quadrants, checks the orientation of triangle P l m U j U j + 1 and excludes the edges that do not intersect the ray (Figure 7b).
Note that algorithm (25) includes only summation, subtraction, and multiplication operations, and it is suitable for non-convex polygons as well. Therefore, we can determine which workspace samples are inside the boundary in a computationally effective manner. It allows us to set sample steps d y and d z smaller than chord length d and get a dense sampling, which improves the accuracy of results.
Thus, we have got a set of N points with coordinates p 1 , ⋯ , p N that belong to the workspace. These are the points for which we will compute the stiffness indices considered in Section 3.3. For this purpose, we use the following discrete representation of Equation (14):
k ¯ y = ∑ s = 1 N k y ( p s ) N , k ¯ z = ∑ s = 1 N k z ( p s ) N , k ¯ − 1 = ∑ s = 1 N k − 1 ( p s ) N .

3.5. Synthesis Algorithm

The methods discussed in Section 3.2, Section 3.3 and Section 3.4 allow us to compute stiffness indices k ¯ y , k ¯ z , and k ¯ − 1 for the given values of design parameters y 1 and y 2 . In the dimensional synthesis, we specify ranges y 1 min ≤ y 1 ≤ y 1 max and y 2 min ≤ y 2 ≤ y 2 max for these parameters, sample the ranges with steps d y 1 and d y 2 , and evaluate the indices for each sample. Because the mechanism has a symmetrical design, it suffices to consider the samples with y 1 ≤ y 2 . As a result, we get three sets of the stiffness indices: { k ¯ y p } , { k ¯ z p } , and { k ¯ p − 1 } , p = 1 , ⋯ , K , where K is a number of samples. Each sample p corresponds to a unique combination of parameters y 1 and y 2 .
According to Section 2, our task is to maximize the lateral stiffness of the mechanism. A straightforward solution here is to choose a combination of parameters y 1 and y 2 corresponding to the largest element of set { k ¯ y p } . However, for this combination, the vertical and overall stiffness can diminish to unacceptable levels. Thus, we have a (discrete unconstrained) multi-objective optimization problem with conflicting stiffness criteria.
Scholars have proposed various methods to solve these problems [35,36]. In this work, we will use a hierarchical ( ε -constraint) method, as discussed in paper [37]. First, we define four objective functions f 1 ( p ) , ⋯ , f 4 ( p ) to be maximized in the following priority order:
f 1 : P → { k ¯ y p } , f 2 : P → { k ¯ p − 1 } , f 3 : P → { k ¯ z p } , f 4 : P → { W p } , p ↦ k ¯ y p , p ↦ k ¯ p − 1 , p ↦ k ¯ z p , p ↦ W p ,
where P = { 1 , ⋯ , K } is a set of sample numbers; { W p } is a set of workspace areas W 1 , ⋯ , W K , which can compute approximately using the next equation:
W p ≈ N p d y d z ,
where N p is a number of points inside the workspace boundary for the p-th combination of parameters y 1 and y 2 .
We have included the fourth objective function in Equation (27) because the workspace shape and dimensions change as we vary parameters y 1 and y 2 . Function f 1 ( p ) , which evaluates the lateral stiffness, has the highest priority according to specified task. Function f 2 ( p ) , which evaluates the overall stiffness, has the second priority in this paper.
After that, the hierarchical optimization follows the next steps [37]:
  • Find the maximum and minimum values of each objective function over set P :
    f i max = max p ∈ P f i ( p ) , f i min = min p ∈ P f i ( p ) , i = 1 , ⋯ , 4 .
    Considering Equation (27), we can compute these values in a straightforward manner.
  • Solve the following optimization problems sequentially for i = 2 , 3 , 4 :
    max p f i ( p ) , s . t . p ∈ P , f r ( p ) ≥ f r * − ε r ( f r * − f r min ) , r = 1 , ⋯ , i − 1 ,
    where f r * is the optimal value of the f r objective function after solving the r-th optimization problem, and we have f 1 * = f 1 max ; ε r is used to set a “distance” to optimum value f r * . Similar to problems (29), we can solve each optimization problem by simple evaluation of the objective functions over set P .
The hierarchical procedure above relies on the following idea. First, we solve the optimization problem for the most important objective function. Next, we consider the less important objectives, and parameter ε r indicates what portion of the already optimized objective we can sacrifice when optimizing the next objective. A solution to the last ( i = 4 ) optimization problem (30) corresponds to the optimal values of parameters y 1 and y 2 .
A major challenge in this approach is to choose the values of parameters ε r , r = 1 , 2 , 3 . This choice depends on the importance of the r-th objective function f r and its potential conflicts with other objectives. Following the techniques from paper [37], we introduce a metric to measure the conflict between the objectives. Let p i * = argmax p ∈ P f i ( p ) be a solution to the i-th maximization problem in Equation (29), i = 1 , ⋯ , 4 . This solution corresponds to vector y i * = [ y 1 i * y 2 i * ] T of optimal design parameters y 1 and y 2 . First, we compute “central” solution y c as the mean of these vectors:
y c = 1 4 ∑ i = 1 4 y i * .
Vector y c in the equation above approximates the center of the set of solutions. Next, we measure angle θ i j between vectors y i * − y c and y j * − y c , i = 1 , ⋯ , 4 , j = 1 , ⋯ , 4 :
cos ( θ i j ) = ( y i * − y c ) T ( y j * − y c ) ∥ y i * − y c ∥ ∥ y j * − y c ∥ ,
and compute conflict indicator c i j between the i-th and j-th objective functions:
c i j = 1 2 1 − cos ( θ i j ) .
Conflict indicator c i j has a value between zero and one. The larger this value is, the more conflicting the i-th and j-th objectives are, while c i j = 0 means these objectives do not conflict; c i i is always equal to zero.
Finally, we define parameters ε r , r = 1 , 2 , 3 , using the expression below:
ε r = γ ∑ i = 1 4 c r i w i ,
where w i is a priority factor of the i-th objective function, such that ∑ i = 1 4 w i = 1 ; γ is a scalar factor determined by numerical tests.
The weighted sum in Equation (34) has the following meaning. If high-priority objectives conflict with the r-th objective, we do not impose strict constraints on f r because it will restrict these high-priority objectives; thus, we get the big value of ε r . If the objectives conflicting with the r-th objective all have low priorities, it is not necessary to set strict constraints on f r ; the value of ε r will be small.
This concludes the dimensional synthesis problem of the considered mechanism. We can summarize the entire synthesis procedure as a sequence of steps:
  • Define constant parameters:
    • Geometrical parameters of the manipulator: w, l C D .
    • Joint constraints: q min , q max , α min , α max , β min , β max .
    • Drive stiffness: c.
    • Parameters of the chord method: y min , y max , n ^ 0 , δ 0 , δ , d.
    • Parameters of the workspace sampling method: d y , d z .
    • Parameters of the design space sampling : y 1 min , y 1 max , y 2 min , y 2 max , d y 1 , d y 2 .
    • Parameters of the hierarchical optimization: γ , w 1 , ⋯ , w 4 .
  • Define orientation φ of the end-effector.
  • Sample parameters y 1 and y 2 (with y 1 ≤ y 2 ) and determine number K of the samples.
  • For each sample p = 1 , ⋯ , K :
    • Find the first point on the workspace boundary by solving optimization problem (17).
    • Determine the whole boundary by solving a sequence of optimization problems (19).
    • Sample the rectangle around the obtained boundary using Equations (22)–(24).
    • Find N p sample points inside the rectangle using algorithm (25).
    • For each sample s = 1 , ⋯ , N p , determine the normalized stiffness matrix and compute the stiffness indices using Equations (11)–(13).
    • Compute the average values of these stiffness indices using Equation (26).
    • Compute the workspace area using Equation (28).
  • Define objective functions f 1 , ⋯ , f 4 according to Equation (27) and find their maximum and minimum values by solving problems (29).
  • Determine parameters ε 1 , ε 2 , and ε 3 using Equations (31)–(34).
  • Find the optimal values of design parameters y 1 and y 2 by solving a sequence of optimization problems (30).
The next section will illustrate the application of the proposed techniques with numerical examples.

4. Simulations and Results

Table 1 lists the geometrical parameters and joint constraints of the mechanism, which correspond to its computer model and prototype (Figure 1). Design parameters y 1 and y 2 were sampled within bounds y 1 min = y 2 min = 255 mm and y 1 max = y 2 max = 595 mm with steps d y 1 = d y 2 = 10 mm . Considering condition y 1 ≤ y 2 , we got K = 630 samples.
Next, we determined the mechanism workspace and computed the stiffness indices for various orientations of the end-effector: angle φ was sampled in a range from 0 ∘ to 30 ∘ with a step of 5 ∘ (we ignored the negative values because of the symmetrical design of the mechanism). As an example, Figure 8 illustrates the workspace boundary for various orientations with y 1 = 255 mm and y 2 = 505 mm . We computed the boundary using the chord method with chord length d = 40 mm and other parameters specified in Table 2. Optimization problems (17) and (19) were solved in MATLAB using standard function “fmincon” with its default settings. The figure shows the workspace diminishes as angle φ increases. The right vertical boundary of each workspace corresponds to right limit y max = 200 mm (Table 2), which was set for the chord method.
After that, we sampled the workspaces inside the obtained boundaries with sample steps d y = d z = 10 mm , four times smaller than chord length d. Figure 9 shows the sampling results for φ = 0 ∘ and various values of design parameters y 1 and y 2 , which were obtained using algorithm (25). The workspaces not only have different shapes, but also slightly displace along the O z axis. This concludes the workspace analysis of the mechanism. Without loss of generality, we will exemplify subsequent results with these workspaces.
The next step was to determine stiffness maps, i.e., the distributions of stiffness indices k y , k z , and k − 1 over the obtained workspaces. Figure 10, Figure 11 and Figure 12 show these distributions over the workspaces from Figure 9. We defined drive stiffness c = 1 N / m since it is just a scaling factor in Equation (11). In this regard, the values of the stiffness indices in Figure 10, Figure 11 and Figure 12 have no physical meaning, and we have omitted their units. Nonetheless, the stiffness maps allow us to estimate the regions of high and low stiffness and how it varies in percents.
Figure 10 indicates that the lateral stiffness is almost two times higher at the bottom of the workspace than on its top. This result is quite reasonable: in the uppermost configurations, the branches of the mechanism stay close to the vertical state, which lowers their ability to withstand lateral forces. If we compare Figure 10d with Figure 10b, we can see that the minimum value of k y has increased three times (from 0.3 to 0.9). This is also an expected result: the “wider” the branches are, the better they withstand lateral forces.
For similar reasons, the vertical stiffness of the mechanism is higher at the top of the workspace, and it decreases as the branches have wider placements (Figure 11). Thus, the indices of the lateral and vertical stiffness conflict with each other. On the other hand, the overall stiffness of the mechanism depends mainly on the relative location of its adjacent branches. The further these branches are to each other, the higher the overall stiffness is. Figure 12a and Figure 12b exemplify this behavior: here, difference y 2 − y 1 is equal to 250 mm and 100 mm, respectively, and the minimum value of k − 1 has decreased 2.6 times (from 0.13 to 0.05).
Figure 13 shows the extreme case when the adjacent branches coincide: y 1 = y 2 = 255 mm . The lateral and vertical stiffness indices behave like in the previous examples. The overall stiffness, however, is zero over the whole workspace (note the 10 − 8 multiplier of k − 1 in Figure 13c). We can explain this result as follows. With coincident branches, the mechanism degenerates into a familiar four-bar linkage, which has one DOF. Therefore, the values of parameters y 1 and y 2 do not matter if they are identical—the mechanism will have a zero stiffness in each case.
For each combination of parameters y 1 and y 2 , we computed the average values of the stiffness indices and the workspace area using Equations (26) and (28). Figure 14 illustrates the obtained results. The plots in this figure have a triangular form because we considered the combinations with y 1 ≤ y 2 . The results match our previous discussions, and we can draw the following conclusions from these plots:
  • Average lateral stiffness k ¯ y increases as sum y 1 + y 2 increases.
  • Average vertical stiffness k ¯ z increases as sum y 1 + y 2 decreases.
  • Average overall stiffness k ¯ − 1 increases as difference y 2 − y 1 increases.
  • Workspace area W increases as sum y 1 + y 2 decreases.
Finally, we performed the multi-objective hierarchical optimization of the design parameters according to Section 3.5. As we discussed earlier, maximizing the lateral stiffness has the highest priority in this optimization problem. However, Figure 14 shows that this objective conflicts with other stiffness indices. In view of the above, we defined the following priority factors for the objective functions:
w 1 = 0 . 3 , w 2 = 0 . 5 , w 3 = 0 . 1 , w 4 = 0 . 1 ,
where we set factor w 2 for the overall stiffness higher than factor w 1 for the lateral stiffness to not sacrifice too much overall stiffness. Scalar factor γ was chosen equal to 1.2 after a series of numerical tests.
After the optimization, we got the following values of the design parameters: y 1 = 345 mm and y 2 = 575 mm , corresponding to the white squares in Figure 14. Compared to the initial design parameters y 1 = 255 mm and y 2 = 505 mm (the white circles in Figure 14), we have the following results:
  • Average lateral stiffness k ¯ y has increased by 54.1 %.
  • Average vertical stiffness k ¯ z has decreased by 10.3 %.
  • Average overall stiffness k ¯ − 1 has decreased by 9.9 %.
  • Workspace area W has decreased by 12.1 %.
Although the lateral stiffness has significantly increased, the values of the other performance metrics have become smaller. This decrease, which we consider quite acceptable, is unavoidable because the performance metrics contradict each other. Figure 10a, Figure 10c, Figure 11a, Figure 11c, Figure 12a, and Figure 12c illustrate the workspace shapes and stiffness maps for the initial and optimized designs and φ = 0 ∘ . The stiffness maps for other angles φ have similar behavior, and we omit them for clarity.
This concludes the dimensional synthesis of the considered mechanism. The next section will discuss the obtained results and proposed algorithms.

5. Discussion

The symmetric design of the mechanism allowed reducing the number of unknown geometrical parameters to two coordinates of the joints. We achieved this reduction because certain parameters, like the platform width and actuator stroke limits, were predetermined in this study. The values of these parameters also affect the mechanism stiffness. We could include them in the dimensional synthesis problem, but its complexity would grow in this case. On the other hand, the reduced model clearly illustrates how the design parameters impact the performance metrics (Figure 14). A designer can also use the obtained results without solving the multi-objective optimization problem, as we did in paper [27].
The chord method applied to the workspace analysis represents an effective tool for finding the workspace boundary. Unlike conventional discretization approaches [38], it does not need to presample the motion space of the end-effector and check the points outside its workspace. The chord method can also identify other types of workspaces at almost the same level of computational complexity [39]. We used it to compute the reachable and dexterous workspaces of the considered mechanism [26], while paper [40] applied it to a spatial mechanism. Hay and Snyman [41] showed how to use it for dimensional synthesis without subsequent sampling. The method limitations include computing the voids inside the workspace and treating the so-called bifurcation points, as discussed in [33]. Nonetheless, we believe the chord method is a useful tool for workspace analysis.
Having found the workspace boundary, we reduced the workspace sampling to the point-in-polygon problem. Algorithm (25) is a computationally efficient way to solve this problem because it relies only on simple mathematical operations. In paper [34], the authors discussed other possibilities for improving this method and presented algorithm variations.
In the next step, we solved the multi-objective optimization problem using the hierarchical ε -constraint method. We preferred this method to another commonly used approach, the weighting sum method [42], for several reasons. First, we tried the weighting sum method with various weight values, but it usually gave us the “corner” solutions: y 1 = y 2 = 595 mm (inappropriate because of the zero overall stiffness) or y 1 = 255 mm and y 1 = 595 mm . In the latter case, the lateral stiffness k ¯ y and overall stiffness k ¯ − 1 both increase by 51.8 % and 33.9 %, respectively, while vertical stiffness k ¯ z and workspace area W decrease by 9.8 % and 16.5 %. At first glance, these results appear more attractive compared to the hierarchical method. However, with these geometrical parameters, the workspace has almost a triangular shape, less suitable for practical applications. The hierarchical approach is more versatile because it allows us to get “intermediate” solutions. Its other benefit over the weighting sum method is that we do not need to normalize objective functions. Paper [37] analyzes both methods in more detail.
Summarizing the performed research, we can mention the following directions for future studies that could improve the proposed algorithms and obtained results:
  • Enhancing the stiffness model. In Section 3.3, we assumed the drives were the only source of mechanism compliance. We can get more accurate results if we consider the stiffness of the revolute joints, moving plate, cylinders, and pistons.
  • Modifying the optimization algorithm. In Section 3.5, we solved the multi-objective optimization problem with the hierarchical approach and assigned a priority factor to each objective. Instead of setting these factors, it looks more attractive to a designer to explicitly specify the decrease rate of the low-priority objectives.
  • Experimental validation. The theoretical results presented in Section 4 look reasonable, but they have not been verified in practice yet. To validate the results, we plan to estimate the end-effector displacements under the specified load using external measurement systems (e.g., a laser tracker or interferometer).

6. Conclusions

The paper has performed the multi-objective dimensional synthesis of a 3-DOF planar parallel mechanism, which constitutes a part of a 5-DOF parallel-serial manipulator and affects its performance. The synthesis problem aimed to find the geometrical parameters of this mechanism that would increase its lateral stiffness. We reduced the number of these parameters to two and introduced various metrics to evaluate stiffness. To compute the mechanism workspace, we proposed a combination of the chord and sampling methods. Finally, we solved the optimal design problem using the hierarchical method.
The results show that the average lateral stiffness of the mechanism has increased by 54.1 %. Other performance metrics that include the average vertical stiffness, the average overall stiffness, and the workspace area have decreased by 10.3 %, 9.9 %, and 12.1 %, respectively. This decrease is caused by the conflicting nature of the performance metrics, and we find it quite acceptable. In future studies, we will develop more accurate stiffness models and perform experimental verification of the obtained results.

Supplementary Materials

The following supporting information can be downloaded at the website of this paper posted on Preprints.org, Video S1: a movie of the prototype operation.

Funding

This research was supported by Russian Science Foundation (RSF) under grant No. 22-79-10304, https://rscf.ru/en/project/22-79-10304/.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The presented data are available on request from the author.

Conflicts of Interest

The author declares that he has no conflict of interest.

References

  1. Russo, M.; Zhang, D.; Liu, X.J.; Xie, Z. A review of parallel kinematic machine tools: design, modeling, and applications. Int. J. Mach. Tools Manuf. 2024, 196, 104118. doi:10.1016/j.ijmachtools.2024.104118. [CrossRef]
  2. Qin, X.; Li, Y.; Feng, G.; Bao, Z.; Li, S.; Liu, H.; Li, H. A novel surface topography prediction method for hybrid robot milling considering the dynamic displacement of end effector. Int. J. Adv. Manuf. Technol. 2024, 130, 3495–3508. doi:10.1007/s00170-023-12814-y. [CrossRef]
  3. Lin, C.; Guang, C.; Zheng, Y.; Ma, K.; Yang, Y. Preliminary evaluation of a novel vision-guided hybrid robot system for capsulotomy in cataract surgery. Displays 2022, 74, 102262. doi:10.1016/j.displa.2022.102262. [CrossRef]
  4. Tao, B.; Feng, Y.; Fan, X.; Lan, K.; Zhuang, M.; Wang, S.; Wang, F.; Chen, X.; Wu, Y. The accuracy of a novel image-guided hybrid robotic system for dental implant placement: an in vitro study. Int. J. Med. Robot. Comput. Assist. Surg. 2023, 19, e2452. doi:10.1002/rcs.2452. [CrossRef]
  5. Huang, T.; Li, Z.; Li, M.; Chetwynd, D.G.; Gosselin, C.M. Conceptual design and dimensional synthesis of a novel 2-DOF translational parallel robot for pick-and-place operations. J. Mech. Des. 2004, 126, 449–455. doi:10.1115/1.1711822. [CrossRef]
  6. Zou, Q.; Zhang, D.; Huang, G. Kinematic models and the performance level index of a picking-and-placing hybrid robot. Machines 2023, 11, 979. doi:10.3390/machines11100979. [CrossRef]
  7. Giri, G.S.; Maddahi, Y.; Zareinia, K. An application-based review of haptics technology. Robotics 2021, 10, 29. doi:10.3390/robotics10010029. [CrossRef]
  8. Tang, Z.; Payandeh, S. Experimental studies of a novel 6-DOF haptic device. 2013 IEEE International Conference on Systems, Man, and Cybernetics; , 2013; pp. 3372–3377. doi:10.1109/SMC.2013.575. [CrossRef]
  9. Kumar, S.; Wöhrle, H.; de Gea Fernández, J.; Müller, A.; Kirchner, F. A survey on modularity and distributivity in series-parallel hybrid robots. Mechatronics 2020, 68, 102367. doi:10.1016/j.mechatronics.2020.102367. [CrossRef]
  10. Feller, D.; Siemers, C. Mechanical design and analysis of a novel three-legged, compact, lightweight, omnidirectional, serial–parallel robot with compliant agile legs. Robotics 2022, 11, 39. doi:10.3390/robotics11020039. [CrossRef]
  11. Li, Q.; Yang, C.; Xu, L.; Ye, W. Performance Analysis and Optimization of Parallel Manipulators; Springer: Singapore, 2023. doi:10.1007/978-981-99-0542-3. [CrossRef]
  12. Xu, D.; Dong, J.; Wang, G.; Cai, J.; Wang, H.; Yin, L. Redundant composite polishing robot with triangular parallel mechanism-assisted polishing to improve surface accuracy of thin-wall parts. J. Manuf. Process. 2024, 124, 147–162. doi:10.1016/j.jmapro.2024.04.029. [CrossRef]
  13. Gao, J.S.; Li, M.X.; Li, Y.Y.; Wang, B.T. Singularity analysis and dimensional optimization on a novel serial-parallel leg mechanism. Procedia Eng. 2017, 174, 45–52. doi:10.1016/j.proeng.2017.01.140. [CrossRef]
  14. Liu, H.; Huang, T.; Mei, J.; Zhao, X.; Chetwynd, D.G.; Li, M.; Hu, S.J. Kinematic design of a 5-DOF hybrid robot with large workspace/limb–stroke ratio. J. Mech. Des. 2007, 129, 530–537. doi:10.1115/1.2712220. [CrossRef]
  15. Jin, Y.; Bi, Z.M.; Liu, H.T.; Higgins, C.; Price, M.; Chen, W.H.; Huang, T. Kinematic analysis and dimensional synthesis of Exechon parallel kinematic machine for large volume machining. J. Mech. Robot. 2015, 7, 041004. doi:10.1115/1.4029499. [CrossRef]
  16. Xu, Y.; Ni, S.; Wang, B.; Wang, Z.; Yao, J.; Zhao, Y. Design and calibration experiment of serial–parallel hybrid rotary platform with three degrees of freedom. Proc. Inst. Mech. Eng., Part C: J. Mech. Eng. Sci. 2019, 233, 1807–1817. doi:10.1177/0954406218774352. [CrossRef]
  17. Zhang, D.S.; Xu, Y.D.; Yao, J.T.; Zhao, Y.S. Analysis and optimization of a spatial parallel mechanism for a new 5-DOF hybrid serial-parallel manipulator. Chin. J. Mech. Eng. 2018, 31, 54. doi:10.1186/s10033-018-0251-4. [CrossRef]
  18. Xu, L.; Chai, X.; Ding, Y. Design of a 2RRU-RRS parallel kinematic mechanism for an inner-cavity machining hybrid robot. J. Mech. Robot. 2024, 16, 054501. doi:10.1115/1.4062649. [CrossRef]
  19. Yu, G.; Wu, J.; Wang, L.; Gao, Y. Optimal design of the three-degree-of-freedom parallel manipulator in a spray-painting equipment. Robotica 2020, 38, 1064–1081. doi:10.1017/S0263574719001255. [CrossRef]
  20. Dong, C.; Liu, H.; Xiao, J.; Huang, T. Dynamic modeling and design of a 5-DOF hybrid robot for machining. Mech. Mach. Theory 2021, 165, 104438. doi:10.1016/j.mechmachtheory.2021.104438. [CrossRef]
  21. Li, J.; Ye, F.; Shen, N.; Wang, Z.; Geng, L. Dimensional synthesis of a 5-DOF hybrid robot. Mech. Mach. Theory 2020, 150, 103865. doi:10.1016/j.mechmachtheory.2020.103865. [CrossRef]
  22. Xu, P.; Li, B.; Cheung, C.F.; Zhang, J.F. Stiffness modeling and optimization of a 3-DOF parallel robot in a serial-parallel polishing machine. Int. J. Precis. Eng. Manuf. 2017, 18, 497–507. doi:10.1007/s12541-017-0060-1. [CrossRef]
  23. Gao, Z.; Zhang, D. Performance analysis, mapping, and multiobjective optimization of a hybrid robotic machine tool. IEEE Trans. Ind. Electron. 2015, 62, 423–433. doi:10.1109/TIE.2014.2327008. [CrossRef]
  24. Deng, F.; Liu, X.; Zhang, N.; Zhang, F. Dimension synthesis of a 3T2R labelling robot with hybrid mechanism. J. Eur. Syst. Autom. 2019, 52, 509–514. doi:10.18280/jesa.520510. [CrossRef]
  25. Li, C.; Wu, H.; Eskelinen, H. Design and multi-objective optimization of a dexterous mobile parallel mechanism for fusion reactor vacuum vessel assembly. IEEE Access 2021, 9, 153796–153810. doi:10.1109/ACCESS.2021.3127947. [CrossRef]
  26. Antonov, A.V.; Chernetsov, R.A.; Ulyanov, E.E.; Ivanov, K.A. Use of the chord method for analyzing workspaces of a parallel structure mechanism. IOP Conf. Ser.: Mater. Sci. Eng. 2020, 747, 012079. doi:10.1088/1757-899X/747/1/012079. [CrossRef]
  27. Antonov, A. Stiffness evaluation and dimensional synthesis of a 5-DOF parallel-serial robot. In Mechanism Design for Robotics; Lovasz, E.C.; Ceccarelli, M.; Ciupe, V., Eds.; Springer: Cham, Switzerland, 2024; pp. 99–107. doi:10.1007/978-3-031-67383-2_10. [CrossRef]
  28. Lynch, K.M.; Park, F.C. Modern Robotics: Mechanics, Planning, and Control; Cambridge University Press: Cambridge, UK, 2017. doi:10.1017/9781316661239. [CrossRef]
  29. Dai, J.S.; Sun, J. Geometrical revelation of correlated characteristics of the ray and axis order of the Plücker coordinates in line geometry. Mech. Mach. Theory 2020, 153, 103983. doi:10.1016/j.mechmachtheory.2020.103983. [CrossRef]
  30. Rosyid, A.; El-Khasawneh, B.; Alazzam, A. Review article: performance measures of parallel kinematics manipulators. Mech. Sci. 2020, 11, 49–73. doi:10.5194/ms-11-49-2020. [CrossRef]
  31. Wu, J.; Wang, J.; Wang, L.; You, Z. Performance comparison of three planar 3-DOF parallel manipulators with 4-RRR, 3-RRR and 2-RRR structures. Mechatronics 2010, 20, 510–517. doi:10.1016/j.mechatronics.2010.04.012. [CrossRef]
  32. Gosselin, C. Stiffness mapping for parallel manipulators. IEEE Trans. Robot. Autom. 1990, 6, 377–382. doi:10.1109/70.56657. [CrossRef]
  33. Hay, A.M.; Snyman, J.A. The chord method for the determination of nonconvex workspaces of planar parallel manipulators. Comput. Math. Appl. 2002, 43, 1135–1151. doi:10.1016/S0898-1221(02)80018-9. [CrossRef]
  34. Hormann, K.; Agathos, A. The point in polygon problem for arbitrary polygons. Comput. Geom. Theory Appl. 2001, 20, 131–144. doi:10.1016/S0925-7721(01)00012-8. [CrossRef]
  35. Gunantara, N. A review of multi-objective optimization: methods and its applications. Cogent Eng. 2018, 5, 1502242. doi:10.1080/23311916.2018.1502242. [CrossRef]
  36. Pereira, J.L.J.; Oliver, G.A.; Francisco, M.B.; Cunha Jr, S.S.; Gomes, G.F. A review of multi-objective optimization: methods and algorithms in mechanical engineering problems. Arch. Comput. Methods Eng. 2022, 29, 2285–2308. doi:10.1007/s11831-021-09663-x. [CrossRef]
  37. Grodzevich, O.; Romanko, O. Normalization and other topics in multi-objective optimization. Fields-MITACS Industrial Problems Workshop; , 2006; pp. 89–101.
  38. Zhou, Y.; Niu, J.; Liu, Z.; Zhang, F. A novel numerical approach for workspace determination of parallel mechanisms. J. Mech. Sci. Technol. 2017, 31, 3005–3015. doi:10.1007/s12206-017-0544-z. [CrossRef]
  39. Hay, A.M.; Snyman, J.A. A multi-level optimization methodology for determining the dextrous workspaces of planar parallel manipulators. Struct. Multidiscip. Optim. 2005, 30, 422–427. doi:10.1007/s00158-005-0536-y. [CrossRef]
  40. Rashoyan, G.; Shalyukhin, K.; Antonov, A.; Aleshin, A.; Skvortsov, S. Analysis of the structure and workspace of the Isoglide-type robot for rehabilitation tasks. In Advances in Artificial Systems for Medicine and Education III; Hu, Z.; Petoukhov, S.; He, M., Eds.; Springer: Cham, Switzerland, 2020; pp. 186–194. doi:10.1007/978-3-030-39162-1_17. [CrossRef]
  41. Hay, A.M.; Snyman, J.A. The optimal synthesis of parallel manipulators for desired workspaces. In Advances in Robot Kinematics; Lenarčič, J.; Thomas, F., Eds.; Springer: Dordrecht, The Netherlands, 2002; pp. 337–346. doi:10.1007/978-94-017-0657-5_36. [CrossRef]
  42. Marler, R.T.; Arora, J.S. The weighted sum method for multi-objective optimization: new insights. Struct. Multidiscip. Optim. 2010, 41, 853–862. doi:10.1007/s00158-009-0460-7. [CrossRef]
1
Normalization of Jacobian matrix J does not affect parameters k y and k z , and the latter can be computed using either matrix K or normalized matrix K n .
2
We have omitted angle φ , as we consider it to be predefined for this optimization problem.
3
For j = n , we consider edge U n U 1 and compute b n = a 1 − a n .
Preprints 138612 g001
Figure 1. Considered manipulator: (a) computer model; (b) prototype during the operation.
Figure 1. Considered manipulator: (a) computer model; (b) prototype during the operation.
Preprints 138612 g001
Preprints 138612 g002
Figure 2. The parallel mechanism: (a) general configuration; (b) lowest configuration.
Figure 2. The parallel mechanism: (a) general configuration; (b) lowest configuration.
Preprints 138612 g002
Preprints 138612 g003
Figure 3. Kinematic parameters of the mechanism.
Figure 3. Kinematic parameters of the mechanism.
Preprints 138612 g003
Preprints 138612 g004
Figure 4. Determining the starting point on the workspace boundary.
Figure 4. Determining the starting point on the workspace boundary.
Preprints 138612 g004
Preprints 138612 g005
Figure 5. Computing the workspace boundary using the chord method: (a) finding point U j + 1 by a circular search at point U j ; (b) angle ψ depending on the σ value.
Figure 5. Computing the workspace boundary using the chord method: (a) finding point U j + 1 by a circular search at point U j ; (b) angle ψ depending on the σ value.
Preprints 138612 g005
Preprints 138612 g006
Figure 6. Sampling rectangle V 1 V 2 V 3 V 4 that envelops workspace boundary U 1 U 2 ⋯ U n . The blue and red dots are the examples of samples inside and outside the boundary.
Figure 6. Sampling rectangle V 1 V 2 V 3 V 4 that envelops workspace boundary U 1 U 2 ⋯ U n . The blue and red dots are the examples of samples inside and outside the boundary.
Preprints 138612 g006
Preprints 138612 g007
Figure 7. Numbering of polygon vertices and edges: (a) the numbers near the vertices inside the parentheses correspond to values a j , while the blue numbers near the edges are values b j ; (b) edge U 1 U 2 with b 1 = 2 and f ( 1 ) > 0 and edge U 3 U 4 with b 3 = − 2 and f ( 3 ) < 0 will not be counted in algorithm (25), as they do not match the if statements of the algorithm.
Figure 7. Numbering of polygon vertices and edges: (a) the numbers near the vertices inside the parentheses correspond to values a j , while the blue numbers near the edges are values b j ; (b) edge U 1 U 2 with b 1 = 2 and f ( 1 ) > 0 and edge U 3 U 4 with b 3 = − 2 and f ( 3 ) < 0 will not be counted in algorithm (25), as they do not match the if statements of the algorithm.
Preprints 138612 g007
Preprints 138612 g008
Figure 8. Workspace boundary for various end-effector orientations ( y 1 = 255 mm , y 2 = 505 mm ): (a) φ = 0 ∘ ; (b) φ = 10 ∘ ; (c) φ = 20 ∘ ; (d) φ = 30 ∘ . The squares correspond to the boundary points.
Figure 8. Workspace boundary for various end-effector orientations ( y 1 = 255 mm , y 2 = 505 mm ): (a) φ = 0 ∘ ; (b) φ = 10 ∘ ; (c) φ = 20 ∘ ; (d) φ = 30 ∘ . The squares correspond to the boundary points.
Preprints 138612 g008
Preprints 138612 g009
Figure 9. Workspace sampling for various parameters ( φ = 0 ∘ ): (a) y 1 = 255 mm , y 2 = 505 mm ; (b) y 1 = 325 mm , y 2 = 425 mm ; (c) y 1 = 345 mm , y 2 = 575 mm ; (d) y 1 = 455 mm , y 2 = 575 mm .
Figure 9. Workspace sampling for various parameters ( φ = 0 ∘ ): (a) y 1 = 255 mm , y 2 = 505 mm ; (b) y 1 = 325 mm , y 2 = 425 mm ; (c) y 1 = 345 mm , y 2 = 575 mm ; (d) y 1 = 455 mm , y 2 = 575 mm .
Preprints 138612 g009
Preprints 138612 g010
Figure 10. Stiffness maps of k y for various parameters ( φ = 0 ∘ ): (a) y 1 = 255 mm , y 2 = 505 mm ; (b) y 1 = 325 mm , y 2 = 425 mm ; (c) y 1 = 345 mm , y 2 = 575 mm ; (d) y 1 = 455 mm , y 2 = 575 mm .
Figure 10. Stiffness maps of k y for various parameters ( φ = 0 ∘ ): (a) y 1 = 255 mm , y 2 = 505 mm ; (b) y 1 = 325 mm , y 2 = 425 mm ; (c) y 1 = 345 mm , y 2 = 575 mm ; (d) y 1 = 455 mm , y 2 = 575 mm .
Preprints 138612 g010
Preprints 138612 g011
Figure 11. Stiffness maps of k z for various parameters ( φ = 0 ∘ ): (a) y 1 = 255 mm , y 2 = 505 mm ; (b) y 1 = 325 mm , y 2 = 425 mm ; (c) y 1 = 345 mm , y 2 = 575 mm ; (d) y 1 = 455 mm , y 2 = 575 mm .
Figure 11. Stiffness maps of k z for various parameters ( φ = 0 ∘ ): (a) y 1 = 255 mm , y 2 = 505 mm ; (b) y 1 = 325 mm , y 2 = 425 mm ; (c) y 1 = 345 mm , y 2 = 575 mm ; (d) y 1 = 455 mm , y 2 = 575 mm .
Preprints 138612 g011
Preprints 138612 g012
Figure 12. Stiffness map of k − 1 for various parameters ( φ = 0 ∘ ): (a) y 1 = 255 mm , y 2 = 505 mm ; (b) y 1 = 325 mm , y 2 = 425 mm ; (c) y 1 = 345 mm , y 2 = 575 mm ; (d) y 1 = 455 mm , y 2 = 575 mm .
Figure 12. Stiffness map of k − 1 for various parameters ( φ = 0 ∘ ): (a) y 1 = 255 mm , y 2 = 505 mm ; (b) y 1 = 325 mm , y 2 = 425 mm ; (c) y 1 = 345 mm , y 2 = 575 mm ; (d) y 1 = 455 mm , y 2 = 575 mm .
Preprints 138612 g012
Preprints 138612 g013
Figure 13. Stiffness maps for the case when the adjacent branches coincide ( y 1 = y 2 = 255 mm ; φ = 0 ∘ ): (a) lateral stiffness k y ; (b) vertical stiffness k z ; (c) overall stiffness k − 1 .
Figure 13. Stiffness maps for the case when the adjacent branches coincide ( y 1 = y 2 = 255 mm ; φ = 0 ∘ ): (a) lateral stiffness k y ; (b) vertical stiffness k z ; (c) overall stiffness k − 1 .
Preprints 138612 g013
Preprints 138612 g014
Figure 14. The values of the performance metrics for various parameters y 1 and y 2 ( φ = 0 ∘ ): (a) average lateral stiffness k ¯ y ; (b) average vertical stiffness k ¯ z ; (c) average overall stiffness k ¯ − 1 ; (d) workspace area W. The white circles correspond to the initial design with y 1 = 255 mm and y 2 = 505 mm ; the white squares correspond to the optimized design with y 1 = 345 mm and y 2 = 575 mm .
Figure 14. The values of the performance metrics for various parameters y 1 and y 2 ( φ = 0 ∘ ): (a) average lateral stiffness k ¯ y ; (b) average vertical stiffness k ¯ z ; (c) average overall stiffness k ¯ − 1 ; (d) workspace area W. The white circles correspond to the initial design with y 1 = 255 mm and y 2 = 505 mm ; the white squares correspond to the optimized design with y 1 = 345 mm and y 2 = 575 mm .
Preprints 138612 g014
Table 1. Geometrical parameters and joint constraints of the considered mechanism ( i = 1 , ⋯ , 4 ).
Table 1. Geometrical parameters and joint constraints of the considered mechanism ( i = 1 , ⋯ , 4 ).
Parameter Value
Platform width, w 298 mm
End-effector length, l C D 163 mm
Minimum actuator stroke, q min 541 mm
Maximum actuator stroke, q max 841 mm
Minimum angle in joint  A i , α min 25 ∘
Maximum angle in joint  A i , α max 155 ∘
Minimum angle in joint  B i , β min 7 ∘
Maximum angle in joint  B i , β max 173 ∘
Table 2. Parameters of the chord method for workspace analysis.
Table 2. Parameters of the chord method for workspace analysis.
Parameter Value
Chord length, d 40 mm
Left limit of the workspace, y min − 200  mm
Right limit of the workspace, y max 200 mm
Direction for the ray search, n ^ 0 [ 0 1 ] T
Step for the initial guess in the ray search, δ 0 10 mm
Step for the initial guess in the circular searches, δ 10 mm
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Alerts
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

facebook logotwitter logolinkedin logo
MDPI Initiatives
Important Links
Subscribe

Disclaimer

Terms of Use

Privacy Policy

© 2025 MDPI (Basel, Switzerland) unless otherwise stated