Path Planning Method for Underground Survey Robot in Dangerous Scenarios

Authors

  • Zelong Chen

DOI:

https://doi.org/10.54097/hset.v43i.7421

Keywords:

Dijkstra algorithm, Scheduling algorithm, Robot.

Abstract

Over the past 20 years, there has been a growing demand for autonomous exploration of underground environments such as tunnels, urban underground corridors, and complex cave environments. With the development of robotics, dangerous tasks that used to be done by humans have been replaced by underground survey robots. To avoid obstacles in the process of robot work, path planning technology has become one of the important components of underground survey robot. The underground survey robot not only needs to move in the plane, but also needs to climb along the pipe. However, the existing research is mostly two-dimensional plane, which cannot be directly applied to the underground exploration robot. Firstly, this paper compares the existing research and chooses Dijkstra algorithm for three-dimensional implementation. After that, the environment map is established, and the position of obstacles faced by the robot was set for simulation verification. Simulation results show the effectiveness of the proposed algorithm.

Downloads

Download data is not yet available.

References

Sariff N, Buniyamin N. An overview of autonomous mobile robot path planning algorithms[C]//2006 4th student conference on research and development. IEEE, 2006: 183 - 188.

Ge S S, Cui Y J. New potential functions for mobile robot path planning[J]. IEEE Transactions on robotics and automation, 2000, 16 (5): 615 - 620.

Zuo J, Zhu X, Peng Y, et al. A new method of posture recognition based on WiFi signal[J]. IEEE Communications Letters, 2021, 25 (8): 2564 - 2568.

Bruijnen D, van Helvoort J, Van de Molengraft R. Realtime motion path generation using subtargets in a rapidly changing environment [J]. Robotics and Autonomous Systems, 2007, 55 (6): 470 - 479.

Sato K. Deadlock-free motion planning using the Laplace potential field [J]. Advanced Robotics, 1992, 7 (5): 449 - 461.

Kuipers B, Feigenbaum E A, Hart P E, et al. Shakey: from conception to history[J]. Ai Magazine, 2017, 38 (1): 88 - 103.

Duchoň F, Babinec A, Kajan M, et al. Path planning with modified a star algorithm for a mobile robot [J]. Procedia Engineering, 2014, 96: 59 - 69.

Ismail A T, Sheta A, Al-Weshah M. A mobile robot path planning using genetic algorithm in static environment[J]. Journal of Computer Science, 2008, 4 (4): 341 - 344.

Xiangyang Deng, Limin Zhang, Lan Luo. An Improved Ant Colony Optimization Applied in Robot Path Planning Problem. Journal of Computers,2013, 45 (1): 234.

Bazan M, Ciskowski P, Dudek R, et al. Multithreaded enhancements of the Dijkstra algorithm for route optimization in urban networks[J]. Archives of Transport System Telematics, 2016, 9.

Burgard W, Hebert M, Bennewitz M. World modeling[M]//Springer handbook of robotics. Springer, Cham, 2016: 1135 - 1152.

Fankhauser P, Bloesch M, Rodriguez D, et al. Kinect v2 for mobile robot navigation: Evaluation and modeling[C]//2015 International Conference on Advanced Robotics (ICAR). IEEE, 2015: 388 - 394.

Downloads

Published

14-04-2023