Abstract.One of the primary ability of an intelligent mobile robot system is obstacle avoidance. BUG algorithms are classic examples of the algorithms used for achieving obstacle avoidance. Unlike many other planning algorithms based on global knowledge, BUG algorithms assume only local knowledge of the environment and a global goal. Among the variations of the BUG algorithms that prevail, BUG-0, BUG-1 and BUG-2 are the more prominent versions. The exhaustive search algorithm present in BUG-1 makes it more reliable and safer for practical applications. Overall, this provides a more predictable and dependable performance. Hence, the essential focus in this paper is on implementing the BUG-1 algorithm across a group of robots to move them from a start location to a target location. The results are compared with the results from BUG-1 algorithm implemented on a single robot. The strategy developed in this work reduces the time involved in moving the robots from starting location to the target location. Further, the paper shows that the total distance covered by each robot in a multi robot-system is always lesser than or equal to that travelled by a single robot executing the same problem.