随机树
算法
趋同(经济学)
计算机科学
运动规划
路径(计算)
弹道
混合模型
人工智能
数学优化
数学
机器人
天文
经济
程序设计语言
经济增长
物理
作者
Hailin Lv,Detian Zeng,Xiao Li
标识
DOI:10.23919/ccc58697.2023.10240326
摘要
Rapidly-exploring random tree (RRT) algorithm exhibits excessive random sampling and poor convergence when planning trajectory in a picking environment. An improved RRT* algorithm employing Gaussian mixture model sampling (GMM-RRT*) algorithm is proposed to optimize the disadvantages of the RRT* algorithm. To verify real effect, GMM-RRT* algorithm, RRT algorithm, RRT* algorithm, RRT* algorithm based on goal node guidance (T-RRT*) algorithm and GMM-RRT* algorithm are worked in 2D scene, 3D scene and manipulator picking simulation scene to solve optimal trajectory, respectively. Results obtained are statistically analyzed in terms of effective length, planning time and number of redundant nodes. Conduct experiments on the Elfin E05 manipulator platform to test the GMM-RRT* algorithm comparing with RRT* algorithm and RRT algorithm. Both simulation and experimental results show that the proposed GMM-RRT* fusion algorithm can effectively shorten planning path time in kiwifruit intelligent picking and improve efficiency of kiwifruit picking.
科研通智能强力驱动
Strongly Powered by AbleSci AI