工程设计学报2024，Vol.31Issue(3)：271-279,9.DOI:10.3785/j.issn.1006-754X.2024.03.189
基于连续顶点分区的混凝土3D打印路径规划算法
Path planning algorithm for concrete 3D printing based on continuous vertex partitioning
摘要
Abstract
Aiming at the problems of poor forming quality and long printing time of concrete 3D printing components,a path planning algorithm based on continuous vertex partitioning was proposed.Firstly,the continuous vertex partitioning method based on Hamiltonian circuit was used to divide the print area into several continuous regions to ensure that the print nozzle would not pass the same vertex many times during the printing process,thus avoiding the problem of repeated printing and poor forming quality.Then,the genetic algorithm was used to search each region,and the shortest printing path was determined through iteration and optimization.The experimental results showed that compared with other path planning algorithms,the proposed algorithm could significantly reduce the empty travel and start-stop times of the print nozzle,and shorten the printing time by more than 10%,which effectively improved the forming quality and printing efficiency for concrete components.The concrete 3D printing path planning algorithm based on continuous vertex partitioning solves the problems of poor forming quality and long printing time of concrete components by effectively dividing the print area,intelligentiy searching the shortest path and combining the optimal path,which can provide strong technical support for the development and application of concrete 3D printing technology.关键词
混凝土3D打印/哈密顿回路/遗传算法/路径优化Key words
concrete 3D printing/Hamiltonian circuit/genetic algorithm/path optimization分类
信息技术与安全科学引用本文复制引用
崔衡,马宗方,宋琳,刘超,韩怡萱..基于连续顶点分区的混凝土3D打印路径规划算法[J].工程设计学报,2024,31(3):271-279,9.基金项目
国家自然科学基金面上项目(62276207) （62276207）
