The objective of an isometric path partition problem is to partition the vertex set of a given graph with minimum number of shortest paths. In this article, the isometric path partition number of ...

This paper introduces Delaunay graph into path planning for mobile robot for the shortest path. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is ...