Real-Time Landing Point Redesignation (LPR) Algorithm

Abstract

In order to achieve a safe, precise, and efficient landing on the moon, a number of factors must be considered in real-time during the critical descent phase. These factors include locating hazardous boulders, craters, and slopes, identifying pre-deployed assets and science areas, and managing fuel consumption. This paper describes an algorithm that trades off the factors laid out above and selects landing points based on input terrain and vehicle data. Inputs to the algorithm are the lander footprint, divert fuel costs, detected hazards, and identified points of interest. The algorithm is designed to accept any number of input cost functions and constraints, ensuring flexibility to a variety of missions. The input cost functions are weighted and then fed into a search algorithm that returns all feasible landing points on the map, prioritized by the weighted cost function. The algorithm is capable of returning overlapping or nonoverlapping solutions. This algorithm is designed to provide on-board crew or autonomous robotic vehicles with real-time landing point redesignation capabilities.