Robot Exploration in a Dynamic Environment Using Hexagonal Grid Coverage
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.
robotics exploration hexagonal grid coverage spanning tree coverage