Planning Jerk-Optimized Trajectory with Discrete Time Constraints for Redundant Robots

Chengkai Dai, Sylvain Lefebvre, Kai Ming Yu, Jo M.P. Geraedts, Charlie C.L. Wang

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
2 Downloads (Pure)

Abstract

We present a method for effectively planning the motion trajectory of robots in manufacturing tasks, the tool paths of which are usually complex and have a large number of discrete time constraints as waypoints. Kinematic redundancy also exists in these robotic systems. The jerk of motion is optimized in our trajectory planning method at the meanwhile of fabrication process to improve the quality of fabrication. Our method is based on a sampling strategy and consists of two major parts. After determining an initial path by graph search, a greedy algorithm is adopted to optimize a path by locally applying adaptive filers in the regions with large jerks. The filtered result is obtained by numerical optimization. In order to achieve efficient computation, an adaptive sampling method is developed for learning a collision-indication function that is represented as a support-vector machine. Applications in robot-Assisted 3-D printing are given in this article to demonstrate the functionality of our approach. Note to Practitioners-In robot-Assisted manufacturing applications, robotic arms are employed to realize the motion of workpieces (or machining tools) specified as a sequence of waypoints with the positions of tool tip and the tool orientations constrained. The required degree of freedom (DOF) is often less than the robotic hardware system (e.g., a robotic arm has six-DOF). Specifically, rotations of the workpiece around the axis of a tool can be arbitrary (see Fig. 1 for an example). By using this redundancy, i.e., there are many possible poses of a robotic arm to realize a given waypoint, the trajectory of robots can be optimized to consider the performance of motion in velocity, acceleration, and jerk in the joint space. In addition, when fabricating complex models, each tool path can have a large amount of waypoints. It is crucial for a motion planning algorithm to compute a smooth and collision-free trajectory of robot to improve the fabrication quality. The time taken by the planning algorithm should not significantly lengthen the total manufacturing time; ideally, it would remain hidden as computing motions for a layer can be done while the previous layer is printing. The method presented in this article provides an efficient framework to tackle this problem. The framework has been well tested on our robot-Assisted additive manufacturing system to demonstrate its effectiveness and can be generally applied to other robot-Assisted manufacturing systems.

Original languageEnglish
Article number9025760
Pages (from-to)1711-1724
Number of pages14
JournalIEEE Transactions on Automation Science and Engineering
Volume17
Issue number4
DOIs
Publication statusPublished - 2020

Keywords

  • Discrete time constraints
  • kinematic redundancy
  • robotic fabrication
  • trajectory planning

Fingerprint Dive into the research topics of 'Planning Jerk-Optimized Trajectory with Discrete Time Constraints for Redundant Robots'. Together they form a unique fingerprint.

Cite this