摘要:Mission planning problem for remote sensing satellite imaging is studied. Firstly, the time constraint satisfaction problem model is presented after analyzing the characteristic of time constraint. Then, An optimal path searching algorithm based on the discrete time window is proposed according to the non-uniqueness for satellite to mission in the visible time window. Simulation results verify the efficiency of the model and algorithm.