运动规划
路径(计算)
趋同(经济学)
计算机科学
路径长度
数学优化
地形
机器人
采样(信号处理)
实时计算
算法
移动机器人
持续时间(音乐)
弹道
优化算法
算法设计
模拟
任意角度路径规划
最优化问题
距离测量
快速行进算法
近似算法
局部最优
机器人运动学
线路规划
最短路径问题
作者
Viet Hoang Anh Nguyen,Vy Tuong Chau,Trang Nguyen Thien Tran,Tuan M. Le,Hieu M. Tran,Ke Wang,Ly V. Tran,Son V. T. Dao
出处
期刊:IEEE Access
[Institute of Electrical and Electronics Engineers]
日期:2025-01-01
卷期号:13: 192958-192980
被引量:1
标识
DOI:10.1109/access.2025.3622542
摘要
This research introduces a new algorithm that enhances the existing Intermediary RRT*-PSO and Informed RRT*, focusing on enhancing the path’s feasibility by replacing edges around the corners with trapezoidal-based turns to ensure robot’s safety and functionality. The algorithm begins by generating an initial path using Intermediary RRT* algorithm. This path is then further refined using an informed sampling strategy, while being optimized by the Equal Distance optimization scheme. The proposed algorithm not only finds the initial path faster than previous methods, but also creates a solution with reduced sharp edges around corners. Non-holonomic robots benefit specifically when using this method because it reduces the frequency of abrupt turns. The procedure was tested through simulated runs on changing maps to establish both solution-generation duration and path-length requirements. This method is shown to be effective for map-based navigation across different terrains by delivering improved convergence rates and reduced path lengths over earlier navigation techniques.
科研通智能强力驱动
Strongly Powered by AbleSci AI