Social Laws for Multi-Agent Pathfinding

Jan Slezák, Jakub Mestek, Roman Barták

2025

Abstract

Multi-agent pathfinding (MAPF) is the problem of finding collision-free plans for navigating a set of agents from their starting positions to their destinations. Frequently, rigid plans for all agents are centrally searched and perfect execution of actions is assumed, which raises issues with the uncertainty and the dynamicity of the environment. Social laws are a well-established paradigm in multi-agent systems to coordinate agents that avoid extensive negotiation. In this work, we present a decentralized online algorithm to solve the MAPF problem without the need for communication between agents. This approach uses social laws inspired by traffic rules.

Paper Citation

in Harvard Style

Slezák J., Mestek J. and Barták R. (2025). Social Laws for Multi-Agent Pathfinding. In Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-737-5, SciTePress, pages 463-470. DOI: 10.5220/0013189200003890

in Bibtex Style

@conference{icaart25,
author={Jan Slezák and Jakub Mestek and Roman Barták},
title={Social Laws for Multi-Agent Pathfinding},
booktitle={Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2025},
pages={463-470},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0013189200003890},
isbn={978-989-758-737-5},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Social Laws for Multi-Agent Pathfinding
SN - 978-989-758-737-5
AU - Slezák J.
AU - Mestek J.
AU - Barták R.
PY - 2025
SP - 463
EP - 470
DO - 10.5220/0013189200003890
PB - SciTePress