A decentralized token-based negotiation approach for multi-agent path finding

Name: A decentralized token-based negotiation approach for multi-agent path finding
Author: Eran, Cihan, Keskin, Mehmet Onur, Cantürk, Furkan, Aydoğan, Reyhan

İsim	A decentralized token-based negotiation approach for multi-agent path finding
Yazar	Eran, Cihan, Keskin, Mehmet Onur, Cantürk, Furkan, Aydoğan, Reyhan
Basım Tarihi:	2021
Basım Yeri	- Springer
Konu	Decentralized coordination, Multi-agent path finding, Negotiation, Self-interested agents
Tür	Belge
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	978-303082253-8
Kayıt Numarası	9e04fa49-02db-4d0c-87bf-08cdd58249b8
Lokasyon	Computer Science
Tarih	2021
Örnek Metin	This paper introduces a negotiation approach to solve the Multi-Agent Path Finding problem. The approach 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 a compatible negotiation strategy are presented. The proposed approach is evaluated in a variety of scenarios by comparing it with state-of-the-art centralized approaches such as Conflict Based Search and its variant. The experimental results showed that the proposed approach can find conflict-free path solutions with a higher success rate, especially when the search space is large and high-density compared to centralized approaches while the gap between path cost differences is reasonably low. The proposed approach enables agents to have their autonomy; thus, it is convenient for MAPF problems involving self-interested agents.
DOI	10.1007/978-3-030-82254-5_16
Cilt	12802 LNAI

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

A decentralized token-based negotiation approach for multi-agent path finding

Yazar Eran, Cihan, Keskin, Mehmet Onur, Cantürk, Furkan, Aydoğan, Reyhan

Basım Tarihi 2021

Basım Yeri - Springer

Konu Decentralized coordination, Multi-agent path finding, Negotiation, Self-interested agents

Tür Belge

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 978-303082253-8

Kayıt Numarası 9e04fa49-02db-4d0c-87bf-08cdd58249b8

Lokasyon Computer Science

Tarih 2021

Örnek Metin This paper introduces a negotiation approach to solve the Multi-Agent Path Finding problem. The approach 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 a compatible negotiation strategy are presented. The proposed approach is evaluated in a variety of scenarios by comparing it with state-of-the-art centralized approaches such as Conflict Based Search and its variant. The experimental results showed that the proposed approach can find conflict-free path solutions with a higher success rate, especially when the search space is large and high-density compared to centralized approaches while the gap between path cost differences is reasonably low. The proposed approach enables agents to have their autonomy; thus, it is convenient for MAPF problems involving self-interested agents.

DOI 10.1007/978-3-030-82254-5_16

Cilt 12802 LNAI