# Multiple-place swarm foraging with dynamic depots

Multiple-place swarm foraging with dynamic depots Teams of robots can be organized to collectively complete complex real-world tasks, for example collective foraging in which robots search for, pick up, and drop off targets in a collection zone. In the previously proposed central-place foraging algorithm (CPFA), foraging performance decreases as swarm size and search areas scale up: more robots produce more inter-robot collisions and larger search areas produce longer travel distances. We propose the multiple-place foraging algorithm with dynamic depots ( $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic ) to address these problems. Depots are special robots which are initially distributed in the search area and can carry multiple targets. Depots move to the centroids of the positions of local targets recently detected by robots. The spatially distributed design reduces robot transport time and reduces collisions among robots. We simulate robot swarms that mimic foraging ants using the $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic strategy, employing a genetic algorithm to optimize their behavior in the robot simulator ARGoS. Robots using the $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic find and collect targets faster than both the CPFA and the static MPFA. $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic outperforms the static MPFA even when the static depots are optimally placed using global information, and it outperforms the CPFA even when the dynamic depots deliver targets to a central location. Further, the $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic scales up more efficiently, so that the improvement over the CPFA and the static MPFA is even greater in large (50 $$\times$$ × 50 m) areas. Including simulated error reduces foraging performance across all algorithms, but the MPFA still outperforms the other approaches. Our work demonstrates that dispersed agents that dynamically adapt to local information in their environment provide more flexible and scalable swarms. In addition, we illustrate a path to implement the $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic in the physical robot swarm of the NASA Swarmathon competition. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Autonomous Robots Springer Journals

# Multiple-place swarm foraging with dynamic depots

, Volume 42 (4) – Jan 9, 2018
18 pages

/lp/springer_journal/multiple-place-swarm-foraging-with-dynamic-depots-sSgm6Rd5aR
Publisher
Springer Journals
Subject
Engineering; Robotics and Automation; Artificial Intelligence (incl. Robotics); Computer Imaging, Vision, Pattern Recognition and Graphics; Control, Robotics, Mechatronics
ISSN
0929-5593
eISSN
1573-7527
D.O.I.
10.1007/s10514-017-9693-2
Publisher site
See Article on Publisher Site

### Abstract

Teams of robots can be organized to collectively complete complex real-world tasks, for example collective foraging in which robots search for, pick up, and drop off targets in a collection zone. In the previously proposed central-place foraging algorithm (CPFA), foraging performance decreases as swarm size and search areas scale up: more robots produce more inter-robot collisions and larger search areas produce longer travel distances. We propose the multiple-place foraging algorithm with dynamic depots ( $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic ) to address these problems. Depots are special robots which are initially distributed in the search area and can carry multiple targets. Depots move to the centroids of the positions of local targets recently detected by robots. The spatially distributed design reduces robot transport time and reduces collisions among robots. We simulate robot swarms that mimic foraging ants using the $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic strategy, employing a genetic algorithm to optimize their behavior in the robot simulator ARGoS. Robots using the $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic find and collect targets faster than both the CPFA and the static MPFA. $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic outperforms the static MPFA even when the static depots are optimally placed using global information, and it outperforms the CPFA even when the dynamic depots deliver targets to a central location. Further, the $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic scales up more efficiently, so that the improvement over the CPFA and the static MPFA is even greater in large (50 $$\times$$ × 50 m) areas. Including simulated error reduces foraging performance across all algorithms, but the MPFA still outperforms the other approaches. Our work demonstrates that dispersed agents that dynamically adapt to local information in their environment provide more flexible and scalable swarms. In addition, we illustrate a path to implement the $$\hbox {MPFA}_{dynamic}$$ MPFA dynamic in the physical robot swarm of the NASA Swarmathon competition.

### Journal

Autonomous RobotsSpringer Journals

Published: Jan 9, 2018

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations