The following publications are possibly variants of this publication:
- Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo TheoriesPavel Surynek. socs 2021: 200-202 [doi]
- Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs ObjectivePavel Surynek. rcai 2020: 85-99 [doi]
- Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT)Pavel Surynek. icaart 2021: 399-420 [doi]
- Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT)Pavel Surynek. socs 2019: 200-201 [doi]
- Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract)Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. atal 2016: 1435-1436 [doi]
- Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs ObjectivePavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. ecai 2016: 810-818 [doi]
- An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs ObjectivesPavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski. socs 2016: 145-147 [doi]
- On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches ComparedPavel Surynek. icaart 2020: 182-193 [doi]
- Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real ArithmeticTomás Kolárik, Stefan Ratschan, Pavel Surynek. icaart 2024: 47-58 [doi]