mlsanityData to 7 Oct 2026

SACHA: Soft Actor-Critic with Heuristic-Based Attention for Partially Observable Multi-Agent Path Finding

arXiv 2307.02691 ↗First posted 5 Jul 2023cs.RO cs.AI cs.MAcited by 6

Not on the map. Why?

Abstract (arXiv)

Multi-Agent Path Finding (MAPF) is a crucial component for many large-scale robotic systems, where agents must plan their collision-free paths to their given goal positions. Recently, multi-agent reinforcement learning has been introduced to solve the partially observable variant of MAPF by learning a decentralized single-agent policy in a centralized fashion based on each agent's partial observation. However, existing learning-based methods are ineffective in achieving complex multi-agent cooperation, especially in congested environments, due to the non-stationarity of this setting. To tackle this challenge, we propose a multi-agent actor-critic method called Soft Actor-Critic with Heuristic-Based Attention (SACHA), which employs novel heuristic-based attention mechanisms for both the actors and critics to encourage cooperation among agents. SACHA learns a neural network for each agent to selectively pay attention to the shortest path heuristic guidance from multiple agents within its field of view, thereby allowing for more scalable learning of cooperation. SACHA also extends the existing multi-agent actor-critic framework by introducing a novel critic centered on each agent to approximate Q-values. Compared to existing methods that use a fully observable critic, our agent-centered multi-agent actor-critic method results in more impartial credit assignment and better generalizability of the learned policy to MAPF instances with varying numbers of agents and types of environments. We also implement SACHA(C), which embeds a communication module in the agent's policy network to enable information exchange among agents. We evaluate both SACHA and SACHA(C) on a variety of MAPF instances and demonstrate decent improvements over several state-of-the-art learning-based MAPF methods with respect to success rate and solution quality.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 18 of its 33 references that are in the map. First posted on arXiv 5 Jul 2023.

Builds on

18 of 33 references.

References · 18

  1. 2017Attention Is All You Needcited by 59,932
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  4. 2015Continuous control with deep reinforcement learningcited by 3,279
  5. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  6. 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,519
  7. 2017Counterfactual Multi-Agent Policy Gradientscited by 733
  8. 2018Actor-Attention-Critic for Multi-Agent Reinforcement Learningcited by 259
  9. 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 197
  10. 2015Multiagent Cooperation and Competition with Deep Reinforcement Learningcited by 180
  11. 2019A Review of Cooperative Multi-Agent Deep Reinforcement Learningcited by 147
  12. 2018PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learningcited by 89
6 more
  1. 2018Searching with Consistent Prioritization for Multi-Agent Path Findingcited by 80
  2. 2020Lifelong Multi-Agent Path Finding in Large-Scale Warehousescited by 79
  3. 2021Heuristic-Guided Reinforcement Learningcited by 41
  4. 2021Learning Selective Communication for Multi-Agent Path Findingcited by 32
  5. 2021Distributed Heuristic Multi-Agent Path Finding with Communicationcited by 31
  6. 2020MAPPER: Multi-Agent Path Planning with Evolutionary Reinforcement Learning in Mixed Dynamic Environmentscited by 26

Built on by

Cited by year

Citing papers per year: 2024: 5; 2025: 1.

6 papers.