首页> 外文期刊>Advances in space research >Online scheduling of distributed Earth observation satellite system under rigid communication constraints
【24h】

Online scheduling of distributed Earth observation satellite system under rigid communication constraints

机译:刚性通信约束下分布式地球观测卫星系统的在线调度

获取原文
获取原文并翻译 | 示例
           

摘要

This paper focused on online scheduling of distributed Earth observation satellite system in a dynamic environment. The objective was to maximize the total profit of the overall system by efficiently coordinating the different satellites with stochastic arrival of urgent tasks, subject to rigid communication and observation time window constraints. We formulated this problem as a single-task, single-robot, time-extended assignment problem with intra-schedule dependency using the multi-robot task assignment taxonomy and formulated the sub-problem after releasing urgent tasks in a mixed-integer linear programming model. We first described the online scheduling algorithm for a single satellite, then we proposed the modified consensus-based bundle algorithm (m-CBBA) and modified asynchronous consensus-based bundle algorithm (m-ACBBA) with synchronous and asynchronous communication, respectively. Compared with initial versions of CBBA and ACBBA, the modified versions added the communication loop prediction phases to efficiently utilize scarce communication opportunities and reduce the communication requirements. Additionally, we introduce two contract net protocol (CNP)-based algorithms for comparison, respectively SingleItem-CNP-based (SI-CNP) algorithm and Batch-CNP-based (BA-CNP) algorithm. Computational experiments indicated that both the total profit and percentage of scheduled urgent tasks achieved by the m-ACBBA and m-CBBA algorithms were much higher than those achieved by both SI-CNP and BA-CNP. Additionally, the number of communications needed by either m-ACBBA or m-CBBA algorithm was lower than that by SI-CNP. When the communication cost in the system is high, the m-CBBA algorithm is preferred because it balances the profit and the required number of communications. When the communication cost is low, the m-ACBBA algorithm is preferred because it achieves high total profit and high percentage of scheduled urgent tasks.
机译:本文侧重于动态环境中分布式地球观测卫星系统的在线调度。目标是通过有效地协调不同的卫星,通过随机到达的不同卫星进行紧急任务的不同卫星来实现整体系统的总利润,符合刚性通信和观察时间窗口约束。我们将此问题作为单个任务,单机器人,时间扩展的分配问题,使用多机器人任务分配分类和在混合整数线性编程模型中释放紧急任务后制定了子问题。我们首先描述了单卫星的在线调度算法,然后我们提出了一种基于修改的共识的束算法(M-CBBA)和基于修改的异步共识的基于异步共识的捆绑算法(M-ACBBA),分别具有同步和异步通信。与CBBA和ACBBA的初始版本相比,修改版本添加了通信循环预测阶段,以有效地利用稀缺的通信机会并降低通信要求。此外,我们介绍了两种合同网络协议(CNP)基于比较的算法,分别是SpectItem-CNP的(SI-CNP)算法和基于BATCH-CNP的(BA-CNP)算法。计算实验表明,M-ACBBA和M-C-CBBA算法所实现的预定局部任务的总利润和百分比远高于Si-CNP和BA-CNP所达到的次数。另外,M-ACBBA或M-C-CBBA算法所需的通信数量低于SI-CNP。当系统中的通信成本很高时,M-CBBA算法是首选的,因为它余额余损和所需的通信数量。当通信成本低时,M-ACBBA算法是首选的,因为它可以实现高度的总利润和预定的紧急任务的高百分比。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号