{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:59:02Z","timestamp":1780444742670,"version":"3.54.1"},"reference-count":35,"publisher":"MDPI AG","issue":"22","license":[{"start":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T00:00:00Z","timestamp":1668902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&amp;D Program of China","award":["2016YFC0803000"],"award-info":[{"award-number":["2016YFC0803000"]}]},{"name":"National Key R&amp;D Program of China","award":["2016YFC0803005"],"award-info":[{"award-number":["2016YFC0803005"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In this paper, we propose a new path planning algorithm based on the probabilistic roadmaps method (PRM), in order to effectively solve the autonomous path planning of mobile robots in complex environments with multiple narrow channels. The improved PRM algorithm mainly improves the density and distribution of sampling points in the narrow channel, through a combination of the learning process of the PRM algorithm and the APF algorithm. We also shortened the required time and path length by optimizing the query process. The first key technology to improve the PRM algorithm involves optimizing the number and distribution of free points and collision-free lines in the free workspace. To ensure full visibility of the narrow channel, we extend the obstacles through the diagonal distance of the mobile robot while ignoring the safety distance. Considering the safety distance during movement, we re-classify the all sampling points obtained by the quasi-random sampling principle into three categories: free points, obstacle points, and adjacent points. Next, we transform obstacle points into the free points of the narrow channel by combining the APF algorithm and the characteristics of the narrow channel, increasing the density of sampling points in the narrow space. Then, we include potential energy judgment into the construction process of collision-free lines shortening the required time and reduce collisions with obstacles. Optimizing the query process of the PRM algorithm is the second key technology. To reduce the required time in the query process, we adapt the bidirectional A* algorithm to query these local paths and obtain an effective path to the target point. We also combine the path pruning technology with the potential energy function to obtain a short path without collisions. Finally, the experimental results demonstrate that the new PRM path planning technology can improve the density of free points in narrow spaces and achieve an optimized, collision-free path in complex environments with multiple narrow channels.<\/jats:p>","DOI":"10.3390\/s22228983","type":"journal-article","created":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T04:39:59Z","timestamp":1669005599000},"page":"8983","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["An Optimized Probabilistic Roadmap Algorithm for Path Planning of Mobile Robots in Complex Environments with Narrow Channels"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2667-1713","authenticated-orcid":false,"given":"Lijun","family":"Qiao","sequence":"first","affiliation":[{"name":"School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2574-4594","authenticated-orcid":false,"given":"Xiao","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5549-8016","authenticated-orcid":false,"given":"Qingsheng","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Mechatronical Engineering, Beijing Institute of Technology, Beijing 100081, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.procs.2018.07.018","article-title":"Methodology for Path Planning and Optimization of Mobile Robots: A Review","volume":"133","author":"Zafar","year":"2018","journal-title":"Procedia Comput. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.dt.2019.04.011","article-title":"A review: On path planning strategies for navigation of mobile robot","volume":"15","author":"Patle","year":"2019","journal-title":"Def. Technol."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.asoc.2019.03.055","article-title":"A knowledge based fuzzy-probabilistic roadmap method for mobile robot navigation","volume":"79","author":"Mohanta","year":"2019","journal-title":"Appl. Soft Comput. J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S0263574712000331","article-title":"Reactive and the shortest path navigation of a wheeled mobile robot in cluttered environments","volume":"31","author":"Savkin","year":"2012","journal-title":"Robotica"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"7426913","DOI":"10.1155\/2016\/7426913","article-title":"Survey of Robot 3D Path Planning Algorithms","volume":"2016","author":"Yang","year":"2016","journal-title":"J. Control Sci. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1017\/S0263574714000289","article-title":"Algorithms for collision-free navigation of mobile robots in complex cluttered environments: A survey","volume":"33","author":"Hoy","year":"2015","journal-title":"Robotica"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.asoc.2017.03.035","article-title":"Mobile robot path planning with surrounding point set and path improvement","volume":"57","author":"Han","year":"2017","journal-title":"Appl. Soft Comput. J."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.robot.2019.02.013","article-title":"Solving the optimal path planning of a mobile robot using improved Q-learning","volume":"115","author":"Low","year":"2019","journal-title":"Robot. Auton. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1320","DOI":"10.1038\/s41598-022-05386-6","article-title":"Path planning of scenic spots based on improved A* algorithm","volume":"12","author":"Wang","year":"2022","journal-title":"Sci. Rep."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.protcy.2016.03.010","article-title":"Time-efficient A* Algorithm for Robot Path Planning","volume":"23","author":"Guruji","year":"2016","journal-title":"Procedia Technol."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.4236\/wjet.2019.71005","article-title":"Interactive Heuristic D* Path Planning Solution Based on PSO for Two-Link Robotic Arm in Dynamic Environment","volume":"7","author":"Raheem","year":"2019","journal-title":"World J. Eng. Technol."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1088\/1755-1315\/108\/5\/052067","article-title":"Path planning for mobile robot using the novel repulsive force algorithm","volume":"108","author":"Sun","year":"2018","journal-title":"IOP Conf. Ser. Earth Environ. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Liu, Z., and Chang, L. (2017, January 28\u201330). A new adaptive artificial potential field and rolling window method for mobile robot path planning. Proceedings of the 29th Chinese Control and Decision Conference, CCDC 2017, Chongqing, China.","DOI":"10.1109\/CCDC.2017.7978472"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.asoc.2015.01.067","article-title":"Mobile robot path planning using artificial bee colony and evolutionary programming","volume":"30","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Santiago, R.M.C., De Ocampo, A.L., Ubando, A.T., Bandala, A.A., and Dadios, E.P. (2017, January 1\u20133). Path planning for mobile robots using genetic algorithm and probabilistic roadmap. Proceedings of the HNICEM 2017\u20149th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management, Manila, Philippines.","DOI":"10.1109\/HNICEM.2017.8269498"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Lv, Q., and Yang, D. (2020, January 12\u201314). Multi-target path planning for mobile robot based on improved PSO algorithm. Proceedings of the 2020 IEEE 5th Information Technology and Mechatronics Engineering Conference, ITOEC 2020, Itoec, Chongqing, China.","DOI":"10.1109\/ITOEC49072.2020.9141588"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"107230","DOI":"10.1016\/j.cie.2021.107230","article-title":"Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm","volume":"156","author":"Miao","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_18","first-page":"19","article-title":"Reinforcement Learning-Based Path Planning Algorithm for Mobile Robots","volume":"5","author":"Liu","year":"2022","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_19","first-page":"5781591","article-title":"Dynamic Path Planning of Unknown Environment Based on Deep Reinforcement Learning","volume":"2018","author":"Lei","year":"2018","journal-title":"J. Robot."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1177\/0278364906067174","article-title":"On the probabilistic foundations of probabilistic roadmap planning","volume":"25","author":"Hsu","year":"2006","journal-title":"Int. J. Robot. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.robot.2018.06.013","article-title":"Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments","volume":"108","author":"Tahir","year":"2018","journal-title":"Robot. Auton. Syst."},{"key":"ref_22","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_23","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/ACCESS.2014.2302442","article-title":"Sampling-based robot motion planning: A review","volume":"2","author":"Elbanhawi","year":"2014","journal-title":"IEEE Access"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/70.660866","article-title":"Analysis of probabilistic roadmaps for path planning","volume":"14","author":"Kavraki","year":"1998","journal-title":"IEEE Trans. Robot. Autom."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.robot.2005.09.026","article-title":"Sampling and node adding in probabilistic roadmap planners","volume":"54","author":"Geraerts","year":"2006","journal-title":"Robot. Auton. Syst."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1016\/j.robot.2007.06.002","article-title":"Reachability-based analysis for Probabilistic Roadmap planners","volume":"55","author":"Geraerts","year":"2007","journal-title":"Robot. Auton. Syst."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Cao, K., Cheng, Q., Gao, S., Chen, Y., and Chen, C. (2019, January 4\u20137). Improved PRM for Path Planning in Narrow Passages. Proceedings of the 2019 IEEE International Conference on Mechatronics and Automation, ICMA 2019, Tianjin, China.","DOI":"10.1109\/ICMA.2019.8816425"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Kannan, A., Gupta, P., Tiwari, R., Prasad, S., Khatri, A., and Kala, R. (2016). Robot motion planning using adaptive hybrid sampling in probabilistic roadmaps. Electronics, 5.","DOI":"10.3390\/electronics5020016"},{"key":"ref_29","unstructured":"Branicky, M.S., LaValle, S.M., Olson, K., and Yang, L. (2001, January 21\u201326). Quasi-randomized path planning. Proceedings of the IEEE International Conference on Robotics and Automation, Seoul, Republic of Korea."},{"key":"ref_30","unstructured":"Shukla, S., Kumar, L., Bera, T., and Dasgupta, R. (2021). A Levy Flight based Narrow Passage Sampling Method for Probabilistic Roadmap Planners. arXiv."},{"key":"ref_31","unstructured":"Boor, V., Overmars, M.H., and van der Stappen, A.F. (1999, January 10\u201315). Gaussian sampling strategy for probabilistic roadmap planners. Proceedings of the IEEE International Conference on Robotics and Automation, Detroit, MI, USA."},{"key":"ref_32","unstructured":"Hsu, D., Jiang, T., Reif, J., and Sun, Z. (2003, January 14\u201319). The bridge test for sampling narrow passages with probabilistic roadmap planners. Proceedings of the IEEE International Conference on Robotics and Automation, Taipei, Taiwan."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TRO.2005.853485","article-title":"Narrow passage sampling for probabilistic roadmap planning","volume":"21","author":"Sun","year":"2005","journal-title":"IEEE Trans. Robot."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3389\/fnbot.2022.910859","article-title":"Real-Time Path Planning for Robot Using OP-PRM in Complex Dynamic Environment","volume":"16","author":"Ye","year":"2022","journal-title":"Front. Neurorobot."},{"key":"ref_35","first-page":"2305","article-title":"Non-holonomic path planning using a quasi-random PRM approach","volume":"Volume 3","author":"Sanchez","year":"2002","journal-title":"Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/22\/8983\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:22:25Z","timestamp":1760145745000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/22\/8983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,20]]},"references-count":35,"journal-issue":{"issue":"22","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["s22228983"],"URL":"https:\/\/doi.org\/10.3390\/s22228983","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,20]]}}}