Group-Based Distributed Auction Algorithms for Multi-Robot Task Assignment

This paper studies the multi-robot task assignment problem in which a fleet of dispersed robots needs to efficiently transport a set of dynamically appearing packages from their initial locations to corresponding destinations within prescribed time-windows. Each robot can carry multiple packages sim...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automation science and engineering Jg. 20; H. 2; S. 1292 - 1303
Hauptverfasser:	Bai, Xiaoshan, Fielbaum, Andres, Kronmuller, Maximilian, Knoedler, Luzia, Alonso-Mora, Javier
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.04.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Assignment problem Collision avoidance Dispersion Distributed algorithms distributed auction algorithm Greedy algorithms Heuristic algorithms Integer programming Multi-robot Multiple robots NP-hard Operations research Optimization Packages Robot sensing systems Robots Task analysis task assignment Task complexity Task scheduling time-windows Travel time Windows (intervals)
ISSN:	1545-5955, 1558-3783
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!