{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T03:36:34Z","timestamp":1775878594173,"version":"3.50.1"},"reference-count":25,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotics"],"abstract":"<jats:p>Finding fast motion functions to get from an initial state (distance, velocity, acceleration) to a final one has been of interest for decades. For a solution to be practically relevant, restrictions on jerk, acceleration and velocity have to be taken into account. Such solutions use optimization algorithms or try to directly construct a motion function allowing online trajectory generation. In this contribution, we follow the latter strategy and present an approach which first deals with the situation where initial and final accelerations are 0, and then relates the general case as much as possible to this situation. This leads to a classification with just four major cases. A continuity argument guarantees full coverage of all situations which is not the case or is not clear for other available algorithms. We present several examples that show the variety of different situations and, thus, the complexity of the task. We also describe an implementation in MATLAB\u00ae and results from a huge number of test runs regarding accuracy and efficiency, thus demonstrating that the algorithm is suitable for online trajectory generation.<\/jats:p>","DOI":"10.3390\/robotics10010025","type":"journal-article","created":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T11:40:48Z","timestamp":1612179648000},"page":"25","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On Fast Jerk\u2013, Acceleration\u2013 and Velocity\u2013Restricted Motion Functions for Online Trajectory Generation"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4573-9357","authenticated-orcid":false,"given":"Burkhard","family":"Alpers","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering, Aalen University, D-73430 Aalen, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2021,2,1]]},"reference":[{"key":"ref_1","unstructured":"Biagiotti, L., and Melchiorri, C. (2008). Trajectory Planning for Automatic Machines and Robots, Springer."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Carbone, G., and Gomez-Bravo, F. (2015). Motion and Operation Planning of Robotic Systems, Springer. Mechanisms and Machine Science 29.","DOI":"10.1007\/978-3-319-14705-5"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Carbone, G., and Gomez-Bravo, F. (2015). Path Planning and Trajectory Planning Algorithms: A General Overview. Motion and Operation Planning of Robotic Systems, Springer.","DOI":"10.1007\/978-3-319-14705-5"},{"key":"ref_4","unstructured":"VDI (1980). Guideline 2143: Motion Rules for Cam Mechanisms; Theoretical Fundamentals (German), Beuth Verlag."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/TRO.2009.2035744","article-title":"Online Trajectory Generation: Basic Concepts for Instantaneous Reactions to Unforseen Events","volume":"26","author":"Wahl","year":"2010","journal-title":"IEEE Trans. Robot."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/TRA.2002.807548","article-title":"Jerk-bounded manipulator trajectory planning: Design for real-time applications","volume":"19","author":"Macfarlane","year":"2003","journal-title":"IEEE Trans. Robot. Autom."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.rcim.2012.08.002","article-title":"Time-optimal and jerk-continuous trajectory planning for robot manipulators with kinematic constraints","volume":"29","author":"Liu","year":"2013","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Lin, J., Somani, N., Hu, B., Rickert, M., and Knoll, A. (2018, January 1\u20135). An Efficient and Time-Optimal Trajectory Generation Approach for Waypoints under Kinematic Constraints and Error Bounds. Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Madrid, Spain.","DOI":"10.1109\/IROS.2018.8593577"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1109\/TMECH.2018.2810828","article-title":"Complete and time-optimal path-constrained trajectory planning with torque and velocity constraints: Theory and applications","volume":"23","author":"Shen","year":"2018","journal-title":"IEEE\/ASME Trans. Mechatron."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/LRA.2018.2883375","article-title":"Minimum-time trajectory planning under intermittent measurements","volume":"4","author":"Penin","year":"2019","journal-title":"IEEE Robot. Autom. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Carbone, G., and Gomez-Bravo, F. (2015). Off-line and On-Line Trajectory Planning. Motion and Operation Planning of Robotic Systems, Springer.","DOI":"10.1007\/978-3-319-14705-5"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Kr\u00f6ger, T. (2010). On-Line Trajectory Generation in Robotic Systems, Springer.","DOI":"10.1007\/978-3-642-05175-3"},{"key":"ref_13","unstructured":"SEW Eurodrive (2010). Manual Program. Module MultiMotion, SEW."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.mechmachtheory.2019.05.002","article-title":"Smooth point-to-point trajectory planning for industrial robots with kinematical constraints based on high-order polynomial curve","volume":"139","author":"Wang","year":"2019","journal-title":"Mech. Mach. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.mechmachtheory.2019.03.019","article-title":"Smooth and time-optimal S-curve trajectory planning for automated robots and machines","volume":"137","author":"Fang","year":"2019","journal-title":"Mech. Mach. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Trigatti, G., Boscariol, P., Scalera, L., Pillan, D., and Gasparetto, A. (2018, January 11\u201313). A look-ahead trajectory planning algorithm for spray painting robots with non-spherical wrists. Proceedings of the 4th IFToMM Symposium on Mechanism Design for Robotics, Udine, Italy.","DOI":"10.1007\/978-3-030-00365-4_28"},{"key":"ref_17","unstructured":"Liu, S. (2002, January 3\u20135). An On-line Reference-Trajectory Generator for Smooth Motion of Impulse-Controlled Industrial Manipulators. Proceedings of the 7th International Workshop on Advanced Motion Control, Maribor, Slovenia."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Haschke, R., Weitnauer, E., and Ritter, H. (2008, January 27\u201331). On-line planning of time-optimal, jerk-limited trajectories. Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems, Nice, France.","DOI":"10.1109\/IROS.2008.4650924"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1177\/0278364913517148","article-title":"Planning high order trajectories with general initial and final conditions and asymmetric bounds","volume":"33","author":"Ezair","year":"2014","journal-title":"Int. J. Robot. Res."},{"key":"ref_20","unstructured":"Broqu\u00e8re, X. (2011). Planification de Trajectoire Pour la Manipulation D\u2019objets et L\u2019interaction Homme-Robot. [Ph.D. Thesis, Universit\u00e9 Paul Sabatier Toulouse III]."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Broqu\u00e8re, X., Sidobre, D., and Herrera-Aguilar, I. (2008, January 22\u201326). Soft motion trajectory planner for service manipulator robot. Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems, Nice, France.","DOI":"10.1109\/IROS.2008.4650608"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1007\/s10846-018-0936-z","article-title":"Smooth cubic polynomial trajectories for human-robot interactions","volume":"95","author":"Sidobre","year":"2019","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_23","unstructured":"McKeeman, B. (2020). MATLAB Performance Measurement, Mathworks."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"20:1","DOI":"10.1145\/3386241","article-title":"Algorithm 1010: Boosting Efficiency in Solving Quartic Equations with No Compromise in Accuracy","volume":"46","author":"Orellana","year":"2020","journal-title":"ACM Trans. Math. Softw."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Desormeaux, K., and Sidobre, D. (2019, January 4\u20138). Online Trajectory Generation: Reactive Control with Return Inside an Admissible Kinematic Domain. Proceedings of the International Conference on Intelligent Robots and Systems (IROS 2019), Macau, China.","DOI":"10.1109\/IROS40897.2019.8968266"}],"container-title":["Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2218-6581\/10\/1\/25\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:18:17Z","timestamp":1760159897000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2218-6581\/10\/1\/25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,1]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,3]]}},"alternative-id":["robotics10010025"],"URL":"https:\/\/doi.org\/10.3390\/robotics10010025","relation":{},"ISSN":["2218-6581"],"issn-type":[{"value":"2218-6581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,1]]}}}