Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective

von Surynek, Pavel
Veröffentlicht in RCAI (18. : 2020 : Moskau) Artificial intelligence (2020)

MULTI-GOAL MULTI-AGENT PATH FINDING VIA DECOUPLED AND INTEGRATED GOAL VERTEX ORDERING

von Surynek, Pavel
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT)

von Surynek, Pavel
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

Unifying Search-Based and Compilation-Based Approaches co Multi-Agent Path Finding through Satisfiability Modulo Theories

von Surynek, Pavel
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

CONCEPTUAL COMPARISON OF COMPILATION-BASED SOLVERS FOR MULTI-AGENT PATH FINDING: MIP VS. SAT

von Surynek, Pavel
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective

von Surynek, Pavel
Veröffentlicht in KI (Veranstaltung : 43. : 2020 : Online) KI 2020: advances in artificial intelligence (2020)

Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT)

von Surynek, Pavel
Veröffentlicht in ICAART (12. : 2020 : Valletta) Agents and artificial intelligence (2021)

Multi-agent Path Finding with Generalized Conflicts: An Experimental Study

von Surynek, Pavel
Veröffentlicht in ICAART (11. : 2019 : Prag) Agents and artificial intelligence (2019)

SUM OF COSTS OPTIMAL MULTI-AGENT PATH FINDING WITH CONTINUOUS TIME VIA SATISFIABILITY MODULO THEORIES

von Surynek, Pavel
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared

von Surynek, Pavel
Veröffentlicht in ICAART (12. : 2020 : Valletta) ICAART 2020 ; Volume 2 (2020)

Hierarchical Control of Swarms during Evacuation

von Janovská, Kristyna
Veröffentlicht in KEOD (13. : 2021 : Online) IC3K 2021 ; Volume 2: KEOD (2021)

Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding

von Selvek, Róbert
Veröffentlicht in IC3K (11. : 2019 : Wien) Knowledge discovery, knowledge engineering and knowledge management (2020)

DPLL(MAPF): AN INTEGRATION OF MULTI-AGENT PATH FINDING AND SAT SOLVING TECHNOLOGIES

von Capek, Martin
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

Near Optimal Solving of the (N2-1)-puzzle Using Heuristics Based on Artificial Neural Networks

von Cahlik, Vojtech
Veröffentlicht in IJCCI (11. : 2019 : Wien) Computational intelligence (2021)

Multi-agent Path Finding and Acting with Small Reflex-Based Mobile Robots

von Chudý, Ján
Veröffentlicht in ROBOVIS (2020 : Online) Robotics, computer vision and intelligent systems (2022)

Discovering implied constraints in precedence graphs with alternatives

von Barták, Roman
Veröffentlicht in Annals of operations research (2010)

Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem

von Surynek, Pavel
Veröffentlicht in International Symposium on Combinatorial Search (11. : 2018 : Stockholm) Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (2018)

Multi-Agent Path Finding with Mutex Propagation

von Zhang, Han
Veröffentlicht in ICAPS Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (2020)

Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) : 16-17 July 2019, Napa, California, USA

Veröffentlicht 2019

Mutex Propagation for SAT-based Multi-agent Path Finding

von Surynek, Pavel
Veröffentlicht in PRIMA (23. : 2020 : Online) PRIMA 2020: principles and practice of multi-agent systems (2021)