Trajectory planning for target sweep coverage with mobile sensors
摘要
Sweep coverage involves mobile sensors visiting targets to relay information to a base station. This paper defines the Minimum Cost Sweep Coverage Problem (MCSCP), seeking to minimize the number of mobile devices while adhering to a required sweep period. The MCSC algorithm addresses this by segmenting the area into cells and focusing on essential cells that cover all targets, minimizing unnecessary trips. Experimental results show that MCSC outperforms existing methods, requiring fewer sensors for the same sweep periods. For instance, with two sinks and a 37-seconds sweep period, MCSC needs 29% fewer sensors than the SinkCycle algorithm for 100 targets. Additionally, for a 30-seconds sweep period, MCSC requires fewer sensors than the D-ROSE algorithm. The study also considers an upper limit on the distance a device can travel before recharging, noting that this slightly increases the number of devices needed.