Hostname: page-component-89b8bd64d-sd5qd Total loading time: 0 Render date: 2026-05-07T00:11:41.428Z Has data issue: false hasContentIssue false

Robot path optimization based on adaptive weight pseudospectral method

Published online by Cambridge University Press:  06 August 2025

Wenzhi Zhou
Affiliation:
School of Mechanical and Electrical Engineering, Soochow University, Suzhou, China
Zhiwei Gao
Affiliation:
School of Mechanical and Electrical Engineering, Soochow University, Suzhou, China
Xin Sun
Affiliation:
School of Mechanical and Electrical Engineering, Soochow University, Suzhou, China
Licheng Fan*
Affiliation:
School of Mechanical and Electrical Engineering, Soochow University, Suzhou, China
*
Corresponding author: Licheng Fan; Email: fanlicheng@suda.edu.cn

Abstract

In complex work environments, improving efficiency and stability is an important issue in robot path planning. This article proposes a new path optimization algorithm based on pseudospectral methods. The algorithm includes an adaptive weighting factor in the objective function, which automatically adjusts the quality of the path while satisfying the performance indicators of the shortest time. It also considers kinematic, dynamic, boundary, and obstacle constraints, and applies the Separating Axis Theorem collision detection method to improve computational efficiency. To discretize the continuous path optimization problem into a nonlinear programming problem, the algorithm utilizes Chebyshev polynomials for the interpolation of state and control variables, along with the adoption of the Lagrange interpolation polynomial to approximate the curve. Finally, it solves the nonlinear programming problem numerically using CasADi, which supports automatic differentiation. The results of the simulation demonstrate that the path optimized by the adaptive-weight pseudospectral method can satisfy various constraints and optimization objectives simultaneously. Experimental verification confirms the efficiency and feasibility of the proposed algorithm.

Information

Type
Research Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Supplementary material: File

Zhou et al. supplementary material 1

Zhou et al. supplementary material
Download Zhou et al. supplementary material 1(File)
File 7.8 MB
Supplementary material: File

Zhou et al. supplementary material 2

Zhou et al. supplementary material
Download Zhou et al. supplementary material 2(File)
File 2.8 MB