MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using
Shortest Path Embeddings
- URL: http://arxiv.org/abs/2102.12461v1
- Date: Wed, 24 Feb 2021 18:41:37 GMT
- Title: MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using
Shortest Path Embeddings
- Authors: Jingyao Ren, Vikraman Sathiyanarayanan, Eric Ewing, Baskin Senbaslar
and Nora Ayanian
- Abstract summary: Solving the Multi-Agent Path Finding (MAPF) problem optimally is known to be NP-Hard for both make-span and total arrival time minimization.
There is no dominating optimal MAPF algorithm that works well in all types of problems and no standard guidelines for when to use which algorithm.
We develop the deep convolutional network MAPFAST, which takes a MAPF problem instance and attempts to select the fastest algorithm to use from a portfolio of algorithms.
- Score: 6.223269541026908
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Solving the Multi-Agent Path Finding (MAPF) problem optimally is known to be
NP-Hard for both make-span and total arrival time minimization. While many
algorithms have been developed to solve MAPF problems, there is no dominating
optimal MAPF algorithm that works well in all types of problems and no standard
guidelines for when to use which algorithm. In this work, we develop the deep
convolutional network MAPFAST (Multi-Agent Path Finding Algorithm SelecTor),
which takes a MAPF problem instance and attempts to select the fastest
algorithm to use from a portfolio of algorithms. We improve the performance of
our model by including single-agent shortest paths in the instance embedding
given to our model and by utilizing supplemental loss functions in addition to
a classification loss. We evaluate our model on a large and diverse dataset of
MAPF instances, showing that it outperforms all individual algorithms in its
portfolio as well as the state-of-the-art optimal MAPF algorithm selector. We
also provide an analysis of algorithm behavior in our dataset to gain a deeper
understanding of optimal MAPF algorithms' strengths and weaknesses to help
other researchers leverage different heuristics in algorithm designs.
Related papers
- Algorithm Selection for Optimal Multi-Agent Path Finding via Graph Embedding [9.831879504969224]
Multi-agent path finding (MAPF) is the problem of finding paths for multiple agents such that they do not collide.
Finding optimal solutions to MAPF is NP-Hard, yet modern optimal solvers can scale to hundreds of agents and even thousands in some cases.
We show how this encoding can be effectively joined with existing encodings, resulting in a novel AS method we call MAPF Algorithm selection via Graph embedding.
arXiv Detail & Related papers (2024-06-16T07:41:58Z) - Scalable Mechanism Design for Multi-Agent Path Finding [87.40027406028425]
Multi-Agent Path Finding (MAPF) involves determining paths for multiple agents to travel simultaneously and collision-free through a shared area toward given goal locations.
Finding an optimal solution is often computationally infeasible, making the use of approximate, suboptimal algorithms essential.
We introduce the problem of scalable mechanism design for MAPF and propose three strategyproof mechanisms, two of which even use approximate MAPF algorithms.
arXiv Detail & Related papers (2024-01-30T14:26:04Z) - Deep Unrolling for Nonconvex Robust Principal Component Analysis [75.32013242448151]
We design algorithms for Robust Component Analysis (A)
It consists in decomposing a matrix into the sum of a low Principaled matrix and a sparse Principaled matrix.
arXiv Detail & Related papers (2023-07-12T03:48:26Z) - Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path
Finding [25.11387753357413]
We study the multi-goal task assignment and path finding (MG-TAPF) problem from theoretical and algorithmic perspectives.
Theoretically, we prove that the MG-TAPF problem is NP-hard to solve optimally.
We present algorithms that build upon algorithmic techniques for the multi-agent path finding problem and solve the MG-TAPF problem optimally and bounded-suboptimally.
arXiv Detail & Related papers (2022-08-02T03:17:29Z) - Machine Learning for Online Algorithm Selection under Censored Feedback [71.6879432974126]
In online algorithm selection (OAS), instances of an algorithmic problem class are presented to an agent one after another, and the agent has to quickly select a presumably best algorithm from a fixed set of candidate algorithms.
For decision problems such as satisfiability (SAT), quality typically refers to the algorithm's runtime.
In this work, we revisit multi-armed bandit algorithms for OAS and discuss their capability of dealing with the problem.
We adapt them towards runtime-oriented losses, allowing for partially censored data while keeping a space- and time-complexity independent of the time horizon.
arXiv Detail & Related papers (2021-09-13T18:10:52Z) - Parallel Surrogate-assisted Optimization Using Mesh Adaptive Direct
Search [0.0]
We present a method that employs surrogate models and concurrent computing at the search step of the mesh adaptive direct search (MADS) algorithm.
We conduct numerical experiments to assess the performance of the modified MADS algorithm with respect to available CPU resources.
arXiv Detail & Related papers (2021-07-26T18:28:56Z) - Memory-Based Optimization Methods for Model-Agnostic Meta-Learning and
Personalized Federated Learning [56.17603785248675]
Model-agnostic meta-learning (MAML) has become a popular research area.
Existing MAML algorithms rely on the episode' idea by sampling a few tasks and data points to update the meta-model at each iteration.
This paper proposes memory-based algorithms for MAML that converge with vanishing error.
arXiv Detail & Related papers (2021-06-09T08:47:58Z) - A bi-level encoding scheme for the clustered shortest-path tree problem
in multifactorial optimization [1.471992435706872]
The Clustered Shortest-Path Tree Problem (CluSPT) plays an important role in various types of optimization problems in real-life.
Recently, some Multifactorial Evolutionary Algorithm (MFEA) have been introduced to deal with the CluSPT.
This paper describes a MFEA-based approach to solve the CluSPT.
arXiv Detail & Related papers (2021-02-12T13:36:07Z) - Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
This paper investigates the classical integer least-squares problem which estimates signals integer from linear models.
The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning.
We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
arXiv Detail & Related papers (2021-01-07T08:00:02Z) - Adaptive Sampling for Best Policy Identification in Markov Decision
Processes [79.4957965474334]
We investigate the problem of best-policy identification in discounted Markov Decision (MDPs) when the learner has access to a generative model.
The advantages of state-of-the-art algorithms are discussed and illustrated.
arXiv Detail & Related papers (2020-09-28T15:22:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.