基于遗传算法的四旋翼无人机路径规划

Reagan L. Galvez, E. Dadios, A. Bandala
{"title":"基于遗传算法的四旋翼无人机路径规划","authors":"Reagan L. Galvez, E. Dadios, A. Bandala","doi":"10.1109/HNICEM.2014.7016260","DOIUrl":null,"url":null,"abstract":"Path planning in quadrotor-typed UAV is essential in navigating from initial to destination point. This will minimize the power consumption of the vehicle which is important to avoid wasted energy in a given amount of time. This paper will use Genetic Algorithm (GA) to determine the shortest path that the quadrotor must travel given one target point to save energy and time without hitting an obstacle. The obstacle is assumed to be any point within the boundary. This algorithm is effective in searching solutions in a given sample space or population. If you know the possible solutions of the problem, you can evaluate it based on its fitness until the fittest individual arrives.","PeriodicalId":309548,"journal":{"name":"2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Path planning for quadrotor UAV using genetic algorithm\",\"authors\":\"Reagan L. Galvez, E. Dadios, A. Bandala\",\"doi\":\"10.1109/HNICEM.2014.7016260\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Path planning in quadrotor-typed UAV is essential in navigating from initial to destination point. This will minimize the power consumption of the vehicle which is important to avoid wasted energy in a given amount of time. This paper will use Genetic Algorithm (GA) to determine the shortest path that the quadrotor must travel given one target point to save energy and time without hitting an obstacle. The obstacle is assumed to be any point within the boundary. This algorithm is effective in searching solutions in a given sample space or population. If you know the possible solutions of the problem, you can evaluate it based on its fitness until the fittest individual arrives.\",\"PeriodicalId\":309548,\"journal\":{\"name\":\"2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HNICEM.2014.7016260\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HNICEM.2014.7016260","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

四旋翼无人机的路径规划是其从初始点到目的地导航的关键。这将最大限度地减少车辆的电力消耗,这对于避免在给定的时间内浪费能源很重要。本文将使用遗传算法(GA)来确定四旋翼飞行器在给定一个目标点时必须行进的最短路径,以节省能量和时间而不碰到障碍物。假定障碍物是边界内的任何一点。该算法在给定的样本空间或总体中搜索解是有效的。如果你知道问题的可能解决方案,你可以根据它的适合度来评估它,直到最适合的个体出现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Path planning for quadrotor UAV using genetic algorithm
Path planning in quadrotor-typed UAV is essential in navigating from initial to destination point. This will minimize the power consumption of the vehicle which is important to avoid wasted energy in a given amount of time. This paper will use Genetic Algorithm (GA) to determine the shortest path that the quadrotor must travel given one target point to save energy and time without hitting an obstacle. The obstacle is assumed to be any point within the boundary. This algorithm is effective in searching solutions in a given sample space or population. If you know the possible solutions of the problem, you can evaluate it based on its fitness until the fittest individual arrives.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信