Multi-Agent Path Finding: A New Boolean Encoding

DOI10.1613/JAIR.1.13818MaRDI QIDQ5041021zbMATH OpenOpenAlexFDO

Authors Roberto Asín Achá, Rodrigo López, Sebastian Hagedorn, J. A. Baier

Publication date 18 October 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.13818

zbMATH Keywords

logic programmingsatisfiabilitysearch multi-agent systems

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Migrating techniques from search-based multi-agent path finding solvers to SAT-based approach
• Conflict-based search for optimal multi-agent pathfinding
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• scientific article; zbMATH DE number 5959974
• Pairwise symmetry reasoning for multi-agent path finding search

Cited in

(3)

• The increasing cost tree search for optimal multi-agent pathfinding
• Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective
• Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits

This page was built for publication: Multi-Agent Path Finding: A New Boolean Encoding

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