The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Jerk-bounded manipulator trajectory planning: design for real-time applications
Abstract
An online method for obtaining smooth, jerk-bounded trajectories has been developed and implemented. Jerk limitation is important in industrial robot applications, since it results in improved path tracking and reduced wear on the robot. The method described herein uses a concatenation of fifth-order polynomials to provide a smooth trajectory between two way points. The trajectory approximates a linear segment with parabolic blends trajectory. A sine wave template is used to calculate the end conditions (control points) for ramps from zero acceleration to nonzero acceleration. Joining these control points with quintic polynomials results in a controlled quintic trajectory that does not oscillate, and is near time optimal for the jerk and acceleration limits specified. The method requires only the computation of the quintic control points, up to a maximum of eight points per trajectory way point. This provides hard bounds for online motion algorithm computation time. A method for blending these straight-line trajectories over a series of way points is also discussed. Simulations and experimental results on an industrial robot are presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Numerical recipes in Pascal: the art of scientific computing
(1990) · Choice Reviews Online · doi:10.5860/choice.27-5158 · Cited by 11,811
Numerical Recipes in C: The Art of Scientific Computing.
Birchenhall, C., Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · The Economic Journal · doi:10.2307/2234664 · Cited by 4,355
McKerrow, P. J. (1991) · Medical Entomology and Zoology · Cited by 1,731
Time-Optimal Control of Robotic Manipulators Along Specified Paths
Bobrow, J. E., Dubowsky, S., & Gibson, J. S. (1985) · The International Journal of Robotics Research · doi:10.1177/027836498500400301 · Cited by 1,315
Minimum-time control of robotic manipulators with geometric path constraints
Shin, K., & McKay, N. (1985) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1985.1104009 · Cited by 996
Vukobratović, M. (1989) · Springer eBooks · doi:10.1007/978-3-642-82997-0 · Cited by 464
Smooth and time-optimal trajectory planning for industrial manipulators along specified paths
Constantinescu, D., & Croft, E. A. (2000) · Journal of Robotic Systems · doi:10.1002/(sici)1097-4563(200005)17:5<233::aid-rob1>3.0.co;2-y · Cited by 387
Self-citationKyriakopoulos, K. J., & Saridis, G. N. (2003) · Proceedings. 1988 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1988.12075 · Cited by 212
Planning of Minimum- Time Trajectories for Robot Arms
Sahar, G., & Hollerbach, J. M. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500305 · Cited by 192
Cited by
Verl, A., Valente, A., Melkote, S., Brecher, C., Ozturk, E., & Tunc, L. T. (2019) · CIRP Annals · doi:10.1016/j.cirp.2019.05.009 · Cited by 392
Deep learning in robotics: survey on model structures and training strategies
Karoly, A. I., Galambos, P., Kuti, J., & Rudas, I. J. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2020.3018325 · Cited by 146
Fu, G., Gu, T., Gao, H., & Lu, C. (2020) · International Journal of Advanced Robotic Systems · doi:10.1177/1729881420952249 · Cited by 13
Metadata
- Authors
- Macfarlane, S., & Croft, E. A.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 2003-02
- Volume
- 19
- Issue
- 1
- Pages
- 42-52
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2122761880
- Cited by
- 415
- References
- 12
- FWCI
- 13.08
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Jerk-bounded manipulator trajectory planning: design for real-time applications. https://app.cochat.ai/papers/10.1109/tra.2002.807548
- The paper
- Macfarlane, S., & Croft, E. A. (2003). Jerk-bounded manipulator trajectory planning: design for real-time applications. IEEE Transactions on Robotics and Automation. https://doi.org/10.1109/tra.2002.807548
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.