mlsanityData to 7 Oct 2026

Decentralized Master-Mind: Joint Action Refinement through Iterative Intent Denoising in Multi-Agent Pathfinding

arXiv 2609.32019 ↗First posted 25 Sep 2026cs.AI cs.MAcited by 0

Not on the map. Why?

Abstract (arXiv)

Decentralized multi-agent path finding (MAPF) with communication requires agents to reach individual goals without collisions under partial observability. Learnable policies trained on expert data provide an effective approach to this problem. However, when several coordinated joint actions are valid in the same context, independently sampling from per-agent distributions can recombine locally valid choices into incompatible joint actions. This failure can arise from the final sampling mechanism even when the per-agent action distributions are learned correctly. DMM (Decentralized Master-Mind) addresses this by replacing one-shot action sampling with discrete, iterative refinement of action intents across communication rounds, inspired by denoising in diffusion models. Agents initialize random action intents and refine them through local communication, coupling their choices before commitment. DMM is pretrained with imitation learning on expert MAPF solutions and further optimized with MICPO, a critic-free group-relative reinforcement-learning method designed for multi-agent, multi-round action refinement. DMM generally achieves higher success rates and lower solution costs than the evaluated learnable baselines. On 1,600 MovingAI tasks, DMM fine-tuned with MICPO solves 1,598, the highest coverage among the evaluated methods, while achieving solution costs close to those of the strongest baselines. DMM also scales to over one million simultaneously acting agents in obstacle-rich environments. These results show that round-level intent refinement can improve joint-action coordination while preserving decentralized execution.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 42 of its 60 references that are in the map. First posted on arXiv 25 Sep 2026.

Builds on

42 of 60 references.

References · 42

  1. 2017Attention Is All You Needcited by 59,932
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  3. 2021Perceiver: General Perception with Iterative Attentioncited by 1,089
  4. 2016Learning to Communicate with Deep Multi-Agent Reinforcement Learningcited by 561
  5. 2017Non-Autoregressive Neural Machine Translationcited by 457
  6. 2025Group-in-Group Policy Optimization for LLM Agent Trainingcited by 442
  7. 2016Learning Multiagent Communication with Backpropagationcited by 355
  8. 2013The Complexity of Decentralized Control of Markov Decision Processescited by 225
  9. 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 197
  10. 2026GDPO: Group reward-Decoupled Normalization Policy Optimization for Multi-reward RL Optimizationcited by 175
  11. 2018PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learningcited by 89
  12. 2018Searching with Consistent Prioritization for Multi-Agent Path Findingcited by 80
30 more
  1. 2023MADiff: Offline Multi-agent Learning with Diffusion Modelscited by 73
  2. 2022LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfindingcited by 50
  3. 2025LLM Collaboration With Multi-Agent Reinforcement Learningcited by 47
  4. 2020Message-Aware Graph Attention Networks for Large-Scale Multi-Robot Path Planningcited by 41
  5. 2025Simultaneous Multi-Robot Motion Planning with Projected Diffusion Modelscited by 37
  6. 2023SCRIMP: Scalable Communication for Reinforcement- and Imitation-Learning-Based Multi-Agent Pathfindingcited by 35
  7. 2021Learning Selective Communication for Multi-Agent Path Findingcited by 32
  8. 2021Distributed Heuristic Multi-Agent Path Finding with Communicationcited by 31
  9. 2022On the Learning of Non-Autoregressive Transformerscited by 27
  10. 2023Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learningcited by 27
  11. 2024POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfindingcited by 20
  12. 2022More Centralized Training, Still Decentralized Execution: Multi-Agent Conditional Policy Factorizationcited by 19
  13. 2024MAPF-GPT: Imitation Learning for Multi-Agent Pathfinding at Scalecited by 17
  14. 2023Decentralized Monte Carlo Tree Search for Partially Observable Multi-agent Pathfindingcited by 11
  15. 2024Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPFcited by 10
  16. 2025Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planningcited by 10
  17. 2024Deploying Ten Thousand Robots: Scalable Imitation Learning for Lifelong Multi-Agent Path Findingcited by 6
  18. 2023ALPHA: Attention-based Long-horizon Pathfinding in Highly-structured Areascited by 5
  19. 2024AgentMixer: Multi-Agent Correlated Policy Factorizationcited by 5
  20. 2025Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuningcited by 5
  21. 2025Graph Attention-Guided Search for Dense Multi-Agent Pathfindingcited by 5
  22. 2024Confidence-Based Curriculum Learning for Multi-Agent Path Findingcited by 3
  23. 2025AID: Agent Intent from Diffusion for Multi-Agent Informative Path Planningcited by 3
  24. 2026Pairwise is Not Enough: Hypergraph Neural Networks for Multi-Agent Pathfindingcited by 3
  25. 2026Simulation-Informed Diffusion for Decentralized Multi-robot Motion Planningcited by 3
  26. 2026Diffusing to Coordinate: Efficient Online Multi-Agent Diffusion Policiescited by 2
  27. 2025Local Guidance for Configuration-Based Multi-Agent Pathfindingcited by 1
  28. 2026Learning to Communicate Locally for Large-Scale Multi-Agent Pathfindingcited by 1
  29. 2026Discrete Diffusion for Complex and Congested Multi-Agent Path Finding with Sparse Social Attentioncited by 1
  30. 2026PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3cited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026CoDiMAD: Diffusion-Based Privileged Distillation for Communication-Free Multi-Robot Coordination ↗
  2. 2025Multi-Agent Path Finding via Offline RL and LLM Collaboration
  3. 2026Residual Denoising Enables Sample-Efficient Multi-Agent Coordination on Demand ↗
  4. 2024HiMAP: Learning Heuristics-Informed Policies for Large-Scale Multi-Agent Pathfinding
  5. 2026Coordinated Diffusion: Generating Multi-Agent Behavior Without Multi-Agent Demonstrations
  6. 2026Learning Communication-Conditioned Generative Policies for Decentralized Multi-Agent Collision Avoidance ↗
  7. 2019Decentralized Multi-Agents by Imitation of a Centralized Controller
  8. 2026Decentralized Diffusion Policy Learning for Enhanced Exploration in Cooperative Multi-agent Reinforcement Learning