- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Robotics

Volume 2013 (2013), Article ID 735958, 6 pages

http://dx.doi.org/10.1155/2013/735958

## Simplified Robotics Joint-Space Trajectory Generation with a via Point Using a Single Polynomial

Department of Mechanical Engineering, Ohio University, Athens, OH 45701, USA

Received 3 December 2012; Revised 30 January 2013; Accepted 31 January 2013

Academic Editor: Gordon R. Pennock

Copyright © 2013 Robert L. Williams II This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper presents novel fourth- and sixth-order polynomials to solve the problem of joint-space trajectory generation with a via point. These new polynomials use a single-polynomial function rather than two-polynomial functions matched at the via point as in previous methods. The problem of infinite spikes in jerk is also addressed.

#### 1. Introduction

Joint-space trajectory generation is in common usage in robotics to provide smooth, continuous motion from one set of joint angles to another, for instance, for moving between two distinct Cartesian poses for which the inverse pose solution has yielded two distinct sets of joint angles. The joint-space trajectory generation occurs at runtime for all joints independently but simultaneously.

There is an entire body of literature devoted to trajectory generation (aka motion planning and path planning) at the joint level. Paul and Zhong [1] were among the first to suggest the use of polynomials for robot trajectory generation. A common joint-space trajectory generation method (linearly changing joint velocity using starting and ending parabolic blends) is identically presented by many authors [2–7]. Despite the widespread popularity of this method, it suffers from infinite spikes in jerk (the derivative of acceleration) and requires three separate functions instead of one. An identical third-order polynomial joint-space trajectory generation approach is also presented by many authors [2, 4–7]. Further, an identical fifth-order polynomial joint-space trajectory generation approach is presented by many authors [2, 4, 5, 7]. From these authors’ lists, it may appear that Koivo was the first to present these methods, when in fact they were already presented in Craig’s first edition in 1986. Fu et al. [8] depart from these standard methods, suggesting initial, intermediate, and final polynomials of order 4-3-4, 3-5-3, or 5 third-order polynomials, for a single joint motion. These are by far the most (unnecessarily) complicated methods and are presented without justification or comparison with simpler methods. For dealing with a via point in which the robot need not stop at the via point (such as for obstacle avoidance), Craig [5] suggests matching two third-order polynomials.

Apparently alone amongst all of the major robotics textbook authors, Angeles [9, Section 6.5] derives a 4-5-6-7 seventh-order polynomial to fit two via points and ensure finite joint jerk at the start and end of motion. Angeles [9, Section 6.6] also presents approximation of this seventh-order polynomial with a cubic spline and discusses the associated errors.

An early version of the current paper was presented by the author at a conference [10]. The original contribution of this paper is a single sixth-order polynomial to provide smooth, continuous joint motion through a via point. Previous approaches have matched two third-order polynomials at the via point. We also present a single fourth-order polynomial to accomplish the same purpose. However, this case should not be used since it leads to discontinuous accelerations, leading to infinite spikes in jerk, which is unacceptable for reliable, smooth, and long-life robotic systems. This infinite jerk problem, prevalent in all of the robotics textbooks, has also been pointed out by Macfarlane and Croft [11], who present jerk-bounded trajectories and Gosselin and Hadj-Messaoud [12] and Petrinec and Kovacic [13] who go one step further to ensure continuous, not just bounded, jerk.

#### 2. Joint-Space Trajectory Generation with a via Point

Standard joint-space trajectory generation assumes that two sets of discrete joint parameters are known (angles for revolute joints, lengths for prismatic joints), and it is required to move smoothly in joint-space from one set to the next. For instance, given required Cartesian poses and , inverse pose kinematics calculate the required joint value sets for achieving each of these; call them and . Note subscript stands for start (or initial) and subscript stands for finish (or final). The standard joint-space trajectory method then moves smoothly from and for all joints independently but simultaneously.

Polynomials are natural choices for providing smooth, continuous motion, with some level of continuous derivatives. In many robotics motion planning problems, the robot must pass through intermediate point(s) between the start and finish poses, such as for obstacle avoidance. The joint rates and accelerations need not go to zero at these so-called via points, but they must be matched between functions meeting at the via point(s).

##### 2.1. Two Third-Order Polynomials

Craig [5] suggested the use of two third-order polynomials meeting at the via point. Section 2.1 is entirely a summary of Craig’s work (with an original example by the current author). Two third-order polynomials will provide smooth motion with continuous position and velocity and zero velocity at the start and end. The two third-order polynomials are

These two polynomials require eight constraints. Four constraints come from the initial and final time points: It is convenient to shift the time axis so that the polynomial has zero time starting at the via time. is the end time of the first range () and is the relative end time of the second range ().

We need four more constraints. We force the first polynomial to end at the via angle and the second polynomial to start at the via angle . We also ensure that the velocities and accelerations match at the via point (they need not go to zero). This will ensure that the jerk stays finite during this via point transition between the two polynomials. The four additional constraints are

