Moving Forward in Formation: A Decentralized Hierarchical Learning Approach to Multi-Agent Moving Together
Not on the map. Why?
Abstract (arXiv)
Multi-agent path finding in formation has many potential real-world applications like mobile warehouse robots. However, previous multi-agent path finding (MAPF) methods hardly take formation into consideration. Furthermore, they are usually centralized planners and require the whole state of the environment. Other decentralized partially observable approaches to MAPF are reinforcement learning (RL) methods. However, these RL methods encounter difficulties when learning path finding and formation problem at the same time. In this paper, we propose a novel decentralized partially observable RL algorithm that uses a hierarchical structure to decompose the multi objective task into unrelated ones. It also calculates a theoretical weight that makes every task reward has equal influence on the final RL value function. Additionally, we introduce a communication method that helps agents cooperate with each other. Experiments in simulation show that our method outperforms other end-to-end RL methods and our method can naturally scale to large world sizes where centralized planner struggles. We also deploy and validate our method in a real world scenario.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2.
4 papers.
- 2024MFC-EQ: Mean-Field Control with Envelope Q-Learning for Moving Decentralized Agents in Formationcited by 1
- 2023Adaptive Value Decomposition with Greedy Marginal Contribution Computation for Cooperative Multi-Agent Reinforcement Learningcited by 0
- 2025PRISM: Complete Online Decentralized Multi-Agent Pathfinding with Rapid Information Sharing using Motion Constraintscited by 0
- 2025An Analysis of Constraint-Based Multi-Agent Pathfinding Algorithmscited by 0
- 2025An Analysis of Constraint-Based Multi-Agent Pathfinding Algorithms23 Nov 2025
- 2025PRISM: Complete Online Decentralized Multi-Agent Pathfinding with Rapid Information Sharing using Motion Constraints12 May 2025
- 2024MFC-EQ: Mean-Field Control with Envelope Q-Learning for Moving Decentralized Agents in Formation15 Oct 2024
- 2023Adaptive Value Decomposition with Greedy Marginal Contribution Computation for Cooperative Multi-Agent Reinforcement Learning14 Feb 2023