Research map / Multi-agent systems and games / Human-AI and goal-conditioned
Neural Neighborhood Search for Multi-agent Path Finding
Zhongxia Yan, Cathy Wu
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes a learning-guided large neighborhood search for multi-agent path finding that uses a neural model to choose subproblems to re-plan.
Problem
Multi-agent path finding (MAPF): planning optimal collision-free paths for many agents, where the combined spatiotemporal and time-restricted nature makes decomposition into subproblems hard.
Approach
Learning-based guidance of decomposition into subproblems for MAPF, framed as neural neighborhood search; the abstract is truncated so the specific mechanism is not fully stated.
Closest papers by meaning
- MAPF-GPT: Imitation Learning for Multi-Agent Pathfinding at Scale (AAAI 2025 · similarity 0.92)
- LNS2+RL: Combining Multi-agent Reinforcement Learning with Large Neighborhood Search in Multi-agent Path Finding (AAAI 2025 · similarity 0.91)
- Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search (AAAI 2024 · similarity 0.90)
- Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI 2024 · similarity 0.90)
- Learn to Follow: Decentralized Lifelong Multi-Agent Pathfinding via Planning and Learning (AAAI 2024 · similarity 0.90)
- Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic (AAAI 2025 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
