文献知网节
摘要:Given the trajectory of the industrial robot in Cartesian space, the existing methods only consider the kinematic constraints when optimizing the time trajectory planning, and ignore the maximum driving ability of the motor, which is likely to cause an overrun alarm and greatly reduce the trajectory accuracy. Therefore, this paper studies the timeoptimal trajectory planning algorithm based on dynamics. Firstly, the algorithm discretizes the path, calculates the Cartesian coordinates of each discrete point and the differential about the path length. Then, this algorithm considers the constraints of dynamics and kinematics, uses the principle of linear programming, recursively calculates the upper limit value of speed and the maximum acceleration value at each discrete point, and calculates the speed value at each discrete point and keeps it within its allowable ranges. Finally, this algorithm uses the speed to calculate the corresponding time of each discrete point, and according to the interpolation period, outputs the path position of each period, the position and orientation in the Cartesian space and joint parameters. The MATLAB program is written to verify the feasibility and efficiency of the algorithm.
会议名称:

5th International Conference on Automation, Control and Robotics Engineering (CACRE 2020)

会议时间:

2020-09-19

会议地点:

中国辽宁大连

  • 专辑:

    信息科技

  • 专题:

    自动化技术

  • DOI:

    10.26914/c.cnkihy.2020.032697

  • 分类号:

    TP242.2

  • 手机阅读
    即刻使用手机阅读
    第一步

    扫描二维码下载

    "移动知网-全球学术快报"客户端

    第二步

    打开“全球学术快报”

    点击首页左上角的扫描图标

    第三步

    扫描二维码

    手机同步阅读本篇文献

  • CAJ下载
  • PDF下载

下载手机APP用APP扫此码同步阅读该篇文章

温馨提示:阅读CAJ格式原文,请使用CAJ浏览器

下载:23 页码:78-82 页数:5 大小:875k

引文网络
  • 参考文献
  • 引证文献
  • 共引文献
  • 同被引文献
  • 二级参考文献
  • 二级引证文献
相关推荐
  • 相似文献
  • 读者推荐
  • 相关基金文献
  • 相关法规
  • 关联作者
  • 相关视频