dc.contributor.authorSeow, Kiam Tian.en_US
dc.date.accessioned2009-12-14T06:42:05Z
dc.date.available2009-12-14T06:42:05Z
dc.date.copyright1992en_US
dc.date.issued1992
dc.identifier.urihttp://hdl.handle.net/10356/19820
dc.description.abstractTheoretically, 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.extent86 p.
dc.language.isoen
dc.rightsNANYANG TECHNOLOGICAL UNIVERSITYen_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Roboticsen_US
dc.titleRobotic-task sequence representation and analysisen_US
dc.typeThesisen_US
dc.contributor.supervisorR. Devanathanen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeMASTER of ENGINEERING(EEE)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record