.. .. Sequential,

.. .. Experiments, 122 6.2.2.2 Biggest map with numerous waypoints

!. .. The-origin,

J. Luis, A. Herrera, and X. Chen, Online configuration of ptz camera networks, Distributed Smart Cameras (ICDSC), pp.1-6, 2012.

C. Soto, B. Song, and A. , Distributed multi-target tracking in a self-configuring camera network, Computer Vision and Pattern Recognition, pp.1486-1493, 2009.

C. Ding, B. Song, A. Morye, A. Jay, and A. Farrell, Collaborative sensing in a distributed ptz camera network, IEEE Transactions on Image Processing, vol.21, issue.7, pp.3282-3295, 2012.

J. Zhao, R. Yoshida, -. Sen, D. Cheung, and . Haws, Approximate techniques in solving optimal camera placement problems, International Journal of Distributed Sensor Networks, vol.9, issue.11, p.241913, 2013.

Y. Xu, B. Lei, and E. A. Hendriks, Camera network coverage improving by particle swarm optimization, EURASIP Journal on Image and Video Processing, issue.1, p.458283, 2011.

J. Zhao, S. Cheung, and T. Nguyen, Optimal camera network configurations for visual tagging, IEEE Journal of Selected Topics in Signal Processing, vol.2, issue.4, pp.464-479, 2008.

Y. Li, H. Chen, M. Er, and X. Wang, Coverage path planning for uavs based on enhanced exact cellular decomposition method, Mechatronics, vol.21, issue.5, pp.876-885, 2011.

C. Hoppe, A. Wendel, S. Zollmann, K. Pirker, A. Irschara et al., Photogrammetric camera network design for micro aerial vehicles, Computer vision winter workshop (CVWW), vol.8, pp.1-3, 2012.

S. Nikolaidis, R. Ueda, A. Hayashi, and T. Arai, Optimal camera placement considering mobile robot trajectory, IEEE International Conference on, pp.1393-1396, 2008.

R. Bodor, P. Schrater, and N. Papanikolopoulos, Multi-camera positioning to optimize task observability, Advanced Video and Signal Based Surveillance, 2005. AVSS 2005. IEEE Conference on, pp.552-557, 2005.

X. Lu, H. Huang, and J. Long, A bi-level programming model for network traffic surveillance of optimal camera location, Computational Sciences and Optimization (CSO), pp.1035-1039, 2011.

R. Bodor, A. Drenner, M. Janssen, P. Schrater, and N. Papanikolopoulos, Mobile camera positioning to optimize the observability of human activity recognition tasks, Intelligent Robots and Systems, 2005.

, IEEE/RSJ International Conference on, pp.1564-1569, 2005.

Y. Jiang, J. Yang, W. Chen, and W. Wang, A coverage enhancement method of directional sensor network based on genetic algorithm for occlusion-free surveillance, Computational Aspects of Social Networks (CASoN), 2010 International Conference on, pp.311-314, 2010.

E. Hörster and R. Lienhart, On the optimal placement of multiple visual sensors, Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks, pp.111-120, 2006.

D. Chrysostomou and A. Gasteratos, Optimum multi-camera arrangement using a bee colony algorithm, Imaging Systems and Techniques (IST), 2012 IEEE International Conference on, pp.387-392, 2012.

L. Liu, X. Zhang, and H. Ma, Dynamic node collaboration for mobile target tracking in wireless camera sensor networks, INFOCOM 2009, IEEE, pp.1188-1196, 2009.

D. Wu, S. Ci, H. Luo, Y. Ye, and H. Wang, Video surveillance over wireless sensor and actuator networks using active cameras, IEEE Transactions on Automatic Control, vol.56, issue.10, pp.2467-2472, 2011.

K. Sohrabi, J. Gao, V. Ailawadhi, and G. J. Pottie, Protocols for self-organization of a wireless sensor network, IEEE personal communications, vol.7, issue.5, pp.16-27, 2000.

L. Liu, X. Zhang, and H. Ma, Optimal node selection for target localization in wireless camera sensor networks, IEEE Transactions on Vehicular Technology, vol.59, issue.7, pp.3562-3576, 2010.

