Fast smoothing of manipulator trajectories using optimal bounded-acceleration shortcuts
Authors:
- 1 May 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10504729,p. 2493-2498
Abstract
This paper considers a shortcutting heuristic to smooth jerky trajectories for many-DOF robot manipulators subject to collision constraints, velocity bounds, and acceleration bounds. The heuristic repeatedly picks two points on the trajectory and attempts to replace the intermediate trajectory with a shorter, collision-free segment. Here, we construct segments that interpolate between endpoints with specified velocity in a time-optimal fashion, while respecting velocity and acceleration bounds. These trajectory segments consist of parabolic and straight-line curves, and can be computed in closed form. Experiments on reaching tasks in cluttered human environments demonstrate that the technique can generate smooth, collision-free, and natural-looking motion in seconds for a PUMA manipulator and the Honda ASIMO robot.Keywords
This publication has 16 references indexed in Scilit:
- Optimization of sequential attractor-based movement for compact behaviour generation2007
- Creating High-quality Paths for Motion PlanningThe International Journal of Robotics Research, 2007
- Real-time dynamic trajectory smoothing for unmanned air vehiclesIEEE Transactions on Control Systems Technology, 2005
- Synthesizing animations of human manipulation tasksACM Transactions on Graphics, 2004
- Planning Collision‐Free Reaching Motions for Interactive Object Manipulation and GraspingComputer Graphics Forum, 2003
- Global time optimal motions of robotic manipulators in the presence of obstacles2003
- Efficient motion planners for nonholonomic mobile robots2002
- Elastic Strips: A Framework for Motion Generation in Human EnvironmentsThe International Journal of Robotics Research, 2002
- Survey of Numerical Methods for Trajectory OptimizationJournal of Guidance, Control, and Dynamics, 1998
- Optimal robot plant planning using the minimum-time criterionIEEE Journal on Robotics and Automation, 1988