Decentralized Gathering of Stochastic, Oblivious Agents on a Grid: A Case Study with 3D M-Blocks

• Main Authors: Ozdemir, Anil (Author), Romanishin, John W (Author), Groß, Roderich (Author), Rus, Daniela L (Author)
• Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
• Format: Article
• Language: English
• Published: IEEE, 2021-12-10T17:22:19Z.
• Subjects: Article
• Online Access: Get fulltext

 © 2019 IEEE. We propose stochastic control policies for gathering a group of embodied agents in a two-dimensional square tile environment. The policies are fully decentralized and can be executed on anonymous, oblivious agents with chirality, but no sense of orientation. The agents require only 4 ternary digits of information. We prove that a group of agents, irrespective of initial positions, will almost surely reach a Pareto optimal configuration in finite time. For one of the control policies, computer simulations show that groups of up to 20 agents consistently reach Pareto optimal configurations, whereas groups of 1000 agents, given the same amount of time, improve the compactness of their configurations on average by 89.20%. The policy also copes well with sensory noise up to a level of 50%. We also present an experimental validation using 6 physical 3D M-Block modules, demonstrating the feasibility of the stochastic control approach in practice.