期刊文献+

皮革裁切加工算法 被引量:8

Leather Cutting Algorithm Design
下载PDF
导出
摘要 给出了用直刀、圆弧刀冲切皮革的加工算法·根据裁切方向和轮廓特点,分别给出两种轨迹计算方式·第一种直接采用等误差逼近计算直刀刀位,第二种则采用等误差、等步长相结合的逼近方式来计算直刀、圆弧刀组合刀位·其间通过在刀具库中搜索合适刀具和绕刀具自身轴心摆转来避免过切·最后用ImprovedGreedy-opt2算法对冲孔轨迹进行路径优化,给出了加工实例,取得了满意的效果· Algorithm design is presented in the paper for the leather punch and cut with straight and arc cutters, and two kinds of paths and relevant calculation methods are presented according to the cut direction and the contour features. In the first method, the equal deviation approaches are used to find straight cutter position, and in the second method, combined equal deviation and chord length approaches are employed to obtain the positions for the mixed straight and arc cutters. During the cutting calculation process, attention should be paid to searching the cutter library for a proper one and rotating the cutters themselves to prevent from over cutting. The punch paths qualities are optimized by an Improved Greedy-opt2 algorithm. Finally, process samples are given to show the satisfactory results of the algorithm.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2005年第7期1642-1646,共5页 Journal of Computer-Aided Design & Computer Graphics
关键词 皮革 皮革加工 切割 冲孔 轨迹优化 旅行商问题 leather leather process cutting punch hole path optimize TSP (Traveling Salesman Problem)
  • 相关文献

参考文献4

二级参考文献2

共引文献8

同被引文献40

  • 1曾建潮,崔志华.一种保证全局收敛的PSO算法[J].计算机研究与发展,2004,41(8):1333-1338. 被引量:158
  • 2肖人彬,陶振武.孔群加工路径规划问题的进化求解[J].计算机集成制造系统,2005,11(5):682-689. 被引量:23
  • 3汪杭军,刘真祥,杨光亿.自动排料中关键算法的研究[J].计算机应用,2005,25(B12):339-341. 被引量:2
  • 4唐学飞,张文君.皮革裁剪方法分析与选择[J].中国皮革,2006,35(8):149-151. 被引量:6
  • 5吴宇燕,彭志牛,王宇晗.NURBS曲线数控插补方法及误差控制[J].机械设计与研究,2006,22(4):75-78. 被引量:11
  • 6[4]ANAND S,McCORD C,SHARMA R.An integrated machine vision based system for solving the nonconvex cuttings stock problem using genetic algorithm[J].Journal of Manufacturing Systems,1999,8(6):114-119.
  • 7[5]KOLAHAN Farhada,LIANG Minga.Optimization of hole-making operations:a tabu-search approach[J].International Journal of Machine Tools and Manufacture,2000,40(12):1735-1753.
  • 8[6]KHAN W A,HAYHURST D R,CANNINGS C.Determination of optimalpath under approach and exit constraints[J].European Journal of Operational Research,1999,117(2):310-325.
  • 9[7]WANG K P,HUANG L,ZHOU C G,et al.Particle swarm optimization for traveling salesman problem[C]//WANG Xizhao.2003 International Conference on Machine Learning and Cybernetics.November 2-5,2003,Xi'an,China.Piscataway,New Jersey:IEEE Service Center,2003(5):1583-1585.
  • 10[8]LIPES H S,COELHO L S.Particle swarm optimization with fast local search for the blind traveling salesman problem[C]//NEDJAH Nadia.5th International Conference on Hybrid Intelligent Systems Proceedings.November 6 -9,2005,Rio de Janeiro,Brazil.Piscataway,New Jersey:IEEE Service Center,2005:245-250.

引证文献8

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部