AI Paper Atlas

Research map / Multi-agent systems and games / Human-AI and goal-conditioned

Neural Neighborhood Search for Multi-agent Path Finding

Zhongxia Yan, Cathy Wu

ICLR 2024 · Multi-agent systems and games › Human-AI and goal-conditioned · approach: Learning-guided MAPF search · 0 citations (OpenAlex)

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

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy