loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Jiří Švancara 1 ; Philipp Obermeier 2 ; Matej Husár 1 ; Roman Barták 1 and Torsten Schaub 2

Affiliations: 1 Charles University, Prague, Czech Republic ; 2 University of Potsdam and Potassco Solutions, Potsdam, Germany

Keyword(s): Multi-Agent Pathfinding, Answer Set Programming, Subgraph, Shortest Path.

Abstract: Multi-agent pathfinding is the task of navigating a set of agents in a shared environment from their start locations to their desired goal locations without collisions. Solving this problem optimally is a hard task and various algorithms have been devised. The algorithms can generally be split into two categories, search- and reduction-based ones. It is known that reduction-based algorithms struggle with large instances in terms of the size of the environment. A recent study tried to mitigate this drawback by pruning some vertices of the environment map. The pruning is done based on the vicinity to a shortest path of an agent. In this paper, we study the effect of choosing such shortest paths. We provide several approaches to choosing the paths and we perform an experimental study to see the effect on the runtime.

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 3.145.111.125

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.; Obermeier, P.; Husár, M.; Barták, R. and Schaub, T. (2023). Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?. In Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-623-1; ISSN 2184-433X, SciTePress, pages 199-206. DOI: 10.5220/0011625100003393

@conference{icaart23,
author={Ji\v{r}í Švancara. and Philipp Obermeier. and Matej Husár. and Roman Barták. and Torsten Schaub.},
title={Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?},
booktitle={Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2023},
pages={199-206},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011625100003393},
isbn={978-989-758-623-1},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?
SN - 978-989-758-623-1
IS - 2184-433X
AU - Švancara, J.
AU - Obermeier, P.
AU - Husár, M.
AU - Barták, R.
AU - Schaub, T.
PY - 2023
SP - 199
EP - 206
DO - 10.5220/0011625100003393
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic