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.

Name thesis:degree_name

Master of Science in Engineering

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Mechanical Engineering

Grantor

The University of Texas at Austin

Year dc:date.issued

2013

Author dc:creator

• Manion, Charles Austin

Advisor dc:contributor.advisor

• Campbell, Matthew I.

• Graph grammar
• Assembly planning

Handle dc:identifier.uri

http://hdl.handle.net/2152/23658

OAI identifier oai:identifier

oai:repositories.lib.utexas.edu:2152/23658