:: Volume 6, Issue 1 (6-2018) ::
jgit 2018, 6(1): 15-43 Back to browse issues page
A Novel and Efficient Algorithm for three-dimensional Coverage and Deployment of Aerial Robots in Vector Spaces
Ali Asghar Heidari , Farid Karimipour *
University of Tehran
Abstract:   (3424 Views)
The maximum coverage sensor deployment problem has attracted researchers of engineering sciences always as one of the fundamental phases in developing of communication and geospatial infrastructures. In this research, a novel strategy is proposed to tackle the maximum coverage robotic sensor deployment task in 3D vector spaces. For this purpose, first, a geometric algorithm is developed in order to detect the covered areas. The water cycle optimization algorithm is utilized to maximize the sensor coverage. Then, to avoid the problem of premature convergence to local optima and to improve the efficiency and searching potential on the problem, an improved water cycle algorithm with dynamic operations and fewer parameters is designed and developed. With regard to several scenarios with different spatial constraints, the efficiency of the proposed algorithm is compared to other methods based on robustness, running time, best and average of the coverage results, standard deviation, convergence speed, and wilcoxon statistical test. The assessment of the results reveals the superior performance of the proposed approach by success rate of 73% and coverage of 80% in a 3D vector space.
Keywords: Aerial robots, Deployment, Coverage, Vector space, Optimization, Water cycle algorithm
Full-Text [PDF 2604 kb]   (1445 Downloads)    
Type of Study: Research | Subject: GIS
Received: 2016/09/21 | Accepted: 2017/08/26 | Published: 2018/06/21



XML   Persian Abstract   Print



Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 6, Issue 1 (6-2018) Back to browse issues page