arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.09024cs.RO
收藏

基于贝叶斯网络的冗余机械臂混合蒙特卡洛优化

Bayes Net based highbrid Monte Carlo Optimization for Redundant Manipulator

Zhejiang University(浙江大学)

Feng Yichang, Wang Jin, Zhang Haiyun, Lu Guodong

AI总结:

针对冗余机械臂运动规划问题,提出基于贝叶斯网络的蒙特卡洛优化方法BN-MCO,通过势场引导、GMM优化与KL散度参数学习实现路径规划,在LBR-iiwa测试中取得最高成功率和适中效率。

摘要:

本文提出一种用于运动规划的基于贝叶斯网络的蒙特卡洛优化方法(BN-MCO)。首先,我们调整由目标和起点约束确定的势场,逐步引导采样簇向目标点和起点靠拢。随后,针对这两个非凸势场,我们利用高斯混合模型(GMM)执行蒙特卡洛优化。此外,我们用KL散度衡量势场确定的真实分布与所提GMM之间的偏差,GMM的参数根据偏差的流形信息进行增量式学习。通过这种方式,由顺序更新的GMM组成的贝叶斯网络不断扩展,直到满足约束条件,且最短路径法能够找到可行路径。最后,我们在书架场景的LBR-iiwa机械臂上调试关键参数,并将BN-MCO与其他5种规划器进行基准测试。结果表明,BN-MCO成功率最高,求解效率适中。

英文摘要:

This paper proposes a Bayes Net based Monte Carlo optimization for motion planning (BN-MCO). Primarily, we adjust the potential fields determined by goal and start constraints to progressively guide the sampled clusters toward the goal and start points. Then, we utilize the Gaussian mixed modal (GMM) to perform the Monte Carlo optimization, confronting these two non-convex potential fields. Moreover, KL divergence measures the bias between the true distribution determined by the fields and the proposed GMM, whose parameters are learned incrementally according to the manifold information of the bias. In this way, the Bayesian network consisting of sequential updated GMMs expands until the constraints are satisfied and the shortest path method can find a feasible path. Finally, we tune the key parameters and benchmark BN-MCO against the other 5 planners on LBR-iiwa in a bookshelf. The result shows the highest success rate and moderate solving efficiency of BN-MCO.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