Optimization techniques for Multi-Robot Task Allocation problems: Review on the state-of-the-art
Open accessThe DOI matches its Crossref record; 4 of the 4 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
Murphy, R. R., Tadokoro, S., Nardi, D., Jacoff, A., Fiorini, P., Choset, H., & Erkmen, A. M. (2008) · Springer Handbook of Robotics · doi:10.1007/978-3-540-30301-5_51 · Cited by 363
A taxonomy for task allocation problems with temporal and ordering constraints
Nunes, E., Manner, M., Mitiche, H., & Gini, M. (2017) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.10.008 · Cited by 252 · cited 4×
“More-over, authors in [22] present a new taxonomy that classifies MRTA problems according to temporal constraints (deadlines of tasks, priority, and so on).”
InfluentialJose, K., & Pratihar, D. K. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.02.003 · Cited by 170
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
- 4
- 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.