Dynamic ranking algorithm for landing site selection

Tiago C. Pais, Rita A. Ribeiro, Yannick Devouassoux, Stephane Reynaud

Landing on planets is always a challenging task due to the distance, communication delays, and hostile environments found. In this paper we present a dynamic ranking algorithm, based on a hybrid aggregation operator, for selecting the best site for landing. The proposed algorithm uses feedback historical information from previous iterations to ensure a reinforcement behavior in the decision process.

PDF full paper