CAJ | 학술논문

装配路径规划是虚拟装配技术的核心，为了获得最优装配路径，在凸四边形障碍物环境中，通过对初始种群选取方法的重新定义，保证了参加演化算法的每条染色体都是可行的，同时对传统遗传算法中的变异算子和杂交算子进行改进，提高了算法的有效性。最后实验证明将改进的遗传算法运用到机械式减速箱装配中可得到更优的装配路径。
장배로경규화시허의장배기술적핵심，위료획득최우장배로경，재철사변형장애물배경중，통과대초시충군선취방법적중신정의，보증료삼가연화산법적매조염색체도시가행적，동시대전통유전산법중적변이산자화잡교산자진행개진，제고료산법적유효성。최후실험증명장개진적유전산법운용도궤계식감속상장배중가득도경우적장배로경。
Assembly path planning is the core of virtual assembly. In order to obtain the optimal path,an improved algorithm based on genetic algorithm is proposed in the convex quadrilateral obstacle environment. The selection of the sample population is redefined to make sure that al the chromosomes involved in the evolutionary algorithms are useful. And the traditional mutation operator and crossover operator of genetic algorithm are improved to enhance the efficiency of the algorithm. Experiment shows that the mechani￣cal reducer can be used to optimize the assembly path.