K. K. Reddy and N. Conci, Camera positioning for global and local coverage optimization, Distributed Smart Cameras (ICDSC), 2012 Sixth International Conference on, pp.1-6, 2012.

N. Bulusu, D. Estrin, L. Girod, and J. Heidemann, Scalable coordination for wireless sensor networks: self-configuring localization systems, International Symposium on Communication Theory and Applications, 2001.

C. D. Franco and G. Buttazzo, Coverage path planning for uavs photogrammetry with energy and resolution constraints, Journal of Intelligent & Robotic Systems, vol.83, issue.3-4, pp.445-462, 2016.

W. Meiting, T. Shili-ding-junjian, and Y. Liwen, Complete coverage path planning of wall-cleaning robot using visual sensor, Electronic Measurement and Instruments, 2007. ICEMI'07. 8th International Conference on, pp.4-159, 2007.

A. Mavrinac and X. Chen, Modeling coverage in camera networks: A survey, International journal of computer vision, vol.101, issue.1, pp.205-226, 2013.

C. Wang, F. Qi, and G. Shi, Nodes placement for optimizing coverage of visual sensor networks, Advances in Multimedia Information Processing-PCM 2009, pp.1144-1149, 2009.

Z. Zhang, J. Willson, Z. Lu, W. Wu, X. Zhu et al., Approximating maximum lifetime k-coverage through minimizing weighted k-cover in homogeneous wireless sensor networks, IEEE/ACM Transactions on Networking, vol.24, issue.6, pp.3620-3633, 2016.

N. Medhi and M. Pal, Sixsoid: A new paradigm for k-coverage in 3d wireless sensor networks, 2013.

U. Murat-erdem and S. Sclaroff, Automated camera layout to satisfy taskspecific and floor plan-specific coverage requirements, Computer Vision and Image Understanding, vol.103, issue.3, pp.156-169, 2006.

Y. Fu, J. Zhou, and L. Deng, Surveillance of a 2d plane area with 3d deployed cameras, Sensors, vol.14, issue.2, pp.1988-2011, 2014.

V. Chvatal, A combinatorial theorem in plane geometry, Journal of Combinatorial Theory, Series B, vol.18, issue.1, pp.39-41, 1975.

E. Packer, Computing multiple watchman routes, Lecture Notes in Computer Science, vol.5038, pp.114-128, 2008.

O. Joseph and . Rourke, Art gallery theorems and algorithms, vol.57, 1987.

C. Marcelo, P. J. Couto, C. De-rezende, and . Souza, An exact algorithm for minimizing vertex guards on art galleries, International Transactions in Operational Research, vol.18, issue.4, pp.425-448, 2011.

S. Fleishman, D. Cohen-or, and D. Lischinski, Automatic camera placement for image-based modeling, Computer Graphics Forum, vol.19, pp.101-110, 2000.

K. Yabuta and H. Kitazawa, Optimum camera placement considering camera specification for security monitoring, IEEE International Symposium on, pp.2114-2117, 2008.

A. Craig and . Tovey, A simplified np-complete satisfiability problem, Discrete applied mathematics, vol.8, issue.1, pp.85-89, 1984.

M. Moeini, A. Kröller, and C. Schmidt, Une nouvelle approche pour la résolution du problème de la galerie d'art

Y. Wang, G. Dang, Y. Si, and H. Zhou, An inversion propagation model using ga for coverage prediction of a single urban cell in wireless network, Communications, 2008. ICC'08. IEEE International Conference on, pp.4894-4898, 2008.

M. Haluk-rahmi-topcuoglu, M. Ermis, and . Sifyan, Hybrid evolutionary algorithms for sensor placement on a 3d terrain, Intelligent Systems Design and Applications, 2009. ISDA'09. Ninth International Conference on, pp.511-516, 2009.

H. Ma, M. Yang, D. Li, Y. Hong, and W. Chen, Minimum camera barrier coverage in wireless camera sensor networks, INFOCOM, 2012 Proceedings IEEE, pp.217-225, 2012.

V. Raghavendra, G. Kulkarni, and . Venayagamoorthy, Particle swarm optimization in wireless-sensor networks: A brief survey, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), vol.41, issue.2, pp.262-267, 2011.

