Modeling and solving the multi-agent pathfinding problem in picat

R Barták, NF Zhou, R Stern, E Boyarski… - 2017 IEEE 29th …, 2017 - ieeexplore.ieee.org
The multi-agent pathfinding (MAPF) problem has attracted considerable attention because
of its relation to practical applications. In this paper, we present a constraint-based …

[PDF][PDF] Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally.

P Surynek - IJCAI, 2015 - surynek.net
Solving cooperative path finding (CPF) by translating it to propositional satisfiability
represents a viable option in highly constrained situations. The task in CPF is to relocate …

Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems

P Surynek - Annals of Mathematics and Artificial Intelligence, 2017 - Springer
This paper deals with solving cooperative path finding (CPF) problems in a makespan-
optimal way. A feasible solution to the CPF problem lies in the moving of mobile agents …

Compact representations of cooperative path-finding as SAT based on matchings in bipartite graphs

P Surynek - 2014 IEEE 26th International Conference on Tools …, 2014 - ieeexplore.ieee.org
This paper addresses make span optimal solving of cooperative path-finding problem (CPF)
by translating it to propositional satisfiability (SAT). The task is to relocate set of agents to …

An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives

P Surynek, A Felner, R Stern, E Boyarski - Proceedings of the …, 2016 - ojs.aaai.org
In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple
agents. Recently, existing makespan optimal SAT-based solvers for MAPF have been …

Multi-agent path finding on real robots

R Barták, J Švancara, V Škopková, D Nohejl… - AI …, 2019 - content.iospress.com
Abstract The problem of Multi-Agent Path Finding (MAPF) is to find paths for a fixed set of
agents from their current locations to some desired locations in such a way that the agents …

Multi-agent path finding on real robots: First experience with ozobots

R Barták, J Švancara, V Škopková, D Nohejl - Advances in Artificial …, 2018 - Springer
Abstract The problem of Multi-Agent Path Finding (MAPF) is to find paths for a fixed set of
agents from their current locations to some desired locations in such a way that the agents …

[PDF][PDF] A Declarative Method for Dynamic Multi-Agent Path Finding.

A Bogatarkan, V Patoglu, E Erdem - GCAI, 2019 - easychair.org
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at
finding paths for multiple agents such that no two agents collide with each other. We study a …

[PDF][PDF] Problem Compilation for Multi-Agent Path Finding: a Survey.

P Surynek - IJCAI, 2022 - ijcai.org
Multi-agent path finding (MAPF) attracts considerable attention in the artificial intelligence
community. The task in the standard MAPF is to find discrete paths through which agents …

Explanation generation for multi-modal multi-agent path finding with optimal resource utilization using answer set programming

A Bogatarkan, E Erdem - Theory and Practice of Logic Programming, 2020 - cambridge.org
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at
finding paths for multiple agents (eg, robots) in an environment (eg, an autonomous …