| contributor author | J. M. Porta | |
| contributor author | L. Ros | |
| contributor author | T. Creemers | |
| contributor author | F. Thomas | |
| date accessioned | 2017-05-09T00:25:07Z | |
| date available | 2017-05-09T00:25:07Z | |
| date copyright | April, 2007 | |
| date issued | 2007 | |
| identifier issn | 1050-0472 | |
| identifier other | JMDEDB-27846#397_1.pdf | |
| identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/136491 | |
| description abstract | This paper presents a numerical method able to compute all possible configurations of planar linkages. The procedure is applicable to rigid linkages (i.e., those that can only adopt a finite number of configurations) and to mobile ones (i.e., those that exhibit a continuum of possible configurations). The method is based on the fact that this problem can be reduced to finding the roots of a polynomial system of linear, quadratic, and hyperbolic equations, which is here tackled with a new strategy exploiting its structure. The method is conceptually simple and easy to implement, yet it provides solutions of the desired accuracy in short computation times. Experiments are included that show its performance on the double butterfly linkage and on larger linkages formed by the concatenation of basic patterns. | |
| publisher | The American Society of Mechanical Engineers (ASME) | |
| title | Box Approximations of Planar Linkage Configuration Spaces | |
| type | Journal Paper | |
| journal volume | 129 | |
| journal issue | 4 | |
| journal title | Journal of Mechanical Design | |
| identifier doi | 10.1115/1.2437808 | |
| journal fristpage | 397 | |
| journal lastpage | 405 | |
| identifier eissn | 1528-9001 | |
| keywords | Linkages | |
| keywords | Algorithms | |
| keywords | Equations | |
| keywords | Approximation AND Space | |
| tree | Journal of Mechanical Design:;2007:;volume( 129 ):;issue: 004 | |
| contenttype | Fulltext | |