Show simple item record

contributor authorJ. M. Porta
contributor authorL. Ros
contributor authorT. Creemers
contributor authorF. Thomas
date accessioned2017-05-09T00:25:07Z
date available2017-05-09T00:25:07Z
date copyrightApril, 2007
date issued2007
identifier issn1050-0472
identifier otherJMDEDB-27846#397_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/136491
description abstractThis 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.
publisherThe American Society of Mechanical Engineers (ASME)
titleBox Approximations of Planar Linkage Configuration Spaces
typeJournal Paper
journal volume129
journal issue4
journal titleJournal of Mechanical Design
identifier doi10.1115/1.2437808
journal fristpage397
journal lastpage405
identifier eissn1528-9001
keywordsLinkages
keywordsAlgorithms
keywordsEquations
keywordsApproximation AND Space
treeJournal of Mechanical Design:;2007:;volume( 129 ):;issue: 004
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record