대한전기학회:학술대회논문집 (Proceedings of the KIEE Conference)
- 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
- /
- Pages.252-254
- /
- 2005
청소 로봇을 위한 경로 계획의 새로운 알고리즘
A New Algorithm for Complete Coverage Path-Planning of Cleaning Robots
- 발행 : 2005.05.14
초록
Completer coverage path planning requires the robot path to cover every part of the workspace, which is an essential issue in cleaning robots and many other robotic applications such as vacuum robots and painter robots. In this paper, a novel Water Flowing Algorithm (WFA) is proposed for cleaning robots to complete coverage path planning in unknown environment without obstacles. The robot covers the whole workspace just like that water fills up a container. First the robot goes to the lowest point in the workspace just like water flows to the bottom of the container. At last the robot will come to highest point in the workspace just like water overflows from the container and simultaneously the robot has covered the whole workspace. The computer simulation results show that the proposed algorithm enable the robot to plan complete coverage paths.