• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种在复杂环境中进行无人机路径规划的新方法。

A new method for unmanned aerial vehicle path planning in complex environments.

作者信息

He Yong, Hou Ticheng, Wang Mingran

机构信息

School of Electrical and Information Engineering, Changsha University of Science and Technology, Changsha, 410114, China.

出版信息

Sci Rep. 2024 Apr 22;14(1):9257. doi: 10.1038/s41598-024-60051-4.

DOI:10.1038/s41598-024-60051-4
PMID:38649448
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11582677/
Abstract

To solve the problems of UAV path planning, such as low search efficiency, uneven path, and inability to adapt to unknown environments, this paper proposes A double-layer optimization A* and dynamic window method for UAV path planning. Firstly, the neighboring node clip-off rule is defined to optimize the node expansion mode of the A* algorithm, and the obstacle coverage model is designed to dynamically adjust the heurizing function of the A* algorithm to improve the path search efficiency. Then, the Bresenham algorithm is adopted for collision detection and critical path nodes are extracted to significantly reduce the number of path turning points. Secondly, a new tracking index is proposed to optimize the evaluation function of the dynamic window method to make the local path fit the global path further. By detecting the dangerous distance, the dynamic adaptive method of evaluation function weight is designed to improve the fixed weight of the dynamic window method. Finally, the key turning point of optimizing the A* algorithm is taken as the temporary target point to improve the DWA algorithm, and the local part follows the global part, and the fusion of the two algorithms is realized. Simulation results show that the proposed method can significantly improve the efficiency and smoothness of mobile robot path planning, enhance the real-time obstacle avoidance and adaptive ability of unknown environments, and better meet the requirements of complex planning tasks.

摘要

为解决无人机路径规划中存在的搜索效率低、路径不平坦以及无法适应未知环境等问题,本文提出一种用于无人机路径规划的双层优化A算法与动态窗口方法。首先,定义邻域节点裁剪规则以优化A算法的节点扩展方式,设计障碍物覆盖模型以动态调整A算法的启发函数,从而提高路径搜索效率。然后,采用布雷森汉姆算法进行碰撞检测并提取关键路径节点,显著减少路径转折点数量。其次,提出一种新的跟踪指标以优化动态窗口方法的评估函数,使局部路径更贴合全局路径。通过检测危险距离,设计评估函数权重的动态自适应方法,改进动态窗口方法的固定权重。最后,将优化A算法的关键转折点作为临时目标点来改进DWA算法,使局部跟随全局,实现两种算法的融合法的融合。仿真结果表明,所提方法能显著提高移动机器人路径规划的效率和平滑性,增强未知环境下的实时避障与自适应能力,更好地满足复杂规划任务的要求。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/bdeee39d0696/41598_2024_60051_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/c58863bf9659/41598_2024_60051_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/1ca1f1f6548d/41598_2024_60051_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/c52724f5999a/41598_2024_60051_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/43fca3f92d44/41598_2024_60051_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/64f3c83e0584/41598_2024_60051_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/b55f2bf174d1/41598_2024_60051_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/6d0d7f00f604/41598_2024_60051_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/4ffafa76e8ee/41598_2024_60051_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/bdeee39d0696/41598_2024_60051_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/c58863bf9659/41598_2024_60051_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/1ca1f1f6548d/41598_2024_60051_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/c52724f5999a/41598_2024_60051_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/43fca3f92d44/41598_2024_60051_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/64f3c83e0584/41598_2024_60051_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/b55f2bf174d1/41598_2024_60051_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/6d0d7f00f604/41598_2024_60051_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/4ffafa76e8ee/41598_2024_60051_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f37/11582677/bdeee39d0696/41598_2024_60051_Fig9_HTML.jpg

相似文献

