基于聚类分析法的装夹规划算法研究

Setups algorithm based on clustering analysis

为解决计算机辅助工艺规划中的装夹规划问题,在定义加工单元的基础上,建立装夹规划数学模型,并提出了应用凝聚的层次聚类法求解该模型。把加工机床和工艺原理约束转换为加工单元间的距离,依据距离大小对加工单元聚类。根据加工顺序优先关系图,应用启发式算法对加工单元分组,对聚类的加工单元进行组间和组内排序。最后以零件ANC-101为例,验证了所提方法的有效性。

To deal with setups planning problem in Computer Aided Process Planning（CAPP）, based on definition of machining unit, a mathematical model of setups planning was constructed. And hierarchical clustering method was proposed to solve the model. Machining tools and process principles constraints were transformed into the distance among machining units. Machining units were clustered according to the distance. Heuristic algorithm was used to group machining units and the clustered machining units were sorted within and cross group. Finally, an example of ANC-101 part was provided to illustrate the feasibility of the proposed model.