Generating a 2d- Navigation Map for Collision-Free Navigation by Multiple Robots

1. A computer implemented method to generate a 2D-navigation map for collision-free navigation by a plurality of robots, the method comprising: initiating a particle simulation to add a plurality of bubbles to an image of an area; processing a bubble simulation to determine a set of bubbles from the plurality of bubbles on the image that are overlapping free spaces of the area in the image, wherein determining the set of bubbles from the plurality of bubbles on the image uses repulsion and rebound operation; generating a 2D-navigation map by connecting the set of bubbles using a plurality of edges, wherein the plurality of edges indicate a navigation path to navigate within the area; and based on the generated 2D-navigation map, traversing the plurality of robots from a current location to another location.

2. The computer implemented method of claim 1 , further comprising: receiving a request to determine a collision-free shortest time taken path for the plurality of robots to traverse from the current location to another location; and executing a path finding query on the generated 2D-navigation map to generate a collision-free shortest time taken path for the plurality of robots to traverse from the current location to another location.

3. The computer implemented method of claim 2 , further comprising: communicating the collision-free path to the one or more of the plurality of robots.

4. The computer implemented method of claim 1 , further comprising: retrieving an obstacle map of the area; and generating the image corresponding to the retrieved obstacle map.

5. The computer implemented method of claim 1 , wherein processing the bubble simulation to determine a set of bubbles comprises: deleting a bubble from the plurality of bubbles that are overlapping a non-free space; and based on the deletion, determining the set of bubbles from the plurality of bubbles on the image.

6. The method, as claimed in claim 1 , wherein the method further comprises terminating the bubble simulation when the plurality of bubbles in the simulation are static.

7. The computer implemented method of claim 1 , wherein the repulsion and rebound operation comprises: moving a bubble from a first position that overlaps a non-free space of the area to a second position that overlaps a free space of the area.

8. A computer system to generate a 2D-navigation map for collision-free navigation by a plurality of robots, the system comprising: a memory to store program code; and a processor executing the program code to: initiate a particle simulation to add a plurality of bubbles to an image of an area; process a bubble simulation to determine a set of bubbles from the plurality of bubbles on the image that are overlapping free spaces of the area in the image, wherein determining the set of bubbles from the plurality of bubbles on the image uses repulsion and rebound operation; generate a 2D-navigation map by connecting the set of bubbles using a plurality of edges, wherein the plurality of edges indicate a navigation path to navigate within the area; and based on the generated 2D-navigation map, traverse the plurality of robots from a current location to another location.

9. The computer system according to claim 8 , wherein the processor further executes the program code to: move a bubble from a first position that overlaps a non-free space of the area to a second position that overlaps a free space of the area.

10. The computer system according to claim 8 , wherein the processor further executes the program code to: receive a request to determine a collision-free shortest time taken path for the plurality of robots to traverse from the current location to another location; and execute a path finding query on the generated 2D-navigation map to generate a collision-free shortest time taken path for the plurality of robots to traverse from the current location to another location.

11. The computer system according to claim 10 , wherein the processor further executes the program code to: communicate the collision-free path to the one or more of the plurality of robots.

12. The computer system according to claim 10 , wherein the processor further executes the program code to: retrieve an obstacle map of the area; and generate the image corresponding to the retrieved obstacle map.

13. The computer system according to claim 10 , wherein the processor further executes the program code to: delete a bubble from the plurality of bubbles that are overlapping a non-free space; and based on the deletion, determine the set of bubbles from the plurality of bubbles on the image.

14. The computer system according to claim 10 , wherein the processor further executes the program code to: terminate the bubble simulation when the plurality of bubbles in the simulation are static.

15. A non-transitory computer readable medium storing instructions that when executed by a computer causes the computer to: initiate a particle simulation to add a plurality of bubbles to an image of an area; process the bubble simulation to determine a set of bubbles from the plurality of bubbles on the image that are overlapping free spaces of the area in the image, wherein determining the set of bubbles from the plurality of bubbles on the image uses repulsion and rebound operation; generate a 2D-navigation map by connecting the set of bubbles using a plurality of edges, wherein the plurality of edges indicate a navigation path to navigate within the area; and based on the generated 2D-navigation map, traverse the plurality of robots from a current location to another location.

16. The non-transitory computer readable medium according to claim 15 , wherein the computer further executes the program code to: receive a request to determine a collision-free shortest time taken path for the plurality of robots to traverse from the current location to another location; and execute a path finding query on the generated 2D-navigation map to generate a collision-free shortest time taken path for the plurality of robots to traverse from the current location to another location.

17. The non-transitory computer readable medium according to claim 16 , wherein the computer further executes the program code to: communicate the collision-free path to the one or more of the plurality of robots.

18. The non-transitory computer readable medium according to claim 15 , wherein the computer further executes the program code to: retrieve an obstacle map of the area; and generate the image corresponding to the retrieved obstacle map.

19. The non-transitory computer readable medium according to claim 15 , wherein the computer further executes the program code to: delete a bubble from the plurality of bubbles that are overlapping a non-free space; and based on the deletion, determine the set of bubbles from the plurality of bubbles on the image.

20. The non-transitory computer readable medium according to claim 15 , wherein the computer further executes the program code to: move a bubble from a first position that overlaps a non-free space of the area to a second position that overlaps a free space of the area.