Coverage path planning with unmanned aerial vehicles for 3D terrain reconstruction

被引:162
作者
Torres, Marina [1 ]
Pelta, David A. [1 ]
Verdegay, Jose L. [1 ]
Torres, Juan C. [2 ]
机构
[1] Univ Granada, Dept Comp Sci & Artificial Intelligence, Models Decis & Optimizat Res Grp, E-18014 Granada, Spain
[2] Univ Granada, Virtual Real Lab, Dept Syst & Languages, E-18014 Granada, Spain
关键词
Coverage path planning; Unmanned aerial vehicle; Heuristics; Non-convex areas; 3D terrain reconstruction; ALGORITHM;
D O I
10.1016/j.eswa.2016.02.007
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Three-dimensional terrain reconstruction from 2D aerial images is a problem of utmost importance due its wide level of applications. It is relevant in the context of intelligent systems for disaster managements (for example to analyze a flooded area), soil analysis, earthquake crisis, civil engineering, urban planning, surveillance and defense research. It is a two level problem, being the former the acquisition of the aerial images and the later, the 3D reconstruction. We focus here in the first problem, known as coverage path planning, and we consider the case where the camera is mounted on an unmanned aerial vehicle (UAV). In contrast with the case when ground vehicles are used, coverage path planning for a UAV is a lesser studied problem. As the areas to cover become complex, there is a clear need for algorithms that will provide good enough solutions in affordable times, while taking into account certain specificities of the problem at hand. Our algorithm can deal with both convex and non-convex areas and their main aim is to obtain a path that reduces the battery consumption, through minimizing the number of turns. We comment on line sweep calculation and propose improvements for the path generation and the polygon decomposition problems such as coverage alternatives and the interrupted path concept. Illustrative examples show the potential of our algorithm in two senses: ability to perform the coverage when complex regions are considered, and achievement of better solution than a published result (in terms of the number of turns used). (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:441 / 451
页数:11
相关论文
共 20 条
  • [1] Bagnitckii A., 2011, OCEANS 11 MTSIEEE KO, P1
  • [2] On the performance comparison of multi-objective evolutionary UAV path planners
    Besada-Portas, Eva
    de la Torre, Luis
    Moreno, Alejandro
    Risco-Martin, Jose L.
    [J]. INFORMATION SCIENCES, 2013, 238 : 111 - 125
  • [3] Coverage for robotics - A survey of recent results
    Choset, H
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2001, 31 (1-4) : 113 - 126
  • [4] Choset H., 1998, FIELD SERVICE ROBOTI, P203, DOI [DOI 10.1007/978-1-4471-1273-0_32, DOI 10.1007/978-1-4471-1273-032]
  • [5] Energy-aware Coverage Path Planning of UAVs
    Di Franco, Carmelo
    Buttazzo, Giorgio
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON AUTONOMOUS ROBOT SYSTEMS AND COMPETITIONS (ICARSC), 2015, : 111 - 117
  • [6] A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
    Fernandez, Jose
    Toth, Boglarka
    Canovas, Lazaro
    Pelegrin, Blas
    [J]. TOP, 2008, 16 (02) : 367 - 387
  • [7] A survey on coverage path planning for robotics
    Galceran, Enric
    Carreras, Marc
    [J]. ROBOTICS AND AUTONOMOUS SYSTEMS, 2013, 61 (12) : 1258 - 1276
  • [8] Haung WH, 2001, IEEE INT CONF ROBOT, P27, DOI 10.1109/ROBOT.2001.932525
  • [9] A terrain-covering algorithm for an AUV
    Hert, S
    Tiwari, S
    Lumelsky, V
    [J]. AUTONOMOUS ROBOTS, 1996, 3 (2-3) : 91 - 119
  • [10] Cooperative Search by Multiple Unmanned Aerial Vehicles in a Nonconvex Environment
    Ji, Xiaoting
    Wang, Xiangke
    Niu, Yifeng
    Shen, Lincheng
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015