基于混沌蚁群算法的无人机路径规划

Daqiao Zhang, Yong Xian, Jie Li, Gang Lei, Yan Chang
{"title":"基于混沌蚁群算法的无人机路径规划","authors":"Daqiao Zhang, Yong Xian, Jie Li, Gang Lei, Yan Chang","doi":"10.1109/CSMA.2015.23","DOIUrl":null,"url":null,"abstract":"Aiming at the problems that the low convergent rate and easily failing into local extremum of the ant colony algorithm (ACA) in the process of path planning, a new method based on the chaos ant colony algorithm (CACA) is proposed. By adding the chaos disturbance factor into standard ACA, the ACA defects of fall into local optimum is effectively overcome and the searching efficiency is improved. By adding target guiding factor into ACA, the direction fuzzy exists in the ant's transfer is effectively avoided, the direction of the search is strengthened and the quality of result is improved. Through the path planning test considering the constraints of threats and turning radius, test results show that CACA can effectively avoid falling into local optimum, and get better penetration paths that meet the restraint conditions of threats and turning radius.","PeriodicalId":205396,"journal":{"name":"2015 International Conference on Computer Science and Mechanical Automation (CSMA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"UAV Path Planning Based on Chaos Ant Colony Algorithm\",\"authors\":\"Daqiao Zhang, Yong Xian, Jie Li, Gang Lei, Yan Chang\",\"doi\":\"10.1109/CSMA.2015.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the problems that the low convergent rate and easily failing into local extremum of the ant colony algorithm (ACA) in the process of path planning, a new method based on the chaos ant colony algorithm (CACA) is proposed. By adding the chaos disturbance factor into standard ACA, the ACA defects of fall into local optimum is effectively overcome and the searching efficiency is improved. By adding target guiding factor into ACA, the direction fuzzy exists in the ant's transfer is effectively avoided, the direction of the search is strengthened and the quality of result is improved. Through the path planning test considering the constraints of threats and turning radius, test results show that CACA can effectively avoid falling into local optimum, and get better penetration paths that meet the restraint conditions of threats and turning radius.\",\"PeriodicalId\":205396,\"journal\":{\"name\":\"2015 International Conference on Computer Science and Mechanical Automation (CSMA)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Computer Science and Mechanical Automation (CSMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSMA.2015.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computer Science and Mechanical Automation (CSMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSMA.2015.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

针对蚁群算法在路径规划过程中收敛速度慢、易陷入局部极值的问题,提出了一种基于混沌蚁群算法的路径规划新方法。通过在标准蚁群算法中加入混沌干扰因子,有效克服了蚁群算法陷入局部最优的缺陷,提高了蚁群算法的搜索效率。通过在蚁群算法中加入目标引导因子,有效地避免了蚁群迁移过程中存在的方向模糊,增强了蚁群搜索的方向性,提高了搜索结果的质量。通过考虑威胁和转弯半径约束的路径规划试验,试验结果表明,CACA能有效避免陷入局部最优,得到满足威胁和转弯半径约束条件的较优突防路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
UAV Path Planning Based on Chaos Ant Colony Algorithm
Aiming at the problems that the low convergent rate and easily failing into local extremum of the ant colony algorithm (ACA) in the process of path planning, a new method based on the chaos ant colony algorithm (CACA) is proposed. By adding the chaos disturbance factor into standard ACA, the ACA defects of fall into local optimum is effectively overcome and the searching efficiency is improved. By adding target guiding factor into ACA, the direction fuzzy exists in the ant's transfer is effectively avoided, the direction of the search is strengthened and the quality of result is improved. Through the path planning test considering the constraints of threats and turning radius, test results show that CACA can effectively avoid falling into local optimum, and get better penetration paths that meet the restraint conditions of threats and turning radius.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on Control Strategy of Two-Wheeled Self-Balancing Robot Research of Crane Scheduling Based on Birth and Death Chain in the Production Shop Field Improving Steganalysis by Fusing SVM Classifiers for JPEG Images Intelligent Medicine Box Monitoring and Management System An Efficient Self-Healing Group Key Management with Lower Storage for Wireless Sensor Network
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1