Research on Route Planning based on improved Ant Colony Algorithm

Author:

Xin Chen,Luo Qiang,Wang Changhong,Yan Zheng,Wang Haibao

Abstract

Abstract In order to enhance the safe flight performance of UAV and better complete complex tasks, it is extremely necessary to study route planning. Firstly, the feature points of the landform landform are extracted as the flight track points of the UAV, and the track planning problem is transformed into the traveling salesman problem. Secondly, an adaptive pheromone update method is proposed, and an improved ant colony algorithm for optimizing the local pheromone is proposed to avoid the basic ant colony algorithm from falling into the local optimal solution and improve the global search ability. Finally, the proposed algorithm is verified by simulation experiments. The experimental results show that the improved ant colony algorithm is practical and superior, and can effectively solve the problem of route planning and obtain the optimal path of route planning.

Publisher

IOP Publishing

Subject

General Physics and Astronomy

Reference9 articles.

1. Improvement and Simulation Analysis of omnidirectional mobile robot[J];Liang;Mechanical Transmission,2016

2. A Local Optimized Ant Colony Algorithm Based on Virtual Ant[J];Li,2019

3. A Study on the Algorithm of Aerial Point Planning of Agricultural UAV Based on Embedded[J];Hong;Agricultural Mechanization Research,2019

4. An Improved Ant Colony and Particle Swarm Hybrid Algorithm for Solving Traveller’s Problem[J];Wang;Computer simulation,2016

5. Robot Path Planning[J];Fang

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3