无人机与地面机器人协同任务分配,无需中心控制却能高效避冲突。
HIPPO-MAT: Decentralized Task Allocation Using GraphSAGE and Multi-Agent Deep Reinforcement Learning
- 用GraphSAGE和IPPO实现各智能体独立学习与决策。
- 30个智能体下成功率达92.5%,仅比中心化方法差16.49%。
- 适合复杂动态环境中的分布式自主系统,如救援或巡检。
本文解决异构多智能体系统中的去中心化连续任务分配问题。提出新型框架HIPPO-MAT,结合GraphSAGE架构的图神经网络为各智能体生成独立嵌入,并采用独立近端策略优化(IPPO)进行多智能体深度强化学习。无人机(UAVs)与地面机器人(UGVs)通过通信通道共享聚合观测数据,各自处理输入以生成丰富状态嵌入。该设计使系统在三维网格环境中实现动态、成本最优且冲突感知的任务分配,无需中央协调。引入改进的A*路径规划器实现高效路径规划与避撞。仿真测试表明,系统可扩展至30个智能体,单步处理时间仅0.32秒;初步在JetBot ROS AI机器人上验证,每台运行于Jetson Nano,通过ESP32-S3的ESP-NOW协议通信,结合同步定位与地图构建(SLAM)。实验显示,本方法达成92.5%的无冲突成功率,相较中心化匈牙利算法仅落后16.49%,优于基于贪心策略的去中心化基线。框架具备良好可扩展性与对动态任务的鲁棒响应能力。
原文摘要 · Abstract (English)
This paper tackles decentralized continuous task allocation in heterogeneous multi-agent systems. We present a novel framework HIPPO-MAT that integrates graph neural networks (GNN) employing a GraphSAGE architecture to compute independent embeddings on each agent with an Independent Proximal Policy Optimization (IPPO) approach for multi-agent deep reinforcement learning. In our system, unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) share aggregated observation data via communication channels while independently processing these inputs to generate enriched state embeddings. This design enables dynamic, cost-optimal, conflict-aware task allocation in a 3D grid environment without the need for centralized coordination. A modified A* path planner is incorporated for efficient routing and collision avoidance. Simulation experiments demonstrate scalability with up to 30 agents and preliminary real-world validation on JetBot ROS AI Robots, each running its model on a Jetson Nano and communicating through an ESP-NOW protocol using ESP32-S3, which confirms the practical viability of the approach that incorporates simultaneous localization and mapping (SLAM). Experimental results revealed that our method achieves a high 92.5% conflict-free success rate, with only a 16.49% performance gap compared to the centralized Hungarian method, while outperforming the heuristic decentralized baseline based on greedy approach. Additionally, the framework exhibits scalability with up to 30 agents with allocation processing of 0.32 simulation step time and robustness in responding to dynamically generated tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。