{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T18:09:04Z","timestamp":1778782144226,"version":"3.51.4"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Hebei Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["F2024203038"],"award-info":[{"award-number":["F2024203038"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62573375"],"award-info":[{"award-number":["62573375"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.engappai.2026.114636","type":"journal-article","created":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T15:45:04Z","timestamp":1774885504000},"page":"114636","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A bidirectional rapidly-exploring random tree algorithm guided by key nodes on the obstacle bounding rectangles"],"prefix":"10.1016","volume":"175","author":[{"given":"Haiyang","family":"Jiang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8363-8207","authenticated-orcid":false,"given":"Yiming","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Dongliang","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Le","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Shenao","family":"Cen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"22","key":"10.1016\/j.engappai.2026.114636_b1","doi-asserted-by":"crossref","DOI":"10.3390\/s24227292","article-title":"Collision avoidance path planning for automated vehicles using prediction information and artificial potential field","volume":"24","author":"Ahn","year":"2024","journal-title":"Sensors"},{"issue":"23","key":"10.1016\/j.engappai.2026.114636_b2","doi-asserted-by":"crossref","DOI":"10.3390\/app122312033","article-title":"RJ-RRT: Improved RRT for path planning in narrow passages","volume":"12","author":"Chai","year":"2022","journal-title":"Appl. Sci."},{"key":"10.1016\/j.engappai.2026.114636_b3","article-title":"An improved RRT-Connect path planning algorithm of robotic arm for automatic sampling of exhaust emission detection in industry 4.0","volume":"33","author":"Cheng","year":"2023","journal-title":"J. Ind. Inf. Integr."},{"key":"10.1016\/j.engappai.2026.114636_b4","series-title":"Proceedings of the 1995 Symposium on Interactive 3D Graphics","first-page":"189","article-title":"I-COLLIDE: An interactive and exact collision detection system for large-scale environments","author":"Cohen","year":"1995"},{"key":"10.1016\/j.engappai.2026.114636_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108246","article-title":"More quickly-RRT*: Improved quick rapidly-exploring random tree star algorithm based on optimized sampling point with better initial solution and convergence rate","volume":"133","author":"Cui","year":"2024","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.114636_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.105182","article-title":"UAV trajectory planning in cluttered environments based on PF-RRT* algorithm with goal-biased strategy","volume":"114","author":"Fan","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.114636_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123571","article-title":"DBVS-APF-RRT*: A global path planning algorithm with ultra-high speed generation of initial paths and high optimal path quality","volume":"249","author":"Feng","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.engappai.2026.114636_b8","series-title":"2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems","first-page":"2997","article-title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic","author":"Gammell","year":"2014"},{"key":"10.1016\/j.engappai.2026.114636_b9","series-title":"2015 IEEE International Conference on Robotics and Automation","first-page":"3067","article-title":"Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs","author":"Gammell","year":"2015"},{"key":"10.1016\/j.engappai.2026.114636_b10","series-title":"2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems","first-page":"4478","article-title":"Homology-class guided rapidly-exploring random tree for belief space planning","author":"Hao","year":"2022"},{"key":"10.1016\/j.engappai.2026.114636_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108776","article-title":"An adaptive bidirectional quick optimal rapidly-exploring random tree algorithm for path planning","volume":"135","author":"Huang","year":"2024","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.114636_b12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.032","article-title":"Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rate","volume":"123","author":"Jeong","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.engappai.2026.114636_b13","series-title":"2011 IEEE International Conference on Robotics and Automation","first-page":"1478","article-title":"Anytime motion planning using the RRT*","author":"Karaman","year":"2011"},{"issue":"4","key":"10.1016\/j.engappai.2026.114636_b14","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","volume":"12","author":"Kavraki","year":"1996","journal-title":"IEEE Trans. Robot. Autom."},{"key":"10.1016\/j.engappai.2026.114636_b15","series-title":"Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)","first-page":"995","article-title":"RRT-connect: An efficient approach to single-query path planning","volume":"vol. 2","author":"Kuffner","year":"2000"},{"key":"10.1016\/j.engappai.2026.114636_b16","series-title":"2019 International Conference on Robotics and Automation","first-page":"5537","article-title":"Balancing global exploration and local-connectivity exploitation with rapidly-exploring random disjointed-trees","author":"Lai","year":"2019"},{"key":"10.1016\/j.engappai.2026.114636_b17","article-title":"Rapidly-exploring random trees: a new tool for path planning","author":"LaValle","year":"1998","journal-title":"Annu. Res. Rep."},{"key":"10.1016\/j.engappai.2026.114636_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111718","article-title":"Effective anti-submarine decision support system based on heuristic rank-based dijkstra and adaptive threshold partitioning mechanism","volume":"161","author":"Li","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.engappai.2026.114636_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115457","article-title":"F-RRT*: An improved path planning algorithm with improved initial solution and convergence rate","volume":"184","author":"Liao","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.engappai.2026.114636_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120254","article-title":"Path planning techniques for mobile robots: Review and prospect","volume":"227","author":"Liu","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"10","key":"10.1016\/j.engappai.2026.114636_b21","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-P\u00e9rez","year":"1979","journal-title":"Commun. ACM"},{"issue":"6","key":"10.1016\/j.engappai.2026.114636_b22","doi-asserted-by":"crossref","first-page":"7475","DOI":"10.1007\/s40747-023-01131-2","article-title":"Path planning and collision avoidance based on the RRT*FN framework for a robotic manipulator in various scenarios","volume":"9","author":"Qi","year":"2023","journal-title":"Complex & Intell. Syst."},{"issue":"4","key":"10.1016\/j.engappai.2026.114636_b23","doi-asserted-by":"crossref","DOI":"10.3390\/jmse11040761","article-title":"Hybrid path planning using a bionic-inspired optimization algorithm for autonomous underwater vehicles","volume":"11","author":"Sahoo","year":"2023","journal-title":"J. Mar. Sci. Eng."},{"issue":"1","key":"10.1016\/j.engappai.2026.114636_b24","doi-asserted-by":"crossref","DOI":"10.3390\/drones9010039","article-title":"Optimized model predictive control-based path planning for multiple wheeled mobile robots in uncertain environments","volume":"9","author":"She","year":"2025","journal-title":"Drones"},{"key":"10.1016\/j.engappai.2026.114636_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.110393","article-title":"Bidirectional rapidly exploring random tree path planning algorithm based on adaptive strategies and artificial potential fields","volume":"148","author":"Sheng","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.114636_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.robot.2023.104570","article-title":"Improved RRT global path planning algorithm based on bridge test","volume":"171","author":"Tu","year":"2024","journal-title":"Robot. Auton. Syst."},{"issue":"12","key":"10.1016\/j.engappai.2026.114636_b27","doi-asserted-by":"crossref","first-page":"11258","DOI":"10.1109\/LRA.2024.3484131","article-title":"Efficient planar fabric repositioning: Deformation-aware RRT* for non-prehensile fabric manipulation","volume":"9","author":"Wang","year":"2024","journal-title":"IEEE Robotics Autom. Lett."},{"issue":"C","key":"10.1016\/j.engappai.2026.114636_b28","article-title":"Application of ant colony optimization algorithm based on farthest point optimization and multi-objective strategy in robot path planning","volume":"167","author":"Wu","year":"2024","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.engappai.2026.114636_b29","doi-asserted-by":"crossref","DOI":"10.3390\/jmse13010184","article-title":"Hybrid probabilistic road map path planning for maritime autonomous surface ships based on historical AIS information and improved DP compression","volume":"13","author":"Wu","year":"2025","journal-title":"J. Mar. Sci. Eng."},{"key":"10.1016\/j.engappai.2026.114636_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.129118","article-title":"Classified-RRT*: Node classification RRT*-based algorithm with improved solution performance and convergence rate","volume":"296","author":"Xiong","year":"2026","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.engappai.2026.114636_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.110645","article-title":"Research on multi-objective point path planning for mobile inspection robot based on multi-informed-rapidly exploring random tree*","volume":"151","author":"Yang","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.114636_b32","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.aej.2023.12.044","article-title":"Intelligent path planning by an improved RRT algorithm with dual grid map","volume":"88","author":"Zhang","year":"2024","journal-title":"Alex. Eng. J."},{"issue":"24","key":"10.1016\/j.engappai.2026.114636_b33","doi-asserted-by":"crossref","DOI":"10.3390\/electronics13244963","article-title":"The optimization and application research of the RRT-APF-based path planning algorithm","volume":"13","author":"Zhang","year":"2024","journal-title":"Electronics"},{"issue":"17","key":"10.1016\/j.engappai.2026.114636_b34","doi-asserted-by":"crossref","DOI":"10.3390\/s24175643","article-title":"A study of the improved a* algorithm incorporating road factors for path planning in off-road emergency rescue scenarios","volume":"24","author":"Zhao","year":"2024","journal-title":"Sensors"}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626009188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626009188?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T17:17:11Z","timestamp":1778779031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197626009188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":34,"alternative-id":["S0952197626009188"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2026.114636","relation":{},"ISSN":["0952-1976"],"issn-type":[{"value":"0952-1976","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A bidirectional rapidly-exploring random tree algorithm guided by key nodes on the obstacle bounding rectangles","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2026.114636","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"114636"}}