A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
2008 IEEE Conference on Cybernetics and Intelligent Systems
The problem of computing such minimal active sensor which can cover the target region completely is NP-hard. This paper designs a novel method, in which the detection area is divided into lots of virtual grid. So area coverage can approximately be considered as point coverage. Then the problem of area coverage turns into set covering problem. An improved ant colony algorithm is proposed for the minimal set covering. Experimental results show that the lever of algorithmic complication isdoi:10.1109/iccis.2008.4670965 fatcat:mwbx7oemzbc2tgbfhjjbzkb7le