Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints

Time-optimal trajectories with bounded velocities and accelerations are known to be parabolic, i.e. piecewise constant in acceleration. An important characteristic of this class of trajectories is the distribution of the switch points – the time instants when the acceleration of any robot joint chan...

全面介紹

Saved in:
書目詳細資料
Main Authors: Lertkultanon, Puttichai, Pham, Quang-Cuong
其他作者: School of Mechanical and Aerospace Engineering
格式: Article
語言:English
出版: 2016
主題:
在線閱讀:https://hdl.handle.net/10356/84597
http://hdl.handle.net/10220/41881
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English
id sg-ntu-dr.10356-84597
record_format dspace
spelling sg-ntu-dr.10356-845972023-03-04T17:15:37Z Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints Lertkultanon, Puttichai Pham, Quang-Cuong School of Mechanical and Aerospace Engineering Parabolic trajectories shortcutting Time-optimal trajectories with bounded velocities and accelerations are known to be parabolic, i.e. piecewise constant in acceleration. An important characteristic of this class of trajectories is the distribution of the switch points – the time instants when the acceleration of any robot joint changes. When integrating parabolic trajectory generation into a motion planning pipeline, especially one that involves a shortcutting procedure, resulting trajectories usually contain a large number of switch points with a dense distribution. This high frequency acceleration switching intensifies joint motor wear as well as hampers the robot performance. In this paper, we propose an algorithm for planning parabolic trajectories subject to both physical bounds, i.e. joint velocity and acceleration limits, and the minimum-switch-time constraint. The latter constraint ensures that the time duration between any two consecutive switch points is always greater than a given minimum value. Analytic derivations are given, as well as comparisons with other methods to demonstrate the efficiency of our approach. Accepted version 2016-12-19T04:50:56Z 2019-12-06T15:48:00Z 2016-12-19T04:50:56Z 2019-12-06T15:48:00Z 2016 Journal Article Lertkultanon, P., & Pham, Q.-C. (2016). Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints. Advanced Robotics, 30(17-18), 1095-1110. 0169-1864 https://hdl.handle.net/10356/84597 http://hdl.handle.net/10220/41881 10.1080/01691864.2016.1204247 en Advanced Robotics © 2016 Taylor & Francis. This is the author created version of a work that has been peer reviewed and accepted for publication by Advanced Robotics, Taylor & Francis. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1080/01691864.2016.1204247]. 22 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Parabolic trajectories
shortcutting
spellingShingle Parabolic trajectories
shortcutting
Lertkultanon, Puttichai
Pham, Quang-Cuong
Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints
description Time-optimal trajectories with bounded velocities and accelerations are known to be parabolic, i.e. piecewise constant in acceleration. An important characteristic of this class of trajectories is the distribution of the switch points – the time instants when the acceleration of any robot joint changes. When integrating parabolic trajectory generation into a motion planning pipeline, especially one that involves a shortcutting procedure, resulting trajectories usually contain a large number of switch points with a dense distribution. This high frequency acceleration switching intensifies joint motor wear as well as hampers the robot performance. In this paper, we propose an algorithm for planning parabolic trajectories subject to both physical bounds, i.e. joint velocity and acceleration limits, and the minimum-switch-time constraint. The latter constraint ensures that the time duration between any two consecutive switch points is always greater than a given minimum value. Analytic derivations are given, as well as comparisons with other methods to demonstrate the efficiency of our approach.
author2 School of Mechanical and Aerospace Engineering
author_facet School of Mechanical and Aerospace Engineering
Lertkultanon, Puttichai
Pham, Quang-Cuong
format Article
author Lertkultanon, Puttichai
Pham, Quang-Cuong
author_sort Lertkultanon, Puttichai
title Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints
title_short Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints
title_full Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints
title_fullStr Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints
title_full_unstemmed Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints
title_sort time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints
publishDate 2016
url https://hdl.handle.net/10356/84597
http://hdl.handle.net/10220/41881
_version_ 1759855496873902080