Association for Computing Machinery
In this paper, the authors study the problem of dynamic coverage of a set of Points Of Interest (POIs) in a time-varying environment. They consider the scenario where a physical quantity is constantly growing at certain rates at the POIs. A number of mobile agents are then deployed to periodically cover (sense or service) the POIs and keep the physical quantity under control bounded at all the POIs. They assume a communication-constrained operation, where the mobile agents need to communicate to a fixed remote station over realistic wireless links to complete their coverage task.