The constraints yield eight linear equations in the eight unknowns (two third-order polynomials, four unknown coefficients each). Three of the unknown polynomial coefficients are found immediately, from the initial and via time constraints: , , and . The simplified matrix/vector equation to solve for the remaining three unknowns is Solve (4) for the remaining five unknowns for use in (12). For the special case of , the analytical solution is , , and , and

###### 2.1.1. Example: Two Third-Order Polynomials with a via Point

Use two third-order polynomials for smooth joint-space trajectory generation, plus motion through a via point, for one joint. Given , , , () sec, find and : deg units are used throughout this example. These results are plotted in Figure 1.

Note that the joint angle passes through the via point and keeps going for a brief time; this is because the velocity is still positive beyond the first 1.5 sec. The maximum angle is , occurring at sec. At , the angular velocity goes to zero (the slope of the angle is zero at that point since the angle is changing in direction). Also note that the velocity term in , the coefficient, is nonzero since the velocity does not need to go to zero at this via point. Further, note that the velocity and acceleration have been successfully matched at the 1.5 sec via point transition as required. Note that the jerk is not matched at the transition (the slopes of the two polynomial accelerations are of the same magnitude but of different signs), but jerk remains finite since the acceleration is matched. The jerk has infinite spikes at the start and end, which is common in the robotics books but is unacceptable.

##### 2.2. Two Fifth-Order Polynomials

The two third-order polynomials presented above, matched at a via point, appear in many robotics textbooks (e.g., [5]). However, this approach suffers from discontinuous acceleration functions at the initial and final time, leading to infinite spikes in jerk at these points in time. This is unacceptable for the repeated motions of mechanical systems due to unacceptable wear, noise, and dynamic excitation. To fix this, we could match two fifth-order polynomials at the via point, specifying zero acceleration at the initial and final times (not at the via time—instead matching velocities and accelerations between the two fifth-order polynomial functions at the via time). However, this will not be presented because we came up with a better method, a single polynomial versus two matched polynomials—this original work is presented in the next two subsections.

##### 2.3. Single Fourth-Order Polynomial

The first original contribution of this paper is presented in this subsection. We can achieve the same goals as the two third-order polynomials meeting at a via point much more simply; let us use only one polynomial, forced to go through the via point. Here are the constraints for meeting the required angles with smooth motion (since we use a single continuous polynomial, the velocity and accelerations are guaranteed to match and be continuous at the via point): Note in this case since there is only one time range, it is convenient to treat all times as absolute, rather than relative as when we did matching of two third-order polynomials. With five constraints, a single fourth-order polynomial is required:

Five linear equations in the five unknown polynomial coefficients , result from the five constraints (7). Two of the unknown polynomial coefficients are found immediately, from the initial time constraints: and . The simplified matrix/vector equation to solve for the remaining three unknowns is The single fourth-order polynomial solution for each joint is

For the special case of , the solution is

###### 2.3.1. Example: Single Fourth-Order Polynomial with a via Point

Use a single fourth-order polynomial for smooth joint-space trajectory generation, plus motion through a via point, for one joint. Given , , , sec, find : Again, deg units are used throughout this example. These results are plotted in Figure 2.

The shape for the single fourth-order polynomial is very similar to that for the two third-order polynomials. Again, the joint angle passes through the via point and keeps going briefly, due to the fact that the velocity is still positive beyond the first 1.5 sec. The peak for this fourth-order case is slightly greater and occurs in time slightly after the peak for the two third-order polynomials example. The maximum angle is , occurring at sec. For the fourth-order polynomial, a side benefit has arisen: the jerk is now continuous at the via time, where it was discontinuous for the two matched third-order polynomials.

The jerk still has an infinite spike at the start and end as we saw with the two third-order polynomials example, which is unacceptable. We now improve upon this with a single sixth-order polynomial in the next subsection; again, this next subsection is original work.

##### 2.4. Single Sixth-Order Polynomial

This section presents another original contribution. We can achieve the same goals as the single fourth-order polynomial with a via point and eliminate the infinite spikes in jerk at the start and end as follows. To the previous five constraints, add two more, for zero acceleration at the start and end of the single motion range. Here are the seven constraints: With the seven constraints, a single sixth-order polynomial is required:

Seven linear equations in the seven unknown polynomial coefficients , result from the seven constraints (13). Three of the unknown polynomial coefficients are found immediately, from the initial time constraints: , , and . The simplified matrix/vector equation to solve for the remaining four unknowns is The single sixth-order polynomial solution for each joint is For the special case of , the analytical solution is

###### 2.4.1. Example: Single Sixth-Order Polynomial with a via Point

Use a single sixth-order polynomial for smooth joint-space trajectory generation, plus motion through a via point, for one joint. Given , , , , and sec, find : Again, deg units are used throughout this example. These results are plotted in Figure 3.

