Abstract. Consider a (robotic) explorer starting an exploration of an unknown terrain from its base station. As the explorer has only limited communication radius, it is necessary to maintain a line of robotic relay stations following the explorer, so that consecutive stations are within the communication radius of each other. This line has to start in the base station and to end at the explorer. In the simple scenario considered here we assume an obstacle-free terrain, so that the shortest connection (the one which needs the smallest number of relay stations) is a straight line. We consider an explorer who goes an arbitrary, typically winding way, and define a very simple, intuitive, fully local, distributed strategy for the relay stationsour Go-To-The-Middle strategy -to maintain a line from the base station to the robot as short as possible. Besides the definition of this strategy, we present an analysis of its performance under different assumptions. For the static case we prove a bound on the convergence speed, for the dynamic case we present experimental evaluations that show the quality of our strategy under different types of routes the explorer could use. In our research we investigate the exploration of a planar terrain without obstacles. To achieve this goal, an explorer is used who starts its work at a base station and progresses to gather information about the whole terrain. In order to construct a communication path between this explorer and the base station, we employ mobile relay stations. These relay stations are small, mobile robots ⋆
Another related scenario was presented in REF , where the explorer and the base station in the static setting correspond to our stations.
Maintaining Communication Between an Explorer and a Base Station
BICC
Computer Science