Social Laws for Multi-Agent Pathfinding
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10511169" target="_blank" >RIV/00216208:11320/25:10511169 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.5220/0013189200003890" target="_blank" >https://doi.org/10.5220/0013189200003890</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5220/0013189200003890" target="_blank" >10.5220/0013189200003890</a>
Alternative languages
Result language
angličtina
Original language name
Social Laws for Multi-Agent Pathfinding
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA23-05104S" target="_blank" >GA23-05104S: Multi-Robotic Path Planning and Execution</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
ISBN
978-989-758-737-5
ISSN
—
e-ISSN
2184-433X
Number of pages
8
Pages from-to
463-470
Publisher name
SciTePress
Place of publication
Setúbal
Event location
Porto
Event date
Feb 23, 2025
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—