A Framework for Coverage Path Planning Optimization Based on Point Cloud for Structural Inspection

被引:28
|
作者
Biundini, Iago Z. [1 ]
Pinto, Milena F. [2 ]
Melo, Aurelio G. [1 ]
Marcato, Andre L. M. [1 ]
Honorio, Leonardo M. [1 ]
Aguiar, Maria J. R. [1 ]
机构
[1] Univ Fed Juiz de Fora, Dept Elect Engn, BR-36036900 Juiz De Fora, Brazil
[2] Fed Ctr Technol Educ Rio De Janeiro, Dept Elect Engn, BR-20271110 Rio De Janeiro, Brazil
关键词
3D inspection; coverage path planning; point cloud analysis; optimization; UAV; ALGORITHM;
D O I
10.3390/s21020570
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
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.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 50 条
  • [21] A Computational Framework for Automatic Online Path Generation of Robotic Inspection Tasks via Coverage Planning and Reinforcement Learning
    Jing, Wei
    Goh, Chun Fan
    Rajaraman, Mabaran
    Gao, Fei
    Park, Sooho
    Liu, Yong
    Shimada, Kenji
    IEEE ACCESS, 2018, 6 : 54854 - 54864
  • [22] Coverage Path Planning Techniques for Inspection of Disjoint Regions With Precedence Provision
    Khanam, Zeba
    Saha, Sangeet
    Ehsan, Shoaib
    Stolkin, Rustam
    Mcdonald-Maier, Klaus
    IEEE ACCESS, 2021, 9 : 5412 - 5427
  • [23] Coverage Path Planning for Robotic Quality Inspection With Control on Measurement Uncertainty
    Liu, Yinhua
    Zhao, Wenzheng
    Liu, Hongpeng
    Wang, Yinan
    Yue, Xiaowei
    IEEE-ASME TRANSACTIONS ON MECHATRONICS, 2022, 27 (05) : 3482 - 3493
  • [24] Coverage Path Planning with Proximal Policy Optimization in a Grid-based Environment
    Ianenko, Aleksandr
    Artamonov, Alexander
    Sarapulov, Georgii
    Safaraleev, Alexey
    Bogomolov, Sergey
    Noh, Dong-ki
    2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2020, : 4099 - 4104
  • [25] Coverage path planning for eddy current inspection on complex aeronautical parts
    Olivieri, P.
    Birglen, L.
    Maldague, X.
    Mantegh, I.
    ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2014, 30 (03) : 305 - 314
  • [26] Research on Robot Path Planning Based on Point Cloud Map in Orchard Environment
    Li, Zhongyang
    Liu, Xiong
    Wang, Huairui
    Song, Jian
    Xie, Fuxiang
    Wang, Kai
    IEEE ACCESS, 2024, 12 : 54853 - 54865
  • [27] Point Cloud-Based Lane Detection for Optimal Local Path Planning
    Choi, Seungjin
    Kim, Dohun
    Park, Sanghyun
    Paik, Joonki
    2022 INTERNATIONAL CONFERENCE ON ELECTRONICS, INFORMATION, AND COMMUNICATION (ICEIC), 2022,
  • [28] Path Planning of Robot Processing Based on Three-Dimensional Point Cloud
    Zhang Tie
    Zhang Meihui
    Zou Yanbiao
    CHINESE JOURNAL OF LASERS-ZHONGGUO JIGUANG, 2018, 45 (05):
  • [29] A new welding path planning method based on point cloud and deep learning
    Xu, Chuqiao
    Wang, Junliang
    Zhang, Jie
    Lu, Chao
    2020 IEEE 16TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2020, : 786 - 791
  • [30] Trajectory Planning and Optimization for Robotic Machining Based On Measured Point Cloud
    Wang, Gang
    Li, Wenlong
    Jiang, Cheng
    Zhu, Dahu
    Li, Zhongwei
    Xu, Wei
    Zhao, Huan
    Ding, Han
    IEEE TRANSACTIONS ON ROBOTICS, 2022, 38 (03) : 1621 - 1637