上海交通大学学报

上海交通大学学报（自然版） ›› 2015, Vol. 49 ›› Issue (03): 387-391.

• 自动化技术、计算机技术 • 上一篇    下一篇

基于改进隶属云模型蚁群算法的喷涂机器人喷枪轨迹组合优化

李翠明，龚俊，牛万才，王翀   

  1. （兰州理工大学 机电工程学院，兰州 730050）
  • 收稿日期:2014-07-03 出版日期:2015-03-30 发布日期:2015-03-30
  • 基金资助:

    国家自然科学基金项目（51165022），甘肃省自然科学基金项目（145RJZA028）资助

Combinatorial Optimization of Spray Painting Robot Tool Trajectory Based on Improved Membership Cloud Models Ant Colony Algorithm

LI Cuiming，GONG Jun，NIU Wancai，WANG Chong   

  1. (College of MechanoElectronic Engineering， Lanzhou University of Technology， Lanzhou 730050，  China)
  • Received:2014-07-03 Online:2015-03-30 Published:2015-03-30

摘要：

摘要：  针对复杂曲面分片后的喷枪轨迹组合优化问题，利用哈密尔顿图将其转化为广义开环旅行商问题(OTSP)，采用“问题无关的进化算法与问题相关的局部搜索相结合”的策略，首先引入隶属云模型来自适应调节蚁群算法中控制的随机性，然后引入K-opt局部搜索策略的基于改进隶属云模型蚁群算法(MCMACA)对喷枪轨迹组合优化的OTSP问题进行求解.仿真结果表明，改进隶属云模型蚁群算法的全局搜索性和局部收敛性更佳，在复杂曲面上对喷涂机器人喷枪轨迹进行优化具有明显的优越性.
关键词：  组中图分类号： 文献标志码：  A

关键词: 合优化, 喷涂机器人, 蚁群算法, 隶属云模型

Abstract:

Abstract： Aimed at the combinatorial optimization of tool trajectory upon the complex freeform curved surface piece, Hamiltonian path was adopted to transform it to an open traveling salesman problem (OTSP). Meanwhile the strategy of integrating the problemunrelated optimization algorithm and the problemrelated local search was adopted. First, the membership cloud models were introduced to adapt and adjust the randomness controlled by the ant colony algorithm. Then, the Kopt partial search strategy was introduced to find the solution to OTSP in respect of the combinatorial optimization of the tool trajectory based on the improved membership cloud models ant colony algorithm (MCMACA). The simulation result shows that MCMACA features better global search ability and local convergence. Meanwhile, it has obvious advantages in terms of optimization of the spray painting robot tool trajectory on complex curved surface.

Key words:  , combinatorial optimization； spray painting robot； ant colony algorithm； membership cloud models

中图分类号: