Abstract
This paper deals with lunar landing site decision algorithms for the case when the lunar lander is not able to reach the original landing site. A new landing site which minimizes the fuel consumption of the lunar rover is determined from landing site candidates located within the maximum reachable downrange of the lunar lander. A path planning algorithm is introduced to determine the new landing site which has the shortest path to the original landing site among the candidates. Numerical simulations are conducted to verify the performance of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
