Social Laws for Multi-Agent Pathfinding

Jan Slezák; 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

Social Laws for Multi-Agent Pathfinding

Topics: Multi-Agent Systems; Robot and Multi-Robot Systems; Task Planning and Execution

In Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, 463-470, 2025 , Porto, Portugal

Authors: Jan Slezák ; Jakub Mestek and Roman Barták

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

Keyword(s): Path-Finding, Social Laws, Multi-Agent Environment.

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.

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.129.58.166

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:

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; ISSN 2184-433X, SciTePress, pages 463-470. DOI: 10.5220/0013189200003890

@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},
issn={2184-433X},
}

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
IS - 2184-433X
AU - Slezák, J.
AU - Mestek, J.
AU - Barták, R.
PY - 2025
SP - 463
EP - 470
DO - 10.5220/0013189200003890
PB - SciTePress