A learnheuristic approach for the team aerial drone motion constraints orienteering problem with

被引:0
作者
Bayliss, Christopher [1 ,2 ]
Juan, Angel A. [1 ,2 ]
Currie, Christine S. M. [3 ]
Panadero, Javier [1 ,2 ]
机构
[1] Univ Oberta Catalunya, IN3, Barcelona, Spain
[2] Euncet Business Sch, Barcelona, Spain
[3] Univ Southampton, Math Sci Dept, Southampton, Hants, England
关键词
Team orienteering problem; Metaheuristics; Machine learning; Learnheuristics; Aerial drones; Route-dependent edge times; FACILITY LOCATION PROBLEM; VEHICLE-ROUTING PROBLEM; EVOLUTIONARY ALGORITHM; BIASED RANDOMIZATION; OPTIMIZATION; CURVATURE; GRASP; AIR;
D O I
10.1016/j.asoc.2020.106280
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This work proposes a learnheuristic approach (combination of heuristics with machine learning) to solve an aerial-drone team orienteering problem. The goal is to maximise the total reward collected from information gathering or surveillance observations of a set of known targets within a fixed amount of time. The aerial drone team orienteering problem has the complicating feature that the travel times between targets depend on a drone's flight path between previous targets. This path-dependence is caused by the aerial surveillance drones flying under the influence of air-resistance, gravity, and the laws of motion. Sharp turns slow drones down and the angle of ascent and air-resistance influence the acceleration a drone is capable of. The route dependence of inter-target travel times motivates the consideration of a learnheuristic approach, in which the prediction of travel times is outsourced to a machine learning algorithm. This work proposes an instance-based learning algorithm with interpolated predictions as the learning module. We show that a learnheuristic approach can lead to higher quality solutions in a shorter amount of time than those generated from an equivalent metaheuristic algorithm, an effect attributed to the search-diversity enhancing consequence of the online learning process. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:19
相关论文
共 73 条
[1]  
Aarts L.K, 1997, Local Search in Combinatorial Optimization, DOI DOI 10.2307/J.CTV346T9C
[2]  
[Anonymous], 2019, APPL SOFT COMPUT
[3]  
[Anonymous], [No title captured]
[4]  
[Anonymous], 2011, Multi-armed bandit allocation indices
[5]  
[Anonymous], 2020, EUR J IND ENG
[6]   Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles [J].
Babel, Luitpold .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 262 (01) :335-346
[7]   Dynamic pricing for vehicle ferries: Using packing and simulation to optimize revenues [J].
Bayliss, Christopher ;
Currie, Christine S. M. ;
Bennell, Julia A. ;
Martinez-Sykora, Antonio .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) :288-304
[8]   DYNAMIC PROGRAMMING [J].
BELLMAN, R .
SCIENCE, 1966, 153 (3731) :34-&
[9]  
Brownlee A., 2010, P IEEE C EV COMP, P1
[10]   An optimal solution procedure or the multiple tour maximum collection problem using column generation [J].
Butt, SE ;
Ryan, DM .
COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) :427-441