English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/96578
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

On closed-form solutions to the position analysis of Baranov trusses

AuthorsRojas, Nicolás ; Thomas, Federico
KeywordsCharacteristic polynomial
Position analysis
Baranov trusses
Issue Date2012
CitationMechanism and Machine Theory 50: 179-196 (2012)
AbstractThe exact position analysis of a planar mechanism reduces to compute the roots of its characteristic polynomial. Obtaining this polynomial usually involves, as a first step, obtaining a system of equations derived from the independent kinematic loops of the mechanism. Although conceptually simple, the use of kinematic loops for deriving characteristic polynomials leads to complex variable eliminations and, in most cases, trigonometric substitutions. As an alternative, a method based on bilateration has recently been shown to permit obtaining the characteristic polynomials of the three-loop Baranov trusses without relying on variable eliminations or trigonometric substitutions. This paper shows how this technique can be applied to solve the position analysis of all cataloged Baranov trusses. The characteristic polynomials of them all have been derived and, as a result, the maximum number of their assembly modes has been obtained. A comprehensive literature survey is also included. © 2011 Elsevier Ltd. All Rights Reserved.
Publisher version (URL)http://dx.doi.org/10.1016/j.mechmachtheory.2011.10.010
Identifiersdoi: 10.1016/j.mechmachtheory.2011.10.010
issn: 0094-114X
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
On closed-form.pdf523,59 kBUnknownView/Open
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.