Comparison of different supervised learning algorithms for position analysis of the slider-crank mechanism

Abstract

Slider-crank mechanisms have a wide range of applications in machine design, primarily for converting rotary motion into reciprocating motion, as seen in internal combustion engines, pumps, compressors, and human-powered vehicles. Due to their widespread usage, analytical and graphical solutions for the position analysis of slider-crank mechanisms are introduced in various textbooks and lecture notes. Recently, artificial neural network algorithms have been applied to various design applications across different research fields, and mechanism design is no exception. However, investigations into the application of neural network algorithms specifically to slider-crank mechanisms are quite limited. In this study, the analytical position analysis of the slider-crank mechanism is presented, and datasets are obtained first. Subsequently, the application of following three different supervised learning algorithms to the position analysis of the slider-crank (R-RRT) mechanism is investigated using analytical solution datasets: the Levenberg-Marquardt Backpropagation (LM) algorithm, Bayesian Regularization (BR) algorithm, and Scaled Conjugate Gradient Descent (SCG) algorithm. These three algorithms were chosen due to their distinct characteristics. The main objectives of this study are to highlight the differences among various neural network algorithms' applications and to understand the applicability and suitability of different neural network algorithms for kinematic position analysis in mechanisms. The results indicate that the Bayesian regularization algorithm yields the best results, while the Levenberg-Marquardt Backpropagation algorithm exhibits the best performance.