Dynamic programming based look-ahead heuristic satellite task programming algorithm

Abstract

The invention discloses a dynamic programming based look-ahead and heuristic satellite task programming algorithm. As for a certain time of look-ahead operation, the current programming task is assumed to be t[i], the current programming time is s[0], the solving target is to find out an optimal task programming solution from a task set {t, L, t<i+m-1>, L, t<i+k-1>} by taking the sum of priority as an evaluation index, then the t is judged to be in the solution or not, and a problem of accepting or rejecting of the t is judged sequentially. First of all, M (m, s) represents the sum of the priority of the optimal programming solution in a task set {t<i+m-1>, L, t<i+k-1>} by taking s[0]+s-1 as the start programming time, wherein 1<=m<=k, 1<=s<=e[i+k-1]-s[0]+1, and m and s are both positive integers, thereby transforming the solving target into solving M (1, 1) and a corresponding programming solution. The dynamic programming based look-ahead heuristic satellite task programming algorithm disclosed by the invention has the advantages of efficiency and accuracy.

Description

technical field [0001] The invention relates to the field of aerospace technology, in particular to a forward-looking heuristic satellite mission planning algorithm based on dynamic programming. Background technique [0002] The heuristic algorithm is an approximate algorithm based on intuition or experience, which gives a feasible solution for each instance of the combinatorial optimization problem to be solved at an acceptable cost (such as computing time, occupied space, etc.). The degree of deviation from the optimal solution may not be predictable in advance. Heuristic algorithms can generally be divided into one-step algorithms, improved algorithms, mathematical programming methods, solution space relaxation algorithms, and modern optimization algorithms, etc. [0003] For the heuristic algorithm, the extraction of the characteristics of the actual problem, the experience and rules of the solution are the key. In the problem of satellite mission planning, task schedu...

AI Technical Summary

Problems solved by technology

There are obvious flaws in choosing simply based on the relationship between the priority of the current task and the priority of the subsequent tasks in the forward-looking step. Even when only the time window is considered, the above task selection rules still cannot guarantee the optimality of the scheme.

Images