Computer Engineering and Applications ›› 2018, Vol. 54 ›› Issue (10): 236-241.DOI: 10.3778/j.issn.1002-8331.1612-0323
Previous Articles Next Articles
WU Baosheng, GUO Yu, WANG Falin, SONG Qian
Online:
Published:
吴保胜,郭 宇,王发麟,宋 倩
Abstract: Cable harness routing is the universal problem in the design of complex mechatronic products. To solve the problems of low efficiency and poor reliability in the design of the cable harness routing, a path planning method of cable harness based on improved ant colony optimization is proposed in this paper. Firstly, the space division method with sectional type is used to establish the wiring space environment. To obtain the path planning space of three dimensional wiring, the wiring space is rasterized at the same time. To solve the problem of path point divergence in the path search, the path search strategy with ant colony optimization algorithm based on gravity rules is introduced, which improves the truth of the path planning. Finally, in the simulation experiment, the method proposed in this paper is contrastive analysis with the basic ant colony algorithm, and the feasibility and effectiveness of the proposed algorithm are verified in this paper.
Key words: cable harness, path planning, ant colony optimization, gravity rules
摘要: 线缆布线是复杂机电产品设计中的普遍性难题。针对线缆布局设计中存在的效率低、可靠性差等问题,提出了一种基于改进蚁群算法的线缆路径规划方法。采用分段式空间划分方法对待布线空间进行环境建模,同时对布线空间进行栅格化处理,以获取三维布线路径的规划空间。为解决基本蚁群算法在进行路径搜索时路径点容易发散的问题,引入了基于重力规则的蚁群算法路径搜索策略,提高了路径规划的真实度。在仿真实验中,将所提出的方法与基本蚁群算法进行了对比分析,验证了该算法的可行性和有效性。
关键词: 线缆, 路径规划, 蚁群算法, 重力规则
WU Baosheng, GUO Yu, WANG Falin, SONG Qian. Research on path planning of cable harness based on improved ant colony optimization[J]. Computer Engineering and Applications, 2018, 54(10): 236-241.
吴保胜,郭 宇,王发麟,宋 倩. 基于改进蚁群算法的线缆路径规划技术研究[J]. 计算机工程与应用, 2018, 54(10): 236-241.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1612-0323
http://cea.ceaj.org/EN/Y2018/V54/I10/236