Collaboration in Multi-Robot Exploration: To Meet or not to Meet?

被引:28
作者
Andre, Torsten [1 ]
Bettstetter, Christian [1 ,2 ]
机构
[1] Alpen Adria Univ Klagenfurt, Networked & Embedded Syst, Lakeside Pk B02a, Klagenfurt, Austria
[2] Lakeside Labs GmbH, Lakeside Pk B04b, Klagenfurt, Austria
关键词
Collaboration; Robot exploration; Mobile robot teams; Indoor exploration; Multi-robot systems; Autonomous systems;
D O I
10.1007/s10846-015-0277-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Work on coordinated multi-robot exploration often assumes that all areas to be explored are freely accessible. This common assumption does not always hold, especially not in search and rescue missions after a disaster. Doors may be closed or paths blocked detaining robots from continuing their exploration beyond these points and possibly requiring multiple robots to clear them. This paper addresses the issue how to coordinate a multi-robot system to clear blocked paths. We define local collaborations that require robots to collaboratively perform a physical action at a common position. A collaborating robot needs to interrupt its current exploration and move to a different location to collaboratively clear a blocked path. We raise the question when to collaborate and whom to collaborate with. We propose four strategies as to when to collaborate. Two obvious strategies are to collaborate immediately or to postpone any collaborations until only blocked paths are left. The other two strategies make use of heuristics based on building patterns. While no single strategy behaves optimal in all scenarios, we show that the heuristics decrease the time required to explore unknown environments considering blocked paths.
引用
收藏
页码:325 / 337
页数:13
相关论文
共 24 条
[1]  
Andre T., 2014, P IEEE GLOBECOM WIUA
[2]  
Andre T., 2013, P IEEE RSJ INT C INT
[3]  
Andre T., 2012, P IEEE GLOBECOM
[4]  
[Anonymous], 1977, PATTERN LANGUAGE TOW
[5]  
[Anonymous], P IEEE INT C ROB AUT
[6]  
[Anonymous], P IEEE INT C ROB AUT
[7]   Piecemeal graph exploration by a mobile robot [J].
Awerbuch, B ;
Betke, M ;
Rivest, RL ;
Singh, M .
INFORMATION AND COMPUTATION, 1999, 152 (02) :155-172
[8]   Coordinated multi-robot exploration [J].
Burgard, W ;
Moors, M ;
Stachniss, C ;
Schneider, FE .
IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (03) :376-386
[9]  
Burgard W, 2002, LECT NOTES ARTIF INT, V2466, P52
[10]  
Burger G., 2014, COMMUNICATION