@COMMENT This file was generated by bib2html.pl <https://sourceforge.net/projects/bib2html/> version 0.94
@COMMENT written by Patrick Riley <http://sourceforge.net/users/patstg/>
@COMMENT This file came from Gal A. Kaminka's publication pages at
@COMMENT http://www.cs.biu.ac.il/~galk/publications/
@InProceedings{aamas12matan,
author = {Matan Keidar and Gal A. Kaminka},
title = {Fast Frontier Detection for Robot Exploration: Theory and Experiments },
booktitle = AAMAS-12,
OPTcrossref = {},
OPTkey = {},
OPTpages = {},
year = {2012},
OPTeditor = {},
OPTvolume = {},
OPTnumber = {},
OPTseries = {},
OPTaddress = {},
OPTmonth = {},
OPTorganization = {},
OPTpublisher = {},
note = {For the definitive paper, look at "Keidar, M. and Kaminka, G.A. "Efficient Frontier Detection for Robot Exploration", Int'l Journal of Robotics Research 2014, at http://https://u.cs.biu.ac.il/~kaminkg/publications/b2hd-ijrr14.html .},
OPTannote = {},
OPTurl = {},
OPTdoi = {},
OPTissn = {},
OPTlocalfile = {},
abstract = {Frontier-based exploration is the most common approach to exploration, a
fundamental problem in robotics. In frontier-based exploration, robots explore by repeatedly
computing (and moving towards) \emph{frontiers}, the segments which separate the known regions
from those unknown. However, most frontier detection algorithms process the entire map data.
This can be a time consuming process which slows down the exploration.
In this paper, we present two novel frontier detection algorithms: \emph{WFD}, a graph search
based algorithm and \FFD, which is based on processing only the new laser readings data. In contrast
to state-of-the-art methods, both algorithms do not process the entire map data. We implemented
both algorithms and showed that both are faster than a  state-of-the-art frontier detector
implementation (by several orders of magnitude).
},
  wwwnote = {},
}