Directional sensors are gaining importance due to applications, including surveillance, detection, and tracking. Such sensors have a limited field of view and a discrete set of directions they can be pointed to. The directional sensor control problem (DSCP) consists in assigning a direction of view to each sensor. The location of the targets is known with uncertainty given by a joint a priori Gaussian distribution, while the sensor locations are known exactly. In this paper, we study the exact and heuristic approaches for the DSCP with the goal of maximizing information gain on the location of a given set of immobile target objects. In particular, we propose an exact mixed integer convex programming (MICP) formulation to be solved by a black-box MICP solver and several metaheuristic approaches based on local search. A computational evaluation shows the very good performance of both methods.
- Benders decomposition
- Mixed integer convex programming
- directional sensors
ASJC Scopus subject areas
- Electrical and Electronic Engineering