結合優先関係グラフに基づく製品の組立順序の生成 : 第1報, 結合優先関係グラフの定義とその操作方法

概要

論文の詳細を見る
We present a graph of the connection precedence relationship (CPR graph) for generating all feasible assembly sequences for a set of mechanical parts. The CPR graph is defined as a special directed graph whose nodes and edges correspond to parts or subassemblies and the relationhips between them, respectively, an each edge has a label indicating the connection precedence relation-ship between the parts or subassemblies. Joining two parts or subassemblies corresponds to the following operation sequence in the-CPR graph: deleting the two corresponding nodes and the edges between them, adding a new node corresponding to the assembled subassembly, and rewriting the labels of the other edges in the graph related to the change. Above operation sequence is called shortening operator. The central idea of the proposed method is that the process of assembling a product corresponds to the process of shortening the CPR graph of the product. Therefore, a complete assembly sequence is generated by using shortening operator repeatedly to change the CPR graph from the initial state to the goal state. Where the CPR graph of initial state consists of the nodes only corresponding to the parts whereas the CPR graph of goal state consists of only one node corresponding to the whole assembly. The major advantages of the proposed method are its simplicity and less computational complexity compared to the other related methods.
一般社団法人日本機械学会の論文
1996-03-25

結合優先関係グラフに基づく製品の組立順序の生成 : 第1報, 結合優先関係グラフの定義とその操作方法

スポンサーリンク

概要

著者

関連論文

スポンサーリンク