Full-Coverage algorithm with local obstacle avoidance algorithm

지역적 회피 알고리즘을 갖는 Full-Coverage 알고리즘

  • 박검모 (전남대 대학원 기계공학과) ;
  • 손영동 (전남대 대학원 기계공학과) ;
  • 김영배 (전남대 기계공학과)
  • Published : 2005.06.01

Abstract

This Paper is to find out a solution for the full-coverage algorithm requiring the real-time processing such as mobile home service robots and vacuum cleaner robots. Previous methods are used by adopting based grid approach method. They used lots of sensors, a high speed CPU, expensive ranger sensors and huge memory. Besides, most full-coverage algorithms should have a map before obstacle avoidance. However, if a robot able to recognize the tangent vector of obstacles, it is able to bring the same result with less sensors and simplified hardware. Therefore, this study suggests a topological based approach and a local obstacle voidance method using a few of PSD sensors and ultra sonic sensors. The simulation results are presented to prove its applicability.

Keywords