Mission Planning Method of the Greedy Algorithm and Dynamic Programming

Big spacecraft has many payloads with complexity constraints and the spacecraft resource-constrained problems.Comprehensive analysis the constraints of the solar altitude angle,the observation mode,the data transmission and the load side of pendulum.Payloads observation constraints are converted to 01 backpack model,combine greedy idea with dynamic programming.Make the fixed observing plan under the same observation needs.Solve regional observation needs and observation conflict with greedy dynamic programming.Experimental results show that the hybrid algorithm is suitable for multiple payloads earth observation mission planning.