Distributed Particle Swarm Optimization using Optimal Computing Budget Allocation for multi-robot learning

Particle Swarm Optimization (PSO) is a population-based metaheuristic that can be applied to optimize controllers for multiple robots using only local information. In order to cope with noise in the robotic performance evaluations, different reevaluation strategies were proposed in the past. In this...

Full description

Saved in:
Bibliographic Details
Main Authors: Di Mario, Ezequiel, Navarro, Inaki, Martinoli, Alcherio
Format: Conference Proceeding
Language:English
Subjects:
Collision avoidance
Mobile robots
Nickel
Noise
Resource management
Robot sensing systems
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Particle Swarm Optimization (PSO) is a population-based metaheuristic that can be applied to optimize controllers for multiple robots using only local information. In order to cope with noise in the robotic performance evaluations, different reevaluation strategies were proposed in the past. In this article, we apply a statistical technique called Optimal Computing Budget Allocation to improve the performance of distributed PSO in the presence of noise. In particular, we compare a distributed PSO OCBA algorithm suitable for resource-constrained mobile robots with a centralized version that uses global information for the allocation. We show that the distributed PSO OCBA outperforms a previous distributed noise-resistant PSO variant, and that the performance of the distributed PSO OCBA approaches that of the centralized one as the communication radius is increased. We also explore different parametrizations of the PSO OCBA algorithm, and show that the choice of parameter values differs from previous guidelines proposed for stand-alone OCBA.
ISSN:1089-778X
1941-0026
DOI:10.1109/CEC.2015.7256940