the Creative Commons Attribution 4.0 License.
the Creative Commons Attribution 4.0 License.
Denimfabricpolishing robot size optimization based on global spatial dexterity
Wenjie Wang
Qing Tao
Xiaohua Wang
Yuting Cao
Congcong Chen
This paper presents a novel method to make denimfabricpolishing robots perform their primary task flexibly and efficiently within a limited workspace. Link lengths are optimized based on an adaptive fireworks algorithm to improve the comprehensive dexterity index. A forward kinematics analysis of the denimfabricpolishing robot is conducted via the D–H method; the workspace is analyzed according to the needs at hand to determine the range of motion of each joint. To solve the movement condition number of the Jacobian matrix, the concept of lowconditionnumber probability is established, and a comprehensive dexterity indicator is constructed. The influence of the robot's size on the condition number and comprehensive dexterity index is determined. Finally, the adaptive fireworks algorithm is used to establish the objective optimization function by integrating the dexterity index and other performance indicators. The optimization results show that when the comprehensive dexterity index is taken as the optimization objective, the dexterity comprehensive index and other performance indices of the robot are the lowest; that is, the robot is more flexible. Compared with the traditional genetic algorithm and particle swarm algorithm, the adaptive fireworks algorithm proposed in this paper has better solving speed and solving precision. The optimized workspace of the robot meets the requirements of the polishing task. The design also yields a sufficiently flexible, efficient, and effective robot.
 Article
(3017 KB)  Fulltext XML
 BibTeX
 EndNote
