计算机科学 ›› 2025, Vol. 52 ›› Issue (7): 262-270.doi: 10.11896/jsjkx.240600016

• 人工智能 • 上一篇    下一篇

基于图染色混合进化算法的长期多智能体任务分配

师晓妍1, 袁培燕1, 张俊娜1, 黄婷2, 龚月姣3   

  1. 1 河南师范大学计算机信息与工程学院 河南 新乡 453007
    2 西安电子科技大学广州研究院 广州 510555
    3 华南理工大学计算机科学与工程学院 广州 510006
  • 收稿日期:2024-06-03 修回日期:2024-07-26 发布日期:2025-07-17
  • 通讯作者: 黄婷(gnauhgnith@gmail.com)
  • 作者简介:(shixiaoyan27@163.com)
  • 基金资助:
    国家自然科学基金青年项目(62206212);广东省基础与应用基础研究区域联合基金-重点项目(2021B1515120078);广州基础与应用基础研究基金(SL2022A04J00521);中央高校基础校科研业务费(ZYTS24164);国家自然科学基金(62072159);河南科技攻关项目(232102211061);河南省高等教育教学改革研究与实践项目(2023SJGLX266Y)

Lifelong Multi-agent Task Allocation Based on Graph Coloring Hybrid Evolutionary Algorithm

SHI Xiaoyan1, YUAN Peiyan1, ZHANG Junna1, HUANG Ting2, GONG Yuejiao3   

  1. 1 College of Computer and Information Engineering, Henan Normal University, Xinxiang, Henan 453007, China
    2 Guangzhou Institute of Technology, Xidian University, Guangzhou 510555, China
    3 School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China
  • Received:2024-06-03 Revised:2024-07-26 Published:2025-07-17
  • About author:SHI Xiaoyan,born in 2000,postgraduate.Her main research interests include evolutionary computing and multi-agent task allocation.
    HUANG Ting,born in 1994,Ph.D,lecturer,is a member of CCF(No.K7200M).Her main research interests include computation intelligence and multi-agent task allocation.
  • Supported by:
    National Natural Science Foundation of China(62206212),Guangdong Province Basic and Applied Basic Research Regional Joint Fund-Key Project(2021B1515120078),Guangzhou Basic and Applied Basic Research Fundation(SL2022A04J00521),Fundamental Research Funds for the Central Universities(ZYTS24164),National Natural Science Foundation of China(62072159),Henan Science and Technology Project(232102211061) and Henan Higher Education Teaching Reform Research and Practice Project(2023SJGLX266Y).

摘要: 多智能体任务分配问题是智能仓储领域的关键底层问题。该问题要求将持续到来的任务分配给可用的智能体,以最小化整体任务的平均周期时间。针对该长期多智能体任务分配问题,首先将其数学建模为图染色问题,利用考虑冲突关系的图表征任务与智能体之间的关联性。基于该问题模型,为了最小化所有任务的平均周期时间,提出结合启发式算法、禁忌搜索算法和遗传算法的图染色混合进化算法(Graph Coloring Hybrid Evolutionary Algorithm,GCHEA),利用启发式算法生成初始解,以有效引导搜索过程;引入禁忌表,避免候选解在寻优过程中陷入局部最优;利用遗传算法的选择、交叉和替换操作增强种群多样性,通过迭代优化得到全局最优解;最终提出算法GCHEA获得图染色方案并进一步解码为具体的任务-智能体的分配方案。在仿真系统上进行测试,实验结果表明,GCHEA与现有的任务分配算法相比,在任务平均周期时间和系统总延误时间这两个性能指标上均取得了显著的改进。具体来说,任务平均周期时间平均减少了49%左右,系统总延误时间平均减少了约50%。

关键词: 智能仓储, 长期多智能体任务分配, 图染色问题, 混合进化算法

Abstract: The multi-agent task allocation problem is a fundamental issue in the field of intelligent warehousing.It involves continuously assigning continuously incoming tasks to available agents to minimize the average cycle time of overall tasks.For suchlifelong multi-agent task allocation problem,the problem is first mathematically modeled as a graph coloring problem,using a graph that considers conflict relationships to characterize the correlation between tasks and agents.Based on this problem model,in order to minimize the average cycle time of all tasks,this paper proposes a graph coloring hybrid evolutionary algorithm(GCHEA) that combines heuristic algorithm,tabu search algorithm,and genetic algorithm,using the heuristic algorithm to ge-nerate initial solutions to effectively guide the search process;introducing tabu lists to avoid candidate solutions falling into local optima during the optimization process;utilizing the selection,crossover,and replacement operations of genetic algorithm to enhance population diversity,and obtaining the global optimal solution through iterative optimization.Finally,the proposed GCHEA obtains the graph coloring scheme and further decode it into a specific task-agent allocation solution.Tested on a simulation system,the experimental results show that,compared with existing task allocation algorithms,GCHEA achieves significant improvements in terms of the performance indicators of average cycle time and total system delay time.Specifically,using the GCHEA results in approximately a 49% reduction in the average cycle time of the task,and a 50% decrease in the average total system delay time.

Key words: Intelligent warehousing, Lifelong multi-agent task allocation, Graph coloring problem, Hybrid evolutionary algorithm

