Uniform dispersal of oblivious mobile robots

摘要

The research area of uniform dispersal focuses on the minimal capabilities required by mobile robots to solve the problem. Consider the uniform dispersion problem in an unknown connected space which is decomposed into smaller cells. Autonomous robots are injected through an entry point and has to occupy all the cells while avoiding collisions. These robots are considered "weak" in terms of hardware capabilities. They have limited memory, visibility and communication range. When the robots do not have any persistent storage (i.e. without any memory of past positions or actions) they are called oblivious. This paper presents a method which enables oblivious robots to solve the uniform dispersion problem.