We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill effects of free riding in unstructured P2P networks. Based on various parameter ...
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Systems constructed from components, including distributed systems, consist of a number of elements that interact with each other. As the number of network elements or interchangea...
Abstract. A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust th...