一种基于改进人工势场的航迹规划方法

Fanrong Sun, Songchen Han
{"title":"一种基于改进人工势场的航迹规划方法","authors":"Fanrong Sun, Songchen Han","doi":"10.1109/CITS.2016.7546401","DOIUrl":null,"url":null,"abstract":"With the increasing number of long range free flight, the flight path planning becomes an important issue. In this paper, the expected path is defined as linear potential field. The trajectory equation to determine maximum likelihood flight heading is established by calculating aircraft potential field gravitation of the trajectory at any space position. The air speed degradation model is built by the analysis of the upper air wind influence, and the distance cost can be defined at any position by taking flight performance constraints into consideration. Finally, an optimization model of flight path is established, which selects distance cost and simplicity as the optimization targets, and an ant colony algorithm is proposed. Many groups of flight paths from the Pareto ant colony algorithm are conducive to collaborative decision scientifically and rationally. Experimental results verify the validity of the method.","PeriodicalId":340958,"journal":{"name":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A flight path planning method based on improved artificial potential field\",\"authors\":\"Fanrong Sun, Songchen Han\",\"doi\":\"10.1109/CITS.2016.7546401\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increasing number of long range free flight, the flight path planning becomes an important issue. In this paper, the expected path is defined as linear potential field. The trajectory equation to determine maximum likelihood flight heading is established by calculating aircraft potential field gravitation of the trajectory at any space position. The air speed degradation model is built by the analysis of the upper air wind influence, and the distance cost can be defined at any position by taking flight performance constraints into consideration. Finally, an optimization model of flight path is established, which selects distance cost and simplicity as the optimization targets, and an ant colony algorithm is proposed. Many groups of flight paths from the Pareto ant colony algorithm are conducive to collaborative decision scientifically and rationally. Experimental results verify the validity of the method.\",\"PeriodicalId\":340958,\"journal\":{\"name\":\"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CITS.2016.7546401\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Computer, Information and Telecommunication Systems (CITS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITS.2016.7546401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

随着远程自由飞行次数的增加,飞行路径规划成为一个重要问题。本文将期望路径定义为线性势场。通过计算飞行器在任意空间位置的势场引力,建立了确定最大似然飞行航向的弹道方程。通过分析高空风的影响,建立了空速退化模型,考虑飞行性能约束,可以在任意位置定义距离成本。最后,以距离代价和简单性为优化目标,建立了航迹优化模型,并提出了蚁群算法。Pareto蚁群算法的多组飞行路径有利于科学合理地进行协同决策。实验结果验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A flight path planning method based on improved artificial potential field
With the increasing number of long range free flight, the flight path planning becomes an important issue. In this paper, the expected path is defined as linear potential field. The trajectory equation to determine maximum likelihood flight heading is established by calculating aircraft potential field gravitation of the trajectory at any space position. The air speed degradation model is built by the analysis of the upper air wind influence, and the distance cost can be defined at any position by taking flight performance constraints into consideration. Finally, an optimization model of flight path is established, which selects distance cost and simplicity as the optimization targets, and an ant colony algorithm is proposed. Many groups of flight paths from the Pareto ant colony algorithm are conducive to collaborative decision scientifically and rationally. Experimental results verify the validity of the method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Recursive construction of quasi-cyclic cycle LDPC codes based on replacement products Design and realization of IMA/DIMA system management based on avionics switched network Mining co-location patterns with spatial distribution characteristics Multilayer perceptron for modulation recognition cognitive radio system Joint hierarchical modulation and network coding for asymmetric data transmission in wireless cooperative communication
×
引用
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