Abstract
In this paper we investigate the problem of finding a Euclidean (L/sub 2/) shortest path between two distinct locations in a planar environment. We propose a novel cell decomposition approach which calculates an L/sub 2/ distance transform through the use of a circular path-planning wave. The proposed method is based on a new data structure, called the framed-quadtree, which combines together the accuracy of high resolution grid-based path planning techniques with the efficiency of quadtree-based techniques, hence having the advantages of both. The heart of this method is a linear time algorithm for computing certain special dynamic Voronoi diagrams. The proposed method does not place any unrealistic constraints on obstacles or on the environment and represents an improvement in accuracy and efficiency over traditional path planning approaches in this area.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
