Optimal path planning based on A* algorithm for submarine mining vehicle

  • Chen Y
  • Wu H
  • Sui Q
  • et al.
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Deep sea mining, as a frontier area in China, urgently needs to make progress in automatic navigation technology. In order to improve the operation efficiency of the seabed mining machine on the soft seabed, the submarine mining vehicle which complete the mining work in a certain mining area need to enter the next mining area quickly and economically. As a classical algorithm, the majority of scholars consider that A * algorithm is the most practical path planning search algorithm. Considering the limitation of operation conditions, the three-dimensional diagram is transformed into two-dimensional diagram by interpolation method when the seabed terrain conditions allow, and then the obstacles can be marked in two-dimensional diagram. A* algorithm was applied into the path planning of mining truck. The simulation results of the paper show that path cost, turning time and turning mode should be considered in the process of avoiding obstacles.

Cite

CITATION STYLE

APA

Chen, Y., Wu, H., Sui, Q., Chen, Y., Wang, R., Chen, B., … Wang, C. (2020). Optimal path planning based on A* algorithm for submarine mining vehicle. MATEC Web of Conferences, 309, 04006. https://doi.org/10.1051/matecconf/202030904006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free