An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the as...An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the assembly model, the components in the assembly can bedivided into partially constrained components and completely con-strained components in the firststage, and then geometric precedence relation for every component is generated automatically.According to the result of the first stage, the second stage determines and constructs allprecedence graphs. The algorithms of these two stages proposed are verified by two assemblyexamples.展开更多
The purpose of this paper is to identify cycles, and in particular positive cycle(s), in an activity network under generalized precedence relations (GPRs). An algorithm is provided to search for such cycle(s). An impr...The purpose of this paper is to identify cycles, and in particular positive cycle(s), in an activity network under generalized precedence relations (GPRs). An algorithm is provided to search for such cycle(s). An improved depth-first search is adopted. An efficient arc-oriented representation is used in the algorithm to save on computer storage requirement.展开更多
基金This project is supported by National Natural Science Foundation of China(No.59990470,No.59725514,No.59985004)and Robotics Laboratory,Chinese Academy of Sciences Foundation(No.RL200006)
文摘An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the assembly model, the components in the assembly can bedivided into partially constrained components and completely con-strained components in the firststage, and then geometric precedence relation for every component is generated automatically.According to the result of the first stage, the second stage determines and constructs allprecedence graphs. The algorithms of these two stages proposed are verified by two assemblyexamples.
文摘The purpose of this paper is to identify cycles, and in particular positive cycle(s), in an activity network under generalized precedence relations (GPRs). An algorithm is provided to search for such cycle(s). An improved depth-first search is adopted. An efficient arc-oriented representation is used in the algorithm to save on computer storage requirement.
