A simulation of the Coverage Path Planning problem. Three robots that know nothing about a room full of obstacles, have to fully discover and cover it.
In this particular simulation, each robot is using a greedy search algorithm, and they are sharing their plans between them so they do a collaborative work.
Typical applications are vacuum cleaning robots (like iRobot Roomba) or mine detection.
