Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 234

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Multi-robot task allocation: analyzing the complexity and optimality of key architectures

Gerkey, B.P., Mataric, M.J.·2004·2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)
DOI 10.1109/robot.2003.1242189
Open this paper in CoChat — free account

Abstract

Important theoretical aspects of multi-robot coordination mechanisms have, to date, been largely ignored. To address part of this negligence, we focus on the problem of multi-robot task allocation. We give a formal, domain-independent, statement of the problem and show it to be an instance of another, well-studied, optimization problem. In this light, we analyze several recently proposed approaches to multi-robot task allocation, describing their fundamental characteristics in such a way that they can be objectively studied, compared, and evaluated.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/robot.2003.1242189

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 234

Metadata

Authors
Gerkey, B. P., & Mataric, M. J.
Venue
2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)
Publisher
IEEE
Published
2004-03-30
Volume
3
Pages
3862-3868
ISSN
1050-4729 (ISSN-L)
DOI
10.1109/robot.2003.1242189
OpenAlex
W2162509910
Cited by
234
References
1
FWCI
11.42
Type
conference paper
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Multi-robot task allocation: analyzing the complexity and optimality of key architectures. https://app.cochat.ai/papers/10.1109/robot.2003.1242189
The paper
Gerkey, B. P., & Mataric, M. J. (2004). Multi-robot task allocation: analyzing the complexity and optimality of key architectures. 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422). https://doi.org/10.1109/robot.2003.1242189

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.