1999
DOI: 10.1177/02783649922066637
|View full text |Cite
|
Sign up to set email alerts
|

The Three-Cubic Method: An Optimal Online Robot Joint Trajectory Generator under Velocity, Acceleration, and Wandering Constraints

Abstract: An original method called the three-cubic method is proposed to generate online robot joint trajectories interpolating given position points with associated velocities. The method is based on an acceleration profile composed of three cubic polynomial segments, which ensure a zero acceleration at each intermediate point. Velocity and acceleration continuity is obtained, and this three-cubics combination allows the analytical solution to the minimum time trajectory problem under maximum velocity and acceleration… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2002
2002
2017
2017

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 37 publications
(17 citation statements)
references
References 16 publications
0
17
0
Order By: Relevance
“…Since lifesupport robots must be able to accomplish a given task in dynamic environments, on-line path planning method is indispensable. So, various on-line path planning methods were proposed [3], [4].…”
Section: Related Workmentioning
confidence: 99%
“…Since lifesupport robots must be able to accomplish a given task in dynamic environments, on-line path planning method is indispensable. So, various on-line path planning methods were proposed [3], [4].…”
Section: Related Workmentioning
confidence: 99%
“…Most similarly there are Spline-based solutions [1,[4][5][6][7][8][9], against which our methods must "compete". The original DMP framework, on the other hand, contains several aspects which are different from our new approach (despite the fact that our approach was partly derived from DMPs).…”
Section: Conclusion and Application Potentialmentioning
confidence: 99%
“…Two fundamental methods (and many variations thereof) exist, which address these demands to different degrees. In a somewhat simplified view one can broadly state that Splines (and other lower order polynomials) are very well suited for via-point control [1,[4][5][6][7][8][9], whereas trajectories generated by a dynamical systems approach (dynamic motion primitives, DMPs [10][11][12][13]) are smooth and robust against perturbations.…”
Section: Introductionmentioning
confidence: 99%
“…If there are no obstacles on the way to the target spot, the straight line locomotion would be the best choice. The path from start point to the target point may be inserted some control points [12]; the control points are used for optimizing the motion control, saving energy, and reducing processing time. It is, however, that the control points are selected for saving energy or saving processing time.…”
Section: Path Planning Algorithmmentioning
confidence: 99%