Denim-fabric-polishing robot size optimization based on global spatial dexterity
<p>This paper presents a novel method to make denim-fabric-polishing 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 ana...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Copernicus Publications
2021-06-01
|
| Series: | Mechanical Sciences |
| Online Access: | https://ms.copernicus.org/articles/12/649/2021/ms-12-649-2021.pdf |
| _version_ | 1818448621456064512 |
|---|---|
| author | W. Wang Q. Tao X. Wang Y. Cao C. Chen |
| author_facet | W. Wang Q. Tao X. Wang Y. Cao C. Chen |
| author_sort | W. Wang |
| collection | DOAJ |
| description | <p>This paper presents a novel method to make denim-fabric-polishing 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 denim-fabric-polishing 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 low-condition-number 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.</p> |
| first_indexed | 2024-12-14T20:22:25Z |
| format | Article |
| id | doaj.art-fa122b07efb44d179b04f5b1f7ec3b42 |
| institution | Directory Open Access Journal |
| issn | 2191-9151 2191-916X |
| language | English |
| last_indexed | 2024-12-14T20:22:25Z |
| publishDate | 2021-06-01 |
| publisher | Copernicus Publications |
| record_format | Article |
| series | Mechanical Sciences |
| spelling | doaj.art-fa122b07efb44d179b04f5b1f7ec3b422022-12-21T22:48:43ZengCopernicus PublicationsMechanical Sciences2191-91512191-916X2021-06-011264966010.5194/ms-12-649-2021Denim-fabric-polishing robot size optimization based on global spatial dexterityW. WangQ. TaoX. WangY. CaoC. Chen<p>This paper presents a novel method to make denim-fabric-polishing 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 denim-fabric-polishing 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 low-condition-number 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.</p>https://ms.copernicus.org/articles/12/649/2021/ms-12-649-2021.pdf |
| spellingShingle | W. Wang Q. Tao X. Wang Y. Cao C. Chen Denim-fabric-polishing robot size optimization based on global spatial dexterity Mechanical Sciences |
| title | Denim-fabric-polishing robot size optimization based on global spatial dexterity |
| title_full | Denim-fabric-polishing robot size optimization based on global spatial dexterity |
| title_fullStr | Denim-fabric-polishing robot size optimization based on global spatial dexterity |
| title_full_unstemmed | Denim-fabric-polishing robot size optimization based on global spatial dexterity |
| title_short | Denim-fabric-polishing robot size optimization based on global spatial dexterity |
| title_sort | denim fabric polishing robot size optimization based on global spatial dexterity |
| url | https://ms.copernicus.org/articles/12/649/2021/ms-12-649-2021.pdf |
| work_keys_str_mv | AT wwang denimfabricpolishingrobotsizeoptimizationbasedonglobalspatialdexterity AT qtao denimfabricpolishingrobotsizeoptimizationbasedonglobalspatialdexterity AT xwang denimfabricpolishingrobotsizeoptimizationbasedonglobalspatialdexterity AT ycao denimfabricpolishingrobotsizeoptimizationbasedonglobalspatialdexterity AT cchen denimfabricpolishingrobotsizeoptimizationbasedonglobalspatialdexterity |