Drone Coverage Path Planning for Visual Inspection of Building Facades

To efficiently plan the coverage path of UAVs during the visual inspection of building facades, the task is divided into two parts: viewpoint planning and path planning. First, a K-medoid clustering method is proposed to generate the initial set of candidate viewpoints based on the point cloud model of the building facade. A greedy optimization algorithm is then employed to select the optimal subset of viewpoints, addressing the viewpoint planning problem. Second, an incomplete graph is constructed, and the objective function is defined for path planning, which is solved using the Gaussian Zenith-Ant Colony Optimization (GZ-ACO) algorithm. The path length and turning angles are considered optimization objectives. Simulation results demonstrate that the proposed viewpoint planning method reduces the number of viewpoints by 66.67% and 98.67%, respectively, compared to the iterative random sampling method and the displacement method. Furthermore, the GZ-ACO algorithm outperforms the traditional ant colony algorithm, achieving a 19.97% reduction in the objective function value and a 21.76% decrease in the average steering angle. The validity and feasibility of the proposed method are thus verified.

Authors

Institutions

Publication Details

Published
2025-03-26
DOI
https://doi.org/10.1109/icit63637.2025.10965204
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Drone Coverage Path Planning for Visual Inspection of Building Facades

Fei Song, Jianguo Tan, Jianxiao Zheng, Wenhao Li
Robotic Path Planning Algorithms
article

Drone Coverage Path Planning for Visual Inspection of Building Facades

Fei Song, Jianguo Tan, Jianxiao Zheng, Wenhao Li
article en

Abstract

To efficiently plan the coverage path of UAVs during the visual inspection of building facades, the task is divided into two parts: viewpoint planning and path planning. First, a K-medoid clustering method is proposed to generate the initial set of candidate viewpoints based on the point cloud model of the building facade. A greedy optimization algorithm is then employed to select the optimal subset of viewpoints, addressing the viewpoint planning problem. Second, an incomplete graph is constructed, and the objective function is defined for path planning, which is solved using the Gaussian Zenith-Ant Colony Optimization (GZ-ACO) algorithm. The path length and turning angles are considered optimization objectives. Simulation results demonstrate that the proposed viewpoint planning method reduces the number of viewpoints by 66.67% and 98.67%, respectively, compared to the iterative random sampling method and the displacement method. Furthermore, the GZ-ACO algorithm outperforms the traditional ant colony algorithm, achieving a 19.97% reduction in the objective function value and a 21.76% decrease in the average steering angle. The validity and feasibility of the proposed method are thus verified.

Xi'an University of Architecture and Technology (CN)
National Natural Science Foundation of China
Climate action
Openalex Percentile: Top 93%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.