A reactive motion planner to maintain visibility of unpredictable targets

摘要

This paper deals with the problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The targets are assumed to move unpredictably, and the distribution of obstacles in the workspace is assumed to be known in advance. Our algorithm computes a motion strategy by maximizing the shortest distance to escape $the shortest distance the target needs to move in order to escape the observer's visibility region. Three main points are discussed: 1) the design and implementation of a reactive planner; 2) the integration and testing of such a planner in a robot system which includes perceptual and control capabilities; and 3) the design and simulation of a motion planner for the task of maintaining visibility of two targets using two mobile observers.