Optimized Mission Planning for Planetary Exploration Rovers

The exploration of planetary surfaces is predominately unmanned, calling for a landing vehicle and an autonomous and/or teleoperated rover. Artificial intelligence and machine learning techniques can be leveraged for better mission planning. This paper describes the coordinated use of both global navigation and metaheuristic optimization algorithms to plan the safe, efficient missions. The aim is to determine the least-cost combination of a safe landing zone (LZ) and global path plan, where avoiding terrain hazards for the lander and rover minimizes cost. Computer vision methods were used to identify surface craters, mounds, and rocks as obstacles. Multiple search methods were investigated for the rover global path plan. Several combinatorial optimization algorithms were implemented to select the shortest distance path as the preferred mission plan. Simulations were run for a sample Google Lunar X Prize mission. The result of this study is an optimization scheme that path plans with the A* search method, and uses simulated annealing to select ideal LZ-path- goal combination for the mission. Simulation results show the methods are effective in minimizing the risk of hazards and increasing efficiency. This paper is specific to a lunar mission, but the resulting architecture may be applied to a large variety of planetary missions and rovers.

[1]  Ayanna M. Howard,et al.  Fuzzy terrain-based path planning for planetary rovers , 2002, 2002 IEEE World Congress on Computational Intelligence. 2002 IEEE International Conference on Fuzzy Systems. FUZZ-IEEE'02. Proceedings (Cat. No.02CH37291).

[2]  Yang Jia,et al.  Global path planning for lunar rover based on Particle Swarm Optimization algorithm , 2011, 2011 IEEE 5th International Conference on Robotics, Automation and Mechatronics (RAM).

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Jiri Matas,et al.  Robust wide-baseline stereo from maximally stable extremal regions , 2004, Image Vis. Comput..

[5]  Cordelia Schmid,et al.  A Comparison of Affine Region Detectors , 2005, International Journal of Computer Vision.

[6]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[7]  G. Swaminathan.  Robot Motion Planning , 2006 .

[8]  Sebastian Thrun,et al.  Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.

[9]  CrepinsekMatej,et al.  Exploration and exploitation in evolutionary algorithms , 2013 .

[10]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[11]  Peng Wu,et al.  Mission-Integrated Path Planning for Planetary Rover Exploration , 2013, J. Softw..

[12]  Jeffrey A. Hoffman,et al.  An Integrated Traverse Planner and Analysis Tool for Planetary Exploration , 2010 .

[13]  M. Egerstedt,et al.  Graph-based path planning for mobile robots , 2006 .

[14]  Anthony Stentz.  Optimal and efficient path planning for partially-known environments , 1994 .

[15]  Roger Wattenhofer,et al.  Physical Algorithms , 2010, ICALP.

[16]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[17]  Takashi Kubota,et al.  An image based path planning scheme for exploration rover , 2011, 2011 IEEE International Conference on Robotics and Biomimetics.

[18]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[19]  Jiri Matas,et al.  Robust wide-baseline stereo from maximally stable extremal regions , 2004, Image Vis. Comput..