research
∙
01/20/2023
Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
Counterexample guided abstraction refinement (CEGAR) represents a powerf...
share
research
∙
12/13/2022
Heuristically Guided Compilation for Multi-Agent Path Finding
Multi-agent path finding (MAPF) is a task of finding non-conflicting pat...
research
∙
07/05/2022
Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters
We study the planning and acting phase for the problem of multi-agent pa...
research
∙
11/11/2021
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
In multi-agent path finding (MAPF), the task is to find non-conflicting ...
research
∙
04/23/2021
Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities
Multi-agent path finding (MAPF) attracts considerable attention in artif...
research
∙
03/08/2021
Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes
Path planning for multiple robots (MRPP) represents a task of finding no...
research
∙
09/10/2020
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering
We introduce multi-goal multi agent path finding (MAPF^MG) which general...
research
∙
06/10/2020
At-Most-One Constraints in Efficient Representations of Mutex Networks
The At-Most-One (AMO) constraint is a special case of cardinality constr...
research
∙
04/25/2020
Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings
Multi-agent path finding in continuous space and time with geometric age...
research
∙
07/21/2019
Multi-Agent Path Finding with Capacity Constraints
In multi-agent path finding (MAPF) the task is to navigate agents from t...
research
∙
07/11/2019
On the Tour Towards DPLL(MAPF) and Beyond
We discuss milestones on the tour towards DPLL(MAPF), a multi-agent path...
research
∙
03/23/2019
Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)
This paper addresses a variant of multi-agent path finding (MAPF) in con...
research
∙
12/28/2018
A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach
In the multi-agent path finding problem (MAPF) we are given a set of age...
research
∙
09/16/2018
Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search
We address item relocation problems in graphs in this paper. We assume i...
research
∙
06/25/2018
Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT
We study practical approaches to solving the token swapping (TSWAP) prob...
research
∙
09/04/2017
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents
We address a problem of area protection in graph-based scenarios with mu...
research
∙
08/24/2017
Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense co
We address a problem of area protection in graph-based scenarios with mu...
research
∙
07/02/2017
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
In multi-agent path finding (MAPF) the task is to find non-conflicting p...
research
∙
10/18/2016
Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability
The problem of makespan optimal solving of cooperative path finding (CPF...
research
∙
10/17/2016
