Decentralized multi-agent path finding framework and strategies based on automated negotiation

Name: Decentralized multi-agent path finding framework and strategies based on automated negotiation
Author: Aydogan, Reyhan, Eran, Cihan, Canturk, Furkan, Keskin, Mehmet Onur

İsim	Decentralized multi-agent path finding framework and strategies based on automated negotiation
Yazar	Aydogan, Reyhan, Eran, Cihan, Canturk, Furkan, Keskin, Mehmet Onur
Basım Tarihi:	2024-03-13
Basım Yeri	- Springer Nature
Konu	Decentralized coordination, Negotiation, Multi-agent path finding
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1387-2532
Kayıt Numarası	fcc37a68-7a7b-4e63-b396-8f3de0dbc258
Lokasyon	Computer Science
Tarih	2024-03-13
Örnek Metin	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

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Decentralized multi-agent path finding framework and strategies based on automated negotiation

Yazar Aydogan, Reyhan, Eran, Cihan, Canturk, Furkan, Keskin, Mehmet Onur

Basım Tarihi 2024-03-13

Basım Yeri - Springer Nature

Konu Decentralized coordination, Negotiation, Multi-agent path finding

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1387-2532

Kayıt Numarası fcc37a68-7a7b-4e63-b396-8f3de0dbc258

Lokasyon Computer Science

Tarih 2024-03-13

Örnek Metin 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