Multi-agent path finding with mutex propagation

DOI10.1016/j.artint.2022.103766OpenAlexW3038106444MaRDI QIDQ2082515

Jiaoyang Li, Sven Koenig, Pavel Surynek, T. K. Satish Kumar, Han Zhang

Publication date: 4 October 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2022.103766

zbMATH Keywords

heuristic searchsatisfiability solvingmulti-agent path finding

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Uses Software

• Chaff
• Graphplan
• Glucose

Cites Work

• The increasing cost tree search for optimal multi-agent pathfinding
• Consistency in networks of relations
• Fast planning through planning graph analysis
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• Conflict-based search for optimal multi-agent pathfinding
• Detecting Cardinality Constraints in CNF
• Towards Robust CNF Encodings of Cardinality Constraints
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Multi-agent path finding with mutex propagation