首页> 外文会议>IEEE Symposium Series on Computational Intelligence >MOGAMR: A Multi-Objective Genetic Algorithm for real-time Mission Replanning
【24h】

MOGAMR: A Multi-Objective Genetic Algorithm for real-time Mission Replanning

机译:MOGAMR:用于实时任务重新计划的多目标遗传算法

获取原文
获取外文期刊封面目录资料

摘要

From the last few years the interest and repercussion on Unmanned Aerial Vehicle (UAV) technologies have been extended from pure military applications to industrial and societal applications. One of the basic tasks to any UAV problems is related to the Mission Planning. This problem is particularly complex when a set of UAVs is considered. In the field of Multi-UAV Mission Planning, some approaches have been carried out in the last years. However, there are few works related to real-time Mission Replanning, which is the focus of this work. In Mission Replanning, some changes in the mission, such as the arrival of new tasks, require to update the preplanned solution as fast as possible. In this paper a Multi-Objective Genetic Algorithm for Mission Replanning (MOGAMR) is proposed to handle this problem. This approach uses a set of previous plans (or solutions), generated using an oa liffline planning process, in order to initialize the population of the algorithm, then acts as a complete regeneration method. In order to simulate a real-time system we have fixed a time limit of 2 minutes. This has been considered as an appropriate time for a human operator to take a decision. Using this time restriction, a set of experiments adding from 1 to 5 new tasks in the Replanning Problems has been carried out. The experiments show that the algorithm works well with this few number of new tasks during the replanning process generating a set of feasible solutions under the time restriction considered.
机译:从最近几年开始,对无人机技术的兴趣和影响已从纯粹的军事应用扩展到工业和社会应用。解决任何无人机问题的基本任务之一是与任务计划有关。当考虑一组无人机时,这个问题特别复杂。在多UAV任务计划领域,最近几年采取了一些方法。但是,与实时任务重新计划相关的工作很少,这是这项工作的重点。在“任务重新计划”中,任务中的某些更改(例如新任务的到来)要求尽快更新预先计划的解决方案。在本文中,提出了一种用于任务重新规划的多目标遗传算法(MOGAMR)来解决这个问题。该方法使用通过liffline计划过程生成的一组先前计划(或解决方案),以初始化算法的总体,然后充当完整的再生方法。为了模拟实时系统,我们固定了2分钟的时间限制。这已被认为是操作员做出决定的适当时间。使用此时间限制,已进行了一组实验,在“重新计划问题”中添加了1到5个新任务。实验表明,该算法在重新规划过程中能处理这几个新任务,并且在考虑的时间限制下生成了一组可行的解决方案,效果很好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号