多机器人任务分配调度的克隆选择算法  

Research on Clonal Selection Algorithm for Multi-Robot Task Allocation and Scheduling

作　　者：全燕鸣[1] 何一明 QUAN Yanming;HE Yiming(School of Mechanical & Automotive Engineering, South China University of Technology, Guangzhou 510640, Guangdong, China)

机构地区：[1]华南理工大学机械与汽车工程学院,广东广州510640

出　　处：《华南理工大学学报（自然科学版）》2021年第5期102-110,共9页Journal of South China University of Technology(Natural Science Edition)

基　　金：广东省普通高校特色创新类项目(2019KTSCX003);广东省自然科学基金资助项目(2020A1515011503)。

摘　　要：针对智能制造系统中同一时间段内多机器人执行多任务时,任务分配调度难以稳定控制及优化的问题,提出一种应用于多机器人任务分配调度的克隆选择算法。首先分析多机器人基于多任务的初始条件,以按生产过程完成任务为约束条件,以系统持续时间、单机器人最大消耗及多机器人总消耗为目标函数,构建多机器人任务分配调度优化的数学模型,使用克隆选择算法进行迭代求解,引入亲和度函数以动态改变克隆、变异、选择参数,从而提高计算效率;最后通过甘特图进行分析并验证此调度方法。结果表明此方法稳定可行;实验证明在多任务条件下,克隆选择算法收敛速度快、计算精度高,具有同时优化多项指标的优点。A clonal selection algorithm(CSA)for multi-robot collaborative scheduling was proposed to solve the difficulties in controlling and optimizing the task assignment and scheduling of multi-robot in the same period in intelligent manufacturing system.Firstly,the initial conditions of multi-robot task were analyzed.Then taking the task completion as the constraint condition and taking task flow time,single robot maximum cost and multi-robot total cost as the objective function,a mathematical model of multi-robot task allocation and scheduling optimization was constructed.The affinity function was introduced to dynamically change the parameters of clone,mutation and selection,so as to improve the computational efficiency.Finally,the scheduling method was verified by Gantt chart analysis.The results show that the proposed method is stable and feasible.Meanwhile,the experiments show that the clonal selection algorithm has the superiority of fast convergence speed and high calculation accuracy,and can optimize various indicators under complex multi-task conditions.

关 键 词：智能制造系统 多机器人 多任务分配 调度 克隆选择算法 

分 类 号：TP242.6[自动化与计算机技术—检测技术与自动化装置]