{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,19]],"date-time":"2026-10-19T16:54:59Z","timestamp":1792428899010,"version":"4.5.0"},"reference-count":28,"publisher":"Wiley","issue":"9","license":[{"start":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:00:00Z","timestamp":1777334400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:00:00Z","timestamp":1777334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62373132"],"award-info":[{"award-number":["62373132"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["F2025201074"],"award-info":[{"award-number":["F2025201074"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>In this paper, a hierarchical planning algorithm for complex urban environment is proposed, which combines the DAB\u2010RRT* algorithm with the dynamic window algorithm to better guide and optimize the global path. At the global level, adopt multi\u2010modal optimization strategy to improve the planning efficiency and dynamic obstacle avoidance ability: connecting the starting point and the target by biased random sampling, adjusting the sampling probability according to the obstacle density, and introducing dynamic target deviation and reverse deviation strategies to guide the efficient expansion of the bidirectional tree structure. In the process of expansion, the methods of dynamic direct connection, candidate node rotation and artificial potential field are combined to realize the adaptive adjustment of avoiding obstacles and step size. The post\u2010processing of the path adopts deleting redundant nodes and B\u2010spline smoothing to make the path smoother. At the level of local action planning, we put forward the mechanism of \u201cglobal\u2013local collaborative dynamic guidance domain,\u201d which turns a fixed global path into a flexible space area that can be dynamically adjusted, and its constraint range will change in real time with the complexity of the environment, and relax the restrictions in crowded areas and keep the route consistent in open areas through two\u2010way feedback. At the same time, an adaptive target attraction strategy is introduced to balance the needs of approaching the target and local obstacle avoidance based on the distance gradient. In the evaluation function of the local planner, the guide domain fitting term is added, and the trajectory conforming to the global reference path is selected first, so that the coordination of local behavior and global path can be realized on the premise of ensuring the overall task goal.<\/jats:p>","DOI":"10.1002\/cpe.70727","type":"journal-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T04:02:48Z","timestamp":1777435368000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Path Planning Algorithm for Urban UAV Based on Improved Bidirectional RRT* and DWA"],"prefix":"10.1002","volume":"38","author":[{"given":"Zhen","family":"Zhou","sequence":"first","affiliation":[{"name":"Key Laboratory of Digital Medical Engineering of Hebei Province, College of Electronic and Information Engineering Hebei University  Baoding Hebei Province China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5484-081X","authenticated-orcid":false,"given":"Zhuo","family":"Chang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Digital Medical Engineering of Hebei Province, College of Electronic and Information Engineering Hebei University  Baoding Hebei Province China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhaohan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Digital Medical Engineering of Hebei Province, College of Electronic and Information Engineering Hebei University  Baoding Hebei Province China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuo","family":"Li","sequence":"additional","affiliation":[{"name":"Key Laboratory of Digital Medical Engineering of Hebei Province, College of Electronic and Information Engineering Hebei University  Baoding Hebei Province China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2026,4,28]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14705-5_1"},{"key":"e_1_2_10_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/70.660866"},{"key":"e_1_2_10_4_1","first-page":"156","volume-title":"Computing the Shortest Path: A Search Meets Graph Theory","author":"Goldberg A. V.","year":"2005"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2004.07.010"},{"key":"e_1_2_10_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3139534"},{"key":"e_1_2_10_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2927869"},{"key":"e_1_2_10_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s44443-025-00415-6"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004252"},{"issue":"10","key":"e_1_2_10_10_1","first-page":"20","article-title":"A Comparison of RRT, RRT* and RRT*\u2010Smart Path Planning Algorithms","volume":"16","author":"Noreen I.","year":"2016","journal-title":"International Journal of Computer Science and Network Security (IJCSNS)"},{"key":"e_1_2_10_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"e_1_2_10_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106875"},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/tee.23502"},{"key":"e_1_2_10_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3123622"},{"key":"e_1_2_10_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-019-09879-8"},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/tee.23898"},{"key":"e_1_2_10_17_1","article-title":"UAV Trajectory Planning Based on Bi\u2010Directional APF\u2010RRT* Algorithm With Goal\u2010Biased","volume":"213","author":"Jiaming F.","year":"2023","journal-title":"Expert Systems with Applications"},{"key":"e_1_2_10_18_1","doi-asserted-by":"publisher","DOI":"10.3390\/drones8120760"},{"key":"e_1_2_10_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2019.05.003"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3220703"},{"key":"e_1_2_10_21_1","doi-asserted-by":"publisher","DOI":"10.1177\/1687814020979430"},{"key":"e_1_2_10_22_1","doi-asserted-by":"publisher","DOI":"10.3390\/s24134041"},{"key":"e_1_2_10_23_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"e_1_2_10_24_1","unstructured":"S.LaValle \u201cRapidly\u2010Exploring Random Trees: A New Tool for Path Planning \u201d(1998) Research Report 9811."},{"key":"e_1_2_10_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2025.110393"},{"key":"e_1_2_10_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC52312.2021.9602069"},{"key":"e_1_2_10_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2023.3269462"},{"key":"e_1_2_10_28_1","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/2565809"},{"key":"e_1_2_10_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/78.193220"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70727","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/cpe.70727","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T06:30:46Z","timestamp":1778913046000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.70727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,28]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["10.1002\/cpe.70727"],"URL":"https:\/\/doi.org\/10.1002\/cpe.70727","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,28]]},"assertion":[{"value":"2025-12-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70727"}}