Skip to content
Review

A Survey of ASP and SAT Encodings for Multi-Agent Pathfinding: Working Abstract

· 0 citations · 12 references

TL;DR

The ongoing work on examining various declarative MAPF encodings from the literature is summarized and some preliminary empirical results are presented, including some preliminary empirical results from Conflict-Based-Search.

View source

Similar papers

Preprint Oct 2026

The Cost of Classical Multi-Agent Path Finding

Insight is provided on when classical MAPF is a reasonable simplification, and when MAPF$_R$ unlocks significantly higher-quality solutions.

Alvin Combrink, S. Roselli, Martin Fabian · 0 citations
Open access Sep 2026

Solving the Multi-Agent Path Finding Problem Using a Hierarchical Multi-Resolution Planner

A hierarchical, reservation-based, multi-resolution planner for discrete-time grid environments, including deadline-aware priority guidelines to resolve reservation contention, boundary-based validation of abstract connectivity to avoid phantom links, and a wait-and-retry fallback when planning temporarily fails are pr...

Gicu Rata, Liviu Octavian Mafteiu-Scai · 0 citations
#artificial intelligence Preprint Oct 2026

A Hyper-Logical View on Multi-Agent Path Planning

This paper shows that many MAPP variants can be modeled in HyperLTL, a temporal logic that reasons about multiple paths and their evolution through time, and in its omega-regular extension HyperQPTL, a complementary, specification-centered view.

H. Frenkel, Dor Atzmon · 0 citations
Preprint Sep 2026

Solving Multi-Agent Sokoban via LaCAM

Sokoban, a puzzle game in which an agent pushes boxes onto unlabelled target locations in a grid world, is a long-standing benchmark planning problem. While it is easy to see the connection to practical applications such as warehouse logistics with autonomous forklifts, its multi-agent counterpart has remained underdev...

Keisuke Okumura · 0 citations
#artificial intelligence Preprint Oct 2026

Shared-Roadmap Generation and Evaluator for Multi-Agent Path Planning Using Heterogeneous Graph Neural Network

Multi-agent path planning (MAPP) in continuous environments often relies on roadmaps to balance safety and search efficiency. However, traditional roadmap generation methods, such as lattice grids or standard sampling-based approaches, frequently face a trade-off between graph density and the likelihood of finding feas...

Brandon Ho, Nikola Rogers, Seung-Kyum Choi · 0 citations
Preprint Oct 2026

Graph-Based Heuristics for Minimum Constraint Removal in Cluttered Robot Motion Planning

Humanoid and service robots operating in clut- tered human environments may encounter motion planning problems that are infeasible when all surrounding objects are treated as fixed obstacles. The Minimum Constraint Removal problem, which we refer to as MCR, addresses this situation by identifying the minimum number of...

Antony Thomas, Fulvio Mastrogiovanni, M. Baglietto · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.