Multi-agent deep reinforcement learning for multi-robot applications: A survey

J Orr, A Dutta - Sensors, 2023 - mdpi.com
Deep reinforcement learning has produced many success stories in recent years. Some
example fields in which these successes have taken place include mathematics, games …

[PDF][PDF] Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems

O Salzman, R Stern - Proceedings of the 19th International Conference …, 2020 - ifaamas.org
Recent years have shown a large increase in applications and research of problems that
include moving a fleet of physical robots. One particular application that is currently a multi …

Structure and intractability of optimal multi-robot path planning on graphs

J Yu, S LaValle - Proceedings of the AAAI Conference on Artificial …, 2013 - ojs.aaai.org
In this paper, we study the structure and computational complexity of optimal multi-robot path
planning problems on graphs. Our results encompass three formulations of the discrete multi …

Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges

A Felner, R Stern, S Shimony, E Boyarski… - Proceedings of the …, 2017 - ojs.aaai.org
Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this
research area, numerous diverse search-based techniques were developed in the past 6 …

Multi-agent pathfinding with continuous time

A Andreychuk, K Yakovlev, P Surynek, D Atzmon… - Artificial Intelligence, 2022 - Elsevier
Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that each agent reaches its goal and the agents do not collide. In recent years, variants …

The increasing cost tree search for optimal multi-agent pathfinding

G Sharon, R Stern, M Goldenberg, A Felner - Artificial intelligence, 2013 - Elsevier
We address the problem of optimal pathfinding for multiple agents. Given a start state and a
goal state for each of the agents, the task is to find minimal paths for the different agents …

Efficient SAT approach to multi-agent path finding under the sum of costs objective

P Surynek, A Felner, R Stern, E Boyarski - ECAI 2016, 2016 - ebooks.iospress.nl
In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple
agents. In this paper we present the first SAT-solver for the sum-of-costs variant of MAPF …

Multi-agent path finding–an overview

R Stern - Artificial Intelligence: 5th RAAI Summer School …, 2019 - Springer
Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that every agent reaches its goal and the agents do not collide. In recent years, there …

Planning optimal paths for multiple robots on graphs

J Yu, SM LaValle - 2013 IEEE International Conference on …, 2013 - ieeexplore.ieee.org
In this paper, we study the problem of optimal multi-robot path planning (MPP) on graphs.
We propose two multiflow based integer linear programming (ILP) models that compute …

On the complexity of quantum circuit compilation

A Botea, A Kishimoto, R Marinescu - Proceedings of the International …, 2018 - ojs.aaai.org
Quantum circuit compilation (QCC) is an important problem in the emerging field of quantum
computing. The problem has a strong relevance to combinatorial search, as solving …