01136nam a2200229 c 4500001001300000005001500013007000300028008004100031040001100072041001300083052003100096245018000127300002400307545008100331545007100412653014700483700001900630700004800649773017200697900001800869900001900887KSI00073141320081209134934ta081205s2005    ulk           000   kor    a0110010 akorbeng01a569.9305b제567ㅈc11(9)00aFlow network을 이용한 청소로봇의 최소방향전환 경로계획 =xMinimal turning path planning for cleaning robots employing flow networks /d남상현,e문승빈  ap. 789-794 ;c30 cm  a남상현, 세종대학교 컴퓨터공학과bshnam28@robotics.sejong.ac.kr  a문승빈, 세종대학교 컴퓨터공학과bsbmoon@sejong.ac.kr  aComplete coverage path planningaTemplateaCellular decompositonaCleaning robotaMobile robotsa청소로봇a최소방향전환 경로계획1 a남상현4aut1 a문승빈,g文承彬,d1961-0KAC2017048680 t제어·자동화·시스템공학 논문지.d제어·자동화·시스템공학회.g11권 9호(2005년 9월), p. 789-794q11:9<789w(011001)KSE199900457,x1225-984510aNam, Sanghyun10aMoon, Seungbin