Traffic and congestion free routing for mobile robots

Small group of robots are being used at different places to gather information. The proclivity for the usage of a team of robots in order to gather information is likely to increase in the upcoming future. The efficient and lossless communication becomes vital for these robots. In our research paper we propose an algorithm that focuses on minimizing congestion and data losses amongst a team of robots. Our algorithm prevents congestion beforehand and can be divided into two parts. A detailed description of these parts has been given in the paper. The algorithm was also tested on various grounds. These results have been discussed in the paper. The algorithm focuses on labelling each node depending on its congestion status and discovering an alternate path having a lower congestion status as soon as the path becomes liable to come in the congested zone.