Efficient and High-Precision Method of Calculating Maximum Singularity-Free Space in Stewart Platform Based on K-Means Clustering and CNN-LSTM-Attention Model

The determination of maximum singularity-free space is critical to structural design and motion control strategy in the Stewart platform. Nevertheless, in practical applications, there exist several limitations such as computational efficiency, calculation precision, and the reliability of computational results. To overcome those shortcomings, this work proposes an efficient and high-precision method for computing the maximum singularity-free space within the Stewart platform. Firstly, apply K-Means clustering to group the variables, including the range, mean, and standard deviation of driving rod lengths, and the clustering centroids and extreme rod lengths collectively form a set of scenarios to avoid large-scale searching. An additional sorting methodology with a specific parameter is proposed for sorting the aforementioned scenarios in descending order and detecting singular-prone cases. Secondly, compute the initial solution for maximum singularity-free length without gimbal lock through an analytical solution formula, enabling reduction in the search scope. Thirdly, introduce a novel scaling factor to resolve the problem of dimensional inconsistency between rotation and translation within the Jacobian matrix using dual quaternions, and determine the singularity based on the determinant of the newly proposed Jacobian matrix. Finally, employ a CNN-LSTM-Attention model for a secondary verification procedure, specifically targeting the challenge of singularities encountered when solving the forward kinematics of the Stewart platform using zero-position values. The experiments demonstrate that the accelerated discretization method for maximum singularity-free joint space and workspace is applicable to devices with diverse geometric configurations. For two practical Stewart platforms, compared with two conventional methods, this method improves computational efficiency and precision significantly. The computation time of the first platform is reduced by 97.54% and 98.07% respectively, while that of the second platform is cut by 80.84% and 81.80% respectively. In terms of precision, the first platform demonstrates 95.83% and 78% improvement respectively, and the second platform attains 99.99% improvement over two conventional methods.

Authors

Institutions

Publication Details

Journal
Actuators
Published
2025-02-06
DOI
https://doi.org/10.3390/act14020074
Citations
3
Primary Topic
Robotic Mechanisms and Dynamics
Type
article
Field-Weighted Citation Impact
3.64
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and High-Precision Method of Calculating Maximum Singularity-Free Space in Stewart Platform Based on K-Means Clustering and CNN-LSTM-Attention Model

Huicheng Zhou, Jie Tao, Wei Fan
3 citations
Actuators
Robotic Mechanisms and Dynamics
3.64
article

Efficient and High-Precision Method of Calculating Maximum Singularity-Free Space in Stewart Platform Based on K-Means Clustering and CNN-LSTM-Attention Model

Huicheng Zhou, Jie Tao, Wei Fan
article en
3 citations

Abstract

The determination of maximum singularity-free space is critical to structural design and motion control strategy in the Stewart platform. Nevertheless, in practical applications, there exist several limitations such as computational efficiency, calculation precision, and the reliability of computational results. To overcome those shortcomings, this work proposes an efficient and high-precision method for computing the maximum singularity-free space within the Stewart platform. Firstly, apply K-Means clustering to group the variables, including the range, mean, and standard deviation of driving rod lengths, and the clustering centroids and extreme rod lengths collectively form a set of scenarios to avoid large-scale searching. An additional sorting methodology with a specific parameter is proposed for sorting the aforementioned scenarios in descending order and detecting singular-prone cases. Secondly, compute the initial solution for maximum singularity-free length without gimbal lock through an analytical solution formula, enabling reduction in the search scope. Thirdly, introduce a novel scaling factor to resolve the problem of dimensional inconsistency between rotation and translation within the Jacobian matrix using dual quaternions, and determine the singularity based on the determinant of the newly proposed Jacobian matrix. Finally, employ a CNN-LSTM-Attention model for a secondary verification procedure, specifically targeting the challenge of singularities encountered when solving the forward kinematics of the Stewart platform using zero-position values. The experiments demonstrate that the accelerated discretization method for maximum singularity-free joint space and workspace is applicable to devices with diverse geometric configurations. For two practical Stewart platforms, compared with two conventional methods, this method improves computational efficiency and precision significantly. The computation time of the first platform is reduced by 97.54% and 98.07% respectively, while that of the second platform is cut by 80.84% and 81.80% respectively. In terms of precision, the first platform demonstrates 95.83% and 78% improvement respectively, and the second platform attains 99.99% improvement over two conventional methods.

ActuatorsVol. 14(2)
Wuhan National Laboratory for Optoelectronics (CN), Huazhong University of Science and Technology (CN)
Openalex Percentile: Top 9%
Robotic Mechanisms and Dynamics
3.64
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.