上海交通大学学报

上海交通大学学报 >

2021 , Vol. 55 >Issue 5: 536 - 543

DOI: https://doi.org/10.16183/j.cnki.jsjtu.2020.208

基于轨迹线的临界多边形算法拓展

展开
  • 1.上海交通大学 电气工程系,上海 200240
    2.上海方菱计算机软件有限公司,上海 200241
周 鑫(1995-),男,湖北省宜昌市人,硕士生,研究方向为机器视觉和自动化系统控制.

收稿日期: 2020-07-06

  网络出版日期: 2021-06-01

收起

Promotion of a No Fit Polygon Algorithm Based on Trajectory

Expand
  • 1. Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
    2. Shanghai Fangling Software Co., Ltd., Shanghai 200241, China

Received date: 2020-07-06

  Online published: 2021-06-01

Fold

摘要

排料问题是指如何在有限的空间内装下最多指定形状物体的问题,在工业生产中有着重要的意义.其求解需要频繁对物体进行相交校验以判断排料位置是否合法.临界多边形算法可以用于加速相交校验过程,但算法本身不能计算曲线,限制了其应用.一种基于移动碰撞法的临界多边形算法可以将工件轮廓拓展至圆弧,但其计算速度较慢.针对该问题,在基于轨迹线的临界多边形算法的基础上,分析并改进了该算法的轨迹生成策略以及外包络轮廓算法.改进后的算法能够在较短的时间内计算出包含圆弧的临界多边形,同时解决了效率和精度问题.最后,在实际的冲床上进行了加工测试,测试结果验证了算法的正确性与效率.

关键词： 临界多边形; 轨迹线算法; 排料问题

本文引用格式

周鑫, 赖晓阳, 孟祥群, 王堃, 唐厚君 . 基于轨迹线的临界多边形算法拓展[J]. 上海交通大学学报, 2021 , 55(5) : 536 -543 . DOI: 10.16183/j.cnki.jsjtu.2020.208

Abstract

The nesting problem is how to nest objects of a specified shape in a two-dimensional space to obtain the maximum space utilization rate, which is of great significance in industrial production. The solution to the nesting problem requires frequent cross-checking of the objects to determine whether the nesting position is legal. The No Fit Polygon algorithm can be used to accelerate the procedure of cross-checking, but the algorithm cannot be used to calculate shapes containing curves, which limits its application. An algorithm based on orbit sliding can calculate No Fit Polygon between shapes which includes arc, but its effectiveness is not satisfactory. Aimed at this problem, and based on trajectory algorithm, the trajectory generation strategy and the profile algorithm are analyzed and improved. The improved algorithm can calculate the No Fit Polygon between shapes containing arc in a shorter time, solving both accuracy and effectiveness problems. Finally, the algorithm is tested in the real punch production process and the results of the test confirms the correctness and effectiveness of the algorithm.

Key words： No Fit Polygon; trajectory algorithm; nesting problem

参考文献

[1] ADAMOWICZ M, ALBANO A. Nesting two-dimensional shapes in rectangular modules[J]. Computer-Aided Design, 1976, 8(1):27-33.
[2] TERRY W, AMICO M D, IORI M. Bin packing problem with general precedence constraints[J]. IFAC-PapersOnLine, 2015, 48(3):2027-2029.
[3] MARTELLO S, PISINGER D, VIGO D. The three-dimensional bin packing problem[J]. Operations Research, 2000, 48(2):256-267.
[4] 孙佳正. 基于不完整临界多边形的二维排样问题的研究[D]. 上海: 华东师范大学, 2018.
[4] SUN Jiazheng. Research on 2D Layout problem based on incomplete No-Fit Polygon[D]. Shanghai: East China Normal University, 2018.
[5] XU J J. An optimization algorithm based on no fit polygon method and hybrid heuristic strategy for irregular nesting problem [C]//The 36th China Control Memories Collection. Dalian: Technical Committee on Control Theory, Chinese Association of Automation, 2017: 1234-1239.
[6] YANG Q. No Fit Polygon for nesting problem solving with hybridizing ant algorithms[J]. Journal of Software Engineering and Applications, 2014, 7(5):433-439.
[7] VALVO E L. Meta-heuristic algorithms for nesting problem of rectangular pieces[J]. Procedia Engineering, 2017, 183:291-296.
[8] 杨卫波, 王万良. 改进临界多边形生成算法[J]. 计算机工程与应用, 2013, 49(1):32-35.
[8] YANG Weibo, WANG Wanliang. Improved algorithm for No-Fit Polygon calculation[J]. Computer Engineering and Applications, 2013, 49(1):32-35.
[9] 杨卫波, 王万良, 张景玲, 等. 基于遗传模拟退火算法的矩形件优化排样[J]. 计算机工程与应用, 2016, 52(7):259-263.
[9] YANG Weibo, WANG Wanliang, ZHANG Jingling, et al. Packing optimization of rectangles based on improved genetic annealing algorithm[J]. Computer Engineering and Applications, 2016, 52(7):259-263.
[10] 刘海明, 周炯, 吴忻生. 应用临界多边形方法与小生境遗传算法求解不规则排样问题[J]. 小型微型计算机系统, 2016, 37(5):1002-1007.
[10] LIU Haiming, ZHOU Jiong, WU Xinsheng. Using No Fit Polygon method and niche genetic algorithm to solve irregular layout problems[J]. Small Microcomputer System, 2016, 37(5):1002-1007.
[11] 周炯. 基于临界多边形方法的二维不规则件排样问题及其算法研究[D]. 广州:华南理工大学, 2015.
[11] ZHOU Jiong. Two-dimensional irregular parts layout problem based on No Fit Polygon method and its algorithm research[D]. Guangzhou: South China University of Technology, 2015.
[12] 汤德佑, 周子琳. 基于临界多边形的不规则件启发式排样算法[J]. 计算机应用, 2016, 36(9):2540-2544.
[12] TANG Deyou, ZHOU Zilin. No-Fit-Polygon-based heuristic nesting algorithm for irregular shapes[J]. Journal of Computer Applications, 2016, 36(9):2540-2544.
[13] 刘胡瑶, 何援军. 基于轨迹计算的临界多边形求解算法[J]. 计算机辅助设计与图形学学报, 2006, 18(8):1123-1129.
[13] LIU Huyao, HE Yuanjun. New algorithm for No Fit Polygon calculation[J]. Journal of Computer-Aided Design & Computer Graphics, 2006, 18(8):1123-1129.
[14] BURKE E K, HELLIER R S R, KENDALL G, et al. Irregular packing using the line and arc No-Fit Polygon[J]. Operations Research, 2010, 58(4):948-970.
Options
文章导航

/

〈 〉