中图分类号: 

  • TP391
[1]ZHANG D,PEE L,CUI L.Artificial intelligence in E-commerce fulfillment:A case study of resource orchestrationat Alibaba's Smart Warehouse[J].International Journal of Information Mana-gement,2021,57:102304.
[2]HAN X,CHENG W,MENG L,et al.A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV[J].Swarm and Evolutionary Computation,2024,86:101538.
[3]LIU M,XU Y,CHEN Z,et al.Decentralized Multi-Agent Based Cooperative Path Planning for Multi-UAVs[J].Computer Science,2012,39(1):219-222.
[4]KORSAH A G,STENTZ A,DIAS B M.A comprehensive taxonomy for multi-robot task allocation[J].The International Journal of Robotics Research,2013,32(12):1495-1512.
[5]WANG D,YU Y,YIN Y,et al.Multi-agent scheduling problems under multitasking[J].International Journal of Production Research,2021,59(12):3633-3663.
[6]ZHU J,SHI J,YANG Z,et al.A real-time decentralized algorithm for task scheduling in multi-agent system with continuous damage[J].Applied Soft Computing,2019,83:105628.
[7]CUI J,LIU Y,NALLANATHAN A.Multi-Agent Reinforce-ment Learning-Based Resource Allocation for UAV Networks[J].IEEE Transactions on Wireless Communications,2019,19(2):729-743.
[8]ZHOU J,ZHENG L,FAN W.Multirobot collaborative task dynamic scheduling based on multiagent reinforcement learning with heuristic graph convolution considering robot service performance[J].Journal of Manufacturing Systems,2024,72:122-141.
[9]QIN W,SUN Y,ZHUANG Z,et al.Multi-agentrein for cementlearning-based dynamic task assignment for vehicles in urban transportation system[J].International Journal of Production Economics,2021,240:108251.
[10]JANG I,SHIN H,TSOURDOS A.Anonymous hedonic game for task allocation in a large-scale multiple agent system[J].IEEE Transactions on Robotics,2018,34(6):1534-1548.
[11]ELANGO M,NACHIAPPAN S,TIWARI M K.Balancing task allocation in multi-robot systems using K-means clustering and auction based mechanisms[J].Expert Systems with Applications,2011,38(6):6486-6491.
[12]BAI X,FIELBAUM A,KRONMÜLLER M,et al.Group-based distributed auction algorithms for multi-robot task assignment[J].IEEE Transactions on Automation Science and Engineering,2022,20(2):1292-1303.
[13]WANG Y,LI H,YAO Y.An adaptive distributed auction algorithm and its application to multi-AUV task assignment[J].Science China Technological Sciences,2023,66(5):1235-1244.
[14]DENG Q,YU J,WANG N.Cooperative task assignment of multiple heterogeneous unmanned aerial vehicles using a modified genetic algorithm with multi-type genes[J].Chinese Journal of Aeronautics,2013,26(5):1238-1250.
[15]LI M,LIU C,LI K,et al.Multi-task allocation with an optimized quantum particle swarm method[J].Applied Soft Computing Journal,2020,96:106603.
[16]SAMIEI A,SUN L.Distributed matching-by-clone Hungarian-based algorithm for task allocation of multi-agent systems[J].IEEE Transactions on Robotics,2023,40:851-863.
[17]CHENG Y,SUN F,ZHANG Y,et al.Task allocation in manufacturing:A review[J].Journal of Industrial Information Integration,2019,15:207-218.
[18]NIE Z,CHEN K C.Hypergraphical real-time multirobot task allocation in a smart factory[J].IEEE Transactions on Industrial Informatics,2021,18(9):6047-6056.
[19]LI K,LIU T,KUMAR P N R,et al.A reinforcement learning-based hyper-heuristic for AGV task assignment and route planning in parts-to-picker warehouses[J].Transportation Research Part E:Logistics and Transportation Review,2024,185:103518.
[20]LOOGES P J,OLARIU S.Optimal greedy algorithms for indifference graphs[J].Computers & Mathematics with Applications,1993,25(7):15-25.
[21]WANG J C,WANG S,LI Z,et al.Improved Algorithm for Tabu Search of Graph Coloring Problems[J].Computer Science,2022,49(S2):94-98.
[22]ABBASIAN R,MOUHOUB M.A hierarchical parallel genetic approach for the graph coloring problem[J].Applied Intelligence,2013,39:510-528.
[23]SCHLOTE A,KING C,CRISOSTOMI E,et al.Delay-tolerantstochastic algorithms for parking space assignment[J].IEEE Transactions on Intelligent Transportation Systems,2014,15(5):1922-1935.
[24]PERSSON S M,SHARF I.Sampling-based A* algorithm forrobot path-planning[J].The International Journal of Robotics Research,2014,33(13):1683-1708.
[25]SAN SEGUNDO P.A new DSATUR-based algorithm for exact vertex coloring[J].Computers & Operations Research,2012,39(7):1724-1733.
[26]PORUMBEL D C,HAO J K,KUNTZ P.An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring[J].Computers & Operations Research,2010,37(10):1822-1832.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!