Search

Assembly planning is a significant problem for automatic assembling using robotic manipulators. An assembly planning method using a Petri net is presented. The assembly network is modeled by using the Petri net with reference to the conventional and/or net. The state shift equation of the Petri net, which is a mathematical model of the net, is analyzed. From this analysis, it is clarified that the set of a basis solution of a state shift matrix is an actual assembly sequence. When considering an optimization problem which minimizes a summation of a weight value of all tasks included in the assembly sequence, a linear programming (LP) technique can be used. Some numerical examples to certify the validity of the proposed analysis are shown. >

An assembly planning method using Petri nets is presented. First, the assembly network is modeled using the conventional AND/OR net. Second, the state shift equation of the Petri net, which is its mathematical model, is analyzed. This analysis shows that the basis solution the of a state shift matrix is identical to the set of a solution which corresponds to an actual assembly sequence. This means that in considering an optimization problem which minimizes a summation of a weight value of all tasks included in the assembly sequence, a linear programming technique can be used. Some numerical examples are given to certify the validity of the analysis.