Assembly sequencing through graph reasoning : graph grammar rules for assembly planning

dc.contributor.advisorCampbell, Matthew I.
dc.creatorManion, Charles Austinen
dc.date.accessioned2014-03-25T17:02:48Zen
dc.date.accessioned2017-05-11T22:49:11Z
dc.date.available2017-05-11T22:49:11Z
dc.date.issued2013-12en
dc.date.submittedDecember 2013en
dc.date.updated2014-03-25T17:02:48Zen
dc.descriptiontexten
dc.description.abstractAssembly planning is difficult and tedious, but is necessary for complex products. This thesis presents a novel approach to automating assembly planning utilizing graph grammars. Computational geometric reasoning is used to produce a label rich graph from a CAD model. This graph is then modified by graph grammar rules to produce candidate assembly sequences which are run in conjunction with a tree search algorithm. An evaluation system then evaluates partial assembly sequences, which are used by the tree- search to find near-optimal assembly sequences.en
dc.description.departmentMechanical Engineeringen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/2152/23658en
dc.subjectGraph grammaren
dc.subjectAssembly planningen
dc.titleAssembly sequencing through graph reasoning : graph grammar rules for assembly planningen
dc.typeThesisen

Files