Mars rover path planning based on Bezier curve and A-Star algorithm
DOI:
CSTR:
Author:
Affiliation:

1.Beijing Key Laboratory of High Dynamic Navigation Technology,Beijing Information Science and Technology University, Beijing 100192, China; 2.Key Laboratory of Modern Measurement & Control Technology, Ministry of Education,Beijing 100192, China; 3.School of Automation, Beijing Information Science &Technology University,Beijing 100192, China

Clc Number:

TP306+.3; TP277

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Exploring the surface of Mars with a mobile rover is the mainstream way for major spacefaring nations to explore Mars. In order to get a safe path for the rover, a Mars rover path planning algorithm based on the improved A-Star algorithm is proposed. By improving the weight factor in the path information algorithm and optimizing the objective function of the traditional algorithm, a large number of worthless search paths can be omitted, shortening the time of search and improving the search efficiency. Compared with the traditional path planning can shorten 53.94% of the time; the introduction of corner optimization algorithm, in the case of the path length is basically the same, reduce the number of turns in the global path; to meet the needs of efficient and stable operation of the detector, corner optimization, the number of turns can be reduced by 16.77%. The path is smoothed by the fourth-order Bessel curve, effectively avoiding the appearance of corner spikes and ensuring the smooth travel of the rover on the surface of Mars.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: January 15,2024
  • Published:
Article QR Code