Distributed Adaptation in Multi-Robot Search using Particle Swarm Optimization
Related publications (58)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We provide a comparison of a series of original coordination mechanisms for the distributed boundary coverage problem with a swarm of miniature robots. Our analysis is based on real robot experimentation and models at different levels of abstraction. Distr ...
We present a modified version of the Particle swarm Optimization algorithm in which we adjust the virtual swarm search by incorporating inter-agent dynamics native to multi-robot search scenarios. The neighborhood structure of PSO is modified to accurately ...
We apply an adapted version of Particle Swarm Optimization to distributed unsupervised robotic learning in groups of robots with only local information. The performance of the learning technique for a simple task is compared across robot groups of various ...
The swarm intelligence literature frequently asserts that swarms exhibit high levels of robustness. That claim is, however, rather less frequently supported by empirical or theoretical analysis. But what do we mean by a 'robust' swarm? How would we measure ...
Discrete optimization is a difficult task common to many different areas in modern research. This type of optimization refers to problems where solution elements can assume one of several discrete values. The most basic form of discrete optimization is bin ...
Review of: Swarm Intelligence: From Natural to Artificial Systems by Eric Bonabeau, Marco Dorigo, and Guy Theraulaz, Oxford University Press, 1999, 307 pp. ...
We explore using particle swarm optimization on problems with noisy performance evaluation, focusing on unsupervised robotic learning. We adapt a technique of overcoming noise used in genetic algorithms for use with particle swarm optimization, and evaluat ...
Seega is an ancient Egyptian two-stage board game that, in certain aspects, is more difficult than chess. The two-player game is most commonly played on a 7 × 7 board, but is also sometimes played on a 5 × 5 or 9 × 9 board. In the first and more difficult sta ...