Multi-robot path finding with wireless multihop communications

Path finding by multiple robots has been studied by many researchers. In particular, when the robot is able to communicate with other colleague robots, path finding will be solved collaboratively among the robots. The main motivation of this article is to apply wireless multihop communications to the collaborative path-finding problem. For this purpose, we propose a cooperative path finding algorithm (CPA) and report its performance by real implementation on ZigBee-based micro-robots as well as MATLAB simulations. There has been some controversy over the use of wireless multihop communications in commercial wireless networks for technical as well as non-technical reasons. However, our study highlights a new potential of multihop communications in inter-robot information exchange. We show the effects of wireless communications on the operation of cooperative multi-robots and find the benefit of multihop communications.

[1]  Heinz Wörn,et al.  Distributed Shortest-Path Finding by a Micro-robot Swarm , 2006, ANTS Workshop.

[2]  Junku Yuh,et al.  The Status of Robotics , 2007, IEEE Robotics & Automation Magazine.

[3]  N. Hagita,et al.  Introduction to a Network Robot System , 2006, 2006 International Symposium on Intelligent Signal Processing and Communications.

[4]  V. Scott Gordon,et al.  Evolving sparse direction maps for maze pathfinding , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[5]  Leszek Podsedkowski,et al.  A new solution for path planning in partially known or unknown environment for nonholonomic mobile robots , 2001, Robotics Auton. Syst..

[6]  L. Wyard-Scott,et al.  A potential maze solving algorithm for a micromouse robot , 1995, IEEE Pacific Rim Conference on Communications, Computers, and Signal Processing. Proceedings.

[7]  Jan M. Rabaey,et al.  When does opportunistic routing make sense? , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

[8]  Seong-Lyun Kim,et al.  The capacity of random wireless networks , 2008, IEEE Transactions on Wireless Communications.

[9]  James McLurkin,et al.  Distributed Algorithms for Dispersion in Indoor Environments Using a Swarm of Autonomous Mobile Robots , 2004, DARS.

[10]  Jiatao Song,et al.  A Complete Coverage Path Planning Method for Mobile Robot in Uncertain Environments , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[11]  Wolfram Burgard,et al.  Wireless communications in networked robotics [Guest editorial] , 2009 .

[12]  Anthony Stentz.  Optimal and Efficient Path Planning for Unknown and Dynamic Environments , 1993 .