{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T15:37:32Z","timestamp":1781797052470,"version":"3.54.5"},"reference-count":35,"publisher":"MDPI AG","issue":"17","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The efficiency of the rapidly exploring random tree (RRT) falls short when efficiently guiding targets through constricted-passage environments, presenting issues such as sluggish convergence speed and elevated path costs. To overcome these algorithmic limitations, we propose a narrow-channel path-finding algorithm (named NCB-RRT) based on Bi-RRT with the addition of our proposed research failure rate threshold (RFRT) concept. Firstly, a three-stage search strategy is employed to generate sampling points guided by real-time sampling failure rates. By means of the balance strategy, two randomly growing trees are established to perform searching, which improves the success rate of the algorithm in narrow channel environments, accelerating the convergence speed and reducing the number of iterations required. Secondly, the parent node re-selection and path pruning strategy are integrated. This shortens the path length and greatly reduces the number of redundant nodes and inflection points. Finally, the path is optimized by utilizing segmented quadratic Bezier curves to achieve a smooth trajectory. This research shows that the NCB-RRT algorithm is better able to adapt to the complex narrow channel environment, and the performance is also greatly improved in terms of the path length and the number of inflection points. Compared with the RRT, RRT* and Bi-RRT algorithms, the success rate is increased by 2400%, 1900% and 11.11%, respectively.<\/jats:p>","DOI":"10.3390\/s23177547","type":"journal-article","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T11:45:51Z","timestamp":1693482351000},"page":"7547","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A Novel AGV Path Planning Approach for Narrow Channels Based on the Bi-RRT Algorithm with a Failure Rate Threshold"],"prefix":"10.3390","volume":"23","author":[{"given":"Bin","family":"Wu","sequence":"first","affiliation":[{"name":"College of Mechanical and Electronic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electronic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaonan","family":"Chi","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electronic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Di","family":"Jiang","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electronic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Yi","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electronic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Lu","sequence":"additional","affiliation":[{"name":"College of Mechanical and Electronic Engineering, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cie.2023.109112","article-title":"A* guiding DQN algorithm for automated guided vehicle pathfinding problem of robotic mobile fulfillment systems","volume":"178","author":"Luo","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.ejor.2022.08.047","article-title":"Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses","volume":"307","author":"Xie","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Liang, C., Zhang, Y., and Dong, L. (2022). A Three Stage Optimal Scheduling Algorithm for AGV Route Planning Considering Collision Avoidance under Speed Control Strategy. Mathematics, 11.","DOI":"10.3390\/math11010138"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yang, Y.S., He, S., and Sun, S. (2023). Research on the Cooperative Scheduling of ARMGs and AGVs in a Sea-Rail Automated Container Terminal under the Rail-in-Port Model. J. Mar. Sci. Eng., 11.","DOI":"10.3390\/jmse11030557"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.swevo.2023.101227","article-title":"Invasive weed optimization for multi-AGVs dispatching problem in a matrix manufacturing workshop","volume":"77","author":"Li","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s12555-020-0769-y","article-title":"AGV Motion Balance and Motion Regulation Under Complex Conditions","volume":"20","author":"Quan","year":"2022","journal-title":"Int. J. Control Autom. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.compag.2022.106867","article-title":"Artificial neural network to predict traction performance of autonomous ground vehicle on a sloped soil bin and uncertainty analysis","volume":"196","author":"Badgujar","year":"2022","journal-title":"Comput. Electron. Agric."},{"key":"ref_8","first-page":"12","article-title":"Robotics-based vineyard water potential monitoring at high resolution","volume":"187","author":"Alves","year":"2021","journal-title":"Comput. Electron. Agric."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Yang, Y.S., Sun, S., Zhong, M.S., Feng, J.K., Wen, F.R., and Song, H.T. (2023). A Refined Collaborative Scheduling Method for Multi-Equipment at U-Shaped Automated Container Terminals Based on Rail Crane Process Optimization. J. Mar. Sci. Eng., 11.","DOI":"10.3390\/jmse11030605"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1155\/2022\/3104017","article-title":"Research into the Automatic Guidance System for AGVs Used for Logistics Based on Millimeter Wave Radar Imaging","volume":"2022","author":"Lin","year":"2022","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.jocs.2022.101938","article-title":"An intelligence-based hybrid PSO-SA for mobile robot path planning in warehouse","volume":"67","author":"Lin","year":"2023","journal-title":"J. Comput. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Liu, Y.Y., Yan, S.H., Zhao, Y., Song, C.H., and Li, F. (2022). Improved Dyna-Q: A Reinforcement Learning Method Focused via Heuristic Graph for AGV Path Planning in Dynamic Environments. Drones, 6.","DOI":"10.3390\/drones6110365"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"58332","DOI":"10.1109\/ACCESS.2022.3179111","article-title":"Robust H-infinity Network Observer-Based Attack-Tolerant Path Tracking Control of Autonomous Ground Vehicle","volume":"10","author":"Lee","year":"2022","journal-title":"IEEE Access"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"12567","DOI":"10.1109\/TVT.2021.3123176","article-title":"Nonlinear Model Predictive Tracking Control With C\/GMRES Method for Heavy-Duty AGVs","volume":"70","author":"Liu","year":"2021","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.conengprac.2023.105464","article-title":"Toward distributed control of networked omnidirectional automated ground vehicles in complex environment with delay communication","volume":"134","author":"Peng","year":"2023","journal-title":"Control Eng. Pract."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.jmsy.2023.03.007","article-title":"A novel multi-tasks chain scheduling algorithm based on capacity prediction to solve AGV dispatching problem in an intelligent manufacturing system","volume":"68","author":"Niu","year":"2023","journal-title":"J. Manuf. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_18","first-page":"1208","article-title":"Rapidly-exploring random trees: A new tool for path planning","volume":"87","author":"LaValle","year":"1999","journal-title":"Res. Rep."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","author":"Karaman","year":"2011","journal-title":"Int. J. Robot. Res."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Gammell, J.D., Srinivasa, S.S., Barfoot, T.D., and IEEE (2014, January 14\u201318). Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic. Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Chicago, IL, USA.","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10514-023-10083-y","article-title":"An efficient RRT-based motion planning algorithm for autonomous underwater vehicles under cylindrical sampling constraints","volume":"47","author":"Yu","year":"2023","journal-title":"Auton. Robot."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"5987","DOI":"10.1007\/s12206-017-1143-8","article-title":"Navigation-oriented design for in-pipe robot in recursively divided sampling space with rapidly exploring random tree","volume":"31","author":"An","year":"2017","journal-title":"J. Mech. Sci. Technol."},{"key":"ref_23","unstructured":"Kuffner, J.J., and LaValle, S.M. (2000, January 24\u201328). RRT-connect: An efficient approach to single-query path planning. Proceedings of the 2000 ICRA, Millennium Conference, IEEE International Conference on Robotics and Automation, Symposia Proceedings (Cat. No. 00CH37065), San Francisco, CA, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Klemm, S., Oberl\u00e4nder, J., Hermann, A., Roennau, A., Schamm, T., Zollner, J.M., and Dillmann, R. (2015, January 6\u20139). Rrt-connect: Faster, asymptotically optimal motion planning. Proceedings of the 2015 IEEE International Conference on Robotics and Biomimetics (ROBIO), Zhuhai, China.","DOI":"10.1109\/ROBIO.2015.7419012"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Qureshi, A.H., Mumtaz, S., Iqbal, K.F., Ali, B., Ayaz, Y., Ahmed, F., Muhammad, M.S., Hasan, O., Kim, W.Y., and Ra, M. (2013, January 12\u201314). Adaptive Potential Guided Directional-RRT. Proceedings of the IEEE International Conference on Robotics and Biomimetics (ROBIO), Shenzhen, China.","DOI":"10.1109\/ROBIO.2013.6739744"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Qureshi, A.H., Iqbal, K.F., Qamar, S.M., Islam, F., Ayaz, Y., Muhammad, N., and IEEE (2013, January 4\u20137). Potential Guided Directional-RRT* for Accelerated Motion Planning in Cluttered Environments. Proceedings of the 10th IEEE International Conference on Mechatronics and Automation (ICMA), Takamatsu, Japan.","DOI":"10.1109\/ICMA.2013.6617971"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1007\/s10514-015-9518-0","article-title":"Potential functions based sampling heuristic for optimal path planning","volume":"40","author":"Qureshi","year":"2016","journal-title":"Auton. Robot."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"95046","DOI":"10.1109\/ACCESS.2019.2928846","article-title":"Bidirectional Potential Guided RRT* for Motion Planning","volume":"7","author":"Wang","year":"2019","journal-title":"IEEE Access"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.eswa.2022.119137","article-title":"UAV trajectory planning based on bi-directional APF-RRT* algorithm with goal-biased","volume":"213","author":"Fan","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Chai, Q.S., and Wang, Y.J. (2022). RJ-RRT: Improved RRT for Path Planning in Narrow Passages. Appl. Sci., 12.","DOI":"10.3390\/app122312033"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.jocs.2022.101937","article-title":"An improved RRT* algorithm for robot path planning based on path expansion heuristic sampling","volume":"67","author":"Ding","year":"2023","journal-title":"J. Comput. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Huang, C.M., and Hsu, S.H. (2022). Efficient Path Planning for a Microrobot Passing through Environments with Narrow Passages. Micromachines, 13.","DOI":"10.3390\/mi13111935"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1109\/JAS.2021.1004252","article-title":"An Adaptive Rapidly-Exploring Random Tree","volume":"9","author":"Li","year":"2022","journal-title":"IEEE-CAA J. Autom. Sin."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.jocs.2021.101540","article-title":"A new approach based on Bezier curves to solve path planning problems for mobile robots","volume":"58","author":"Durakli","year":"2022","journal-title":"J. Comput. Sci."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Kang, J.G., Lim, D.W., Choi, Y.S., Jang, W.J., and Jung, J.W. (2021). Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning. Sensors, 21.","DOI":"10.3390\/s21020333"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/17\/7547\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:43:29Z","timestamp":1760129009000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/17\/7547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":35,"journal-issue":{"issue":"17","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["s23177547"],"URL":"https:\/\/doi.org\/10.3390\/s23177547","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,30]]}}}