Path Optimization Using an Improved APF-RRT* Algorithm

dc.contributor.authorZheng, Yongyang
dc.contributor.authorPimsarn, Monsak
dc.contributor.authorChuwattanakul, Varesa
dc.contributor.authorChokphoemphun, Suriya
dc.contributor.authorEiamsa-Ard, Smith
dc.date.accessioned2026-08-06T10:53:56Z
dc.date.available2026-08-06T10:53:56Z
dc.date.issued2026-01-01
dc.description.abstractPath planning remains a critical research area in mobile robotics, yet current approaches often suffer from suboptimal path quality, limited sampling efficiency, and inadequate adaptability across diverse operational scenarios. To address these issues, this paper proposes an improved algorithm combining Artificial Potential Field (APF) and Restricted Path Time (RRT*) approaches. This algorithm employs an optimization model that combines dynamic sampling with potential field guidance, constructing a two-stage dynamic sampling mechanism. During sampling, candidate nodes with Gaussian noise are generated along the resultant force direction. Finally, path cost comparison and parent node reselection are performed within the dynamic optimization radius to ensure asymptotic optimality of the path. Experimental results show that in complex maps, path length is reduced by 33.41% and 26.64%, respectively, and planning time is reduced by 21.36% and 86.32%, respectively; in narrow passages, path length is reduced by 49.6% and 49.8%, respectively. The results confirm the effectiveness of the two-stage dynamic sampling mechanism, which not only preserves the probabilistic completeness of the RRT* algorithm but also adaptively adjusts the sampling strategy, improving both planning length and time.
dc.identifier.citationInternational Journal of Mechanical Engineering and Robotics Research, 15(1), 93-101, 2026
dc.identifier.doi10.18178/ijmerr.15.1.93-101
dc.identifier.issn22780149
dc.identifier.other2-s2.0-105032476457
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/17700
dc.sourceInternational Journal of Mechanical Engineering and Robotics Research
dc.subjectartificial potential field
dc.subjectdynamic sampling
dc.subjectpath planning
dc.subjectRestricted Path Time (RRT*) algorithm
dc.titlePath Optimization Using an Improved APF-RRT* Algorithm
dc.typeArticle

Files

Collections