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

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

C apt: Concurrent assignment and planning of trajectories for multiple robots

Turpin, Matthew, Michael, Nathan, Kumar, Vijay · 2014 · The International Journal of Robotics Research

Abstract

In this paper, we consider the problem of concurrent assignment and planning of trajectories (which we denote Capt ) for a team of robots. This problem involves simultaneously addressing two challenges: (1) the combinatorially complex problem of finding a suitable assignment of robots to goal locations, and (2) the generation of collision-free, time parameterized trajectories for every robot. We consider the Capt problem for unlabeled (interchangeable) robots and propose algorithmic solutions to two variations of the Capt problem. The first algorithm, c-Capt, is a provably correct, complete, centralized algorithm which guarantees collision-free optimal solutions to the Capt problem in an obstacle-free environment. To achieve these strong claims, c-Capt exploits the synergy obtained by combining the two subproblems of assignment and trajectory generation to provide computationally tractable solutions for large numbers of robots. We then propose a decentralized solution to the Capt problem throughd-Capt, a decentralized algorithm that provides suboptimal results compared toc-Capt. We illustrate the algorithms and resulting performance through simulation and experimentation.

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.1177/0278364913515307

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 193

Metadata

Authors
Turpin, M., Michael, N., & Kumar, V.
Venue
The International Journal of Robotics Research
Published
2014-01
Volume
33
Issue
1
Pages
98-112
ISSN
  • 0278-3649 (ISSN-L)
  • 1741-3176
OpenAlex
W1964462572
Cited by
193
References
1
FWCI
11.87
Type
journal article
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: C apt: Concurrent assignment and planning of trajectories for multiple robots. https://app.cochat.ai/papers/10.1177/0278364913515307
The paper
Turpin, M., Michael, N., & Kumar, V. (2014). C apt: Concurrent assignment and planning of trajectories for multiple robots. The International Journal of Robotics Research. https://doi.org/10.1177/0278364913515307

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.