Publication IEICE TRANSACTIONS on Information and SystemsVol.E96-DNo.12pp.2877-2881 Publication Date: 2013/12/01 Online ISSN: 1745-1361 DOI: 10.1587/transinf.E96.D.2877 Print ISSN: 0916-8532 Type of Manuscript: LETTER Category: Artificial Intelligence, Data Mining Keyword: robotics, spanning tree coverage, exploration, hexagonal grid coverage,
Full Text: PDF(3.2MB)>>
Summary: Robot covering problem has gained attention as having the most promising applications in our real life. Previous spanning tree coverage algorithm addressed this problem well in a static environment, but not in a dynamic one. In this paper, we present and analyze our algorithm workable in a dynamic environment with less shadow areas.