K. Chakrabarty, H. Sitharama-iyengar, E. Qi, and . Cho, Grid coverage for surveillance and target location in distributed sensor networks, IEEE transactions on computers, vol.51, issue.12, pp.1448-1453, 2002.

V. Akbarzadeh, C. Gagné, M. Parizeau, M. Argany, and M. Mostafavi, Probabilistic sensing model for sensor placement optimization based on line-of-sight coverage, IEEE Transactions on Instrumentation and Measurement, vol.62, issue.2, pp.293-303, 2013.

M. Wang, X. Liu, Y. Zhang, and Z. Wang, Camera coverage estimation based on multistage grid subdivision, ISPRS International Journal of Geo-Information, vol.6, issue.4, p.110, 2017.

N. Li and J. R. Marden, Designing games for distributed optimization, IEEE Journal of Selected Topics in Signal Processing, vol.7, issue.2, pp.230-242, 2013.

B. Song, C. Soto, K. Amit, J. Roy-chowdhury, and . Farrell, Decentralized camera network control using game theory, Second ACM/IEEE International Conference on, pp.1-8, 2008.

A. Van-den-hengel, R. Hill, B. Ward, A. Cichowski, H. Detmold et al., Automatic camera placement for large scale surveillance networks, Applications of Computer Vision (WACV), pp.1-6, 2009.

W. Zhong, J. Liu, M. Xue, and L. Jiao, A multiagent genetic algorithm for global numerical optimization, IEEE Transactions on Systems, Man, and Cybernetics, vol.34, issue.2, pp.1128-1141, 2004.

P. Zhou and C. Long, Optimal coverage of camera networks using pso algorithm, Image and Signal Processing (CISP), 2011 4th International Congress on, vol.4, pp.2084-2088, 2011.

A. Kb-maji, . Ghosh, . Kar, and . Mandal, An evolutionary algorithm based approach for vlsi floor-planning, Science and Technology (TICST), 2015 International Conference on, pp.248-253, 2015.

X. Fu, W. Ru-chuan, L. Sun, and W. U. Shuai, Research on the threedimensional perception model and coverage-enhancing algorithm for wireless multimedia sensor networks, The Journal of China Universities of Posts and Telecommunications, vol.17, pp.67-72, 2010.

G. Vijayan and R. Tsay, A new method for floor planning using topological constraint reduction. IEEE transactions on computer-aided design of integrated circuits and systems, vol.10, pp.1494-1501, 1991.

S. Boyd and L. Vandenberghe, Convex optimization. Cambridge university press, 2004.

E. Galceran and M. Carreras, A survey on coverage path planning for robotics, Robotics and Autonomous Systems, vol.61, issue.12, pp.1258-1276, 2013.

J. Valente, D. Sanz, J. D. Cerro, A. Barrientos, and M. De-frutos, Near-optimal coverage trajectories for image mosaicing using a mini quad-rotor over irregular-shaped fields. Precision agriculture, vol.14, pp.115-132, 2013.

D. B. David-w-casbeer, R. W. Kingston, T. W. Beard, and . Mclain, Cooperative forest fire surveillance using a team of small unmanned air vehicles, International Journal of Systems Science, vol.37, issue.6, pp.351-360, 2006.

C. Luo, X. Simon, D. A. Yang, J. C. Stacey, and . Jofriet, A solution to vicinity problem of obstacles in complete coverage path planning, Proceedings. ICRA'02. IEEE International Conference on, vol.1, pp.612-617, 2002.

T. Lee, S. Baek, S. Oh, and Y. Choi, Complete coverage algorithm based on linked smooth spiral paths for mobile robots, Control Automation Robotics & Vision (ICARCV), pp.609-614, 2010.

X. Simon, C. Yang, and . Luo, A neural network approach to complete coverage path planning, IEEE Transactions on Systems, Man, and Cybernetics, vol.34, issue.1, pp.718-724, 2004.

J. Pablo, . Zarco-tejada, A. J. José, . Berni, E. Suárez et al., A new era in remote sensing of crops with unmanned robots, SPIE Newsroom, pp.2-4, 2008.

H. Chao, M. Baumann, A. Jensen, Y. Chen, Y. Cao et al., Band-reconfigurable multi-uav-based cooperative remote sensing for real-time water management and distributed irrigation control, IFAC Proceedings Volumes, vol.41, pp.11744-11749, 2008.

