Evènement pour le groupe Algorithmique Distribuée

Date 2015-12-14  14:00-15:00
Titre Beachcombing on Strips and Islands 
RésuméA group of mobile robots (beachcombers) have to search collectively every point of a given domain. At any given moment, each robot can be in walking mode or in searching mode. It is assumed that each robot's maximum allowed searching speed is strictly smaller than its maximum allowed walking speed. A point of the domain is searched if at least one of the robots visits it in searching mode. The Beachcombers' Problem consists in developing efficient schedules (algorithms) for the robots which collectively search all the points of the given domain as fast as possible. In this talk, I will present recent results on this topic.  
OrateurDavid Ilcinkas 

Aucun document lié à cet événement.

Retour à l'index