PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 28, 20250 citationsOpen Access

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

View Full Paper
LRLavanya RatnabalaSkolkovo Institute of Science and TechnologyRPRobinroy PeterSkolkovo Institute of Science and TechnologyAFAleksey FedoseevSkolkovo Institute of Science and Technology

Key Points

  • The method achieves a 92.5% conflict-free success rate, outperforming the heuristic decentralized baseline.
  • Using simulation experiments, the framework shows scalability with up to 30 agents while maintaining robust task allocation.
  • Dynamic task allocation is enabled without centralized coordination, utilizing communication among agents for shared observations.
  • A modified A* path planner is integrated for efficient routing and collision avoidance, enhancing operational effectiveness.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Ratnabala et al. (2025) studied this question.

synapsesocial.com/papers/68d90a0f41e1c178a14f6aaahttps://doi.org/10.48550/arxiv.2503.07662
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Multiagent Dynamic Task Allocation Based on Graph Neural Reinforcement Learning Algorithm2026
  2. 2Graph Neural Network for Decentralized Multi-Robot Goal Assignment2024 · 32 citations
  3. 3Agent Allocation-Action Learning with Dynamic Heterogeneous Graph in Multi-Task Games2024
  4. 4Efficient dynamic task allocation in multi-agent systems via coordinated graph representations2026
  5. 5Graph-Based Task Allocation for Multi-Agent Fleet Management: A Genetic Algorithm Approach with LLM Integration2026