. Ds-long, J. M. Degloria, and . Galbraith, Use of the global positioning system in soil survey, Journal of soil and water conservation, vol.46, issue.4, pp.293-297, 1991.

A. Barrientos, J. Colorado, J. Del-cerro, A. Martinez, C. Rossi et al., Aerial remote sensing in agriculture: A practical approach to area coverage and path planning for fleets of mini aerial robots, Journal of Field Robotics, vol.28, issue.5, pp.667-689, 2011.

C. D. Camille, P. Lelong, G. Burger, B. Jubelin, S. Roux et al., Assessment of unmanned aerial vehicles imagery for quantitative monitoring of wheat crop in small plots, Sensors, vol.8, issue.5, pp.3557-3585, 2008.

. Ds-long, J. M. Degloria, and . Galbraith, Use of the global positioning system in soil survey, Journal of soil and water conservation, vol.46, issue.4, pp.293-297, 1991.

F. James, J. Roberts, D. Zufferey, and . Floreano, Energy management for indoor hovering robots, IEEE/RSJ International Conference on, pp.1242-1247, 2008.

S. Wei-pang-chin and . Ntafos, Optimum watchman routes. Information Processing Letters, vol.28, pp.39-44, 1988.

X. Tan, Fast computation of shortest watchman routes in simple polygons, Information Processing Letters, vol.77, issue.1, pp.27-33, 2001.

M. Dror, A. Efrat, A. Lubiw, and J. Mitchell, Touring a sequence of polygons, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp.473-482, 2003.

J. Faigl, Approximate solution of the multiple watchman routes problem with restricted visibility range, IEEE transactions on neural networks, vol.21, issue.10, pp.1668-1679, 2010.

M. Richard and . Karp, Reducibility among combinatorial problems, In Complexity of computer computations, pp.85-103, 1972.

H. Choset, Annals of mathematics and artificial intelligence, vol.31, pp.113-126, 2001.

M. Torres, A. David, . Pelta, L. José, J. Verdegay et al., Coverage path planning with unmanned aerial vehicles for 3d terrain reconstruction, Expert Systems with Applications, vol.55, pp.441-451, 2016.

A. Paulo, B. Jimenez, A. Shirinzadeh, G. Nicholson, and . Alici, Optimal area covering using genetic algorithms, Advanced intelligent mechatronics, 2007.

, IEEE/ASME international conference on, pp.1-5, 2007.

Y. Choi, T. Lee, S. Baek, and S. Oh, Online complete coverage path planning for mobile robots based on linked spiral paths using constrained inverse distance transform. In Intelligent Robots and Systems, IEEE/RSJ International Conference on, pp.5788-5793, 2009.

P. Hsu, C. Lin, and M. Yang, On the complete coverage path planning for mobile robots, Journal of Intelligent and Robotic Systems, vol.74, issue.3-4, pp.945-963, 2014.

V. An and Z. Qu, A practical approach to coverage control for multiple mobile robots with a circular sensing range, 2013 IEEE International Symposium on, pp.112-117, 2013.

H. Mühlenbein, Parallel genetic algorithms, population genetics and combinatorial optimization, Workshop on Parallel Processing: Logic, Organization, and Technology, pp.398-406, 1989.

M. Serpell and J. E. Smith, Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms, Evolutionary Computation, vol.18, issue.3, pp.491-514, 2010.

T. Davies and A. Jnifene, Multiple waypoint path planning for a mobile robot using genetic algorithms, Computational Intelligence for Measurement Systems and Applications, Proceedings of 2006 IEEE International Conference on, pp.21-26, 2006.

J. Ware and N. Roy, An analysis of wind field estimation and exploitation for quadrotor flight in the urban canopy layer, Robotics and Automation (ICRA), 2016 IEEE International Conference on, pp.1507-1514, 2016.

Y. Liu, X. Lin, and S. Zhu, Combined coverage path planning for autonomous cleaning robots in unstructured environments, Intelligent Control and Automation, pp.8271-8276, 2008.

H. Robbins and S. Monro, A stochastic approximation method. The annals of mathematical statistics, pp.400-407, 1951.

