Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
A Distributed Algorithm for the Multi-Robot Task Allocation Problem
verfasst von : Stefano Giordani, Marin Lujak, Francesco Martinelli
Erschienen in: Trends in Applied Intelligent Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this work we address the Multi-Robot Task Allocation Problem (MRTA). We assume that the decision making environment is decentralized with as many decision makers (agents) as the robots in the system. To solve this problem, we developed a distributed version of the Hungarian Method for the assignment problem. The robots autonomously perform different substeps of the Hungarian algorithm on the base of the individual and the information received through the messages from the other robots in the system. It is assumed that each robot agent has an information regarding its distance from the targets in the environment. The inter-robot communication is performed over a connected dynamic communication network and the solution to the assignment problem is reached without any common coordinator or a shared memory of the system. The algorithm comes up with a global optimum solution in
O
(
n
3
) cumulative time (
O
(
n
2
) for each robot), with
O
(
n
3
) number of messages exchanged among the
n
robots.