We investigate the use of multi-agent allocation techniques on problems related to Earth observation scenarios with multiple users and satellites. We focus on the problem of coordinating users having reserved exclusive orbit portions and one central planner having several requests that may use some intervals of these exclusives. We define this problem as Earth Observation Satellite Constellation Scheduling Problem (EOSCSP) and map it to a Mixed Integer Linear Program. As to solve EOSCSP, we propose market-based techniques and a distributed problem solving technique based on Distributed Constraint Optimization (DCOP), where agents cooperate to allocate requests without sharing their own schedules. These contributions are experimentally evaluated on randomly generated EOSCSP instances based on real large-scale or highly conflicting observation order books.

翻译：我们通过多个用户和卫星调查在与地球观测情景有关的问题上使用多剂分配技术的问题,我们侧重于协调拥有专用专用轨道部分的用户和提出若干可能使用某些间隔专属部分请求的中央规划员的问题,我们将这一问题定义为地球观测卫星星座布局问题(EOSSP),并将其绘制成一个混合整形线性方案。关于解决EOSCSP,我们提出了基于市场的技术以及基于分布式约束性优化(DCOP)的分散式解决问题技术,在这种技术基础上,代理人合作分配请求,而不分享各自的时间表,根据随机生成的EOSCSP情况,根据实际大规模或高度冲突的观测订单书籍,对这些贡献进行了实验性评估。