Speaker
Description
Over the last couple of decades, there has been extensive investigation of
agent-based distributed computation, with special focus on weak agents with limited memory and capabilities. The aim is to understand fundamental properties of agent-based systems where simple basic entities give rise to complex behavior. A typical problem in this setting is exploration of a (geometric or discrete) space, possibly with the aim of locating an unknown target. A single finite-state agent can be proven too weak to explore any non-trivial space. However, equipped with the possibility to mark some points in the space, the agent (or a team of agents) gain Turing-complete power. In the talk we present recent results about the efficiency of memory implementation in such systems.
| Pracovisko fakulty (katedra)/ Department of Faculty | KI |
|---|