Abstract: In this paper a graphic approach to the path planning problem based on the topological method is discussed.We develop a path planning algorithm for a mobile robot of rectangular shape among convex obstacles with theboundaries of line-segments and circle pieces. In this algorithm the local planning problem which appears whensome local changes happen has been discuased on the basis of not changing or only partially changing thetopological network. The graphic method is a general way of realizing the two dimensional topological path plan-ning algorithm.