{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T15:06:12Z","timestamp":1779375972407,"version":"3.53.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:00:00Z","timestamp":1779321600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:00:00Z","timestamp":1779321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s11370-026-00715-4","type":"journal-article","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T14:16:09Z","timestamp":1779372969000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A sampling-based planner for underground pipeline inspection with unknown narrow passage"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0601-705X","authenticated-orcid":false,"given":"Jiarui","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1256-1337","authenticated-orcid":false,"given":"Jinhai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8742-904X","authenticated-orcid":false,"given":"Zhenning","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7105-7100","authenticated-orcid":false,"given":"Yingrun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6898-7903","authenticated-orcid":false,"given":"Yanhong","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,21]]},"reference":[{"key":"715_CR1","doi-asserted-by":"publisher","unstructured":"Shen, X., Liu, J., Sun, J., Jiang, L., Zhao, H., Zhang, H.: Ssct-net: A semisupervised circular teacher network for defect detection with limited labeled multiview mfl samples. IEEE Transactions on Industrial Informatics vol. 19(no. 10), 10114\u201310124 (2023) https:\/\/doi.org\/10.1109\/TII.2022.3232764","DOI":"10.1109\/TII.2022.3232764"},{"issue":"3","key":"715_CR2","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1109\/TIA.2024.3362920","volume":"60","author":"C Wang","year":"2024","unstructured":"Wang C, Chowdhury S, Liang X (2024) Transmission structure corrosion due to stray currents and the inspection and mitigation techniques: A review. IEEE Trans Ind Appl 60(3):4677\u20134692. https:\/\/doi.org\/10.1109\/TIA.2024.3362920","journal-title":"IEEE Trans Ind Appl"},{"issue":"9","key":"715_CR3","doi-asserted-by":"publisher","first-page":"10843","DOI":"10.1007\/s10489-022-04030-0","volume":"53","author":"Y Dai","year":"2023","unstructured":"Dai Y, Yu J, Zhang C, Zhan B, Zheng X (2023) A novel whale optimization algorithm of path planning strategy for mobile robots. Appl Intell 53(9):10843\u201310857. https:\/\/doi.org\/10.1007\/s10489-022-04030-0","journal-title":"Appl Intell"},{"issue":"1","key":"715_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10489-021-02397-0","volume":"52","author":"H Li","year":"2022","unstructured":"Li H, Zhao T, Dian S (2022) Prioritized planning algorithm for multi-robot collision avoidance based on artificial untraversable vertex. Appl Intell 52(1):429\u2013451. https:\/\/doi.org\/10.1007\/s10489-021-02397-0","journal-title":"Appl Intell"},{"key":"715_CR5","doi-asserted-by":"publisher","first-page":"18387","DOI":"10.1109\/ACCESS.2024.3359748","volume":"12","author":"W Wang","year":"2024","unstructured":"Wang W, Li J, Bai Z, Wei Z, Peng J (2024) Toward optimization of agv path planning: An rrt*-aco algorithm. IEEE Access 12:18387\u201318399. https:\/\/doi.org\/10.1109\/ACCESS.2024.3359748","journal-title":"IEEE Access"},{"key":"715_CR6","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/OJVT.2024.3391380","volume":"5","author":"M Haris","year":"2024","unstructured":"Haris M, Bhatti DMS, Nam H (2024) A fast-convergent hyperbolic tangent PSO algorithm for UAVS path planning. IEEE Open Journal of Vehicular Technology 5:681\u2013694. https:\/\/doi.org\/10.1109\/OJVT.2024.3391380","journal-title":"IEEE Open Journal of Vehicular Technology"},{"key":"715_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123762","volume":"249","author":"MN Ab Wahab","year":"2024","unstructured":"Ab Wahab MN, Nazir A, Khalil A, Ho WJ, Akbar MF, Noor MHM, Mohamed ASA (2024) Improved genetic algorithm for mobile robot path planning in static environments. Expert Syst Appl 249:123762. https:\/\/doi.org\/10.1016\/j.eswa.2024.123762","journal-title":"Expert Syst Appl"},{"key":"715_CR8","doi-asserted-by":"publisher","unstructured":"Dijkstra EW (2022) A Note on Two Problems in Connexion with Graphs, 1st edn., pp. 287\u2013290. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3544585.3544600","DOI":"10.1145\/3544585.3544600"},{"issue":"6","key":"715_CR9","doi-asserted-by":"publisher","first-page":"9003","DOI":"10.1109\/TVT.2023.3348140","volume":"73","author":"Z Lin","year":"2024","unstructured":"Lin Z, Wu K, Shen R, Yu X, Huang S (2024) An efficient and accurate a-star algorithm for autonomous vehicle path planning. IEEE Trans Veh Technol 73(6):9003\u20139008. https:\/\/doi.org\/10.1109\/TVT.2023.3348140","journal-title":"IEEE Trans Veh Technol"},{"key":"715_CR10","doi-asserted-by":"publisher","unstructured":"Stentz A (1994) Optimal and efficient path planning for partially-known environments. In: Proceedings of the 1994 IEEE International Conference on Robotics and Automation, pp. 3310\u201333174 . https:\/\/doi.org\/10.1109\/ROBOT.1994.351061","DOI":"10.1109\/ROBOT.1994.351061"},{"issue":"2","key":"715_CR11","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1109\/LRA.2020.2969191","volume":"5","author":"L Schmid","year":"2020","unstructured":"Schmid L, Pantic M, Khanna R, Ott L, Siegwart R, Nieto J (2020) An efficient sampling-based method for online informative path planning in unknown environments. IEEE Robot Autom Lett 5(2):1500\u20131507. https:\/\/doi.org\/10.1109\/LRA.2020.2969191","journal-title":"IEEE Robot Autom Lett"},{"issue":"19","key":"715_CR12","doi-asserted-by":"publisher","first-page":"9524","DOI":"10.1007\/s10489-024-05650-4","volume":"54","author":"W Burzynski","year":"2024","unstructured":"Burzynski W, Stecz W (2024) Trajectory planning with multiplatform spacetime RRT. Appl Intell 54(19):9524\u20139541. https:\/\/doi.org\/10.1007\/s10489-024-05650-4","journal-title":"Appl Intell"},{"issue":"4","key":"715_CR13","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1109\/TITS.2015.2498841","volume":"17","author":"D Gonz\u00e1lez","year":"2016","unstructured":"Gonz\u00e1lez D, P\u00e9rez J, Milan\u00e9s V, Nashashibi F (2016) A review of motion planning techniques for automated vehicles. IEEE Trans Intell Transp Syst 17(4):1135\u20131145. https:\/\/doi.org\/10.1109\/TITS.2015.2498841","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"10","key":"715_CR14","doi-asserted-by":"publisher","first-page":"12324","DOI":"10.1007\/s10489-022-04137-4","volume":"53","author":"K He","year":"2023","unstructured":"He K, Niu X-Z, Min X-Y, Min F (2023) Ercp: speedup path planning through clustering and presearching. Appl Intell 53(10):12324\u201312339. https:\/\/doi.org\/10.1007\/s10489-022-04137-4","journal-title":"Appl Intell"},{"key":"715_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.arcontrol.2020.10.001","volume":"50","author":"MNA Wahab","year":"2020","unstructured":"Wahab MNA, Nefti-Meziani S, Atyabi A (2020) A comparative review on mobile robot path planning: Classical or meta-heuristic methods. Annu Rev Control 50:233\u2013252. https:\/\/doi.org\/10.1016\/j.arcontrol.2020.10.001","journal-title":"Annu Rev Control"},{"issue":"7","key":"715_CR16","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1007\/s12555-023-0796-6","volume":"22","author":"J Lee","year":"2024","unstructured":"Lee J, Lim T, Kim W (2024) Interactive robot trajectory planning with augmented reality for non-expert users. Int J Control Autom Syst 22(7):2263\u20132272. https:\/\/doi.org\/10.1007\/s12555-023-0796-6","journal-title":"Int J Control Autom Syst"},{"key":"715_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.robot.2015.02.007","volume":"68","author":"AH Qureshi","year":"2015","unstructured":"Qureshi AH, Ayaz Y (2015) Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Robot Auton Syst 68:1\u201311. https:\/\/doi.org\/10.1016\/j.robot.2015.02.007","journal-title":"Robot Auton Syst"},{"key":"715_CR18","doi-asserted-by":"publisher","DOI":"10.3390\/jmse11040702","author":"G Tang","year":"2023","unstructured":"Tang G, Liu P, Hou Z, Claramunt C, Zhou P (2023) Motion planning of uav for port inspection based on extended rrt* algorithm. J Marine Sci Eng. https:\/\/doi.org\/10.3390\/jmse11040702","journal-title":"J Marine Sci Eng"},{"issue":"7","key":"715_CR19","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Rob Res 30(7):846\u2013894. https:\/\/doi.org\/10.1177\/0278364911406761","journal-title":"Int J Rob Res"},{"key":"715_CR20","doi-asserted-by":"publisher","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2014) Informed rrt*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: 2014 IEEE\/RSJ international conference on intelligent robots and systems, pp. 2997\u20133004. https:\/\/doi.org\/10.1109\/IROS.2014.6942976","DOI":"10.1109\/IROS.2014.6942976"},{"key":"715_CR21","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.032","volume":"123","author":"I-B Jeong","year":"2019","unstructured":"Jeong I-B, Lee S-J, Kim J-H (2019) Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rate. Expert Syst Appl 123:82\u201390. https:\/\/doi.org\/10.1016\/j.eswa.2019.01.032","journal-title":"Expert Syst Appl"},{"key":"715_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108246","volume":"133","author":"X Cui","year":"2024","unstructured":"Cui X, Wang C, Xiong Y, Mei L, Wu S (2024) More quickly-RRT*: Improved quick rapidly-exploring random tree star algorithm based on optimized sampling point with better initial solution and convergence rate. Eng Appl Artif Intell 133:108246. https:\/\/doi.org\/10.1016\/j.engappai.2024.108246","journal-title":"Eng Appl Artif Intell"},{"key":"715_CR23","doi-asserted-by":"publisher","unstructured":"Hsu D, Jiang T, Reif J, Sun Z (2003) The bridge test for sampling narrow passages with probabilistic roadmap planners. In: 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422), vol. 3, pp. 4420\u201344263. https:\/\/doi.org\/10.1109\/ROBOT.2003.1242285","DOI":"10.1109\/ROBOT.2003.1242285"},{"key":"715_CR24","doi-asserted-by":"publisher","unstructured":"Meng Z, Qin H, Sun H, Shen X, Ang MH (2017) Obstacle-guided informed planning towards robot navigation in cluttered environments. In: 2017 IEEE International Conference on Robotics and Biomimetics (ROBIO), pp. 332\u2013337. https:\/\/doi.org\/10.1109\/ROBIO.2017.8324439","DOI":"10.1109\/ROBIO.2017.8324439"},{"key":"715_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2023.104570","volume":"171","author":"H Tu","year":"2024","unstructured":"Tu H, Deng Y, Li Q, Song M, Zheng X (2024) Improved RRT global path planning algorithm based on bridge test. Robot Auton Syst 171:104570. https:\/\/doi.org\/10.1016\/j.robot.2023.104570","journal-title":"Robot Auton Syst"},{"key":"715_CR26","doi-asserted-by":"publisher","DOI":"10.3390\/app112411777","author":"Z Wu","year":"2021","unstructured":"Wu Z, Meng Z, Zhao W, Wu Z (2021) Fast-RRT: A RRT-based optimal path finding method. Appl Sci. https:\/\/doi.org\/10.3390\/app112411777","journal-title":"Appl Sci"},{"issue":"4","key":"715_CR27","doi-asserted-by":"publisher","first-page":"3292","DOI":"10.1109\/TIE.2020.2978701","volume":"68","author":"B Hu","year":"2021","unstructured":"Hu B, Cao Z, Zhou M (2021) An efficient RRT-based framework for planning short and smooth wheeled robot motion under kinodynamic constraints. IEEE Trans Industr Electron 68(4):3292\u20133302. https:\/\/doi.org\/10.1109\/TIE.2020.2978701","journal-title":"IEEE Trans Industr Electron"},{"key":"715_CR28","doi-asserted-by":"publisher","first-page":"162516","DOI":"10.1109\/ACCESS.2020.3021126","volume":"8","author":"A Suarez","year":"2020","unstructured":"Suarez A, Caballero A, Garofano A, Sanchez-Cuevas PJ, Heredia G, Ollero A (2020) Aerial manipulator with rolling base for inspection of pipe arrays. IEEE Access 8:162516\u2013162532. https:\/\/doi.org\/10.1109\/ACCESS.2020.3021126","journal-title":"IEEE Access"},{"key":"715_CR29","doi-asserted-by":"publisher","DOI":"10.3390\/biomimetics5020026","author":"Y Wang","year":"2020","unstructured":"Wang Y, Pandit P, Kandhari A, Liu Z, Daltorio KA (2020) Rapidly exploring random tree algorithm-based path planning for worm-like robot. Biomimetics. https:\/\/doi.org\/10.3390\/biomimetics5020026","journal-title":"Biomimetics"},{"key":"715_CR30","doi-asserted-by":"publisher","first-page":"5987","DOI":"10.1007\/s12206-017-1143-8","volume":"31","author":"J An","year":"2017","unstructured":"An J, Lee G, Oh I, Moon H, Ryew S (2017) Navigation-oriented design for in-pipe robot in recursively divided sampling space with rapidly exploring random tree. J Mech Sci Technol 31:5987\u20135995. https:\/\/doi.org\/10.1007\/s12206-017-1143-8","journal-title":"J Mech Sci Technol"},{"key":"715_CR31","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.egyr.2023.05.204","volume":"9","author":"B Zhao","year":"2023","unstructured":"Zhao B, Wu C-D, Zhao X, Sun R-H, Jiang Y (2023) Research on hybrid navigation algorithm and multi-objective cooperative planning method for electric inspection robot. Energy Rep 9:805\u2013813. https:\/\/doi.org\/10.1016\/j.egyr.2023.05.204. (2022 The 3rd International Conference on Power and Electrical Engineering)","journal-title":"Energy Rep"},{"key":"715_CR32","doi-asserted-by":"publisher","DOI":"10.3390\/su15129816","author":"Z Wu","year":"2023","unstructured":"Wu Z, Huang H, Zhao G, Liu J (2023) Tmr-array-based pipeline location method and its realization. Sustainability. https:\/\/doi.org\/10.3390\/su15129816","journal-title":"Sustainability"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-026-00715-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-026-00715-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-026-00715-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T14:16:10Z","timestamp":1779372970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-026-00715-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,21]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["715"],"URL":"https:\/\/doi.org\/10.1007\/s11370-026-00715-4","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,21]]},"assertion":[{"value":"26 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article, and the article is approved by all authors for publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"62"}}