{"id":{"repo_id":"texas","oai_identifier":"oai:repositories.lib.utexas.edu:2152/23658"},"canonical_url":"https://search.dev.ndltd.org/etd/texas/oai:repositories.lib.utexas.edu:2152/23658","repository":{"repo_id":"texas","name":"University of Texas","base_url":"https://repositories.lib.utexas.edu/server/oai/request"},"display":{"title":"Assembly sequencing through graph reasoning : graph grammar rules for assembly planning","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Manion, Charles Austin"],"institution":"The University of Texas at Austin","degree_name":"Master of Science in Engineering","degree_level":"Masters","degree_discipline":"Mechanical Engineering","degree_department":null,"school":null,"contributors":[],"advisors":["Campbell, Matthew I."],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-12","date_published":"2013-12","updated_at":"2026-07-24T05:01:20Z","subjects":["Graph grammar","Assembly planning"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2152/23658","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Campbell, Matthew I."]},{"key":"dc:creator","label":"Author","values":["Manion, Charles Austin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-25T17:02:48Z"]},{"key":"dc:date.issued","label":"Date","values":["2013-12"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mechanical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Engineering"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["The University of Texas at Austin"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Graph grammar","Assembly planning"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/2152/23658"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["text"]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Assembly sequencing through graph reasoning : graph grammar rules for assembly planning"]}]}],"canonical_facts":{"dc:contributor.advisor":["Campbell, Matthew I."],"dc:creator":["Manion, Charles Austin"],"dc:date.accessioned":["2014-03-25T17:02:48Z"],"dc:date.issued":["2013-12"],"dc:description":["text"],"dc:description.abstract":["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."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/2152/23658"],"dc:subject":["Graph grammar","Assembly planning"],"dc:title":["Assembly sequencing through graph reasoning : graph grammar rules for assembly planning"],"dc:type":["Thesis"],"thesis:degree_discipline":["Mechanical Engineering"],"thesis:degree_level":["Masters"],"thesis:degree_name":["Master of Science in Engineering"],"thesis:institution_name":["The University of Texas at Austin"]},"updated_at":"2026-07-24T05:01:20Z"}