Optimization techniques for Multi-Robot Task Allocation problems: Review on the state-of-the-art
Open accessThe DOI matches its Crossref record; 84 of the 84 references it cites were found in a registry or an index.
Abstract
In the last years, Multi-Robot Systems (MRS) have experienced considerable recognition due to various possible real-world applications. Multi-Robot Task Allocation (MRTA) is among the most interesting MRS problems. This problem concerns the situation when a set of given tasks must be performed by a team of mobile robots with the intention of optimizing an objective function (e.g., minimizing the mission time). This paper aims to present MRTA applications and categorizes methods into market-based, behavior-based, and optimization-based approaches. The paper focus on the latter and review several works in order to point out their advantages and limitations and to identify possible future research opportunities. Furthermore, a statistical analysis is provided to identify the most used methods and the evolution of the topic over the years.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Algorithms for the Assignment and Transportation Problems
Munkres, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105003 · Cited by 3,986 · cited 1×
“Further, this al-gorithm has been improved by Munkres to deal with the case where the number of workers is not the same as the number of jobs [133, 134].”
Proceedings. 1985 IEEE International Conference on Robotics and Automation
(1985) · doi:10.1109/robot.1985 · Cited by 3,673
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576 · cited 1×
“To solve this type of problem, resolution methods have been classified into two main categories: exact approaches and approximate approaches [25].”
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236 · cited 1×
“On the other hand, the majority of metaheuristics solve a problem from a population of feasible solutions or from a randomly generated initial population of candidates with an iterative process that improves progressively the population [29].”
Proceedings of the 2004 American Control Conference
(2004) · Proceedings of the 2004 American Control Conference · doi:10.23919/acc.2004.1383555 · Cited by 2,605
A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems
Gerkey, B. P., & Matarić, M. J. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045564 · Cited by 1,753 · cited 5×
“Intentional cooperation approaches are more appropriate for MRTA problems [14].”
Influential2018 IEEE International Conference on Robotics and Automation (ICRA)
(2018) · doi:10.1109/icra36916.2018 · Cited by 1,340
ALLIANCE: an architecture for fault tolerant multirobot cooperation
Parker, L. E. (1998) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.681242 · Cited by 1,312 · cited 1×
“ALLIANCE [70, 71] and BLE [72] are the pioneering algorithms in this category.”
Cited by
Cross-robot behavior adaptation through intention alignment
Chen, X., Gao, Y., Liu, H., Yang, F., Ghadirzadeh, A., Yang, J., Liang, B., Zhang, C., Lam, T. L., & Zhu, S.-C. (2026) · Science Robotics · doi:10.1126/scirobotics.adv2250
Metadata
- Authors
- Chakraa, H., Guérin, F., Leclercq, E., & Lefebvre, D.
- Venue
- Robotics and Autonomous Systems
- Publisher
- Elsevier BV
- Published
- 2023-10
- Volume
- 168
- Pages
- 104492
- ISSN
- 0921-8890 (ISSN-L)
- OpenAlex
- W4385155193
- Cited by
- 213
- References
- 84
- FWCI
- 23.92
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.