Again, the shape is similar to the previous two examples. The maximum angle is , occurring at sec. Note the magnitude of the angular velocity, acceleration, and jerk are not greatly different for the three cases we have presented with via point. Generally they are lowest for the two third-order polynomials. This single sixth-order polynomial approach has eliminated the problem of infinite spikes in jerk at the start and end of each motion. Here, the jerk is discontinuous but it remains finite, which obeys the rule of thumb for mechanical design/motion.

#### 3. Discussion

All joint-space trajectory generation methods presented by previous authors and the new ones proposed in this paper can easily be applied to multiple joints, simultaneously but independently.

This main original contribution of this paper is to present a new joint-space trajectory generation approach using a single polynomial for motion through a given via point. The robot does not need to stop at the via point, but the motion must be smooth and continuous through the via point. A single fourth-order polynomial was developed to achieve this smooth motion through a via point and to replace the two three-order polynomials matched at the via point in common usage today. With the new approach, this via point matching comes automatically and there is no need for two-polynomial functions.

An important secondary contribution of this paper is to expose a bad practice in common usage in joint-space trajectory generation in robotics today. We are not the first to notice this [11–13], but judging from the four robotics textbooks in the list of references published within the past five years, the message has not been widely understood (only [9] is concerned with preventing infinite jerk). For any functions in which the acceleration is discontinuous, the associated jerk (time derivative of acceleration) function will have infinite spikes at those acceleration discontinuities. Cam’s design teaches that these infinite spikes in jerk are unacceptable and must be avoided by the designed/motion controller. By extension, in robot joint-space trajectory generation, any method which allows discontinuous acceleration functions is unacceptable and must not be used. Unfortunately, the linear velocity with parabolic blends, the third-order polynomial, and the two third-order polynomials matched to meet at a via point all suffer from discontinuity in acceleration and thus infinite spikes in jerk. These methods are still very common in usage in the standard robotics textbooks today; these methods must be discarded. Otherwise, unacceptable noise, wear, stress, reduced life, and the introduction of bad dynamics may result.

The novel single fourth-order polynomial introduced in this paper to go through a via point also suffers from this discontinuous acceleration. Therefore, to remedy this we introduced a novel sixth-order polynomial to move smoothly and continuously through a via point, with finite jerk throughout the entire motion, which is acceptable*. *

#### 4. Conclusion

For joint-space trajectory generation in robotics, the recommendations of this paper are simple; for all joint motions without a via point, use the standard fifth-order polynomial from Craig [5]. For all joint motions with a via point, use the new single sixth-order polynomial introduced in this paper. Not only does this new sixth-order polynomial keep the jerk finite, it also achieves the via point motion with only one function.

#### References

- R. P. Paul and H. Zhong, “Robot motion trajectory specification and generation,” in
*Proceedings of the 2nd International Symposium on Robotics Research*, Kyoto, Japan, August 1984. - A. J. Koivo,
*Fundamentals For Control of Robotic Manipulators*, John Wiley and Sons, New York, NY, USA, 1989. - R. E. Parkin,
*Applied Robotic Analysis*, Prentice Hall, Englewood Cliffs, NJ, USA, 1991. - L. Sciavicco and B. Siciliano,
*Robotics: Modeling, Planning, and Control*, McGraw-Hill, New York, NY, USA, 2008. - J. J. Craig,
*Introduction To Robotics: Mechanics and Control*, Pearson Prentice Hall, Upper Saddle River, NJ USA, 3rd edition, 2005. - M. W. Spong, S. Hutchinson, and M. Vidyasagar,
*Robot Modeling and Control*, John Wiley and Sons, New York, NY, USA, 2005. - R. N. Jazar,
*Theory of Applied Robotics: Kinematics, Dynamics, and Control*, Springer, New York, NY, USA, 2nd edition, 2010. - K. S. Fu, R. C. Gonzalez, and C. S. G. Lee,
*Robotics: Control, Sensing, Vision, and Intelligence*, McGraw-Hill, New York, NY, USA, 1987. - J. Angeles,
*Fundamentals of Robotic Mechanical Systems*, Springer, New York, NY, USA, 3rd edition, 2007. - R. L. Williams II, “Improved robotics joint-space trajectory generation with via point,” in
*Proceedings of the ASME IDETC/CIE*, Washington, DC, USA, August 2011, DETC2011-47592. - S. Macfarlane and E. A. Croft, “Jerk-bounded manipulator trajectory planning: design for real-time applications,”
*IEEE Transactions on Robotics and Automation*, vol. 19, no. 1, pp. 42–52, 2003. View at Publisher · View at Google Scholar · View at Scopus - C. M. Gosselin and A. Hadj-Messaoud, “Automatic planning of smooth trajectories for pick-and-place operations,”
*Journal of Mechanical Design, Transactions Of the ASME*, vol. 115, no. 3, pp. 450–456, 1993. View at Scopus - K. Petrinec and Z. Kovacic, “Trajectory planning algorithm based on the continuity of jerk,” in
*2007 Mediterranean Conference on Control and Automation, MED*, grc, July 2007. View at Publisher · View at Google Scholar · View at Scopus