A DDQN-Based Path Planning Method for Multi-UAVs in a 3D Indoor Environment

Yuchen Ma, Yancai Xu
{"title":"A DDQN-Based Path Planning Method for Multi-UAVs in a 3D Indoor Environment","authors":"Yuchen Ma, Yancai Xu","doi":"10.1109/ICCR55715.2022.10053884","DOIUrl":null,"url":null,"abstract":"Path planning is one of the most essential for unmanned aerial vehicle (UAV) autonomous navigation. The deep Q-network (DQN) method is widely used for solving the path planning problem, but most researchers simplify the scene into the 2D environment with a single UAV and ignore the fact that there are always multi-UAVs working in 3D environments. Therefore, a double deep Q-network (DDQN) based global path planning algorithm for multi-UAVs in a 3D indoor environment is proposed in this paper. Firstly, the double deep Q-network was designed to approximate the action of multi-UAVs. The 3D space is discretized into grids while each gird is a basic unit of path planning and the whole grid map is the input for the neural network. Then, a continual reward function generated by building an artificial potential field was determined to replace the traditional sparse reward function. Moreover, the action selection strategy is used to determine the current optimal action so that multi-UAVs are able to find the path to reach target points in a simulated indoor environment and avoid crashing into each other and obstacles at the same time. Finally, the experiment verifies the effectiveness of the proposed method. The simulation result demonstrates that the agents can effectively avoid local optimal solution and correctly predict the global optimal action.","PeriodicalId":441511,"journal":{"name":"2022 4th International Conference on Control and Robotics (ICCR)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Control and Robotics (ICCR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCR55715.2022.10053884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Path planning is one of the most essential for unmanned aerial vehicle (UAV) autonomous navigation. The deep Q-network (DQN) method is widely used for solving the path planning problem, but most researchers simplify the scene into the 2D environment with a single UAV and ignore the fact that there are always multi-UAVs working in 3D environments. Therefore, a double deep Q-network (DDQN) based global path planning algorithm for multi-UAVs in a 3D indoor environment is proposed in this paper. Firstly, the double deep Q-network was designed to approximate the action of multi-UAVs. The 3D space is discretized into grids while each gird is a basic unit of path planning and the whole grid map is the input for the neural network. Then, a continual reward function generated by building an artificial potential field was determined to replace the traditional sparse reward function. Moreover, the action selection strategy is used to determine the current optimal action so that multi-UAVs are able to find the path to reach target points in a simulated indoor environment and avoid crashing into each other and obstacles at the same time. Finally, the experiment verifies the effectiveness of the proposed method. The simulation result demonstrates that the agents can effectively avoid local optimal solution and correctly predict the global optimal action.
基于ddqn的多无人机三维室内路径规划方法
路径规划是实现无人机自主导航的关键问题之一。深度q -网络(deep Q-network, DQN)方法被广泛用于解决路径规划问题,但大多数研究人员将场景简化为单个无人机的二维环境,而忽略了三维环境中总是有多架无人机工作的事实。为此,本文提出了一种基于双深度q网络(DDQN)的三维室内多无人机全局路径规划算法。首先,设计了双深度q网络来逼近多无人机的动作;将三维空间离散成网格,每个网格作为路径规划的基本单元,整个网格图作为神经网络的输入。然后,通过构建人工势场生成连续奖励函数来代替传统的稀疏奖励函数。利用动作选择策略确定当前最优动作,使多架无人机在模拟室内环境中找到到达目标点的路径,同时避免相互碰撞和障碍物碰撞。最后,通过实验验证了所提方法的有效性。仿真结果表明,该智能体能够有效避免局部最优解,并正确预测全局最优行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信