1
A new method for unmanned aerial vehicle path planning in complex environments.一种在复杂环境中进行无人机路径规划的新方法。
Sci Rep. 2024 Apr 22;14(1):9257. doi: 10.1038/s41598-024-60051-4.
2
Global Dynamic Path Planning of AGV Based on Fusion of Improved A* Algorithm and Dynamic Window Method.基于改进A*算法与动态窗口法融合的AGV全局动态路径规划
Sensors (Basel). 2024 Mar 21;24(6):2011. doi: 10.3390/s24062011.
3
Robot obstacle avoidance optimization by A* and DWA fusion algorithm.基于 A*与 DWA 融合算法的机器人避障优化。
PLoS One. 2024 Apr 29;19(4):e0302026. doi: 10.1371/journal.pone.0302026. eCollection 2024.
4
Dynamic Path Planning of AGV Based on Kinematical Constraint A* Algorithm and Following DWA Fusion Algorithms.基于运动学约束 A*算法和跟随 DWA 融合算法的 AGV 动态路径规划。
Sensors (Basel). 2023 Apr 19;23(8):4102. doi: 10.3390/s23084102.
5
Path planning and collision avoidance methods for distributed multi-robot systems in complex dynamic environments.复杂动态环境下分布式多机器人系统的路径规划与避碰方法
Math Biosci Eng. 2023 Jan;20(1):145-178. doi: 10.3934/mbe.2023008. Epub 2022 Sep 30.
6
Multi-UAV Path Planning Algorithm Based on BINN-HHO.基于 BINN-HHO 的多无人机路径规划算法。
Sensors (Basel). 2022 Dec 13;22(24):9786. doi: 10.3390/s22249786.
7
Dynamic Path Planning of Mobile Robot Based on Improved Sparrow Search Algorithm.基于改进麻雀搜索算法的移动机器人动态路径规划
Biomimetics (Basel). 2023 Apr 27;8(2):182. doi: 10.3390/biomimetics8020182.
8
Path Planning of an Unmanned Aerial Vehicle Based on a Multi-Strategy Improved Pelican Optimization Algorithm.基于多策略改进鹈鹕优化算法的无人机路径规划
Biomimetics (Basel). 2024 Oct 21;9(10):647. doi: 10.3390/biomimetics9100647.
9
Path planning for mobile robots in complex environments based on improved ant colony algorithm.基于改进蚁群算法的复杂环境下移动机器人路径规划
Math Biosci Eng. 2023 Jul 27;20(9):15568-15602. doi: 10.3934/mbe.2023695.
10
Research on Path Planning Algorithm of Driverless Ferry Vehicles Combining Improved A* and DWA.结合改进A*算法与动态窗口算法的无人驾驶渡船路径规划算法研究
Sensors (Basel). 2024 Jun 21;24(13):4041. doi: 10.3390/s24134041.

引用本文的文献

1
Three-Dimensional Path Planning for UAV Based on Multi-Strategy Dream Optimization Algorithm.基于多策略梦优化算法的无人机三维路径规划
Biomimetics (Basel). 2025 Aug 21;10(8):551. doi: 10.3390/biomimetics10080551.
2
Emergency evacuation paths for tank farm fires based on bi-objective dynamic planning.基于双目标动态规划的罐区火灾应急疏散路径
Sci Rep. 2025 Mar 14;15(1):8887. doi: 10.1038/s41598-025-93567-4.
3
Research on autonomous navigation of mobile robots based on IA-DWA algorithm.基于IA-DWA算法的移动机器人自主导航研究
Sci Rep. 2025 Jan 15;15(1):2099. doi: 10.1038/s41598-024-84858-3.
4
Ship path planning based on improved multi-scale A* algorithm of collision risk function.基于改进的碰撞风险函数多尺度A*算法的船舶路径规划
Sci Rep. 2024 Dec 6;14(1):30418. doi: 10.1038/s41598-024-80712-8.
5
An integrated framework for UAV-based precision plant protection in complex terrain: the ACHAGA solution for multi-tea fields.复杂地形下基于无人机的精准植物保护集成框架:针对多茶园的ACHAGA解决方案
Front Plant Sci. 2024 Sep 26;15:1440234. doi: 10.3389/fpls.2024.1440234. eCollection 2024.