Return to search

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

Assembly 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. / text

Identiferoai:union.ndltd.org:UTEXAS/oai:repositories.lib.utexas.edu:2152/23658
Date25 March 2014
CreatorsManion, Charles Austin
Source SetsUniversity of Texas
Detected LanguageEnglish
TypeThesis
Formatapplication/pdf

Page generated in 0.0017 seconds