论文部分内容阅读
针对复杂折弯件的加工提出了一种基于多重约束模型的工序规划算法。该算法采用启发式搜索中的A*算法将工序规划转换为一般化的最短路径搜寻问题,并使用基于可行性、尺寸精度和生产效率的多重约束模型来优化搜索过程。基于该算法实现了一套工艺规划系统,通过对该系统的测试表明,该算法执行效率高,稳定性好,能够有效减少复杂折弯件的规划时间,尤其对于无法完成最终折弯的工件,规划时间会大幅缩短。
Aiming at the processing of complex bending parts, a process planning algorithm based on multiple constrained models is proposed. The algorithm uses the A * algorithm in heuristic search to transform the process planning into the generalized shortest path search problem and uses a multiple constraint model based on feasibility, dimensional accuracy and production efficiency to optimize the search process. Based on this algorithm, a set of process planning system is realized. The test of this system shows that the algorithm has high efficiency and good stability, which can effectively reduce the planning time of complicated bending parts. Especially for the workpieces that can not be finished, Planning time will be significantly shortened.