On the boundedness of running-in attractors based on recurrence plot and recurrence qualification analysis
A feature parameter was proposed to quantitatively explore the boundedness of running-in attractors; its variation throughout the friction process was also investigated. The enclosing radius R was built with recurrence plots (RPs) and recurrence qualification analysis (RQA) by using the time delay embedding and phase space reconstruction. Additionally, the typology of RPs and the recurrence rate (RR) were investigated to verify the applicability of R in characterizing the friction process. Results showed that R is larger at the beginning, but exhibits a downward trend in the running-in friction process; R becomes smooth and trends to small steady values during the steady-state friction period, and finally shows an upward trend until failure occurs. The evolution of R, which corresponded with the typology of RPs and RR during friction process, can be used to quantitatively analyze the variation of the running-in attractors and friction state identifacation. Hence, R is a valid parameter, and the boundedness of running-in attractors can offer a new way for monitoring the friction state of tribological pairs.
Keywordsrunning-in attractor boundedness enclosing radius recurrence plot dynamic evolvement
This work is carried out within the projects supported by the National Natural Science Foundation of China (Nos. 51775546 and 51375480) and the Priority Academic Program Development of Jiangsu Higher Education Institutions.
- Xie Y B. Theory of Tribo-systems. In Tribology-Lubricants and Lubrication. Kuo C H, Ed. InTech, 2011.Google Scholar
- Zhu H, Ge S R, Li G, Lv L. Test of running-in process and preliminary analysis of running-in attractors. Lubr Eng 32(1): 1–3 (2017)Google Scholar
- Liu L J, Fu Y, Ma S W. Wind power short-term prediction method based on multivariable mutual information and phase space reconstruction. In Intelligent Computing in Smart Grid and Electrical Vehicles. ICSEE 2014, LSMS 2014. Communications in Computer and Information Science, vol 463. Li K, Xue Y, Cui S, Niu Q, Eds. Berlin, Heidelberg: Springer, 2014: 1–12.Google Scholar
Open Access: The articles published in this journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.