Aiming at the problems of the long generating time of the shortest pa th algorithm in laser marking system and the unsatisfactory path effect,this pap er presents a new model of the shortest path algorithm. First,according to graphic plane distribution characteristics,the graphs whi ch distribute closely join into the same area,making all graphs into multiple areas.And then,the graphs in each area are connected by local optimization,which can reduce the size of algorith m and improve the efficiency. Secondly,all the areas are connected by the best way,requiring the shortest tota l distance between adjuacent areas.Finally,the graphis inside each area are output according to the order of adjustment to obta in the optimal path.The new algorithm can achieve higher operational efficiency and better path effect.Experimental r esults show that compared with the original algorithm,the new one can save nearly 97% gener ation time,and increase nearly 5% in path effect.