Publication

Collective search of a single odour source using cooperation

2007
Student Projects

Abstract

We study coordination strategies for a multirobot team. The goal is to find the source of an odour most efficiently in terms of the distance travelled by the robots and the time required to discover the source. We focus on the problem of finding the source of the odour once a robot has already found the plume of this odour. The results show that the studied algorithms are effective in non-homogeneous wind models, which include turbulences.

Official source

Graph Chat

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.

2007
Student Projects

Abstract

Official source

Related concepts (14)

Algorithm

In mathematics and computer science, an algorithm (ˈælɡərɪðəm) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually.

Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.

Randomized algorithm

A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output (or both) are random variables.

Related publications (6)

Collective search of a single odour source using cooperation

Chat with Graph Search

Linearization Algorithms for Fully Composite Optimization

Tracking Atoms with Particles

Lower Bounds on Generic Broadcast Algorithms