Grid based 2D navigation by a decentralized robot system with collison avoidance

This paper presents a collision-free decentralized random algorithm for robots to search an unknown 2D area with obstacles. Assumptions in this paper are based on real robots instead of particles so collisions between robots are considered. Robots move along edges of a grid and randomly choose the next steps in sequence based on local sensing, communication, and the repulsive force method. A rigorous mathematical proof of convergence with probability 1 is given. For a complete search of the area, an equilateral triangular grid should be used and the algorithm is compared with others in the simulation.

[1]  Serge Kernbach,et al.  Multi-robot searching algorithm using Lévy flight and artificial potential field , 2010, 2010 IEEE Safety Security and Rescue Robotics.

[2]  Andrey V. Savkin,et al.  Analysis and synthesis of networked control systems: Topological entropy, observability, robustness and optimal control , 2005, Autom..

[3]  Hugo Ferreira,et al.  Multiple robot operations for maritime search and rescue in euRathlon 2015 competition , 2016, OCEANS 2016 - Shanghai.

[4]  Ahmad Baranzadeh,et al.  A decentralized Grid-based Random Search Algorithm for Locating Targets in Three dimensional Environments by a Mobile Robotic Network , 2015 .

[5]  E. Shaw.  The Development of Schooling in Fishes. II , 1961, Physiological Zoology.

[6]  A. Matveev,et al.  Algorithms for collision-free navigation of mobile robots in complex cluttered environments: a survey , 2014, Robotica.

[7]  Andrey V. Savkin,et al.  Seeking a path through the crowd: Robot navigation in unknown dynamic environments with moving obstacles based on an integrated environment representation , 2014, Robotics Auton. Syst..

[8]  Zygmunt J. Haas,et al.  Coverage and connectivity in three-dimensional underwater sensor networks , 2008, Wirel. Commun. Mob. Comput..

[9]  Olivier Aycard,et al.  Grid-based Localization and Online Mapping with Moving Object Detection and Tracking , 2007 .

[10]  Gregory Dudek,et al.  Pure Topological Mapping in Mobile Robotics , 2010, IEEE Transactions on Robotics.

[11]  Ahmad Baranzadeh,et al.  A Decentralized Control Algorithm for Target Search by a Multi-Robot Team , 2013 .

[12]  Andrey V. Savkin,et al.  Decentralized Control of Mobile Sensor Networks for Asymptotically Optimal Blanket Coverage Between Two Boundaries , 2013, IEEE Transactions on Industrial Informatics.

[13]  Ali Marjovi,et al.  Multi-robot exploration and fire searching , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  Ahmad Baranzadeh,et al.  Decentralized Autonomous Navigation Strategies for Multi-Robot Search and Rescue , 2016, ArXiv.

[15]  Andrey V. Savkin,et al.  A simple biologically inspired algorithm for collision-free navigation of a unicycle-like robot in dynamic environments with moving obstacles , 2013, Robotica.

[16]  Andrey V. Savkin,et al.  Optimal Distributed Blanket Coverage Self-Deployment of Mobile Wireless Sensor Networks , 2012, IEEE Communications Letters.

[17]  Andrey V. Savkin,et al.  The problem of optimal robust Kalman state estimation via limited capacity digital communication channels , 2005, Syst. Control. Lett..

[18]  Roland Siegwart,et al.  Introduction to Autonomous Mobile Robots , 2004 .

[19]  Haibing Guan,et al.  A PSO-inspired multi-robot search algorithm independent of global information , 2011, 2011 IEEE Symposium on Swarm Intelligence.

[20]  Xiaotian Yang.  A decentralized algorithm for collision free navigation of multiple robots in search tasks , 2016, CCC 2016.

[21]  Andrey V. Savkin,et al.  Real-time navigation of mobile robots in problems of border patrolling and avoiding collisions with moving and deforming obstacles , 2012, Robotics Auton. Syst..

[22]  Andrey V. Savkin,et al.  A method for guidance and control of an autonomous vehicle in problems of border patrolling and obstacle avoidance , 2011, Autom..