欢迎访问机床与液压官方网站!

咨询热线:020-32385312 32385313 RSS EMAIL-ALERT
Q-learning算法下的机械臂轨迹规划与避障行为研究
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

江苏省2019年度高校“青蓝工程”中青年学术带头人培养项目;江苏省现代教育技术研究2019课题(2019R73998); 2018江苏省教育信息化研究立项课题(20180047)


Trajectory Planning and Obstacle Avoidance of Manipulator Based on Q-learning Algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    机械臂运动和避障中存在轨迹偏差,要通过适当控制算法加以纠正确保实际轨迹趋近于理想轨迹。提出基于改进Q-learning算法的轨迹规划与避障方案,分别构建状态向量集合和每种状态下的动作集合,利用BP神经网络算法提高模型的连续逼近能力,并在迭代中不断更新Q函数值;路径规划中按照关节旋转角度及连杆空间移动距离最小原则,实现在合理避障同时轨迹偏差度最低。仿真结果表明:提出的控制算法收敛性速度快,路径规划效果优于传统规划方案,偏移成本最低。

    Abstract:

    The trajectory deviation exists in the movement and obstacle avoidance of the manipulator, which should be corrected through appropriate control algorithm to ensure that the actual trajectory is close to the ideal trajectory. A path planning and obstacle avoidance scheme was proposed based on improved Q-learning algorithm. The state vector set and the action set in each state were constructed respectively. BP neural network algorithm was used to improve the continuous approximation ability of the model, and the Q function value was updated continuously in the iteration. In the path planning, according to the principle of the rotation angle of the joint and the minimum space movement distance of the connecting rod, the reasonable obstacle avoidance and the minimum trajectory deviation were realized. The simulation results show that the proposed control algorithm has fast convergence speed, better path planning effect than the traditional planning scheme, and the lowest migration cost.

    参考文献
    相似文献
    引证文献
引用本文

郭新兰. Q-learning算法下的机械臂轨迹规划与避障行为研究[J].机床与液压,2021,49(9):57-61.
GUO Xinlan. Trajectory Planning and Obstacle Avoidance of Manipulator Based on Q-learning Algorithm[J]. Machine Tool & Hydraulics,2021,49(9):57-61

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2023-03-09
  • 出版日期: 2021-05-15