Skip to main content
Log in

A sampling-based planner for underground pipeline inspection with unknown narrow passage

  • Original Research Paper
  • Published:
Intelligent Service Robotics Aims and scope Submit manuscript

Abstract

Reliable path planning is critical for pipeline inspection robots operating in constrained industrial environments. Sampling-based methods have the advantage of high computational efficiency and are widely deployed in robot path planning. However, they face two challenges in underground pipeline inspection: poor adaptability in complex narrow passage scenarios and how to autonomously plan the path fitting pipeline layout. To address the above challenges, we propose a path planner RGP-RRT* (Ring Guide Pipeline-RRT*). First, we propose the ring guide mechanism that dynamically adjusts sample density near obstacle boundary based on the status of node extension. It enhances the adaptability to different narrow passage scenarios and provides orientation guidance for the planner. Second, we propose a pipeline-biased sampling method, which samples the area near the underground pipeline based on the sensor detection radius. This method improves search efficiency while ensuring that the planned path maintains sensor coverage to the underground pipeline. In addition, a pipeline-aligned post-processing method is proposed, which autonomously generates the path fitting the pipeline layout while considering obstacle avoidance. Simulations and experiments show that our planner improves time cost, success rate, and inspection performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Fig. 4
Fig. 5
Algorithm 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Availability of data and material

The data that support the findings of this study are available from the corresponding author, upon reasonable request.

References

  1. 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–10124 (2023) https://doi.org/10.1109/TII.2022.3232764

  2. 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–4692. https://doi.org/10.1109/TIA.2024.3362920

    Article  Google Scholar 

  3. 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–10857. https://doi.org/10.1007/s10489-022-04030-0

    Article  Google Scholar 

  4. 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–451. https://doi.org/10.1007/s10489-021-02397-0

    Article  Google Scholar 

  5. 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–18399. https://doi.org/10.1109/ACCESS.2024.3359748

    Article  Google Scholar 

  6. 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–694. https://doi.org/10.1109/OJVT.2024.3391380

    Article  Google Scholar 

  7. 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

    Article  Google Scholar 

  8. Dijkstra EW (2022) A Note on Two Problems in Connexion with Graphs, 1st edn., pp. 287–290. Association for Computing Machinery, New York, NY, USA. https://doi.org/10.1145/3544585.3544600

  9. 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–9008. https://doi.org/10.1109/TVT.2023.3348140

    Article  Google Scholar 

  10. 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–33174 . https://doi.org/10.1109/ROBOT.1994.351061

  11. 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–1507. https://doi.org/10.1109/LRA.2020.2969191

    Article  Google Scholar 

  12. Burzynski W, Stecz W (2024) Trajectory planning with multiplatform spacetime RRT. Appl Intell 54(19):9524–9541. https://doi.org/10.1007/s10489-024-05650-4

    Article  Google Scholar 

  13. González D, Pérez J, Milanés V, Nashashibi F (2016) A review of motion planning techniques for automated vehicles. IEEE Trans Intell Transp Syst 17(4):1135–1145. https://doi.org/10.1109/TITS.2015.2498841

    Article  Google Scholar 

  14. He K, Niu X-Z, Min X-Y, Min F (2023) Ercp: speedup path planning through clustering and presearching. Appl Intell 53(10):12324–12339. https://doi.org/10.1007/s10489-022-04137-4

    Article  Google Scholar 

  15. 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–252. https://doi.org/10.1016/j.arcontrol.2020.10.001

    Article  MathSciNet  Google Scholar 

  16. 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–2272. https://doi.org/10.1007/s12555-023-0796-6

    Article  Google Scholar 

  17. Qureshi AH, Ayaz Y (2015) Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Robot Auton Syst 68:1–11. https://doi.org/10.1016/j.robot.2015.02.007

    Article  Google Scholar 

  18. 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

    Article  Google Scholar 

  19. Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Rob Res 30(7):846–894. https://doi.org/10.1177/0278364911406761

    Article  Google Scholar 

  20. 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–3004. https://doi.org/10.1109/IROS.2014.6942976

  21. 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–90. https://doi.org/10.1016/j.eswa.2019.01.032

    Article  Google Scholar 

  22. 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

    Article  Google Scholar 

  23. 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–44263. https://doi.org/10.1109/ROBOT.2003.1242285

  24. 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–337. https://doi.org/10.1109/ROBIO.2017.8324439

  25. 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

    Article  Google Scholar 

  26. 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

    Article  Google Scholar 

  27. 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–3302. https://doi.org/10.1109/TIE.2020.2978701

    Article  Google Scholar 

  28. 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–162532. https://doi.org/10.1109/ACCESS.2020.3021126

    Article  Google Scholar 

  29. 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

    Article  Google Scholar 

  30. 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–5995. https://doi.org/10.1007/s12206-017-1143-8

    Article  Google Scholar 

  31. 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–813. https://doi.org/10.1016/j.egyr.2023.05.204. (2022 The 3rd International Conference on Power and Electrical Engineering)

    Article  Google Scholar 

  32. 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

    Article  Google Scholar 

Download references

Funding

This work was supported in part by the National Natural Science Foundation of China under Grant U21A20481.

Author information

Authors and Affiliations

Authors

Contributions

Conceptualization: [Jiarui Liu]; Methodology: [Jiarui Liu, Yingrun Liu]; Formal analysis and investigation: [Jiarui Liu, Yingrun Liu]; Writing-original draft preparation: [Jiarui Liu]; Writing-review and editing: [Jinhai Liu, Jiarui Liu, Zhenning Wu, Yanhong Luo]; Funding acquisition: [Jinhai Liu]; Resources: [Jinhai Liu]; Supervision: [Jinhai Liu, Zhenning Wu, Yanhong Luo].

Corresponding author

Correspondence to Jinhai Liu.

Ethics declarations

Conflict of interest

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.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, J., Liu, J., Wu, Z. et al. A sampling-based planner for underground pipeline inspection with unknown narrow passage. Intel Serv Robotics 19, 62 (2026). https://doi.org/10.1007/s11370-026-00715-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Version of record:

  • DOI: https://doi.org/10.1007/s11370-026-00715-4

Keywords

Profiles

  1. Jinhai Liu