Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/31382
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Finding infinitesimal motions of objects in assemblies using Grassmann-Cayley algebra |
Autor: | Staffetti, Ernesto; Ros, Lluís CSIC ORCID ; Thomas, Federico CSIC ORCID | Palabras clave: | Grassmann-cayley algebra Kinematic constraints Gometric reasoning Robots |
Fecha de publicación: | 1999 | Editor: | Oulu University | Citación: | Proceedings of IFToMM: 584-591 (1999) | Resumen: | We present a method for deriving the set of allowed infinitesimal motions of a polyhedron in contact with a polyhedral assembly without breaking the established basic contacts. The result is obtained, under the frictionless assumption, by describing each basic contact by means of the Grassmann-Cayley algebra and using cycle conditions over closed kinematic chains between the polyhedron and the assembly. Although, in practice, subparts of assemblies need to be moved completely and not only infinitesimally, the obtained results constitute a very useful information for an assembly sequence planner [Thomas et al. 1992], [Staffetti et al. 1998]. We also apply the proposed technique to solve infinitesimal mobility analysis problems of general multiloop spatial mechanisms. | Descripción: | 10th IFToMM: World Congress On The Theory of Machines and Mechanisms, 1999, Oulu, Finland | URI: | http://hdl.handle.net/10261/31382 | ISBN: | 9514252950 |
Aparece en las colecciones: | (IRII) Comunicaciones congresos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
doc1.pdf | 193,81 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
276
checked on 23-abr-2024
Download(s)
120
checked on 23-abr-2024
Google ScholarTM
Check
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.