Research Papers

Convolution-Based Trajectory Generation Methods Using Physical System Limits

[+] Author and Article Information
Geon Lee

Korean Institute of Science and
Technology (KIST),
Seoul, 136-791, Republic of Korea
e-mail: 022454@kist.re.kr

Jinhyun Kim

Department of Mechanical Engineering,
Seoul National University of
Science and Technology,
Seoul, 139-743, Republic of Korea
e-mail: jinhyun@seoultech.ac.kr

Youngjin Choi

Department of Electronic Systems Engineering,
Hanyang University,
Ansan, 426-791, Republic of Korea
e-mail: cyj@hanyang.ac.kr

1Corresponding author.

Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL. Manuscript received November 29, 2010; final manuscript received June 22, 2012; published online October 29, 2012. Assoc. Editor: Warren E. Dixon.

J. Dyn. Sys., Meas., Control 135(1), 011001 (Oct 29, 2012) (8 pages) Paper No: DS-10-1354; doi: 10.1115/1.4007551 History: Received November 29, 2010; Revised June 22, 2012

This paper proposes two novel convolution-based trajectory generation methods using physical system limits such as maximum velocity, maximum acceleration, and maximum jerk. Convolution is a mathematical operation on two functions of an input function and a convoluted function, producing an output function that is typically viewed as a modified version of input function. Time duration parameters of the convoluted functions with a unit area are determined from the given physical system limits. The convolution-based trajectory generation methods to be proposed in this paper have three advantages; first, a continuously differentiable trajectory is simply obtained by applying successive convolution operations; second, a resultant trajectory is always generated satisfying the given physical system limits; third, the suggested methods have low computational burden thanks to recursive form of convolution operation. The suggested methods consider both zero and nonzero initial/terminal conditions. Finally, the effectiveness of the suggested methods is shown through numerical simulations.

© 2013 by ASME
Your Session has timed out. Please sign back in to continue.


Craig, J. J., 1989, Introduction to Robotics, Addison-Wesley, New York.
Constantinescu, D., and Croft, E. A., 2000, “Smooth and Time-Optimal Trajectory Planning for Industrial Manipulators Along Specified Paths,” J. Rob. Syst., 17, pp. 233–249. [CrossRef]
Mizoshita, Y., Hasegawa, S., and Takaishi, K., 1996, “Vibration Minimized Access Control for Disk Drives,” IEEE Trans. Magn., 32, pp. 1793–1798. [CrossRef]
Tsuji, T., Tanaka, Y., Morasso, P. G., Sanguincti, V., and Kaneko, M., 2002, “Bio-Mimetic Trajectory Generation of Robots via Artificial Potential Field With Time Base Generator,” IEEE Trans. Syst., Man, Cybern Part C Appl. Rev., 32(4), pp. 426–439. [CrossRef]
Jeon, J. W., and Ha, Y. Y., 2000, “A Generalized Approach for the Acceleration and Deceleration of Industrial Robots and CNC Machine Tools,” IEEE Trans. Ind. Electron., 47(2), pp. 133–139. [CrossRef]
Panahi, I. M. S., and Toliyat, H. A., 2006, “An Efficient Processor-Based Online Generation of Time-Optimal Trajectories,” IEEE Trans. Control Syst. Technol., 14(5), pp. 966–973. [CrossRef]
Bobrow, J. E., Dubowsky, S., and Gibson, J. S., 1985, “Time-Optimal Control of Robotic Manipulators Along Specified Paths,” Int. J. Rob. Res., 4, pp. 3–17. [CrossRef]
Ahn, K. T., Cho, J. S., and Chung, W. K., 2006, “Discrete Trajectory Formation in Comparison With the Analytical Method for Smooth Movements,” Proceedings of IEEE International Conferernce on Industrial Electronics Control and Instrumentation, pp. 4462–4467. [CrossRef]
Macfarlane, S., and Croft, E. A., 2003, “Jerk-Bounded Manipulator Trajectory Planning: Design for Real-Time Application,” IEEE Trans. Rob. Autom., 19(1), pp. 42–52. [CrossRef]
Schlemmer, M., and Agrawal, S. K., 2002, “A Computational Approach for Time-Optimal Planning of High-Rise Elevators,” IEEE Trans. Control Syst. Technol., 10(1), pp. 105–111. [CrossRef]
Fu, K. S., Gonzalez, R. C., and Lee, C. S. G., 1987, Robotics: Control, Sensing, Vision and Intelligence, McGraw-Hill, New York.
Nam, S.-H., and Yang, M.-Y., 2004, “A Study on a Generalized Parametric Interpolator With Real-Time Jerk-Limited Acceleration,” Comput.-Aided Des., 36(1), pp. 27–36. [CrossRef]
Nguyen, K. D., Chen, I.-M., and Ng, T.-C., 2007, “Planning Algorithms for S-Curve Trajectories,” Proceedings of IEEE International Conference on Advanced Intelligent Mechatronics, pp. 1–6. [CrossRef]
Lambreshts, P., Boerlage, M., and Steinbuch, M., 2005, “Trajectory Planning and Feedforward Design for Electromechanical Motion Systems,” Control Eng. Pract., 13, pp. 145–157. [CrossRef]
Erkorkmaz, K., and Altintas, Y., 2001, “High Speed CNC System Design, Part I: Jerk Limited Trafectory Generation and Quintic Spline Interpolation,” Int. J. Mach. Tools Manuf., 41, pp. 1323–1345. [CrossRef]
Ahn, K. T., Chung, W. K., and Youm, Y., 2004, “Zero States Polynomial-Like Trahectory(ZSPOT) Generation,” Proceedings of International Conference on the Advanced Mechatronics, pp. 120–125.
Khalsa, D. S., 1990, “High Performance Motion Control Trajectory Commands Based on the Convolution Integral and Digital Filtering,” Proceedings of International Conference on Intelligent Motion, pp. 54–61.
Park, H. A., Ali, M. A., and Lee, C. S. G., 2010, “Convolution-Sum-Based Generation of Walking Patterns for Uneven Terrains,” Proceedings of IEEE International Conference on Humanoid Robots, pp. 455–460. [CrossRef]
Kim, J.-H., 2007, “Walking Pattern Generation of a Biped Walking Robot Using Convolution Sum,” Proceedings of IEEE International Conference on Humanoid Robotics, pp. 539–544. [CrossRef]
Su, K.-H., Hu, C.-K., and Cheng, M.-Y., 2006, “Design and Implementation of an FPGA-Based Motion Command Generation Chip,” Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, pp. 5030–5035. [CrossRef]


Grahic Jump Location
Fig. 1

Convolution-based trajectory generation method: zero states

Grahic Jump Location
Fig. 2

Convolution-based trajectory generation method: nonzero terminal condition

Grahic Jump Location
Fig. 3

Decomposition of the trajectory with nonzero states into a rectangular initial velocity function and the nonzero final velocity function

Grahic Jump Location
Fig. 4

Four possible trajectories according to the given distance, initial and terminal conditions

Grahic Jump Location
Fig. 5

Criterion distance Sn* obtained as t0 →0 in the Fig. 2, in the case of zero initial velocity

Grahic Jump Location
Fig. 6

The distance to be moved is equal to the area of polygon

Grahic Jump Location
Fig. 7

Block diagram of the whole algorithm

Grahic Jump Location
Fig. 8

Block diagram of the convolution

Grahic Jump Location
Fig. 9

Simulation results of the method I

Grahic Jump Location
Fig. 10

Simulation results of the method II



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In