A Method to Avoid Singularity of the Planar Four-Bar Linkage by Means of Self-Adaptive Structure

2014 ◽  
Vol 709 ◽  
pp. 227-233
Author(s):  
Rui Qin Guo ◽  
Wei Hu ◽  
Juan Liu ◽  
Song Lin

The singularity, namely, the output movement of the mechanism is uncertain due to kinematic bifurcation at the singular position, is the intrinsic characteristic of mechanism, resulting in movement out of control. To find a practical solution for this vexed question to make mechanism able to avoid its singular position is the greatest challenge in the field of mechanism. Based on the study of the planar four-bar linkage with singularity, the ideology of introducing self-adaptive mechanism theory into the solution of avoid singularity problem is firstly put forward in this paper. Using self-adaptive mechanism to complement the out of control parameters of singular position can make the mechanism have the ability to avoid singularity. Then the mechanism passes through the singular position smoothly with determined movement and load capability. Finally, the purpose of avoiding singularity is achieved.

2014 ◽  
Vol 10 (12) ◽  
pp. 1042-1046 ◽  
Author(s):  
Qiaolin Lei ◽  
Haibo Rao ◽  
Xuemei Wang ◽  
Da Zhou ◽  
Caineng Li ◽  
...  

2021 ◽  
pp. 575-589
Author(s):  
Danilo F. Poveda-Pulla ◽  
Jefferson V. Dominguez-Paute ◽  
Luis F. Guerrero-Vásquez ◽  
Paúl A. Chasi-Pesántez ◽  
Jorge O. Ordoñez-Ordoñez ◽  
...  

2014 ◽  
Vol 19 ◽  
pp. 52-67 ◽  
Author(s):  
Haixiang Guo ◽  
Yanan Li ◽  
Jinling Li ◽  
Han Sun ◽  
Deyun Wang ◽  
...  

2020 ◽  
Vol 514 ◽  
pp. 203-233
Author(s):  
Shir Li Wang ◽  
Farid Morsidi ◽  
Theam Foo Ng ◽  
Haldi Budiman ◽  
Siew Chin Neoh

2011 ◽  
Vol 255-260 ◽  
pp. 2121-2125
Author(s):  
Qiang Xu ◽  
Le Chang Sun ◽  
Min Zhang ◽  
Ting Zhao

Churn is a great challenge for the development and deployment of Distributed Hash Table networks, but current churn treatments ignore the effect of adapting the size of routing table flexibly to handle churn. In this paper, we research the routing table self-adaptive mechanism for Kademlia. Based on quantifying the influence ofK, the parameter representing the size of ak-bucket, on routing performance, a self-adaptive algorithm of K is proposed. This algorithm adapts K to the variation of churn rate which is estimated by the validity of data in routing table. Simulation results show that it can reduce the lookup latency under churn. Even if the churn rate varies remarkably, the network is flexible enough to provide fine performance.


Sign in / Sign up

Export Citation Format

Share Document