Yayın:
More scalable solution for multi-robot-multi-target assignment problem

Yükleniyor...
Küçük Resim

Tarih

Kurum Yazarları

Danışman

item.page.editor

Editör

Bölüm / Program

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

ELSEVIER

DOI

10.1016/j.robot.2019.01.005

Türü

View PlumX Details

Araştırma Projeleri

Akademik Birimler

Dergi Sayısı

Özet

During multi-robot exploration, the calculation cost of the target assignment increases significantly with an increase in the map size and number of robots. In this study, a target elimination method is proposed to overcome this challenge. The benefit of the proposed method increases as the map size and number of robots increase, which is demonstrated both empirically and theoretically. Moreover, it is established that the proposed method does not rely on a specific map representation or robot-target assignment method. (C) 2019 Elsevier B.V. All rights reserved.

Tanım

Dergi veya Seri

ROBOTICS AND AUTONOMOUS SYSTEMS

ISSN

0921-8890

ISBN

Haklar

Alıntı

Koleksiyonlar

Onay

Gözden geçir

Tamamlayıcı Bilgiler

Referans Gösteren

Related Patent

Related Goal

0

Views

0

Downloads