Abstract
The optimal placement of surveillance cameras and determining the configuration of exposure routes to ensure optimal coverage is essentially a combinatorial optimisation problem. In this paper, we proposed two approaches to identify and locate the location of cameras in an area of interest with planning already done at the site. The major contribution of the paper is to propose the modification on the greedy grid voting algorithm, which can control the overlap between each camera's coverage based on the application requirements. The greedy grid-voting algorithm does not follow any execution order for optimisation purposes. We also modified the traditional global greedy algorithm and it produced better coverage of the area of interest compared to the greedy approaches used to calculate the maximum coverage. The results obtained tell us that the approach ensures total coverage with a minimum of sensors than other techniques exist in the literature.