Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-28T04:36:30.917Z Has data issue: false hasContentIssue false
  • English
  • Français

A dynamic optimal trajectory generator for Cartesian Path following

Published online by Cambridge University Press:  18 April 2001

Edward Red
Edward Red
Affiliation:
Department of Mechanical Engineering, Brigham Young University, 435 CTB, P.O. Box 24201, Provo, Utah 84602-4201 (USA)
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper considers a dynamic and adaptive trajectory generator for negotiating paths using S-curves. Applying constant jerk transitions between the constant acceleration and deceleration periods of the trajectory, the trajectory will optimally transition to the desired speed setting. Optimal is defined to be the minimum time to transition from the current speed to the set speed for the move segment when jerk and acceleration are limited. The S-curve equations will adapt to instantaneous changes in speed setting and path length. An integrated motion planner will determine allowable speeds and transitional profiles based on the remaining move distance.

Keywords

Trajectory generatorCartesian pathS-curvesOptimal timeIntegrated motion planner
Type
Research Article
Information
Robotica , Volume 18 , Issue 5 , September 2000 , pp. 451 - 458
Copyright
© 2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)