Robot base disturbance optimization with compact differential evolution light

Despite the constant growth of the computational power in consumer electronics, very simple hardware is still used in space applications. In order to obtain the highest possible reliability, in space systems limited-power but fully tested and certified hardware is used, thus reducing fault risks. Some space applications require the solution of an optimization problem, often plagued by real-time and memory constraints. In this paper, the disturbance to the base of a robotic arm mounted on a spacecraft is modeled, and it is used as a cost function for an online trajectory optimization process. In order to tackle this problem in a computationally efficient manner, addressing not only the memory saving necessities but also real-time requirements, we propose a novel compact algorithm, namely compact Differential Evolution light (cDElight). cDElight belongs to the class of Estimation of Distribution Algorithms (EDAs), which mimic the behavior of population-based algorithms by means of a prob...

Despite the constant growth of the computational power in consumer electronics, very simple hardware is still used in space applications. In order to obtain the highest possible reliability, in space systems limited-power but fully tested and certified hardware is used, thus reducing fault risks. Some space applications require the solution of an optimization problem, often plagued by real-time and memory constraints. In this paper, the disturbance to the base of a robotic arm mounted on a spacecraft is modeled, and it is used as a cost function for an online trajectory optimization process. In order to tackle this problem in a computationally efficient manner, addressing not only the memory saving necessities but also real-time requirements, we propose a novel compact algorithm, namely compact Differential Evolution light (cDElight). cDElight belongs to the class of Estimation of Distribution Algorithms (EDAs), which mimic the behavior of population-based algorithms by means of a probabilistic model of the population of candidate solutions. This model has a more limited memory footprint than the actual population. Compared to a selected set of memory-saving algorithms, cDElight is able to obtain the best results, despite a lower computational overhead.