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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on automation science and engineering Ročník 20; číslo 2; s. 1292 - 1303
Hlavní autoři:	Bai, Xiaoshan, Fielbaum, Andres, Kronmuller, Maximilian, Knoedler, Luzia, Alonso-Mora, Javier
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.04.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!