Multi-Agent Path Finding: Policies Instead of Plans

Jakub Mestek; Roman Barták

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Multi-Agent Path Finding: Policies Instead of Plans

Topics: Multi-Agent Systems; Planning and Scheduling; Robot and Multi-Robot Systems; State Space Search; Task Planning and Execution; Uncertainty in AI

In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, 95-104, 2024 , Rome, Italy

Authors: Jakub Mestek and Roman Barták

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

Keyword(s): Multi-Agent Path Finding, Non-Deterministic Environment, Policies.

Abstract: The task of Multi-Agent Path Finding (MAPF) problem is to find collision-free plans for a set of agents moving from their starting locations to their destinations. In the classical variant of MAPF, a plan for an agent is a sequence of actions. In this paper, we suggest a novel approach to solving this problem in a non-deterministic environment – constructing a solution in the form of policies (one for each agent). The policy prescribes the agent which action it should take in a given situation described by a location and a timestep.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

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

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:

Mestek, J. and Barták, R. (2024). Multi-Agent Path Finding: Policies Instead of Plans. In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-680-4; ISSN 2184-433X, SciTePress, pages 95-104. DOI: 10.5220/0012397200003636

@conference{icaart24,
author={Jakub Mestek. and Roman Barták.},
title={Multi-Agent Path Finding: Policies Instead of Plans},
booktitle={Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2024},
pages={95-104},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012397200003636},
isbn={978-989-758-680-4},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Multi-Agent Path Finding: Policies Instead of Plans
SN - 978-989-758-680-4
IS - 2184-433X
AU - Mestek, J.
AU - Barták, R.
PY - 2024
SP - 95
EP - 104
DO - 10.5220/0012397200003636
PB - SciTePress