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
| Identifer | oai:union.ndltd.org:UTEXAS/oai:repositories.lib.utexas.edu:2152/23658 |
| Date | 25 March 2014 |
| Creators | Manion, Charles Austin |
| Source Sets | University of Texas |
| Detected Language | English |
| Type | Thesis |
| Format | application/pdf |
Page generated in 0.0057 seconds