Distributed Bees Algorithm Parameters Optimization for a Cost Efficient Target Allocation in Swarms of Robots
AbstractSwarms of robots can use their sensing abilities to explore unknown environments and deploy on sites of interest. In this task, a large number of robots is more effective than a single unit because of their ability to quickly cover the area. However, the coordination of large teams of robots is not an easy problem, especially when the resources for the deployment are limited. In this paper, the Distributed Bees Algorithm (DBA), previously proposed by the authors, is optimized and applied to distributed target allocation in swarms of robots. Improved target allocation in terms of deployment cost efficiency is achieved through optimization of the DBA’s control parameters by means of a Genetic Algorithm. Experimental results show that with the optimized set of parameters, the deployment cost measured as the average distance traveled by the robots is reduced. The cost-efficient deployment is in some cases achieved at the expense of increased robots’ distribution error. Nevertheless, the proposed approach allows the swarm to adapt to the operating conditions when available resources are scarce. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Jevtić, A.; Gutiérrez, Á. Distributed Bees Algorithm Parameters Optimization for a Cost Efficient Target Allocation in Swarms of Robots. Sensors 2011, 11, 10880-10893.
Jevtić A, Gutiérrez Á. Distributed Bees Algorithm Parameters Optimization for a Cost Efficient Target Allocation in Swarms of Robots. Sensors. 2011; 11(11):10880-10893.Chicago/Turabian Style
Jevtić, Aleksandar; Gutiérrez, Álvaro. 2011. "Distributed Bees Algorithm Parameters Optimization for a Cost Efficient Target Allocation in Swarms of Robots." Sensors 11, no. 11: 10880-10893.