3 citations · 12 across the 18 of their papers we have counts for
17 papers · 1 filter
Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
Pavel Surynek
Counterexample guided abstraction refinement (CEGAR) represents a powerful symbolic technique for various tasks such as model checking and reachability analysis. Recently, CEGAR co…
Heuristically Guided Compilation for Multi-Agent Path Finding
Pavel Surynek
Multi-agent path finding (MAPF) is a task of finding non-conflicting paths connecting agents' specified initial and goal positions in a shared environment. We focus on compilation-…
Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters
Matouš Kulhan, Pavel Surynek
We study the planning and acting phase for the problem of multi-agent path finding (MAPF) in this paper. MAPF is a problem of navigating agents from their start positions to specif…
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
Martin Čapek, Pavel Surynek
In multi-agent path finding (MAPF), the task is to find non-conflicting paths for multiple agents from their initial positions to given individual goal positions. MAPF represents a…
Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities
Pavel Surynek
Multi-agent path finding (MAPF) attracts considerable attention in artificial intelligence community as well as in robotics, and other fields such as warehouse logistics. The task…
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
Pavel Surynek
We introduce multi-goal multi agent path finding (MAPF) which generalizes the standard discrete multi-agent path finding (MAPF) problem. While the task in MAPF is to navigat…
At-Most-One Constraints in Efficient Representations of Mutex Networks
Pavel Surynek
The At-Most-One (AMO) constraint is a special case of cardinality constraint that requires at most one variable from a set of Boolean variables to be set to TRUE. AMO is important…
Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings
Pavel Surynek
Multi-agent path finding in continuous space and time with geometric agents MAPF is addressed in this paper. The task is to navigate agents that move smoothly between…
On the Tour Towards DPLL(MAPF) and Beyond
Pavel Surynek
We discuss milestones on the tour towards DPLL(MAPF), a multi-agent path finding (MAPF) solver fully integrated with the Davis-Putnam-Logemann-Loveland (DPLL) propositional satisfi…
Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)
Pavel Surynek
This paper addresses a variant of multi-agent path finding (MAPF) in continuous space and time. We present a new solving approach based on satisfiability modulo theories (SMT) to o…
A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach
Pavel Surynek
In the multi-agent path finding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths for all agents while avoiding c…
Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search
Pavel Surynek
We address item relocation problems in graphs in this paper. We assume items placed in vertices of an undirected graph with at most one item per vertex. Items can be moved across e…
Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT
Pavel Surynek
We study practical approaches to solving the token swapping (TSWAP) problem optimally in this short paper. In TSWAP, we are given an undirected graph with colored vertices. A color…
Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination
Marika Ivanová, Pavel Surynek
We address a problem of area protection in graph-based scenarios with multiple agents. The problem consists of two adversarial teams of agents that move in an undirected graph shar…
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
Pavel Surynek, Ariel Felner, Roni Stern +1
In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-cos…
Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability
Pavel Surynek
The problem of makespan optimal solving of cooperative path finding (CPF) is addressed in this paper. The task in CPF is to relocate a group of agents in a non-colliding way so tha…
Improvements in Sub-optimal Solving of the -Puzzle via Joint Relocation of Pebbles and its Applications to Rule-based Cooperative Path-Finding
Pavel Surynek, Petr Michalík
The problem of solving -puzzle and cooperative path-finding (CPF) sub-optimally by rule based algorithms is addressed in this manuscript. The task in the puzzle is to rear…