Author
Aydogan, Reyhan, Eran, Cihan, Canturk, Furkan, Keskin, Mehmet Onur
Publication Date
2024-03-13
Publication Place
-
Springer Nature
Subject
Decentralized coordination, Negotiation, Multi-agent path finding
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
1387-2532
Record ID
fcc37a68-7a7b-4e63-b396-8f3de0dbc258
Library Location
Computer Science
Date
2024-03-13
Sample Text
This paper introduces a negotiation framework to solve the Multi-Agent Path Finding (MAPF) Problem for self-interested agents in a decentralized fashion. The framework aims to achieve a good trade-off between the privacy of the agents and the effectiveness of solutions. Accordingly, a token-based bilateral negotiation protocol and two negotiation strategies are presented. The experimental results over four different settings of the MAPF problem show that the proposed approach could find conflict-free path solutions albeit suboptimally, especially when the search space is large and high-density. In contrast, Explicit Estimation Conflict-Based Search (EECBS) struggles to find optimal solutions. Besides, deploying a sophisticated negotiation strategy that utilizes information about local density for generating alternative paths can yield remarkably better solution performance in this negotiation framework.
DOI
10.1007/s10458-024-09639-8
Cilt
38
