检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:潘盛湖[1] 张小军 PAN Shenghu;ZHANG Xiaojun(Department of Mechatronics Engineering,Southwest Petroleum University,Chengdu 610500,China)
出 处:《机械科学与技术》2023年第9期1402-1408,共7页Mechanical Science and Technology for Aerospace Engineering
基 金:四川省教育厅项目(16ZA0070)。
摘 要:针对当前复杂图形加工中存在加工轨迹之间空行程多,导致加工过程耗时很长等缺陷,提出一种简单、易于实现的加工轨迹切换优化方法。分析了复杂图形加工轨迹切换控制方法,给出了缩短总空行程的优化思想。基于双向蚁群算法原理,推导了双向最大最小蚁群算法(Bidirectional max-min ant colony system,BMMAS),结合加工轨迹之间轨迹切换特点,对复杂图形加工工艺路径进行规划设计,给出了算法实现流程及加工工艺路径优化的实现要点。最后利用该方法对平面复杂图形进行了优化加工实验。实验结果表明,该加工方法计算简单,加工效率高,空行程路径长度较其它方法短,加工平稳。研究结果对相似复杂图形加工具有参考价值。In view of the defects of the current complex graphics processing,such as too much empty travel between machining paths,resulting in a long time-consuming machining process,a simple and easy to realize machining path switching optimization method was proposed.The switching control method of complex graphics machining path was analyzed,and the optimization idea of shortening the total empty stroke was given.A bidirectional max min ant colony system(BMMAS)was derived based on the principle of bidirectional ant colony algorithm.Combined with the characteristics of trajectory switching between machining trajectories,the machining process path of complex graphics was planned and designed,and the implementation process of the algorithm and the key points of machining process path optimization was given.Finally,the method was used to optimized the machining of plane complex graphics.The experimental results showed that this machining method has the advantages of simple calculation,high machining efficiency,less empty stroke path length and stable machining.The research results have reference value for similar complex graphics processing.
分 类 号:TH164[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.149.2.199