用图学习与遗传算法生成多样化的多智能体行动方案,提升灾难救援规划效率。
Automated Generation of Diverse Courses of Actions for Multi-Agent Operations using Binary Optimization and Graph Learning
- 构建任务图与行动方案池的图抽象,量化多样性。
- 遗传算法优化任务分配,兼顾多样性和适配度,生成20个方案耗时约50分钟。
- 图神经网络自适应排序单个智能体任务,提升执行成功率。
灾难响应、搜救及军事任务中的多智能体操作需要自动化行动方案(COA)规划。环境变化(如降雨、积雪、障碍)会影响方案性能,因此需要多样化的任务分布方案。同时,智能体能力差异带来实际机遇与计算挑战。本文提出一种理论框架与计算方法,用于生成具有软兼容性变化的多样化COA池。核心是将任务空间与方案池抽象为图结构以量化多样性。将任务分配建模为集中式多机器人任务分配问题,使用遗传算法进行无序分配,联合最大化方案池多样性与智能体-任务匹配度。再通过策略梯度训练图神经网络,实现每个方案中单个智能体的任务序列优化,以适应任务特征并最大化完成率。在模拟环境中测试显示,该方法相比随机基线显著提升性能,任务排序的最优性差距小,5个智能体、100个任务的场景下生成最多20个方案耗时约50分钟。
原文摘要 · Abstract (English)
Operations in disaster response, search \& rescue, and military missions that involve multiple agents demand automated processes to support the planning of the courses of action (COA). Moreover, traverse-affecting changes in the environment (rain, snow, blockades, etc.) may impact the expected performance of a COA, making it desirable to have a pool of COAs that are diverse in task distributions across agents. Further, variations in agent capabilities, which could be human crews and/or autonomous systems, present practical opportunities and computational challenges to the planning process. This paper presents a new theoretical formulation and computational framework to generate such diverse pools of COAs for operations with soft variations in agent-task compatibility. Key to the problem formulation is a graph abstraction of the task space and the pool of COAs itself to quantify its diversity. Formulating the COAs as a centralized multi-robot task allocation problem, a genetic algorithm is used for (order-ignoring) allocations of tasks to each agent that jointly maximize diversity within the COA pool and overall compatibility of the agent-task mappings. A graph neural network is trained using a policy gradient approach to then perform single agent task sequencing in each COA, which maximizes completion rates adaptive to task features. Our tests of the COA generation process in a simulated environment demonstrate significant performance gain over a random walk baseline, small optimality gap in task sequencing, and execution time of about 50 minutes to plan up to 20 COAs for 5 agent/100 task operations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。