Abstract
The muck removal operation in tunnel boring machine (TBM) construction seriously restricts the safety and efficiency of tunnel engineering. To meet the requirements of muck removal at the bottom of the tunnel, a mechanism design and path planning algorithm were proposed to address the complex structure and frequent interference of the robot operating environment. Firstly, a robot cleaning plan and the robot body structure were proposed, the kinematic model of the robot was designed. Secondly, an improved RRT algorithm suitable for TBM and robot working environment was proposed to meet the requirements, which conclude obstacle avoidance, short time-consuming, and path smoothness. A collision detection strategy based on distance judgment, a random point generation strategy under goal-oriented constraints, a redundant path point deletion strategy, and a path smoothing processing strategy based on cubic B-splines were proposed to optimize the final path. Finally, the simulation platform has been built for traditional RRT and improved RRT algorithm were used for simulation. The results showed that the improved algorithm reduces the path cost by 27.13%, which verifies the effectiveness of the method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Hong Kairong, D., Yanliang, C.K., et al.: Full-face tunnel boring machine (shields/TBMs) in China: history, achievements, and prospects. Tunnel Constr. 42(05), 739–756 (2022)
Jianbin, L.: Current status, problems and prospects of research, design, and manufacturing of boring machine in China. Tunnel Constr. 41(06), 877–896 (2021)
Fei, H., Xingjian, Z., Yanming, S., et al.: Design and experiment of muck removal robot for tunneling boring machine. Advanced Engineering Sciences 54(04), 12–19 (2022)
Chen, Q., Zheng, Y., Jiang, H., et al.: Improved particle swarm optimization algorithm based on neural network for dynamic path planning. J. Huazhong Univ. Sci. Technol. (Nat. Sci. Edn.) 49(02), 51–55 (2021)
Ma, J., Wang, Y., He, Y., et al.: Motion planning of citrus harvesting manipulator based on informed guidance point of configuration space. Trans. Chin. Soc. Agric. Eng. (Trans. CSAE) 35(08), 100–108 (2019)
Lin, H.I., Yang, C.S.: 2D-span resampling of bi-RRT in dynamic path planning. Int. J. Autom. Smart Technol. 5(1), 39–48 (2015)
Gammell, J.D., Barfoot, T.D., Srinivasa, S.S.: Informed sampling for asymptotically optimal path planning. IEEE Trans. Rob. 34(4), 966–984 (2018)
Wei, L., Shijun, J.: Optimal path convergence method based on artificial potential field method and informed sampling. J. Comput. Appl. 41(10), 2912–2918 (2021)
Bo, C., Bi, S., Zheng, J., et al.: Obstacle avoidance algorithm for redundant manipulator of improved artificial potential field method. J. Harbin Inst. Technol. 51(07), 184–191 (2019)
Xu, J., Liu, Z., Yang, C., et al.: A pseudo-distance algorithm for collision detection of manipulators using convex-plane-polygons-based representation. Robot. Comput. Integr. Manuf. 66, 101993 (2020)
Liu, J., Fan, P.: Path planning of manipulator based on improved RRT*-connect Algorithm. Comput. Eng. Appl. 57(06), 274–278 (2021)
Du, M., Mei, T., Chen, J., et al.: RRT-based motion planning algorithm for intelligent vehicle in complex environments. Robot 37(04), 443–450 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Jiang, L., Sun, Y., Wang, Y., Yuan, X., Qian, H. (2023). Path Planning for Muck Removal Robot of Tunnel Boring Machine. In: Yang, H., et al. Intelligent Robotics and Applications. ICIRA 2023. Lecture Notes in Computer Science(), vol 14272. Springer, Singapore. https://doi.org/10.1007/978-981-99-6480-2_7
Download citation
DOI: https://doi.org/10.1007/978-981-99-6480-2_7
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-6479-6
Online ISBN: 978-981-99-6480-2
eBook Packages: Computer ScienceComputer Science (R0)