首页> 外文会议>AIAA guidance, navigation, and control conference;AIAA SciTech forum >Cooperative Multiple Task Assignment Considering Precedence Constraints Using Multi-Chromosome Encoded Genetic Algorithm
【24h】

Cooperative Multiple Task Assignment Considering Precedence Constraints Using Multi-Chromosome Encoded Genetic Algorithm

机译:多染色体编码遗传算法的优先约束协同多任务分配

获取原文

摘要

In the problem of cooperative multiple task assignment for heterogeneous unmanned aerial vehicles (UAVs), multiple consecutive tasks need to be performed on each target subject to task precedence constraints. An arbitrary task execution order might result in deadlock situations, i.e., one or multiple vehicles fall into an infinite waiting loop. In this paper, a multi-chromosome encoded genetic algorithm (MCE-GA) is proposed for avoiding the deadlock situations and assigning heterogeneous vehicles on multiple targets. The deadlock-free individuals are generated by considering the target identifiers and task precedence constraints in the multi-chromosome encoding process. Moreover, the specific crossover and mutation operators are designed to guarantee the feasibility of offspring individuals during the evolution process. The performance of MCE-GA is tested via comparing with random search method on simulation experiments. The comparison results from Monte Carlo simulations demonstrate that MCE-GA can produce better feasible solutions than random search method.
机译:在异构无人飞行器(UAV)的协作式多任务分配问题中,受任务优先权约束,需要在每个目标上执行多个连续任务。任意任务执行顺序可能会导致死锁情况,即一个或多个车辆陷入无限等待循环。本文提出了一种多染色体编码遗传算法(MCE-GA),以避免死锁情况,并在多个目标上分配异构车辆。通过在多染色体编码过程中考虑目标标识符和任务优先级约束来生成无死锁的个体。此外,特定的交叉和变异算子旨在确保后代个体在进化过程中的可行性。通过在仿真实验中与随机搜索方法进行比较,测试了MCE-GA的性能。蒙特卡罗模拟的比较结果表明,与随机搜索方法相比,MCE-GA可以提供更好的可行解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号