We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Expanded Douglas–Peucker Polygonal Approximation and Opposite Angle-Based Exact Cell Decomposition for Path Planning with Curvilinear Obstacles.
- Authors
Jung, Jin-Woo; So, Byung-Chul; Kang, Jin-Gu; Lim, Dong-Woo; Son, Yunsik
- Abstract
The Expanded Douglas–Peucker (EDP) polygonal approximation algorithm and its application method for the Opposite Angle-Based Exact Cell Decomposition (OAECD) are proposed for the mobile robot path-planning problem with curvilinear obstacles. The performance of the proposed algorithm is compared with the existing Douglas–Peucker (DP) polygonal approximation and vertical cell decomposition algorithm. The experimental results show that the path generated by the OAECD algorithm with EDP approximation appears much more natural and efficient than the path generated by the vertical cell decomposition algorithm with DP approximation.
- Subjects
ROBOTIC path planning; MOBILE robots; CELLS; APPROXIMATION algorithms; PERFORMANCE
- Publication
Applied Sciences (2076-3417), 2019, Vol 9, Issue 4, p638
- ISSN
2076-3417
- Publication type
Article
- DOI
10.3390/app9040638