中文摘要：

为了解决不确定性条件下的智能体群组协同任务规划问题,从提高任务分配方案鲁棒性的角度出发,建立以最小化任务完成时间和最大化任务完成质量为目标的区间规划模型,提出可直接求解模型的区间型非支配排序算法.算法定义区间目标函数间的占优支配关系,在编码空间通过组合使用随机遗传算子和启发式算子引导种群进化,在解码空间采用循环拥挤距离排序淘汰染色体保持种群规模.实验结果表明,所提出的方法可行有效,在不确定性条件下能得到鲁棒优质的任务分配方案.

英文摘要：

To solve the cooperative task scheduling problem under uncertain conditions for the agent group, an interval programming mathematical model is established from the aspect of improving robustness of task allocation scheme. A nondominated sorting algorithm in the interval pattern is proposed for solving this model. Since the model aims to minimize task completion time while maximize task completion quality, the dominance relationship between different individuals is defined. Then the algorithm guides the evolution of population by using the random genetic operator and heuristics operator in the coding space, and removes chromosomes to keep the size of population by adopting the circular crowded sorting strategy in the decoding space. Experiment results show that the proposed method is feasible and effective, and can obtain robust and superior task allocation schemes under uncertain conditions.