J. Hans and . Bremermann, Optimization through evolution and recombination. Selforganizing systems, vol.93, p.106, 1962.

M. Richard and . Friedberg, A learning machine: Part i, IBM Journal of Research and Development, vol.2, issue.1, pp.2-13, 1958.

E. P. George and . Box, Evolutionary operation: A method for increasing industrial productivity, Applied statistics, pp.81-101, 1957.

H. John and . Holland, Outline for a logical theory of adaptive systems, Journal of the ACM (JACM), vol.9, issue.3, pp.297-314, 1962.

T. Jarmo and . Alander, Department of Information Technology and Production Economics, 1994.

I. Rechenberg, Cybernetic solution path of an experimental problem, 1965.

A. Zhou, B. Qu, H. Li, and S. Zhao, Multiobjective evolutionary algorithms: A survey of the state of the art, Ponnuthurai Nagaratnam Suganthan, and Qingfu Zhang, vol.1, pp.32-49, 2011.

Q. Zhang and H. Li, Moea d a multiobjective evolutionary algorithm based on decomposition, IEEE Transactions on evolutionary computation, vol.11, issue.6, pp.712-731, 2007.

G. Soremekun, . Gürdal, L. T. Haftka, and . Watson, Composite laminate design optimization by genetic algorithm with generalized elitist selection, Computers & structures, vol.79, issue.2, pp.131-143, 2001.

E. David and . Goldberg, Genetic algorithms and walsh functions: Part i, a gentle introduction. Complex systems, vol.3, pp.129-152, 1989.

S. Ronald, Robust encodings in genetic algorithms: A survey of encoding issues, IEEE International Conference on, pp.43-48, 1997.

A. Godfrey, D. Walters, and . Smith, Evolutionary design algorithm for optimal layout of tree networks. Engineering Optimization, vol.24, pp.261-281, 1995.

S. Owais, V. Snasel, P. Kromer, and A. Abraham, Survey: using genetic algorithm approach in intrusion detection systems techniques, Computer Information Systems and Industrial Management Applications, 2008. CISIM'08. 7th, pp.300-307, 2008.

D. E. Goldberg, Optimal initial population size for binary-coded genetic algorithms. Clearinghouse for Genetic Algorithms, 1985.

Y. Morsly and N. Aouf, Mohand Said Djouadi, and Mark Richardson. Particle swarm optimization inspired probability algorithm for optimal camera network placement, IEEE Sensors Journal, vol.12, issue.5, pp.1402-1412, 2012.

H. Alden and . Wright, Genetic algorithms for real parameter optimization. Foundations of genetic algorithms, vol.1, pp.205-218, 1991.

J. E. Agoston-e-eiben and . Smith, Introduction to evolutionary computing, vol.53, 2003.

C. Haj-rachid-mais, ;. Bloch, and . De-franche-comte, Wahiba Ramdane-Cherif, and Pascal Chatonnay. Différentes opérateursévolutionnaires de permutation: sélections, croisements et mutations, 2010.

O. François and C. Lavergne, Design of evolutionary algorithms-a statistical perspective, IEEE Transactions on Evolutionary Computation, vol.5, issue.2, pp.129-148, 2001.

J. Arabas, Z. Michalewicz, and J. Mulawka, Gavaps-a genetic algorithm with varying population size, Proceedings of the First IEEE Conference on, pp.73-78, 1994.

L. Brad, D. E. Miller, and . Goldberg, Genetic algorithms, tournament selection, and the effects of noise, Complex systems, vol.9, issue.3, pp.193-212, 1995.

K. Matsui, New selection method to improve the population diversity in genetic algorithms, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on, vol.1, pp.625-630, 1999.

J. John and . Grefenstette, Optimization of control parameters for genetic algorithms, IEEE Transactions on systems, man, and cybernetics, vol.16, issue.1, pp.122-128, 1986.

X. H. Shi, . Liang, . Lee, L. M. Lu, and . Wang, An improved ga and a novel psoga-based hybrid algorithm, Information Processing Letters, vol.93, issue.5, pp.255-261, 2005.

R. Cerf, An asymptotic theory for genetic algorithms, European Conference on Artificial Evolution, pp.35-53, 1995.

