On Benchmarking of Frontier-Based Multi-Robot Exploration Strategies

被引:22
作者
Faigl, Jan [1 ]
Kulich, Miroslav [2 ]
机构
[1] Czech Tech Univ, Fac Elect Engn, Tech 2, Prague 16627, Czech Republic
[2] Czech Tech Univ, Czech Inst Informat Robot & Cybernet, Prague 16636, Czech Republic
来源
2015 EUROPEAN CONFERENCE ON MOBILE ROBOTS (ECMR) | 2015年
关键词
D O I
10.1109/ECMR.2015.7324183
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
This paper tackles an evaluation and comparison of frontier-based exploration strategies to create a grid map of unknown environment by a team of autonomous mobile robots. A strategy is considered as a set of procedures to determine promising goal candidates, allocate them to the robots, and select the next navigational goal for each robot. A mobile robot is a complex system with many components that affect the mission performance and a comparison of different strategies in real experiments can be performed only for a particular system setup and with only partial controllability of important parameters. Therefore, the reproducibility and repeatability of such a comparison are not satisfied. In this paper, we propose a methodology for evaluating exploration strategies and provide a benchmark for a comparison of frontier-based approaches in a well-defined evaluation environment. The proposed methodology is demonstrated on a comparison of five state-of-the-art task-allocation strategies in multi-robot exploration.
引用
收藏
页数:8
相关论文
共 37 条
[1]  
AMIGONI F, 2013, ECMR, P68
[2]  
Amigoni F., 2010, WORKSH ROL EXP ROB R
[3]  
Amigoni F, 2010, STUD COMP INTELL, V314, P315
[4]   An insightful comparison between experiments in mobile robotics and in science [J].
Amigoni, Francesco ;
Reggiani, Monica ;
Schiaffonati, Viola .
AUTONOMOUS ROBOTS, 2009, 27 (04) :313-325
[5]  
Andujar C., 2013, TECH REP
[6]  
[Anonymous], 2012, MINPOS NOVEL FRONTIE, DOI [DOI 10.1007/978-3-642-33515-0_49, 10.1007/978-3-642-33515-0_49]
[7]   Chained Lin-Kernighan for large traveling salesman problems [J].
Applegate, D ;
Cook, W ;
Rohe, A .
INFORMS JOURNAL ON COMPUTING, 2003, 15 (01) :82-92
[8]  
Applegate DL, 2003, Concorde tsp solver
[9]   Approximation algorithms for lawn mowing and milling [J].
Arkin, EM ;
Fekete, SP ;
Mitchell, JSB .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2000, 17 (1-2) :25-50
[10]  
Bautin A., 2013, 5 WORKSH PLANN PERC, P210