A particular method for the shortest path finding of mobile robots

This paper proposes a particular method to save time and power for mobile robots path planning in work. This method is used for finding shortest paths between all pairs of vertices in simple graph (or network) which is determined by the vertex set and the edge set. And it has a new kind of matrix operation with selection and connection operators for calculation. This matrix operation is easier, conciser and faster than the method of R. W. Floyd in calculating process. As a result, the table of distances between all pairs of vertices (or nodes) is presented in the form of a shortest path matrix. It also can be widely used in the applications of city logistics or communication networks, if cities or relay stations are considered as vertices.