H. Schwefel, Evolution strategies: A family of non-linear optimization techniques based on imitating some principles of organic evolution, Annals of Operations Research, vol.1, issue.2, pp.165-167, 1984.

K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii, International Conference on Parallel Problem Solving From Nature, pp.849-858, 2000.

D. Whitley, A genetic algorithm tutorial, Statistics and computing, vol.4, issue.2, pp.65-85, 1994.

D. Thierens and D. Goldberg, Elitist recombination: An integrated selection recombination ga, Proceedings of the First IEEE Conference on, pp.508-512, 1994.

M. Srinivas, M. Lalit, and . Patnaik, Adaptive probabilities of crossover and mutation in genetic algorithms, IEEE Transactions on Systems, Man, and Cybernetics, vol.24, issue.4, pp.656-667, 1994.

M. Srinivas, M. Lalit, and . Patnaik, Genetic algorithms: A survey, computer, vol.27, issue.6, pp.17-26, 1994.

Q. Zhang and H. Li, Moea/d: A multiobjective evolutionary algorithm based on decomposition, IEEE Transactions on evolutionary computation, vol.11, issue.6, pp.712-731, 2007.

H. Kuk, J. Han, and . Kim, Genetic quantum algorithm and its application to combinatorial optimization problem, Evolutionary Computation, vol.2, pp.1354-1360, 2000.

H. Kuk, J. Han, and . Kim, Quantum-inspired evolutionary algorithm for a class of combinatorial optimization, IEEE transactions on evolutionary computation, vol.6, issue.6, pp.580-593, 2002.

H. Rahila, . Sheikh, M. Mukesh, and . Raghuwanshi, Genetic algorithm based clustering: a survey, Emerging Trends in Engineering and Technology, 2008. ICETET'08. First International Conference on, pp.314-319, 2008.

K. Yuan, K. Wang, and . Fan, Applying genetic algorithms on pattern recognition: An analysis and survey, Proceedings of the 13th International Conference on, vol.2, pp.740-744, 1996.

V. Nazarzehi and A. V. Savkin, Distributed self-deployment of mobile wireless 3d robotic sensor networks for complete sensing coverage and forming specific shapes, Robotica, vol.36, issue.1, pp.1-18, 2018.

W. Ning, Strongly np-hard discrete gate-sizing problems, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.13, issue.8, pp.1045-1051, 1994.

R. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, Micro Machine and Human Science, 1995. MHS'95., Proceedings of the Sixth International Symposium on, pp.39-43, 1995.

W. Leong and . Gary-g-yen, Pso based multiobjective optimization with dynamic population size and adaptive local archives, IEEE Transactions on Systems, Man, and Cybernetics, vol.38, issue.5, pp.1270-1293, 2008.

W. Daniel, . Boeringer, H. Douglas, and . Werner, Particle swarm optimization versus genetic algorithms for phased array synthesis, IEEE Transactions on antennas and propagation, vol.52, issue.3, pp.771-779, 2004.

K. Premalatha and . Natarajan, Hybrid pso and ga for global maximization, Int. J. Open Problems Compt. Math, vol.2, issue.4, pp.597-608, 2009.

. Sg-ponnambalam, M. Jagannathan, A. Kataria, and . Gadicherla, A tsp-ga multiobjective algorithm for flow-shop scheduling, The International Journal of Advanced Manufacturing Technology, vol.23, pp.909-915, 2004.

J. Noraini-mohd-razali and . Geraghty, Genetic algorithm performance with different selection strategies in solving tsp, Proceedings of the world congress on engineering, vol.2, pp.1134-1139, 2011.

H. Choset and P. Pignon, Coverage path planning: The boustrophedon cellular decomposition, Field and service robotics, pp.203-209, 1998.

, The coverage is made by selecting a set of adapted waypoints. The coverage must be good enough to enable reconstruction of the 3D shape of the object without any occlusion. Result here are obtained by the method of Hoppe et al, p.13

, The aim is to focus on covering a road (walking path) in a small room by using only 3 cameras

, Map of an area to cover with crucial sub-area (region of interest), the normal sub-area and obstacle. This map is an example of area coverage

, Illustration of an covered area for tracking target

