Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, March 14, 2017, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Jara Uitto
Consider $k$ mobile agents placed at the origin of an infinite grid that collaboratively search for a treasure hidden in the grid by an adversary. The agents are controlled by either deterministic or randomized finite automata and, given that agents $a$ and $a'$ share a grid cell, they are able to communicate with each other through constant size messages. We show that the availability of random bits and the timing parameters of the execution environment have a direct impact on the minimum number of agents needed to find the treasure. The lower bounds on the number of agents are complemented with matching upper bounds.
Automatic MiSe System Software Version 1.4803M | admin login