Coverage Path Planning Optimization Based on Point Cloud for Structural Inspection

Author(s):  
Iago Z. Biundini ◽  
Milena F. Pinto ◽  
Aurelio G. Melo ◽  
Andre L. M. Marcato ◽  
Leonardo M. Honorio
Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 570 ◽  
Author(s):  
Iago Z. Biundini ◽  
Milena F. Pinto ◽  
Aurelio G. Melo ◽  
Andre L. M. Marcato ◽  
Leonardo M. Honório ◽  
...  

Different practical applications have emerged in the last few years, requiring periodic and detailed inspections to verify possible structural changes. Inspections using Unmanned Aerial Vehicles (UAVs) should minimize flight time due to battery time restrictions and identify the terrain’s topographic features. In this sense, Coverage Path Planning (CPP) aims at finding the best path to coverage of a determined area respecting the operation’s restrictions. Photometric information from the terrain is used to create routes or even refine paths already created. Therefore, this research’s main contribution is developing a methodology that uses a metaheuristic algorithm based on point cloud data to inspect slope and dams structures. The technique was applied in a simulated and real scenario to verify its effectiveness. The results showed an increasing 3D reconstructions’ quality observing optimizing photometric and mission time criteria.


2018 ◽  
Vol 15 (1) ◽  
pp. 202-213 ◽  
Author(s):  
Charles Norman Macleod ◽  
Gordon Dobie ◽  
Stephen Gareth Pierce ◽  
Rahul Summan ◽  
Maxim Morozov

2019 ◽  
Author(s):  
Luis Piardi ◽  
José Lima ◽  
Ana I. Pereira ◽  
Paulo Costa

Author(s):  
Iago Z. Biundini ◽  
Aurelio G. Melo ◽  
Milena F. Pinto ◽  
Guilherme M. Marins ◽  
Andre L. M. Marcato ◽  
...  

2020 ◽  
Vol 10 (23) ◽  
pp. 8641
Author(s):  
Xuan Ye ◽  
Lan Luo ◽  
Li Hou ◽  
Yang Duan ◽  
Yang Wu

Coverage path planning on a complex free-form surface is a representative problem that has been steadily investigated in path planning and automatic control. However, most methods do not consider many optimisation conditions and cannot deal with complex surfaces, closed surfaces, and the intersection of multiple surfaces. In this study, a novel and efficient coverage path-planning method is proposed that considers trajectory optimisation information and uses point cloud data for environmental modelling. First, the point cloud data are denoised and simplified. Then, the path points are converted into the rotation angle of each joint of the manipulator. A mathematical model dedicated to energy consumption, processing time, and path smoothness as optimisation objectives is developed, and an improved ant colony algorithm is used to solve this problem. Two measures are proposed to prevent the algorithm from being trapped in a local optimum, thereby improving the global search ability of the algorithm. The standard test results indicate that the improved algorithm performs better than the ant colony algorithm and the max–min ant system. The numerical simulation results reveal that compared with the point cloud slicing technique, the proposed method can obtain a more efficient path. The laser ablation de-rusting experiment results specify the utility of the proposed approach.


2021 ◽  
Vol 193 ◽  
pp. 107913
Author(s):  
Yuan Tang ◽  
Yiming Miao ◽  
Ahmed Barnawi ◽  
Bander Alzahrani ◽  
Reem Alotaibi ◽  
...  

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 642
Author(s):  
Luis Miguel González de Santos ◽  
Ernesto Frías Nores ◽  
Joaquín Martínez Sánchez ◽  
Higinio González Jorge

Nowadays, unmanned aerial vehicles (UAVs) are extensively used for multiple purposes, such as infrastructure inspections or surveillance. This paper presents a real-time path planning algorithm in indoor environments designed to perform contact inspection tasks using UAVs. The only input used by this algorithm is the point cloud of the building where the UAV is going to navigate. The algorithm is divided into two main parts. The first one is the pre-processing algorithm that processes the point cloud, segmenting it into rooms and discretizing each room. The second part is the path planning algorithm that has to be executed in real time. In this way, all the computational load is in the first step, which is pre-processed, making the path calculation algorithm faster. The method has been tested in different buildings, measuring the execution time for different paths calculations. As can be seen in the results section, the developed algorithm is able to calculate a new path in 8–9 milliseconds. The developed algorithm fulfils the execution time restrictions, and it has proven to be reliable for route calculation.


Sign in / Sign up

Export Citation Format

Share Document