Table of Contents
Fetching ...

HIPPO-MAT: Decentralized Task Allocation Using GraphSAGE and Multi-Agent Deep Reinforcement Learning

Lavanya Ratnabala, Robinroy Peter, Aleksey Fedoseev, Dzmitry Tsetserukou

TL;DR

The paper tackles decentralized continuous task allocation for heterogeneous agents operating in a 3D environment. It introduces HIPPO-MAT, a framework that fuses GraphSAGE-based per-agent embeddings with Independent PPO (IPPO) and a reservation-based A* path planner to enable concurrent, conflict-aware task assignments without centralized control. Experiments show a conflict-free rate of 92.5% and a travel-time gap of about 16.5% relative to the centralized Hungarian method, with real-world validation on JetBot ROS AI Robots and 0.32 simulation-step allocation times, demonstrating practical viability. The work demonstrates scalability to at least $N=30$ agents and robustness to sensor noise and communication delays, offering a scalable solution for real-time decentralized multi-agent task allocation.

Abstract

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.

HIPPO-MAT: Decentralized Task Allocation Using GraphSAGE and Multi-Agent Deep Reinforcement Learning

TL;DR

The paper tackles decentralized continuous task allocation for heterogeneous agents operating in a 3D environment. It introduces HIPPO-MAT, a framework that fuses GraphSAGE-based per-agent embeddings with Independent PPO (IPPO) and a reservation-based A* path planner to enable concurrent, conflict-aware task assignments without centralized control. Experiments show a conflict-free rate of 92.5% and a travel-time gap of about 16.5% relative to the centralized Hungarian method, with real-world validation on JetBot ROS AI Robots and 0.32 simulation-step allocation times, demonstrating practical viability. The work demonstrates scalability to at least agents and robustness to sensor noise and communication delays, offering a scalable solution for real-time decentralized multi-agent task allocation.

Abstract

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.

Paper Structure

This paper contains 21 sections, 8 equations, 7 figures, 4 tables.

Figures (7)

  • Figure 1: Jetbot ROS AI Robots equipped with Jetson Nano for individual policy loading and ESP32-S3 for inter-agent communication.
  • Figure 2: Multi-agent reinforcement learning and GraphSAGE architecture for task allocation.
  • Figure 3: Simulation environment in PyBullet. Agents navigate with dynamic task assignments and obstacles.
  • Figure 4: Experimental setup to test the model in Jetbot ROS AI robots equipped with Jetson Nano for individual policy loading and ESP32-S3 for inter-agent communication.
  • Figure 5: Environment mapping by Jetbot ROS AI robot.
  • ...and 2 more figures