The Analysis of an Efficient Algorithm for Robot Coverage and Exploration based on Sensor Network Deployment

In this paper we present the design and theoretical analysis of a novel algorithm (LRV) that efficiently solves the problems of coverage, exploration and sensor network deployment at the same time. The basic premise behind the algorithm is that the robot carries network nodes as a payload, and in the process of moving around, emplaces the nodes into the environment based on certain local criteria. In turn, the nodes emit navigation directions for the robot as it goes by. Nodes recommend directions least recently visited by the robot, hence the name LRV. We formally establish the following two properties: 1. LRV is complete on graphs, and 2. LRV is optimal on trees. We present some experimental conjectures for LRV on regular square lattice graphs and compare its performance empirically to other graph exploration algorithms.