An Efficient and Robust Robot Path Planning Algorithm

능률적이고 안정된 로보트 경로계획 알고리즘 개발에 관한 연구

This paper presents an efficient and robust robot path planning technique that can always find a path, if one exists, in a densely cluttered, unknown and unstructured obstacle environment. The terrain in which the robot is expected to navigate is represented as a tesselated grid of square cells. The generated path is resolution complete and also resolution optimal once the terrain is fully explored by the robot or all the information about the terrain is given. The technique enables the accurate wave propagation to the diagonally adjacent cells and facilitates the implementations of various essential features for a real-time path planner such as partial updates and parallel computations.