Migrating techniques from search-based multi-agent path finding solvers to SAT-based approach

DOI10.1613/JAIR.1.13318MaRDI QIDQ5076310zbMATH OpenOpenAlexFDO

Authors Pavel Surynek, Roni Stern, Eli Boyarski, Ariel Felner

Publication date 16 May 2022

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.13318

zbMATH Keywords

constraint satisfactionplanningproblem solvingsatisfiability

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective
• Conflict-based search for optimal multi-agent pathfinding
• Branch-and-cut-and-price for multi-agent path finding
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• The increasing cost tree search for optimal multi-agent pathfinding

Cited in

(5)

• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• Multi-agent path finding with mutex propagation
• scientific article; zbMATH DE number 1927173 (Why is no real title available?)
• Multi-Agent Path Finding: A New Boolean Encoding
• Shadoks Approach to Low-Makespan Coordinated Motion Planning

This page was built for publication: Migrating techniques from search-based multi-agent path finding solvers to SAT-based approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076310)