Mobile robots operating in unknown environments need to build maps. To do so they must have an exploration algorithm to plan a path. This algorithm should guarantee that the whole of the environment, or at least some designated area, will be mapped. The path should also be optimal in some sense and not simply a "random walk" which is clearly inefficient.\ud When multiple robots are involved, the algorithm also\ud needs to take advantage of the fact that the robots can\ud share the task. In this paper we discuss a modification\ud to the well-known distance transform that satisfies\ud these requirements
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.