Nearly Optimal Path Following With Jerk and Torque Rate Limits Using Dynamic Programming

被引:36
作者
Kaserer, Dominik [1 ]
Gattringer, Hubert [1 ]
Mueller, Andreas [1 ]
机构
[1] Johannes Kepler Univ Linz, Inst Robot, A-4040 Linz, Austria
关键词
Dynamic programming (DP); jerk and torque rate constraints; suboptimal path following; third-order constraints; SMOOTH; OPTIMIZATION; MANIPULATORS;
D O I
10.1109/TRO.2018.2880120
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
This paper presents a new dynamic programming (DP) approach to the optimal path following problem. The method rests on an interpolation in the phase plane so that the resulting joint accelerations and joint torques are continuous. This allows for taking into account limits on the joint jerks and torque rates in addition to joint velocities, accelerations, torques, and the mechanical power. Most methods proposed in the literature yield values of optimal trajectories at discrete sampling times so that this must be interpolated subsequently to the trajectory optimization. This causes violations of the joint jerk and torque rate limits. The proposed method does not suffer from this problem, which is a main feature of this approach. Unlike most of the previously proposed methods, joint jerk and torque rate limits are addressed with a reasonable increase in the computation time of DP algorithms. Special attention is given to experimental validation of the optimization results. The presented experimental results confirm the importance of taking the motor torque characteristics as well as the Coulomb and viscous friction into account. Neglecting these effects (as most previous publications did) leads to trajectories that cannot be performed by real manipulators. Apart from DP, other approaches with smaller computation times exist. However, most of these methods are either limited to the time optimal case (which might not always be the desired criterion) and are not able to handle all earlier mentioned constraints or cannot take into account viscous friction effects. Apart from that a sequential convex programming (SCP) approach exists, which accounts for the same constraints as the presented approach. Therefore, the proposed DP approach is compared to this SCP method and an example is presented where the time optimal trajectory is performed by a real manipulator.
引用
收藏
页码:521 / 528
页数:8
相关论文
共 23 条
  • [1] [Anonymous], 1962, Applied Dynamic Programming
  • [2] TIME-OPTIMAL CONTROL OF ROBOTIC MANIPULATORS ALONG SPECIFIED PATHS
    BOBROW, JE
    DUBOWSKY, S
    GIBSON, JS
    [J]. INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1985, 4 (03) : 3 - 17
  • [3] Constantinescu D, 2000, J ROBOTIC SYST, V17, P233, DOI 10.1002/(SICI)1097-4563(200005)17:5<233::AID-ROB1>3.0.CO
  • [4] 2-Y
  • [5] Time-Optimal Path Following for Robots With Convex-Concave Constraints Using Sequential Convex Programming
    Debrouwere, Frederik
    Van Loock, Wannes
    Pipeleers, Goele
    Quoc Tran Dinh
    Diehl, Moritz
    De Schutter, Joris
    Swevers, Jan
    [J]. IEEE TRANSACTIONS ON ROBOTICS, 2013, 29 (06) : 1485 - 1495
  • [6] Flores F. Geu, 2011, P 13 WORLD C MECH MA, P1577
  • [7] Evaluation of Generalized Force Derivatives by Means of a Recursive Newton-Euler Approach
    Guarino Lo Bianco, Corrado
    [J]. IEEE TRANSACTIONS ON ROBOTICS, 2009, 25 (04) : 954 - 959
  • [8] Fast interpolation and time-optimization with contact
    Hauser, Kris
    [J]. INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2014, 33 (09) : 1231 - 1250
  • [9] Hung Pham, 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA), P679, DOI 10.1109/ICRA.2017.7989084
  • [10] Calculating a near time-optimal jerk-constrained trajectory along a specified smooth path
    Mattmueller, Jan
    Gisler, Damian
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 45 (9-10) : 1007 - 1016