Abstract: A new global path planning algorithm for mobile robot is proposed.Neither assumption on obstacle characteristics nor connected graph models for obstacles are needed in this method.Such defects as computation complexity existing in traditional methods caused by searching can be avoided,and as a result,the applicability and real-time performance are improved greatly.Simulation results verify the efficiency of this method.