, The gallery is covered by 4 guards (x 1 ; ...; x 4 ) for a polygon composed by n vertice (v 1

, An omnidirectional sensor centred on x, with a radius r for the range, p.22

, Illustration fo a simple wireless sensor network with omnidirectional sensor centred on x, with a radius r

, Illustration of the area coverage with visual sensors. The area is covered at 47%. Experiment form Jiang et al

. .. , 26 2.10 Result of coverd area after the game theory optimization. The objective of the game therory is to maximize the tracking and the resolution. The results shown are from the experiment made, The images are representing the iterative sequences for the targets tracking and maximized resolution, p.30

, Illustration of the area coverage by a set of cameras randomly scattered (a)

, Watchman route problem answer illustration

. .. , 45 2.15 Illustration of a semi approximate decomposition outcome from the survey of Choset [72]. The 4 figures illustrates the trajectory of the robot over the time

. .. , Illustration of the different sweeps and spirals, p.47

, Finches from Galapagos archipelago extract od The Origin of species by C

. .. , 2 Biologic representation, cell to chromosome until DNA, p.53

, The selection implyed by GA mechanism

, The grid G is placed on the floor to discretize the area covered with numerous grid points g i . The point covered by the camera, belonging to B() are highlighted in red

. .. , 75 4.3 Example of map that must be covered with a randomized area sampling. Illustration from Horster et al [14] (a) Area to cover. (b) Area with the random points of the grid to cover (c) Importance weighting of the area (zone of the interest). (b) allowed position for cameras position, Map representation using random distribution or uniform grid, p.76

, 3D grid with uniform distribution of the grid points. Illustration from

, Illustration of a grid layer in three floor building from [47]. In the figure (b) (d) (c) the uniform grid is visible with the black case of the grid representing the area uncovered and the colored case for the covered area, p.78

, Relief grid used to discretize an area while taking into account the relief

, The rotation composed by three degrees of freedom on pan tilt roll (?, ?, ?), p.84

, The grid is placed on the floor to discretize the area covered, vol.87

, Map to cover with the map boundaries in red (W and H size) in black. The sub-part have no interest to be covered

, ) the blue rectangle represents the field of view of one camera projected onto the ground with z=1 (30 × 20px) and in the figure (c), (d) with z=2 (60 × 40px)

G. A. Comparison-between, . Pso, and . .. Gapso, , vol.106

, Indoor area coverage using V-rep to simulate a realistic environment, p.108

, Coverage area from satellite images with 75 cameras for a coverage of 76.39% using the the GA

. .. Gapso, 110 5.7 Optimization of the waypoints poses with a vast outside area and just a few black holes, Coverage area from satellite images with 25 cameras for 90.76% of coverage using the GA and 92.81% of coverage using the

, a) is the area to cover taken from a satellite images,(b) is a mask of the area to cover, (c) is a result of the coverage with the waypoints position, (d) is the representation of the black hole

, 2 Extraction of the curve angle in the trajectory

, Experimentation of coverage path planning in outdoor area, p.123

, Experimentation of coverage path planning in outdoor area, p.124

, Outdoor simulation of the coverage path planning. The camera projection FoV is 40 × 60px and fixed altitude(with a square projection of 40px wide for the positioning optimization)

, Outdoor simulation of the coverage path planning. The camera projection FOV is 40 × 60px and fixed altitude (with a square projection of 40px wide for the positioning optimization)

, Covered area between waypoints following the path planning. Where Wr and Hr are the size of the camera projection as

. .. , 128 6.10 Path plan for maximizing the covered area with a camera projection equal to 40x60px. The area is covered with 5 and 8 waypoints, Influence of the waypoints order in the new cost function, p.129

A. , Path planning for maximizing the covered area. The area is covered with 15 and 30 waypoints and several cost functions have been tested

.. .. Sum-up-ref, 32 2.2 Sum-up of the solution based on evolutionary method for maximize the coverage

. List and . .. Ea,

, Important clarifications for setting up a GA

. .. Parameters, 95 5.1 Design of the experiment to compare the efficiency of PSO and GA in different conditions. (GT is Ground Truth and NW is the maximum Number of Waypoints)

, A.1 Sum-up of the low and high sampling frequency advantages or disadvantages