The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Optimized Stochastic Policies for Task Allocation in Swarms of Robots
Open accessAbstract
We present a scalable approach to dynamically allocating a swarm of homogeneous robots to multiple tasks, which are to be performed in parallel, following a desired distribution. We employ a decentralized strategy that requires no communication among robots. It is based on the development of a continuous abstraction of the swarm obtained by modeling population fractions and defining the task allocation problem as the selection of rates of robot ingress and egress to and from each task. These rates are used to determine probabilities that define stochastic control policies for individual robots, which, in turn, produce the desired collective behavior. We address the problem of computing rates to achieve fast redistribution of the swarm subject to constraint(s) on switching between tasks at equilibrium. We present several formulations of this optimization problem that vary in the precedence constraints between tasks and in their dependence on the initial robot distribution. We use each formulation to optimize the rates for a scenario with four tasks and compare the resulting control policies using a simulation in which 250 robots redistribute themselves among four buildings to survey the perimeters.
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.
Integrity signals
Registry
Cites
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.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Gillespie, D. T. (1976) · Journal of Computational Physics · doi:10.1016/0021-9991(76)90041-3 · Cited by 6,029
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
A Guide to Monte Carlo Simulations in Statistical Physics
Landau, D. P., & Binder, K. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139696463 · Cited by 2,257
Stochastic Simulation of Chemical Kinetics
Gillespie, D. T. (2007) · Annual Review of Physical Chemistry · doi:10.1146/annurev.physchem.58.032806.104637 · Cited by 2,115
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
Flocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
Methods for task allocation via agent coalition formation
Shehory, O., & Kraus, S. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00045-9 · Cited by 1,080
Market-Based Multirobot Coordination: A Survey and Analysis
Dias, M. B., Zlot, R., Kalra, N., & Stentz, A. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2006.876939 · Cited by 932
Cited by
Swarm robotics: a review from the swarm engineering perspective
Brambilla, M., Ferrante, E., Birattari, M., & Dorigo, M. (2013) · Swarm Intelligence · doi:10.1007/s11721-012-0075-2 · Cited by 1,762
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
Mean-field models in swarm robotics: a survey
Elamvazhuthi, K., & Berman, S. (2019) · Bioinspiration & Biomimetics · doi:10.1088/1748-3190/ab49a4 · Cited by 110
Self-citationBrambilla, M., Brutschy, A., Dorigo, M., & Birattari, M. (2015) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/2700318 · Cited by 66
Zahadat, P., & Schmickl, T. (2016) · Adaptive Behavior · doi:10.1177/1059712316633028 · Cited by 38
Metadata
- Authors
- Berman, S., Halasz, A., Hsieh, M. A., & Kumar, V.
- Venue
- IEEE Transactions on Robotics
- Published
- 2009-08
- Volume
- 25
- Issue
- 4
- Pages
- 927-937
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2145510175
- Cited by
- 258
- References
- 28
- FWCI
- 20.47
- Type
- journal article
- Language
- en
- Open access
- green
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: Optimized Stochastic Policies for Task Allocation in Swarms of Robots. https://app.cochat.ai/papers/10.1109/tro.2009.2024997
- The paper
- Berman, S., Halasz, A., Hsieh, M. A., & Kumar, V. (2009). Optimized Stochastic Policies for Task Allocation in Swarms of Robots. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2009.2024997
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.