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 2023-04, Vol.20 (2), p.1292-1303
Hauptverfasser:	Bai, Xiaoshan, Fielbaum, Andres, Kronmuller, Maximilian, Knoedler, Luzia, Alonso-Mora, Javier
Format:	Artikel
Sprache:	eng
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)
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!