Computational issues in systems of mobile entities

在这个项目中，我对计算移动实体组的确定性算法的设计感兴趣。这些实体是相同的、极其简单的，而且单独来看相当弱；但整体上有能力执行复杂的任务。实体运行的环境可以是网络或地形。在这两种环境中，实体的行为都是循环的：一个实体变得活跃（异步且独立），它根据协议决定移动到哪里，它移动到一个位置，然后再次变得不活跃。一组实体可以做什么以及效率如何取决于实体的特征，例如，它们的通信媒体、它们看到邻近实体的能力、它们的同步水平、记住过去的可能性。实体的一些特征（例如，局域性、遗忘性和通信）特别重要，对它们的研究可能在可伸缩性、效率和容错性方面产生重大影响。

In this project I am interested in the design of deterministic algorithms for groups of computational moving entities. Such entities are identical, extremely simple and individually quite weak; but collectively capable of performing possibly complex tasks. The environment in which the entities operate can be a network or a terrain. In both environments the behaviour of the entities is cyclic: an entity becomes active (asynchronously and independently), it decides where to move based on the protocol, it moves to a location, and it becomes inactive again. What can be done by a team of entities and how efficiently depends on the characteristics of the entities like, for example, their communication media, their ability to see neighbouring entities, their level of synchronization, the possibility to remember the past. Some of the entities' characteristics (for example, locality, obliviousness, and communication) are particularly important and their study could have significant consequences in terms of scalability, efficiency, and fault-tolerance.