Time-optimal Smoothing of RRT-given Path for Manipulators

Burak Boyacioglu, Seniz Ertugrul

2016

Abstract

Trajectory planning is one of the most studied topics in robotics. Among several methods, a sampling-based method, Rapidly-exploring Randomized Tree (RRT) algorithm, has become popular over the last two decades due to its computational efficiency. However, the RRT method does not suggest an exact way to obtain a smooth trajectory along the viapoints given by itself. In this paper, we present an approach using a timeoptimal trajectory planning algorithm, specifically for robotic manipulators without using inverse kinematics. After the trajectory smoothing with cubic splines in an environment with obstacles considering not only velocity and acceleration but also jerk constraints; the study is simulated on a six degrees of freedom humanoid robot arm model and always finds a solution successfully if there is a feasible one.

Paper Citation

in Harvard Style

Boyacioglu B. and Ertugrul S. (2016). Time-optimal Smoothing of RRT-given Path for Manipulators . In Proceedings of the 13th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO, ISBN 978-989-758-198-4, pages 406-411. DOI: 10.5220/0005984504060411

in Bibtex Style

@conference{icinco16,
author={Burak Boyacioglu and Seniz Ertugrul},
title={Time-optimal Smoothing of RRT-given Path for Manipulators},
booktitle={Proceedings of the 13th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,},
year={2016},
pages={406-411},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005984504060411},
isbn={978-989-758-198-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 13th International Conference on Informatics in Control, Automation and Robotics - Volume 2: ICINCO,
TI - Time-optimal Smoothing of RRT-given Path for Manipulators
SN - 978-989-758-198-4
AU - Boyacioglu B.
AU - Ertugrul S.
PY - 2016
SP - 406
EP - 411
DO - 10.5220/0005984504060411