Deterministic Ants in Labyrinth — Information Gained by Map Sharing

A few ant robots are placed in a labyrinth, formed by a square lattice with a small number of corridors removed. Ants move according to a deterministic algorithm designed to explore all corridors. Each ant remembers the shape of corridors which it has visited. Once two ants meet, they share the information acquired. We evaluate how the time of getting a complete information by an ant depends on the number of ants, and how the length known by an ant depends on time. Numerical results are presented in the form of scaling relations.

[1]  Stefano Carpin,et al.  USARSim: Providing a Framework for Multi-Robot Performance Evaluation | NIST , 2006 .

[2]  Prasanna Velagapudi,et al.  Experiments in Coordination Demand for MultiRobot Systems , 2008 .

[3]  James D. Foley,et al.  Fundamentals of interactive computer graphics , 1982 .

[4]  Max Pfingsthorn,et al.  UvA-DARE ( Digital Academic Repository ) A scalable hybrid multi-robot SLAM method for highly detailed maps , 2007 .

[5]  W. Coffey,et al.  Diffusion and Reactions in Fractals and Disordered Systems , 2002 .

[6]  Prasanna Velagapudi,et al.  Synchronous vs. Asynchronous Video in Multi-robot Search , 2008, First International Conference on Advances in Computer-Human Interaction.

[7]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[8]  Gerald Seet,et al.  Multiple-Robot Systems for USAR: Key Design Attributes and Deployment Issues , 2011 .

[9]  H. Schuster.  Deterministic chaos: An introduction , 1984 .

[10]  H. Rieger,et al.  Anomalous diffusion in disordered media and random quantum spin chains , 1998 .

[11]  F. Henyey,et al.  On the number of distinct sites visited in 2D lattices , 1982 .

[12]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[13]  Guangming Xie,et al.  Adaptive task assignment for multiple mobile robots via swarm intelligence approach , 2007, Robotics Auton. Syst..

[14]  L. Preucil,et al.  Balancing the information gain against the movement cost for multi-robot frontier exploration , 2007 .

[15]  Bernardo Cunha,et al.  Communicating among Robots in the RoboCup Middle-Size League , 2009, RoboCup.

[16]  Seong-Lyun Kim,et al.  Multi-robot path finding with wireless multihop communications , 2010, IEEE Communications Magazine.

[17]  Dali Sun,et al.  Multi-robot Range-Only SLAM by Active Sensor Nodes for Urban Search and Rescue , 2008, RoboCup.

[18]  H. Stanley,et al.  Breakdown of Alexander-Orbach conjecture for percolation: Exact enumeration of random walks on percolation backbones , 1984 .

[19]  Prasanna Velagapudi,et al.  Scaling effects in multi-robot control , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[20]  J. Bouchaud,et al.  Anomalous diffusion in disordered media: Statistical mechanisms, models and physical applications , 1990 .

[21]  Siang Kok Sim,et al.  A Hierarchical Mixed Multi-Agent System , 2003, 2003 4th International Conference on Control and Automation Proceedings.

[22]  N. Lebovka,et al.  Percolation of aligned dimers on a square lattice , 2009, 0912.0778.

[23]  Arnoud Visser,et al.  Balancing the Information Gain Against the Movement Cost for Multi-robot Frontier Exploration , 2008, EUROS.

[24]  Arnoud Visser,et al.  Including communication success in the estimation of information gain for multi-robot exploration , 2008, 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops.