独占轨道星座观测调度的拍卖与分布式优化方法
Auction-based and Distributed Optimization Approaches for Scheduling Observations in Satellite Constellations with Exclusive Orbit Portions
摘要：
我们调查使用多代理分配技术的问题与地球观测的情况下，多个用户和卫星。我们专注于协调用户预留的独家轨道部分和一个中央计划有几个请求，可能会使用这些独家的一些间隔的问题。我们将此问题定义为对地观测卫星星座调度问题（EOSCSP），并将其映射为一个混合线性规划问题。为了解决EOSCSP，我们提出了基于市场的技术和分布式约束优化（DCOP）的基础上，代理合作分配请求，而不共享自己的时间表的分布式问题求解技术。这些贡献的实验评估随机生成的EOSCSP实例的基础上真正的大规模或高度冲突的观察顺序书。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
