A Path-Planning Method for Mars Rovers based on Grid Map

Abstract

Path-planning is one of the major parts for Mars to complete exploration missions. With running slowly and higher computing complexity, traditional path-planning algorithms, such as A* and D* algorithms, are no longer in using. In this paper, a fast and efficient global path-planning method is got through improving the conretional A* algorithm. Then combining with local obstacle avoiding method, a complete rover path-planning method based on grid map is obtained. Finally, by using simulation provefs this method is effective and available.

Keywords

path-planning / PAA* / local obstacles avoidance / A*

References

[1] Koren Yoram, Johann Borenstein. Potential field methods and their inherent limitations for mobile robot navigation[C]//Robotics and Automation, Proceedings of 1991 IEEE International Conference on. [S. l.]: IEEE, 1991.
[2] Koenig Sven, Maxim Likhachev. Improved fast replanning for robot navigation in unknown terrain[C]//Robotics and Automation, Proceedings of 2002. IEEE International Conference on. [S. l.]: IEEE, 2002.
[3] Carsten Joseph. Global path planning on board the mars exploration rovers[C]///Aerospace Conference, 2007 IEEE. [S. l.]: IEEE, 2007.
[4] Goldberg Steven B, Mark Maimone M, Larry Matthies. Stereo vision and rover navigation software for planetary exploration[C]//Proceedings of 2002 IEEE Aerospace Conference. [S.l.]: IEEE, 2002.
[5] Durfee Edmund H, Charles L Ortiz Jr, Michael J Wolverton. A survey of research in distributed, continual planning[J]. AI Magazine, 1999,20(4):13.