基于遗传算法的无人机三维运动规划

Maverick Rivera, J. R. D. del Rosario, A. Bandala
{"title":"基于遗传算法的无人机三维运动规划","authors":"Maverick Rivera, J. R. D. del Rosario, A. Bandala","doi":"10.1109/HNICEM48295.2019.9072878","DOIUrl":null,"url":null,"abstract":"Development of Unmanned Aerial Vehicle (UAV) is now a popular field in research. In most of its applications, a pathfinding algorithm is needed in order to find the optimal path and avoid obstacles. In this paper, a genetic algorithm is implemented in order to determine the optimal path for a UAV that will avoid obstacles along the way. The genetic algorithm implemented uses variable-length chromosomes to solve the problem. The results of the simulation of the system yield an average of 29 generations and avoided 53, 500 collisions to find the best path.","PeriodicalId":6733,"journal":{"name":"2019 IEEE 11th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment, and Management ( HNICEM )","volume":"11 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Genetic Algorithm Based 3D Motion Planning for Unmanned Aerial Vehicle\",\"authors\":\"Maverick Rivera, J. R. D. del Rosario, A. Bandala\",\"doi\":\"10.1109/HNICEM48295.2019.9072878\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Development of Unmanned Aerial Vehicle (UAV) is now a popular field in research. In most of its applications, a pathfinding algorithm is needed in order to find the optimal path and avoid obstacles. In this paper, a genetic algorithm is implemented in order to determine the optimal path for a UAV that will avoid obstacles along the way. The genetic algorithm implemented uses variable-length chromosomes to solve the problem. The results of the simulation of the system yield an average of 29 generations and avoided 53, 500 collisions to find the best path.\",\"PeriodicalId\":6733,\"journal\":{\"name\":\"2019 IEEE 11th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment, and Management ( HNICEM )\",\"volume\":\"11 1\",\"pages\":\"1-4\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 11th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment, and Management ( HNICEM )\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HNICEM48295.2019.9072878\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 11th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment, and Management ( HNICEM )","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HNICEM48295.2019.9072878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

无人驾驶飞行器(UAV)的发展是目前研究的一个热门领域。在大多数应用中,为了找到最优路径并避开障碍物,都需要寻路算法。在本文中,为了确定无人机避开沿途障碍物的最优路径,实现了一种遗传算法。所实现的遗传算法采用变长染色体来解决这一问题。仿真结果表明,该系统平均进行了29代迭代,避免了53500次碰撞,从而找到了最佳路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Genetic Algorithm Based 3D Motion Planning for Unmanned Aerial Vehicle
Development of Unmanned Aerial Vehicle (UAV) is now a popular field in research. In most of its applications, a pathfinding algorithm is needed in order to find the optimal path and avoid obstacles. In this paper, a genetic algorithm is implemented in order to determine the optimal path for a UAV that will avoid obstacles along the way. The genetic algorithm implemented uses variable-length chromosomes to solve the problem. The results of the simulation of the system yield an average of 29 generations and avoided 53, 500 collisions to find the best path.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信