loading
Papers

Research.Publish.Connect.

Paper

Authors: Jiří Švancara and Roman Barták

Affiliation: Charles University, Faculty of Mathematics and Physics, Prague and Czech Republic

ISBN: 978-989-758-350-6

Keyword(s): Multi-Agent Path Finding, SAT, Search Algorithm.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Cooperation and Coordination ; Distributed and Mobile Software Systems ; Enterprise Information Systems ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Mobile Agents ; Multi-Agent Systems ; Planning and Scheduling ; Simulation and Modeling ; Software Engineering ; Symbolic Systems

Abstract: The problem of multi-agent path finding (MAPF) is studied in this paper. Solving MAPF optimally is a computationally hard problem and many different optimal algorithms have been designed over the years. These algorithms have good runtimes for some problem instances, while performing badly for other instances. Interestingly, these hard instances are often different across the algorithms. This leads to an idea of combining the strengths of different algorithms in such a way that an input problem instance is split into disjoint subproblems and each subproblem is solved by appropriate algorithm resulting in faster computation than using either of the algorithms for the whole instance. By manual problem decomposition we will empirically show that the above idea is viable. We will also sketch a possible future work on automated problem decomposition.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.238.192.150

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Švancara, J. and Barták, R. (2019). Combining Strengths of Optimal Multi-Agent Path Finding Algorithms.In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-350-6, pages 226-231. DOI: 10.5220/0007470002260231

@conference{icaart19,
author={Ji\v{r}í Švancara. and Roman Barták.},
title={Combining Strengths of Optimal Multi-Agent Path Finding Algorithms},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2019},
pages={226-231},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007470002260231},
isbn={978-989-758-350-6},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Combining Strengths of Optimal Multi-Agent Path Finding Algorithms
SN - 978-989-758-350-6
AU - Švancara, J.
AU - Barták, R.
PY - 2019
SP - 226
EP - 231
DO - 10.5220/0007470002260231

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.