蚁群算法在无人驾驶园区参观路线的应用  

Application of ant colony optimization algorithm in district visiting route using unmanned vehicle

作　　者：郭蓬[1,2] 张金炜 戎辉[1,3] 王文扬[1] 高嵩[1,2] 何佳[1] GUO Peng;ZHANG Jinwei;RONG Hui;WANG Wenyang;GAO Song;HE Jia(Automotive Engineering Research Institute,China Automotive Technology and Research Center,Tianjin 300300,China;Tianjin University,Tianjin 300072,China;Hebei University of Technology,Tianjin 300132,China)

机构地区：[1]中国汽车技术研究中心汽车工程研究院,天津300300 [2]天津大学,天津300072 [3]河北工业大学,天津300132

出　　处：《现代电子技术》2019年第11期149-152,共4页Modern Electronics Technique

基　　金：国家重点研发计划(2017YFB0102500)~~

摘　　要：针对无人车在中国汽车技术研究中心院区内参观线路的规划问题,提出一种基于蚁群算法参观路线规划的方法。首先利用栅格搭建环境地图,然后通过蚁群算法设置始末位置、构造解空间、更新信息素、增加迭代次数、判断路径长度,最后输出最短路线。文中根据参观要求做出三种不同路径规划方案以验证算法的可行性。A visit route planning method based on ant colony optimization algorithm is presented to solve the planning problem of the visit route of unmanned vehicle in district of China Automotive Technology and Research Center.The grid is used to construct the environment map,and the ant colony optimization algorithm is used to set the beginning and end positions,construct the solution space,update the pheromones,increase the number of iterations,judge the path length,so as to output the shortest route.Three different schemes are made according to visit requirements,which are used to verify the feasibility of the algorithm.

关 键 词：无人车 蚁群算法 路线规划 信息表 栅格地图 最短路线 

分 类 号：TN911.1-34[电子电信—通信与信息系统]