Recent years have seen notable advancements in robotics technology and an increase in the popularity of robotics applications in various industries. Textile and clothing enterprises have gradually begun to replace human beings with robots to reduce the cost of labor. Robots may be utilized to polish denim fabric (Liu et al., 2014), for example. These robots must be designed for high flexibility, high efficiency, and high precision.
It is crucial that robots be designed with sufficient flexibility in order to properly adapt to various working environments. Many scholars target the size of the robot to this effect, as size markedly influences flexibility. Luo et al. (2020) and Ning et al. (2015), for example, used computeraided engineering (CAE) software to optimize their robots' sizes for enhanced performance. They used the finiteelement method, however, which only optimizes the size of the fixed pose of the robot. Shen et al. (2013) defined workspace flexibility on the basis of a service ball and then redesigned the structural parameters of a cotton fiber sorting robot accordingly. Sun et al. (2019, 2020a) proposed a generalized inverse description method based on the finite instantaneous screw theory, which improved the accuracy of the manipulator. Considering the uncertainty of parameters, they proposed a design method to minimize vibration and deformation to optimize the manipulator. Jia et al. (2015) established the posture maneuverability concept, which can be used as an index to optimize the size of a given machine. However, this requires solving highly complex inverse kinematics problems.
There have been many other valuable contributions to the literature. Gosselin and Angeles (1988, 1991) took the condition number of a Jacobian matrix as the main factor to design a robot structure. Li et al. (2013), Gan et al. (2014), and Tian et al. (2013) optimized the structural parameters of a robot with the workspace as a constraint. Gao et al. (2011) established flexible polishing point and flexible polishing space concepts under which the position and size of a robot can be optimized relative to the workpiece. Deng et al. (2017) proposed workspace, static stiffness, and global velocity fluctuation indices for optimizing the size and quality of a robot arm. Sun et al. (2020b) and Sun and Lian (2018) proposed a probabilistic safety factor, which takes the probability density function as the constraint condition to optimize a new type of parallel machine tool. Quan et al. (2017) optimized a set of robot parameters by covering the minimum workspace, connecting the link lengths, and establishing comprehensive optimization indices. Most of the above methods for size optimization are genetic algorithms, which have the disadvantages of relatively low accuracy and slow convergence (Aghazadeh Heris and Oskoei, 2014; Tinós et al., 2018).
The fireworks algorithm (FWA) is an intelligent optimization algorithm first proposed by Tan and Zhu (2010) in 2010. It has become a popular research topic as per its simple parameters and strong solution performance. Xue et al. (2017) applied FWA to discretize an optimization field and effectively solved a multidimensional knapsack problem. Li et al. (2015) improved the FWA for precise parameter estimation in a chaos control system. Li et al. (2018) applied the improved FWA to multiprocessor task scheduling and achieved good results. Babu et al. (2016) used the improved FWA to solve unknown parameters in the dual diode model of a photovoltaic (PV) module. Reddy et al. (2016) used FWA to solve the scheduling problem in a smart power grid.
The denimfabricpolishing robot should be designed for maximum flexibility and stability to effectively complete its task. The “lowconditionnumber probability” concept was developed in this study; a comprehensive evaluation index and mean space condition number indicator were also used to finalize the proposed robot design. The influence of link length on the condition number of the robot was calculated to determine the target link to be optimized. The adaptive FWA was then used to optimize the target function and optimize the robot's size for the given task.
2.1 2.1 kinematics analysis
The mechanical body of the denimfabricpolishing robot discussed here is composed of a Universal Robots (UR) robot and grinding head. The kinematic model of the robot is an important theoretical basis for workspace analysis, motion planning, and parameter optimization. The forward kinematics model of this robot was established via the D–H method. The kinematic coordinate system is shown in Fig. 1, and the link parameters are given in Table 1.
The transformation matrix ${}_{i}^{i\mathrm{1}}\mathbf{T}$ of the ith link of the robot is
According to the D–H parameter, the transformation matrix ${}_{\mathrm{1}}^{\mathrm{0}}\mathbf{T}$ of the first link is
${}_{\mathrm{2}}^{\mathrm{1}}\mathbf{T}$, ${}_{\mathrm{3}}^{\mathrm{2}}\mathbf{T}$, ${}_{\mathrm{4}}^{\mathrm{3}}\mathbf{T}$, ${}_{\mathrm{5}}^{\mathrm{4}}\mathbf{T}$, and ${}_{\mathrm{6}}^{\mathrm{5}}\mathbf{T}$ can be obtained similarly. The transformation matrix of the links can be multiplied to obtain the transformation matrix ${}_{\mathrm{6}}^{\mathrm{0}}\mathbf{T}$ of the end of the denimfabricpolishing robot relative to the base coordinates:
2.2 Workspace analysis of denimfabricpolishing robot
In the process of denim polishing, site space and actual polishing space restrictions limit the range of joint corners and link size. A diagram of the polishing workspace is shown in Fig. 2.
The worktable length is 2 m, and the worktable width (maximum working radius) is ${r}_{max}=\mathrm{1}$ m. To maximize the working range of the robot, it is placed in the middle of the 2 m side of the worktable edge. The maximum length and width of the denim fabric piece are l=1.1 m and d=0.5 m, so its working radius is smallest (r_{min}) when it is near the robot side:
The Monte Carlo method can be used to determine the workspace of the robot at different time points across the turning angle range. According to the working requirements of the robot, the turning angle range of each joint is determined by trial and error:
The mechanism model of the denimfabricpolishing robot was established in SimMechanics as is shown in Fig. 3. The end position of the robot was obtained given the same joint angle input of the SimMechanics mechanism model and the mathematical model (Eqs. 1–3). The error of the end position of the two models, which validates the mathematical model presented above, is shown in Fig. 4.
Randomly taking the values in each joint range as the angle input value, the position of the end of the robot in the workspace can be obtained according to Eqs. (1)–(3). A workspace with 15 000 cycles was obtained here under the initial link size condition as shown in Fig. 5.
According to the projection of the XY plane of the workspace in Fig. 5b, the maximum motion radius of the denimfabricpolishing robot is 0.9117 m. The robot's motion radius is between 0.7434 and 1 m, so its workspace meets the polishing requirements in this case.
Flexibility is one of the most widely used indices for evaluating the motion performance of robots. “Flexibility” in this context refers to the number of postures that can be obtained by the end tool when the end reference point of the robot is located at a certain point in the workspace. The condition number of the Jacobian matrix indicates the robot's level of dexterity; the matrix itself represents the linear mapping between the operating space velocity and the joint space velocity of the end of the robot. The Jacobian matrix can be solved directly by a predefined method, The robot has six rotating joints, so only differential rotations were considered. The ith column of the Jacobian matrix representative of the rotating joints is
where n, o, a, and p denote the four column vectors of the transformation matrix ${}_{\mathrm{6}}^{i}\mathbf{T}$.
The expression of the transformation matrix ${}_{\mathrm{6}}^{i}\mathbf{T}$ can be obtained by the following formula.
The condition number is defined as the ratio of the maximum singular value to the minimum singular value of a Jacobian matrix, that is
Variables σ_{max}(J) and σ_{min}(J) represent the maximum and minimum singularities of the Jacobian matrix, respectively, and J is the Jacobian matrix. The range of condition numbers is $[\mathrm{1},+\mathrm{\infty}]$. A smaller condition number indicates a more flexible robot with better performance.
Because the condition number is only related to the turning angle and structure size of the robot joint, which reflects the ability of the robot to move in the specified position and posture (but not in the task space), a global spatial condition number mean (GCI) index was established in this study. The condition number was averaged in the whole motion space to build an indicator that reflects the flexibility of the robot's kinematics in the whole motion space:
where K is the condition number under the specified position and W is the global workspace.
A new dexterity index was established based on the mean of the spatial condition number to reflect the fluctuations discussed above: low condition probability (LCP), the percentage α of the number of locations with condition numbers lower than the mean of the spatial condition number b in the space location number n after discretizing the points in the reachable operation space of the task space. When α=0.5, the condition number distribution is uniform and there are no large fluctuations. As α approaches 0, the condition number fluctuates greatly but the overall condition value is high. When α approaches 1, the condition number fluctuates greatly, but the overall condition value is low. A larger LCP value indicates the overall operability of the robotic arm better.
The effects of the above two indicators on the dexterity of the robot must be unified to be interpreted properly. The LCP is $\mathit{\alpha}=[\mathrm{0},\mathrm{1}]$, so weighting it directly has little effect on the results. To increase the order of the LCP, weighting was applied to form the comprehensive flexibility index (CFI):
where k_{1} and k_{2} are the weighting factors for the corresponding items, and δ is the parameter that raises the order of magnitude.
3.1 Influence of link size on condition number
The joint angle and link size ranges are key factors in the kinematic performance of the robot. The joint angle range is mainly determined by the size and placement of the denim fabric, so it was not analyzed in detail in this study; the effects of link size were prioritized as per their effects on the kinematic performance index. The relationship between link size and condition number was determined by analyzing the relationship between each link size and condition number via the control variable method. When the joint angle is −70^{∘}, 10^{∘}, −30^{∘}, 10^{∘}, 10^{∘}, and 0^{∘}, the effect of each link size on the condition number of the robot is as shown in Fig. 6.
As is shown in Fig. 6a and b, the condition number decreases as the second dimension of the link increases when the first dimension of the link remains unchanged. When the size of Link 2 is unchanged, changes in the size of Link 1 have no effect on the condition number.
As is shown in Fig. 6c and d, the condition number increases as link Size 4 increases while Size 3 remains unchanged. However, the condition number decreases as Size 3 increases when Size 4 remains unchanged.
Figure 6e and f indicate that the condition number decreases as link Size 6 increases while Size 5 remains unchanged; the condition number increases with Size 5; however, when the size of Link 6 is unchanged. In summary, the size of Link 1 has no effect on the CFI, i.e., the comprehensive dexterity evaluation index. The dimensions of Links 2–6 were selected to optimize the robot size in this study accordingly.
4.1 Adaptive FWA
The FWA is a swarm intelligence optimization algorithm inspired by the explosion of fireworks and sparks across a certain range. It is mainly composed of an explosion operator, mutation operator, mapping rule, and selection strategy. It is operated in the following stepwise process.
The first step is initialization, the generation of fireworks at any N locations in the solution space; the explosion operator generates S_{i} new sparks in the explosion range A_{i}, where A_{i} and S_{i} are
where $\widehat{A}$ and m are the maximum explosion radius and the maximum number of sparks caused by the explosion, respectively; Y_{min} and Y_{max} are the fitness values of the individuals with the best and worst fitness. f(x_{i}) is the fitness value of individual x_{i}, and ε is the minimum constant. To prevent uneven spark numbers from affecting performance, S_{i} can be changed to
where round() is an integer function, and a and b are given constants.
To increase the spark diversity, the following displacement and Gauss variation can be imposed:
where rand(0,A_{i} is the uniform random number generated in the explosion range, ${x}_{i}^{k}$ is the position of the ith individual in the kth dimension, and g is a random number in a Gaussian distribution with a mean variance of 1.
To avoid spark locations from crossing the boundary, the following mapping rules are used:
where ${x}_{max}^{k}$ and ${x}_{min}^{k}$ are upper and lower bounds on the kth dimension, respectively, and % denotes redundancy.
An elite retention strategy is used to directly retain the bestfit sparks with a roulette to filter the remaining sparks. The probability that each spark will be selected is
where R(x_{i}) represents the sum of the distances of an individual x_{i} to other sparks; H is the total number of sparks. The FWA has a prematurity problem; its performance is poor and its operations are timeconsuming when the optimal solution is far from the origin. The adaptive FWA is an improvement over the FWA that enables the explosion radius to be automatically adjusted, changes the mutation mode, maps the rules and selection strategies, and improves the performance of the algorithm.
The adaptive radius is calculated by selecting among values that meet several criteria. The fitness value must be lower than this generation of fireworks, the distance to the optimum individual must be the shortest among the individuals satisfying Eq. (1), and the distance between the individual and the optimum fireworks must be considered the subsequent explosion radius. The initialization radius is the entire solution range. To strike a balance between local and global searches, a weight λ (usually 1.3) is multiplied by the adaptive radius.
The Gauss sparks for the new Gauss variant operator are calculated as follows:
where e is a random number with a mean of 0 and a variance of 1; ${x}_{b}^{k}$ is the position of the most suitable firework in the kdimension of the current population. Next, new mapping rules are established at random:
where U(0,1) is a uniformly distributed random number on the [0,1] interval. Finally, an eliterandom selection strategy is operated by selecting the most suitable individual in the population and then using a random strategy for the selection of other fireworks to minimize the computation time.
4.2 Fitness function selection
The link size of the robot affects its dexterity. To satisfy the workspace requirements of the polishing process, the dexterity index was used here as the objective function. Only the link size was optimized in this case, so the structure of the robot did not change. The sum of the dimensions of Links 2, 3, and 5 is the radius of motion of the robot. Changes in size affect the farthest distance the robot can reach, so the length of the link is a restrictive element. The fitness function is
where l_{2}, l_{3}, and l_{5} are the lengths of Links 2, 3, and 5, respectively.
4.3 Algorithmic steps
The denimfabricpolishing robot was optimized in this study based on the adaptive FWA via the following stepwise process.

Initialize population. Determine the number of fireworks N, which are generated anywhere in the link size search space.

Solve polynomial coefficients. Solve the dexterity evaluation index by substituting Ngroup link size Q into Eqs. (5)–(9).

Verify constraints. Determine whether the link size obtained in Step 2 meets the constraint of Eq. (20).

Calculate fitness values. The result of Step 3 is filtered. If the link size does not meet the constraint, the fitness value of the fireworks is increased to increase the explosion amplitude and expand the search range. If the link size meets the constraint, the adaptive FWA is iterated with Eq. (19) as the objective function.

Adaptive FWA generates new population.

Judge final conditions. If the number of iterations is reached or the fitness value meets the requirements, the algorithm ends; otherwise, return to Step 2.
To set the value in the comprehensive dexterity index, it was necessary to first analyze the condition number mean value of the workspace. Taking the effect of the change of secondary and tertiary dimensions of the link on the condition number mean value of the workspace as an example, the effect of the link size on the condition number mean value of the workspace is as shown in Fig. 7.
As shown in Fig. 7, the mean value of the condition number in the workspace (14, 20) varies as the link size changes within the given joint angle range. Because GCI and LCP have the same degree of influence on the dexterity of the robot, in order to make the range of both changes equal in magnitude, their weights were set here to k_{1}=0.5, k_{2}=0.5, and δ=20.
Because the optimum range of each link size needed to be determined artificially in this case, in order to illustrate how we take into account the effects of the dimensions of the various links, we take Link 2 and Link 3 as an example, several groups of different sizes of other links were selected (in each group combination, Link 2 and Link 3 joints were variables). Combined with the results of several groups of simulation experiments, the value ranges of Link 2 and Link 3 were selected according to the comprehensive index (the simulation in this paper is just an example). The same idea is used to get the initial dimensions of the other links. We have also added the illustrations in the paper.
The influence of each link's size on the comprehensive dexterity index was obtained by writing an Mfile (Fig. 8) to make the optimum range as accurate as possible. As shown in Fig. 8a and b, the robot appears to be more flexible with a smaller comprehensive dexterity index when Links 2 and 3 have larger dimensions. These dimensions must satisfy the limitations of the working site, however. The optimal values were found to be [0.3, 0.6]. As shown in Fig. 8c and d, the dimensions of Links 4 and 5 affect the comprehensive dexterity index within the range of [0.08, 0.16]. The comprehensive dexterity index is smaller when Link 4 is smaller and reaches its minimum around 0.12 m. The optimal range of Link 4 size was determined to be [0.05, 0.12]. As shown in Fig. 8e and f, the comprehensive dexterity index is minimal when the size of Link 5 is within the range [0.096, 0.14]; the optimal size was determined to be [0.06, 0.14]. Finally, as shown in Fig. 8e and f, the comprehensive dexterity index remains relatively stable when Link 6 ranges in size from [0.05, 0.15]. The optimal range of Link 6 was determined to be [0.05, 0.15].
The adaptive FWA, particle swarm algorithm, and genetic algorithm were used to optimize GCI, LCP, and CFI, respectively. The number of fireworks N was set to 5; the number of sparks generated was 50; the number of variant sparks was 5; the initial positions of fireworks were any random number of ${l}_{\mathrm{2}}={l}_{\mathrm{3}}=[\mathrm{0.3},\mathrm{0.6}]$, ${l}_{\mathrm{5}}=[\mathrm{0.06},\mathrm{0.14}]$, ${l}_{\mathrm{4}}=[\mathrm{0.05},\mathrm{0.12}]$, or ${l}_{\mathrm{6}}=[\mathrm{0.05},\mathrm{0.15}]$; the number of explosions was limited to a=0.8 and b=0.04; and the number of iterations was 50. The results are shown in Figs. 9–11.
Algorithmic evolution curve of the three optimization indices was obtained based on the adaptive fireworks algorithm (AFWA), particle swarm optimization (PSO), and GA shown in Figs. 9a, 10a, and 11a. Compared with the other two algorithms (PSO and GA), the adaptive AFWA has better solution accuracy and convergence speed than the other two algorithms (PSO and GA). So, the AFWA is used to optimize the size of the robot rod.
The dimensions of the robot links were obtained by the three optimization indices based on the AFWA; the results are shown in Figs. 9b, 10b, and 11b. The sum of the optimized link dimensions and the dimensions of Links 2, 3, and 5 are listed in Table 2. The sum of dimensions of Links 2, 3, and 5 is 0.9999, 0.9465, and 0.9999 m, respectively. The sum of the dimensions of the optimized Links 2, 3, and 5 falls between the minimum working radius of 0.7434 m and the maximum working radius of 1 m, which meets the working requirements of the denimfabricpolishing robot.
GCI and LCP can be calculated simultaneously when the objective function value has been optimized and the comprehensive flexibility index is taken as the optimization target based on the optimized robot link size. The optimized objective function values are shown in Table 3. The GCI and LCP obtained with the comprehensive flexibility index as the optimization target are lower than those obtained with the GCI and LCP as the optimization target.
When the link size is not optimized, the GCI is 32.88, the LCP is 56.78 %, and the comprehensive flexibility index is 20.76. The overall flexibility index was reduced by 9.68 % after optimization. It can be found that the link size obtained by taking the comprehensive flexibility as the index mostly meets the requirements, and the motion performance of the robot is improved. From the above analysis, it can be seen that the comprehensive index (CFI) proposed in this paper has obvious advantages.
A comprehensive evaluation index based on the mean of the space condition number and weighted low probability condition number is proposed in this paper for judging the dexterity of a denimfabricpolishing robot. The adaptive FWA can be used to optimize the size of the robot links to meet the requirements of the polishing task while achieving the optimal dexterity index. The results of an optimization experiment show that the proposed adaptive FWA has better solution accuracy and convergence speed than traditional algorithms, and the technique remits a substantial improvement in the robot's motion performance as well as a slight increase in the available workspace while meeting the given working radius requirements. The optimized robot is sufficiently flexible and precise for completing the denimfabricpolishing task effectively.
Number  Character  Explanation 
1  a_{i}  Link length 
2  d_{i}  Offset distance 
3  α_{i}  Twist angle 
4  θ_{i}  Joint angle 
5  ${}_{i}^{i\mathrm{1}}\mathbf{T}$  The transformation matrix of the two adjacent links 
6  r_{max}  Maximum working radius 
7  l  The length of the denim fabric piece 
8  d  The width of the denim fabric piece 
9  r_{min}  Minimum working radius 
10  J_{i}  the ith column of the Jacobian matrix J 
11  n, o, a, P  The four column vectors of the transformation matrix, where n, o, and a are the attitude vectors and P is the position vector 
12  K  The condition number 
13  σ_{max}(J)  The maximum singularities of the Jacobian matrix 
14  σ_{min}(J)  The minimum singularities of the Jacobian matrix 
15  GCI  The global spatial condition number mean index 
16  K  The condition number under the specified position 
17  W  global working space 
18  b  The number of points where condition numbers are lower than the mean of the spatial condition number 
19  n  The total space location number 
20  CFI  Comprehensive flexibility index 
21  k_{1}, k_{2}  The weighting factor for the corresponding items 
22  δ  The parameter that raises the order of magnitude 
23  LCP  The low condition probability 
24  A_{i}  The explosion range 
25  S_{i}  New sparks 
26  $\widehat{A}$  The maximum explosion radius 
27  m  The maximum number of sparks 
28  Y_{min}  The fitness values of the individuals with the best fitness 
29  Y_{max}  The fitness values of the individuals with the worst fitness 
30  f(x_{i})  The fitness value of individual x_{i} 
31  ε  The minimum constant 
32  ${x}_{i}^{k}$  The position of the ith individual in the kth dimension 
33  g  Gaussian random number whose mean square error is 1 
34  ${x}_{max}^{k}$  Upper bounds on the kth dimension 
35  ${x}_{min}^{k}$  Lower bounds on the kth dimension 
36  p(x_{i})  The probability that each spark will be selected 
37  R(x_{i})  The sum of the distances of an individual x_{i} to other sparks 
38  H  The total number of sparks 
39  e  A random number with a mean of 0 and a variance of 1 
40  ${x}_{b}^{k}$  The position of the most suitable firework in the kdimension of the current population 
41  l_{2}, l_{3}, l_{4}, l_{5}, l_{6}  the lengths of Links 2, 3, 4, 5, and 6, respectively 
42  U(0,1)  Random number in the range (0,1) 
All data, models, and code generated or used during the study appear in the article. The raw/processed data required to reproduce these findings cannot be shared at this time as the data also form part of an ongoing study.
All authors contributed to the study conception and design. The experiment, data collection, and analysis were performed by WW, QT, XW, YC, and CC. The first draft of the manuscript was written by WW, and the experiments and data were mainly completed by WW and QT. All authors commented on previous versions of the manuscript and made suggestions. All authors read and approved the final paper.
The authors declare that they have no conflict of interest.
This work partially supported by the National Natural Science Foundation of China (program no. 51905405), the Natural Science basic Research Plan in Shaanxi Province of China (program no. 2019JQ855), and the Natural Science Special Project of Education Department in Shaanxi Province of China (program no. 19JK0375). We also greatly appreciate the efforts and helpful suggestions from the reviewers and the editors.
This research has been supported by the National Natural Science Foundation of China (grant no. 51905405), the Natural Science basic Research Plan in Shaanxi Province of China (grant no. 2019JQ855), and the Natural Science Special Project of Education Department in Shaanxi Province of China (grant no. 19JK0375).
This paper was edited by Daniel Condurache and reviewed by Jingang Jiang and two anonymous referees.
Aghazadeh Heris, J. E. and Oskoei, M. A.: Modified genetic algorithm for solving nqueens problem, Iranian Conference on Intelligent Systems (ICIS), Bam, Iran, 4–6 February 2014, IEEE, 14253285, https://doi.org/10.1109/iraniancis.2014.6802550, 2014.
Babu, T. S., Ram, J. P., Sangeetha, K., Laudani, A., and Rajasekar, N: Parameter extraction of two diode solar PV model using Fireworks algorithm, Sol. Energy, 140, 265–276, https://doi.org/10.1016/j.solener.2016.10.044, 2016.
Deng, Z.l., Cheng, F., and Zhang, M.: Design and optimization of arm structure for mobile medical service robot based on multitarget particle swarm optimization, International Journal of Mechatronics and Applied Mechanics, 2107, 115–121, https://doi.org/10.17683/ijomam/issue2.17, 2017.
Gan, Y., Wang, J., and Sun, F.: D–H parameter optimization design of 6R robot based on given workspace, China Mechanical Engineering, 25, 3003–3007, https://doi.org/10.3969/j.issn.1004132X.2014.22.004, 2014.
Gao, Z., Lan, X., and Bian, Y.: Structural Dimension Optimization of Robotic Belt Grinding System for Grinding Work pieces with Complex Shaped Surfaces Based on Dexterity Grinding Space, Chinese Journal of Aeronautics, 24, 346–354, https://doi.org/10.1016/S10009361(11)600411, 2011.
Gosselin, C. and Angeles, J.: The optimum kinematic design of a planar threedegreeoffreedom parallel manipulator, J. Mech. Design, 110, 35–41, https://doi.org/10.1115/1.3258901, 1988.
Gosselin, C. and Angeles, J.: A global performance index for the kinematic optimization of robotic manipulators, J. Mech. Design, 113, 220–226, https://doi.org/10.1115/1.2912772, 1991.
Jia, S. Y., Jia, Y. H., and Xu, S. J.: Dimensional optimization method for manipulator based on orientation manipulability, Journal of Beijing University of Aeronautics and Astronautics, 41, 1693–1700, https://doi.org/10.13700/j.bh.10015965.2014.0665, 2015.
Li, D., Wang, W., Wang, Q., and Hao, D.: Polishing robot structure optimization based on workspace analysis, Proceedings of 2016 AsiaPacific Conference on Intelligent Robot Systems (ACIRS), Tokyo, Japan, 20–22 July 2016, IEEE, 16268373, 52–56. https://doi.org/10.1109/ACIRS.2016.7556187, 2016.
Li, H., Bai, P., Zhang, H., Jin, H. B., and Xue, J. J.: Research on the algorithm of reverse fireworks and its application, Journal of Xi'an Jiaotong University, 49, 82–88, https://doi.org/10.7652/xjtuxb201511014, 2015.
Li, J., Tian, Q., Zhang, G., Wu, W., Xue, D., Li, L., Wang, J., and Chen, L.: Task scheduling algorithm based on fireworks algorithm, EURASIP J. Wirel. Comm., 256, 1–8, https://doi.org/10.1186/s1363801812592, 2018.
Liu, Y. M., Li, J. Y., Cai, Y, L., and Nie, M.: Current state and development trend of rail grinding technology, China Railway Science, 35, 29–37, https://doi.org/10.3969/j.issn.10014632.2014.04.05, 2014.
Luo, H., Fu, J., Wang, P., Liu, J., and Zhou, W.: Design optimization of the ram structure of friction stir welding robot, Mech. Adv. Mater. Struc., 27, 108–118, https://doi.org/10.1080/15376494.2018.1471758, 2020.
Ning, K. P., Li, D. B., He, F., Tong, Y. F., and Zhang, K.: Research on the Structural Optimization Design of ER300 Palletizing Robot, Open Automation and Control Systems Journal, 7, 1405–1414, https://doi.org/10.2174/1874444301507011405, 2015.
Quan, L. Z., Peng, T., Shen, L. Y., An, S. Y., Ji, Z. L., and Sun, T.: Optimization and experiment of mechanical arm parameters of threedimensional seedling plate management robot, J. Ag. Eng. Res., 33, 10–19, https://doi.org/10.11975/j.issn.10026819.2017.07.002, 2017.
Reddy, K. S., Panwar, L. K., Kumar, R., and Panigrahi, B. K.: Distributed resource scheduling in smart grid with electric vehicle deployment using fireworks algorithm, J. Mod. Power Syst. Cle., 4, 188–199, https://doi.org/10.1007/s4056501601956, 2016.
Shen, D. F., Zhang, H. A., Ye, G. M., and Wang, G. Z.: Structural parameter optimization design of cotton different fiber sorting robot based on flexibility, Journal of Textile, 34, 151–156, https://doi.org/10.3969/j.issn.02539721.2013.02.029, 2013.
Sun, T. and Lian, B.: Stiffness and mass optimization of parallel kinematic machine, Mech. Mach. Theory, 120, 73–88, 2018.
Sun, T., Lian, B., Song, Y., and Feng, L.: Elastodynamic optimization of a 5DoF parallel kinematic machine considering parameter uncertainty, IEEEASME T. Mech., 24, 315–325, 2019.
Sun, T., Yang, S., and Lian, B.: Finite and instantaneous screw theory in robotic mechanism, Springer Nature, Singapore, 2020a.
Sun, T., Lian, B., Yang, S., and Song, Y.: Kinematic Calibration of Serial and Parallel Robots Based on Finite and Instantaneous Screw Theory, IEEE T. Robot., 36, 816–834, 2020b.
Tan, Y. and Zhu, Y.: Fireworks algorithm for optimization, Lecture Notes in Computer Science, 6145, 355–364, https://doi.org/10.1007/9783642134951_44, 2010.
Tian, H. B., Ma, H. W., and Wei, J.: Study on the workspace and structural parameters of a series robot manipulator, Journal of Agricultural Machinery, 44, 196–201 https://doi.org/10.6041/j.issn.10001298.2013.04.034, 2013.
Tinós, R., Zhao, L., Chicano, F., and Whitley, D.: NK Hybrid Genetic Algorithm for Clustering, IEEE T. Evolut. Comput., 22, 748–761, https://doi.org/10.1109/tevc.2018.2828643, 2018.
Xue, J. J., Wang, Y., Meng, X. F., and Xiao, J. Y.: Binary reverse learning fireworks algorithm for solving multidimensional knapsack problem, System Engineering and Electronic Technology, 39, 451–458, https://doi.org/10.3969/j.issn.1001506X.2017.02.33, 2017.
 Abstract
 Introduction
 Kinematics and workspace analysis of denimfabricpolishing robot
 Flexibility index of denimfabricpolishing robot
 Robot dimension optimization based on adaptive FWA
 Simulation verification and analysis
 Conclusions
 Appendix A: Character definition
 Code and data availability
 Author contributions
 Competing interests
 Acknowledgements
 Financial support
 Review statement
 References
 Abstract
 Introduction
 Kinematics and workspace analysis of denimfabricpolishing robot
 Flexibility index of denimfabricpolishing robot
 Robot dimension optimization based on adaptive FWA
 Simulation verification and analysis
 Conclusions
 Appendix A: Character definition
 Code and data availability
 Author contributions
 Competing interests
 Acknowledgements
 Financial support
 Review statement
 References