Mission Planning for Emergency Rapid Mapping with Drones

被引:20
作者
Glock, Katharina [1 ]
Meyer, Anne [2 ]
机构
[1] FZI Res Ctr Informat Technol, D-76131 Karlsruhe, Germany
[2] TU Dortmund Univ, D-44227 Dortmund, Germany
关键词
generalized correlated team orienteering problem; UAV mission planning; adaptive large neighborhood search; emergency surveillance; ORIENTEERING PROBLEM; ALGORITHM; INFORMATION;
D O I
10.1287/trsc.2019.0963
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We introduce a mission planning concept for routing unmanned aerial vehicles (UAVs) through a set of sampling locations in the immediate aftermath of an incident such as a fire or chemical accident. Using interpolation methods that account for the spatial interdependencies inherent in the surveyed phenomenon, these samples allow predicting the distribution of hazardous substances across the affected area. We define the generalized correlated team orienteering problem (GCorTOP) for selecting informative samples considering spatial correlations between observed and unobserved locations, as well as priorities in the surveyed area. To quickly provide high-quality solutions in time-sensitive situations, we propose a two-phase multistart adaptive large neighborhood search (2MLS). We show the competitiveness of the solution approach using benchmark instances for the team orienteering problem and investigate the performance of the proposed models and solution approach in an extensive study based on newly introduced benchmark instances for the mission planning problem.
引用
收藏
页码:534 / 560
页数:27
相关论文
共 48 条
[21]   The Generalized Covering Salesman Problem [J].
Golden, Bruce ;
Naji-Azimi, Zahra ;
Raghavan, S. ;
Salari, Majid ;
Toth, Paolo .
INFORMS JOURNAL ON COMPUTING, 2012, 24 (04) :534-553
[22]   Orienteering Problem: A survey of recent variants, solution approaches and applications [J].
Gunawan, Aldy ;
Lau, Hoong Chuin ;
Vansteenwegen, Pieter .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 255 (02) :315-332
[23]   An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices [J].
Ha, Minh Hoang ;
Bostel, Nathalie ;
Langevin, Andre ;
Rousseau, Louis-Martin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 226 (02) :211-220
[24]   Heuristics for the multi-vehicle covering tour problem [J].
Hachicha, M ;
Hodgson, MJ ;
Laporte, G ;
Semet, F .
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (01) :29-42
[25]  
Harig R, 2011, FORSCHUNG BEVOLKERUN, V14
[26]   Sampling-based robotic information gathering algorithms [J].
Hollinger, Geoffrey A. ;
Sukhatme, Gaurav S. .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2014, 33 (09) :1271-1287
[27]  
Irnich S, 2014, MOS-SIAM SER OPTIMIZ, P1
[28]   Pareto mimic algorithm: An approach to the team orienteering problem [J].
Ke, Liangjun ;
Zhai, Laipeng ;
Li, Jing ;
Chan, Felix T. S. .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 61 :155-166
[29]  
Kilby P, 2013, TUTORIAL CONSTRAINT
[30]  
Krause A, 2008, J MACH LEARN RES, V9, P235