Parallel Preprocessing for the Optimal Camera Placement Problem
International Journal of Modeling and Optimization
This paper deals with the preprocessing needed for the optimal camera placement problem, which is stated as a unicost set covering problem (USCP). Distributed and massively parallel computations with graphics processing unit (GPU) are proposed in order to perform the reduction and visibility preprocessing respectively. An experimental study reports that a significant speedup can be achieved, and we give a general heterogeneous parallel approach that brings together these parallel computations.
... llel computations. In addition to that, a set-based differential evolution (DE) method is applied to solve 10 instances of the considered problem, and promising results are reported. Index Terms-Distributed computing, graphics processing unit (GPU), optimal camera placement problem, preprocessing, set-based differential evolution (DE) algorithm, unicost set covering problem (USCP). Mathieu Bré villiers received in 2008 his PhD degree in computer science from the University of Haute-Alsace (UHA), Mulhouse, France. He spent one year at the Grenoble Intitute of Technology (Grenoble INP, France) as temporary lecturer and researcher, and then has been hired by the UHA in 2009 as associate professor. Since 2014, he is member of the "Metaheuristic and Combinatorial Optimization" research team at LMIA Laboratory. His main research interests include massively parallel and distributed hybrid metaheuristics and their applications.