Algorithms for Full-View Coverage of Targets with Group Set Cover

Group Set Cover is an optimization problem which its solution that can be used to solve the problem of full-view target coverage. In the context of time slices, two methods (TSC-FTC, FTC-TW) based on Group Set Cover have been proposed to optimize full-view coverage of targets problem. In TSC-FTC, the set of sensors that can cover the most targets are chosen using Group Set Cover in each time slice, and the total number of targets covered throughout time is calculated. This method effectively utilizes the resources in each time slice and enables the evaluation of coverage effectiveness. FTC-TW, an improvement of TSC-FTC, involves using Group Set Cover in each time slice to select the set of sensors that can cover the maximum number of targets, and then calculating the cumulative number of targets covered after a certain period of time. This method enables a quick selection of the set of sensors covering the maximum number of targets and also enables the evaluation of the effectiveness of full-view coverage. Both methods can effectively improve the full-view coverage of targets in different scenarios. We perform approximate solutions for both algorithms separately and provide a global approximation to the local optimality of non-submodular optimization.