Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/19820Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Seow, Kiam Tian. | en_US |
| dc.date.accessioned | 2009-12-14T06:42:05Z | - |
| dc.date.available | 2009-12-14T06:42:05Z | - |
| dc.date.copyright | 1992 | en_US |
| dc.date.issued | 1992 | - |
| dc.identifier.uri | http://hdl.handle.net/10356/19820 | - |
| dc.description.abstract | Theoretically, this thesis addresses the problem of representing and analyzing feasible assembly sequences for mechanical products. Practically, it addresses the problem of automatic generation of feasible assembly sequences based on the specified precedence constraints. A feasible assembly sequence is one order of all assembly tasks for an assembly, satisfying all the specified precedence ordering constraints which constitute what is called an implicit representation. | en_US |
| dc.format.extent | 86 p. | - |
| dc.language.iso | en | - |
| dc.rights | NANYANG TECHNOLOGICAL UNIVERSITY | en_US |
| dc.subject | DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics | en_US |
| dc.title | Robotic-task sequence representation and analysis | en_US |
| dc.type | Thesis | en_US |
| dc.contributor.supervisor | R. Devanathan | en_US |
| dc.contributor.school | School of Electrical and Electronic Engineering | en_US |
| dc.description.degree | Master of Engineering | en_US |
| item.fulltext | With Fulltext | - |
| item.grantfulltext | restricted | - |
| Appears in Collections: | EEE Theses | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| EEE_THESES_344.pdf Restricted Access | 8.97 MB | Adobe PDF | View/Open |
Page view(s) 5
956
Updated on Dec 2, 2023
Download(s)
4
Updated on Dec 2, 2023
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.