Optimized stochastic policies for task allocation in swarms of robots

Spring Berman, Ádám Halász, M. Ani Hsieh, Vijay Kumar

Research output: Contribution to journalArticle

146 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)927-937
Number of pages11
JournalIEEE Transactions on Robotics
Volume25
Issue number4
DOIs
StatePublished - 2009
Externally publishedYes

Fingerprint

Robots
Communication

Keywords

  • Distributed control
  • Markov processes
  • Optimization
  • Stochastic systems
  • Swarm robotics
  • Task allocation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Computer Science Applications

Cite this

Optimized stochastic policies for task allocation in swarms of robots. / Berman, Spring; Halász, Ádám; Hsieh, M. Ani; Kumar, Vijay.

In: IEEE Transactions on Robotics, Vol. 25, No. 4, 2009, p. 927-937.

Research output: Contribution to journalArticle

Berman, Spring ; Halász, Ádám ; Hsieh, M. Ani ; Kumar, Vijay. / Optimized stochastic policies for task allocation in swarms of robots. In: IEEE Transactions on Robotics. 2009 ; Vol. 25, No. 4. pp. 927-937.
@article{8d3482c6bedf46c6b0306229f907646a,
title = "Optimized stochastic policies for task allocation in swarms of robots",
abstract = "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.",
keywords = "Distributed control, Markov processes, Optimization, Stochastic systems, Swarm robotics, Task allocation",
author = "Spring Berman and {\'A}d{\'a}m Hal{\'a}sz and Hsieh, {M. Ani} and Vijay Kumar",
year = "2009",
doi = "10.1109/TRO.2009.2024997",
language = "English (US)",
volume = "25",
pages = "927--937",
journal = "IEEE Transactions on Robotics",
issn = "1552-3098",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Optimized stochastic policies for task allocation in swarms of robots

AU - Berman, Spring

AU - Halász, Ádám

AU - Hsieh, M. Ani

AU - Kumar, Vijay

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Distributed control

KW - Markov processes

KW - Optimization

KW - Stochastic systems

KW - Swarm robotics

KW - Task allocation

UR - http://www.scopus.com/inward/record.url?scp=69249220102&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69249220102&partnerID=8YFLogxK

U2 - 10.1109/TRO.2009.2024997

DO - 10.1109/TRO.2009.2024997

M3 - Article

AN - SCOPUS:69249220102

VL - 25

SP - 927

EP - 937

JO - IEEE Transactions on Robotics

JF - IEEE Transactions on Robotics

SN - 1552-3098

IS - 4

ER -