Content area

Abstract

This paper proposes a robot trajectory planning method focused on time and jerk optimization under compound constraints. First, the robot path-tracking task is parameterized by incorporating both kinematic and dynamic constraints in joint and Cartesian spaces, establishing a time-optimal trajectory optimization model. To achieve C3 continuity in joint motion, joint-motion continuity conditions are analyzed, and optimization variables are reconstructed using piecewise cubic splines with corresponding continuity constraints. Considering the nonlinear and nonconvex characteristics of jerk constraints, the time-optimal planning model is decomposed into two second-order cone programming (SOCP) subproblems, achieving linear convexification of the original problem. Additionally, the objective function is improved to optimize both time and joint jerk simultaneously. Experimental results confirm that the proposed method effectively improves robot efficiency and trajectory smoothness.

Details

1009240
Title
Time-Jerk Optimal Robotic Trajectory Planning Under Jerk and Continuity Constraints via Convex Optimization
Publication title
Actuators; Basel
Volume
14
Issue
6
First page
272
Publication year
2025
Publication date
2025
Publisher
MDPI AG
Place of publication
Basel
Country of publication
Switzerland
ISSN
20760825
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
Publication history
 
 
Online publication date
2025-05-29
Milestone dates
2025-04-26 (Received); 2025-05-28 (Accepted)
Publication history
 
 
   First posting date
29 May 2025
ProQuest document ID
3223856916
Document URL
https://www.proquest.com/scholarly-journals/time-jerk-optimal-robotic-trajectory-planning/docview/3223856916/se-2?accountid=208611
Copyright
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2025-06-25
Database
ProQuest One Academic