The following publications are possibly variants of this publication:
- Multi-agent path finding with mutex propagationHan Zhang, Jiaoyang Li 0001, Pavel Surynek, T. K. Satish Kumar, Sven Koenig. ai, 311:103766, 2022. [doi]
- Multi-Agent Path Finding with Mutex PropagationHan Zhang, Jiaoyang Li 0001, Pavel Surynek, Sven Koenig, T. K. Satish Kumar. aips 2020: 323-332 [doi]
- Mutex Propagation in Multi-Agent Path Finding for Large AgentsHan Zhang, Yutong Li, Jiaoyang Li 0001, T. K. Satish Kumar, Sven Koenig. socs 2022: 249-253 [doi]
- Variants of Independence Detection in SAT-Based Optimal Multi-agent Path FindingPavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski. icaart 2018: 116-136 [doi]
- Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding ProblemPavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. socs 2018: 90-105 [doi]
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF SolverPavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski. icaart 2017: 85-95 [doi]
- Mutex reasoning in cooperative path finding modeled as propositional satisfiabilityPavel Surynek. iros 2013: 4326-4331 [doi]
- Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based ApproachPavel Surynek, Roni Stern, Eli Boyarski, Ariel Felner. jair, 73:553-618, 2022. [doi]
- Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SATPavel Surynek. socs 2021: 203-205 [doi]
- Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract)Pavel Surynek. socs 2022: 317-319 [doi]
- Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal VariantsPavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. socs 2017: 169-170 [doi]