Collaborative online planning for automated victim search in disaster response

被引:26
作者
Beck, Zoltan [1 ]
Teacy, W. T. Luke [1 ]
Rogers, Alex [2 ]
Jennings, Nicholas R. [3 ,4 ]
机构
[1] Univ Southampton, Southampton, Hants, England
[2] Univ Oxford, Oxford, England
[3] Imperial Coll London, London, England
[4] King Abdulaziz Univ, Jeddah, Saudi Arabia
基金
英国工程与自然科学研究理事会;
关键词
Search and rescue; Task allocation; Hindsight optimisation; Path planning; Multi-robot teams; Particle filter; MACHINE SCHEDULING PROBLEM; AUTONOMOUS SEARCH; RESCUE; ALGORITHM; UAV;
D O I
10.1016/j.robot.2017.09.014
中图分类号
TP [自动化技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
Collaboration is essential for effective performance by groups of robots in disaster response settings. Here we are particularly interested in heterogeneous robots that collaborate in complex scenarios with incomplete, dynamically changing information. In detail, we consider an automated victim search setting, where unmanned aerial vehicles (UAVs) with different capabilities work together to scan for mobile phones and find and provide information about possible victims near these phone locations. The state of the art for such collaboration is robot control based on independent planning for robots with different tasks and typically incorporates uncertainty with only a limited scope. In contrast, in this paper, we take into account complex relations between robots with different tasks. As a result, we create a joint, full horizon plan for the whole robot team by optimising over the uncertainty of future information gain using an online planner with hindsight optimisation. This joint plan is also used for further optimisation of individual UAV paths based on the long-term plans of all robots. We evaluate our planner's performance in a realistic simulation environment based on a real disaster and find that our approach finds victims 25% faster compared to current state-of-the-art approaches. (C) 2017 Published by Elsevier B.V.
引用
收藏
页码:251 / 266
页数:16
相关论文
共 55 条
[1]
A survey of scheduling problems with setup times or costs [J].
Allahverdi, Ali ;
Ng, C. T. ;
Cheng, T. C. E. ;
Kovalyov, Mikhail Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :985-1032
[2]
Andryeyev O., 2016, 2016 25 INT C COMP C, P1
[3]
[Anonymous], 1992, POISSON PROCESSES
[4]
[Anonymous], 2012, P 26 AAAI C ART INT
[5]
Shared Potential Fields and their place in a multi-robot co-ordination taxonomy [J].
Baxter, Joseph L. ;
Burke, Edmund K. ;
Garibaldi, Jonathan M. ;
Norman, Mark .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2009, 57 (10) :1048-1055
[6]
Beck Z., 2016, THESIS
[7]
Beck Z., 2016, AAMAS 16
[8]
Bernardini Sara, 2013, P 23 INT C AUT PLANN
[9]
Boumghar R., 2011, P 14 INT C CLIMB WAL, P215
[10]
A Survey of Monte Carlo Tree Search Methods [J].
Browne, Cameron B. ;
Powley, Edward ;
Whitehouse, Daniel ;
Lucas, Simon M. ;
Cowling, Peter I. ;
Rohlfshagen, Philipp ;
Tavener, Stephen ;
Perez, Diego ;
Samothrakis, Spyridon ;
Colton, Simon .
IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2012, 4 (01) :1-43