跳到正文
返回论文列表
cs.MA提交于 已译

不确定任务需求下的异构团队协同

Coordination of Heterogeneous Teams with Uncertain Task Requirements

Jongann Lee · Melkior Ornik

中文摘要

协调异构智能体团队完成需求未知的任务是一个具有挑战性的多智能体规划问题。智能体在发现任务需求和执行任务的能力上各不相同,因此规划器必须协调任务发现、执行与暂存。本文提出一种分层规划器,使用图神经网络策略为智能体分配动作,再用最短路径算法找到通往动作位置的路径。方法的核心是 CAAT 图,它由智能体、任务、能力与动作构成,是规划上下文的图表示。实验表明,与分别优化任务发现和任务执行的基线相比,学习到的规划器能联合协调异构团队,在更短时间内同时发现任务需求并完成任务。此外,仅在户外地图上训练的策略可零样本迁移到室内地图,该地图的智能体、任务与能力数量均超过训练时所见,无需微调即可规划。

关键要点

  1. 01问题:异构智能体在任务需求未知时需同时协调发现、执行与暂存。
  2. 02方法:分层规划器用图神经网络策略分配动作,再用最短路径算法寻路。
  3. 03核心表示:CAAT 图统一建模智能体、任务、能力与动作。
  4. 04结果:联合优化比独立优化基线更快完成任务发现与执行。
  5. 05局限/拓展:仅户外训练即可零样本迁移到更复杂的室内地图。

解读

尚无解读。

原始英文摘要

arXiv:2611.21828v1 Announce Type: cross Abstract: Coordinating a team of heterogeneous agents to complete tasks with unknown requirements is a challenging multi-agent planning problem. Agents differ in their ability to discover task requirements and in their ability to engage tasks, so the planner must coordinate task discovery, execution, and staging. This paper introduces a hierarchical planner that uses a graph neural network policy to assign actions to agents, then finds a path to the action's location using a shortest-path algorithm. The central part of our approach is the CAAT graph, which is a graph representation of the planning context consisting of the agents, tasks, capabilities, and actions. We demonstrate that our learned planner can jointly coordinate a heterogeneous team to simultaneously discover task requirements and complete tasks in a shorter time compared to baselines that optimize task discovery and task engagement independently. Furthermore, we show that our policy can zero-shot plan on out-of-distribution settings by training only on an outdoor map then transferring without finetuning to an indoor map with more agents, tasks, and capabilities than seen during training.

同方向论文 · cs.MA

查看全部 →