2013
DOI: 10.1109/iccas.2013.6704048
View full text
|
|
Share
Hoang Huu Viet, SeungYoon Choi, TaeChoong Chung

Abstract: This paper presents a novel approach to deal with the online complete coverage problem for a team of robots in unknown environments. In our approach each robot covers an unvisited region using a single boustrophedon motion until a robot reaches an ending point, which is surrounded by covered positions or obstacles. At the ending point the robot detects backtracking points based on the accumulated knowledge, plans the shortest backtracking path to the next starting point based on the proposed Theta* with multi…

expand abstract