Alert button
Picture for Pavel Surynek

Pavel Surynek

Alert button

Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding

Jan 20, 2023
Pavel Surynek

Figure 1 for Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
Figure 2 for Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
Figure 3 for Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
Figure 4 for Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
Viaarxiv icon

Heuristically Guided Compilation for Multi-Agent Path Finding

Dec 13, 2022
Pavel Surynek

Figure 1 for Heuristically Guided Compilation for Multi-Agent Path Finding
Figure 2 for Heuristically Guided Compilation for Multi-Agent Path Finding
Figure 3 for Heuristically Guided Compilation for Multi-Agent Path Finding
Figure 4 for Heuristically Guided Compilation for Multi-Agent Path Finding
Viaarxiv icon

Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters

Jul 06, 2022
Matouš Kulhan, Pavel Surynek

Figure 1 for Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters
Figure 2 for Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters
Figure 3 for Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters
Figure 4 for Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters
Viaarxiv icon

DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies

Nov 11, 2021
Martin Čapek, Pavel Surynek

Figure 1 for DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
Figure 2 for DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
Figure 3 for DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
Figure 4 for DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
Viaarxiv icon

Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities

Apr 23, 2021
Pavel Surynek

Viaarxiv icon

Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes

Mar 08, 2021
Pavel Surynek

Figure 1 for Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes
Figure 2 for Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes
Figure 3 for Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes
Figure 4 for Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes
Viaarxiv icon

Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering

Sep 10, 2020
Pavel Surynek

Figure 1 for Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
Figure 2 for Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
Figure 3 for Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
Figure 4 for Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
Viaarxiv icon

At-Most-One Constraints in Efficient Representations of Mutex Networks

Jun 10, 2020
Pavel Surynek

Figure 1 for At-Most-One Constraints in Efficient Representations of Mutex Networks
Figure 2 for At-Most-One Constraints in Efficient Representations of Mutex Networks
Figure 3 for At-Most-One Constraints in Efficient Representations of Mutex Networks
Figure 4 for At-Most-One Constraints in Efficient Representations of Mutex Networks
Viaarxiv icon

Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings

Apr 25, 2020
Pavel Surynek

Figure 1 for Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings
Figure 2 for Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings
Figure 3 for Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings
Figure 4 for Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings
Viaarxiv icon

Multi-Agent Path Finding with Capacity Constraints

Jul 21, 2019
Pavel Surynek, T. K. Satish Kumar, Sven Koenig

Figure 1 for Multi-Agent Path Finding with Capacity Constraints
Figure 2 for Multi-Agent Path Finding with Capacity Constraints
Figure 3 for Multi-Agent Path Finding with Capacity Constraints
Figure 4 for Multi-Agent Path Finding with Capacity Constraints
Viaarxiv icon