Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6922Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Lozano-Perez, Tomas | - |
| dc.date | 2004-10-20T20:07:10Z | - |
| dc.date | 2004-10-20T20:07:10Z | - |
| dc.date | 1976-12-01 | - |
| dc.date.accessioned | 2013-10-09T02:47:37Z | - |
| dc.date.available | 2013-10-09T02:47:37Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AITR-397 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6922 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This thesis describes a mechanical assembly system called LAMA (Language for Automatic Mechanical Assembly). The goal of the work was to create a mechanical assembly system that transforms a high-level description of an automatic assembly operation into a program or execution by a computer controlled manipulator. This system allows the initial description of the assembly to be in terms of the desired effects on the parts being assembled. Languages such as WAVE [Bolles & Paul] and MINI [Silver] fail to meet this goal by requiring the assembly operation to be described in terms of manipulator motions. This research concentrates on the spatial complexity of mechanical assembly operations. The assembly problem is seen as the problem of achieving a certain set of geometrical constraints between basic objects while avoiding unwanted collisions. The thesis explores how these two facets, desired constraints and unwanted collisions, affect the primitive operations of the domain. | - |
| dc.format | 15949289 bytes | - |
| dc.format | 12606998 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AITR-397 | - |
| dc.title | The Design of a Mechanical Assembly System | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.