A Path Planning for One UAV Based on Geometric Algorithm

Haochen Li, Sentang Wu, Pengzhi Xie, Zekui Qin, Baochang Zhang
{"title":"A Path Planning for One UAV Based on Geometric Algorithm","authors":"Haochen Li, Sentang Wu, Pengzhi Xie, Zekui Qin, Baochang Zhang","doi":"10.1109/GNCC42960.2018.9019122","DOIUrl":null,"url":null,"abstract":"In this paper, a new learning algorithm named geometric learning algorithm is proposed to solve the UAV’s track planning problem. Actually, based on the environment modeling, the optimal path planning problem is to find an optimal route. The Geometric learning algorithm is essentially an reinforcement learning algorithm. It can not only fully use the distance information to calculate the track based on the geometric distance information but can also fuse dangerous information in a complex environment, which solves the problem of track planning from a practical and theoretical point of view. Based on the two-dimensional successful planning of a single drone, the algorithm is extended to the path planning and decision making of single drone three-dimensional planning. And from a practical and theoretical point of view, the path planning problem has been well solved.","PeriodicalId":6623,"journal":{"name":"2018 IEEE CSAA Guidance, Navigation and Control Conference (CGNCC)","volume":"6 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE CSAA Guidance, Navigation and Control Conference (CGNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GNCC42960.2018.9019122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, a new learning algorithm named geometric learning algorithm is proposed to solve the UAV’s track planning problem. Actually, based on the environment modeling, the optimal path planning problem is to find an optimal route. The Geometric learning algorithm is essentially an reinforcement learning algorithm. It can not only fully use the distance information to calculate the track based on the geometric distance information but can also fuse dangerous information in a complex environment, which solves the problem of track planning from a practical and theoretical point of view. Based on the two-dimensional successful planning of a single drone, the algorithm is extended to the path planning and decision making of single drone three-dimensional planning. And from a practical and theoretical point of view, the path planning problem has been well solved.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于几何算法的无人机路径规划
针对无人机的航迹规划问题,提出了一种新的学习算法——几何学习算法。实际上,基于环境建模的最优路径规划问题就是寻找最优路径。几何学习算法本质上是一种强化学习算法。它不仅可以充分利用距离信息来计算基于几何距离信息的轨道,而且可以融合复杂环境下的危险信息,从实践和理论的角度解决了轨道规划问题。在单架无人机二维成功规划的基础上,将该算法扩展到单架无人机三维规划的路径规划和决策。从实践和理论的角度来看,很好地解决了路径规划问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive Sliding-Mode Disturbance Observer-Based Nonlinear Control for Unmanned Dual-Arm Aerial Manipulator Subject to State Constraints A Cloud Detection Method for Landsat 8 Satellite Remote Sensing Images Based on Improved CDNet Model Time-coordinated path following for multiple agile fixed-wing UAVs with end-roll expectations A Novel Model Calibration Method for Active Magnetic Bearing Based on Deep Reinforcement Learning Wind and Actuator Fault Estimation for a Quadrotor UAV Based on Two-Stage Particle Filter
×
引用
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