The shortest path computation is important in industrial automation, especially for robot and autonomous vehicle navigation. However, most of the computations concentrate on computing the shortest path between two points within a polygon. The common approach for handling a bounded domain with free form boundary is to convert the domain into a polygon by boundary approximation so that the conventional computing algorithms can be used. Such an approximation affects the accuracy of the path. This article presents an approach to compute the shortest path between two given points in a free form boundary domain without any boundary approximation. This is addressed geometrically by imaginably placing a source at one of the points which radiates the shortest paths to various points of the domain. Some shortest paths are deflected by the geometry of the boundary so that they are no longer straight lines. Based on the deflections of the shortest paths, the bounded domain is partitioned into a set of subdomains. A tree is then constructed to show the relationships among these subdomains. The shortest path between two points is obtained from this tree.
Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning
Contributed by the Computers and Information Division of ASME for publication in the JOURNAL OF Computing AND INFORMATION Science IN ENGINEERING. Manuscript received November 25, 2013; final manuscript received November 27, 2013; published online February 26, 2014. Editor: Bahram Ravani.
- Views Icon Views
- Share Icon Share
- Search Site
Au, C., and Ma, Y. (February 26, 2014). "Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning." ASME. J. Comput. Inf. Sci. Eng. June 2014; 14(2): 021004. https://doi.org/10.1115/1.4026183
Download citation file: