An adjustment distributed method for Route Planning of Space Exploration Task

Aerospace missions are usually accomplished with limited resources and time, and important to use time and resources wisely. With limited resources and time, it is very complicated to complete aerospace exploration missions, such as target classification missions, object tracking missions, target collection, space junk cleanup. Reasonable route planning is the basis for completing aerospace exploration missions. We are unable to complete aerospace exploration missions at once, and need two or more times to complete, or the total cost is too large, which will waste a lot of time and cost. Heuristic optimization algorithms are often used to solve path planning problems, while generated inefficient route, and require more time and costs. Therefore, in this paper, we propose an adjustment distributed algorithm (ADM) to address the limitations of heuristic optimization algorithms and save cost of time and cost, and obtain more reasonable routes. Experimental results show that our algorithm has better route planning capability with lower total cost.