Abstract
We propose a method for determining the number of sensors, their arrangement, and approximate lower bounds for the number of sensors for the multiple covering of an arbitrary closed bounded convex area in a plane. The problem of multiple covering is considered with restrictions on the minimal possible distances between the sensors and without such restrictions. To solve these problems, some 0–1 linear programming (LP) problems are constructed.We use a heuristic solution algorithm for 0–1 LP problems of higher dimensions. The results of numerical implementation are given and for some particular cases it is obtained that the number of sensors found can not be decreased.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
