Mission planning for a constellation of Earth observation satellites is a complex problem raising significant technological challenges for tomorrow's space systems. The large numbers of customers requests and their dynamic introduction in the planning system result in a huge combinatorial search space with a potentially highly dynamical evolution requirements. The techniques used nowadays have several limitations, in particular, it is impossible to dynamically adapt the plan during its construction even for small modifications. Satellites of a constellation are planned in a chronological way instead of a more collective planning which can provide additional load balancing. In this paper, we propose to solve this difficult and highly dynamic problem using adaptive multi-agent systems, taking advantage from their self-adaptation and self-organization mechanisms. In the proposed system, the agents, through their local interactions, allow to dynamically reach a good solution, while ensuring a controlled distribution of tasks within the constellation of satellites. Finally, a comparison with a classical chronological greedy algorithm, commonly used in the spatial domain, highlights the advantages of the presented system.