Optimal placement of stereo sensors

Autonomous wireless devices such as sensor nodes and stereo cameras, due to their low cost of operation coupled with the potential for remote deployment, have found a plethora of applications ranging from monitoring air, soil and water to seismic detection and military surveillance. Typically, such a network spans a region of interest with the individual nodes cooperating to detect events and disseminate information. Given a deployment of sensors and targets over a region, a sensor pairing is desired for each target that optimizes the coverage under certain constraints. This problem can be modeled as an integer programming problem and solved using branch-and-cut. For larger problems, it is necessary to limit the number of variables, and a GRASP routine was developed for this purpose. Valid cutting planes are developed and computational results presented.

[1]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[2]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[3]  Paola Festa,et al.  GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES , 2003 .

[4]  Carlos A. S. Oliveira,et al.  Asymptotic Properties of Random Multidimensional Assignment Problems , 2004 .

[5]  Panos M. Pardalos,et al.  GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..

[6]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[7]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[8]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[9]  Sanjeev Khanna,et al.  Target tracking with distributed sensors: the focus of attention problem , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[10]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[11]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[12]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[13]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[14]  Mika Johnsson,et al.  On the Euclidean 3-Matching Problem , 1998, Nord. J. Comput..

[15]  Toshihide Ibaraki,et al.  Metaheuristics : progress as real problem solvers , 2005 .

[16]  Erik D. Demaine,et al.  Deploying sensor networks with guaranteed capacity and fault tolerance , 2005, MobiHoc '05.

[17]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[18]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[19]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2005, Mob. Networks Appl..