Energy-time-efficient adaptive dispatching algorithms for ant-like robot systems

In this paper, we investigate energy-time-efficient dispatching methods for ant-like robots to cover an unmapped region effectively. These ant-like robots have very limited energy and sensor ability, making them practical and inexpensive to build. Our dispatching model was based on bio-inspired algorithms from an ant colony system. We assumed that all the ant-like robots start from their home starting point, the nest, and the region is composed of floor tiles that can be modelled as vertices in a graph. In this dispatching system, the ant-like robots leave pheromone on the tiles and use this information to cover the region. We developed and analyzed two different adaptive dispatching algorithms with different communication methods to the nest. We further compared these two adaptive dispatching algorithms with two non-adaptive methods. Extensive computer simulations validated the proposed adaptive algorithms, showing that they can dispatch ant-like mobile robots to cover an unmapped region with energy-time efficiency.

[1]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[2]  G. Whelan,et al.  Cooperative search and rescue with a team of mobile robots , 1997, 1997 8th International Conference on Advanced Robotics. Proceedings. ICAR'97.

[3]  Chaomin Luo,et al.  A real-time cooperative sweeping strategy for multiple cleaning robots , 2002, Proceedings of the IEEE Internatinal Symposium on Intelligent Control.

[4]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2004, Annals of Mathematics and Artificial Intelligence.

[5]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[6]  Takeo Kanade,et al.  Terrain mapping for a roving planetary explorer , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[7]  Hugh F. Durrant-Whyte.  Uncertain geometry in robotics , 1988, IEEE J. Robotics Autom..

[8]  Israel A. Wagner,et al.  Distributed covering by ant-robots using evaporating traces , 1999, IEEE Trans. Robotics Autom..

[9]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[10]  Boleslaw K. Szymanski,et al.  Efficient and inefficient ant coverage methods , 2001, Annals of Mathematics and Artificial Intelligence.

[11]  Keiji Suzuki,et al.  Development of cooperative small mowing robots , 2003, Proceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694).

[12]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[13]  Heon Young Yeom,et al.  Agent chaining: an approach to dynamic mobile agent planning , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[14]  Israel A. Wagner,et al.  Efficiently searching a graph by a smell-oriented vertex process , 2004, Annals of Mathematics and Artificial Intelligence.

[15]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[16]  Eiichi Yoshida,et al.  Cooperative sweeping by multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[17]  Günther Schmidt,et al.  Path planning and guidance techniques for an autonomous mobile cleaning robot , 1995, Robotics Auton. Syst..