A novel successive convexification framework with symplectic pseudospectral solutions for nonlinear optimal control problems of constrained pantograph delay systems

This paper proposes a novel symplectic pseudospectral iteration framework for the nonlinear optimal control problem (OCP) of a pantograph delay system with inequality constraints. Traditional numerical algorithms for OCPs with pantograph delay systems have predominantly focused on unconstrained scenarios, neglecting constrained problems. Therefore, we propose a novel symplectic pseudospectral iteration framework for constrained problems. First, we employ the successive convexification (SCvx) method to transform the original problem into a series of linear quadratic (LQ) problems, addressing nonlinearity. Then, leveraging time-scale transformations and parametric variational principles, we derive the first-order necessary conditions (FONCs) for these convexified problems, including a Hamiltonian two-point boundary value problem (HTBVP) with stretching terms and a linear complementarity problem. To handle pantograph time delays effectively, we employ a local Legendre-Gauss-Lobatto (LGL) pseudospectral method with proportional grid discretization. Finally, employing a symplectic indirect algorithm, we develop a symplectic pseudospectral method (SPM) for solving the transformed LQ problems, converting them into a system of sparse linear algebraic equations and a linear complementarity problem. Validation of the framework is performed using diverse illustrative examples, demonstrating strong agreement between SCvx and SPM in computational efficiency. Numerical experiments confirm the sparsity of the core matrix and robustness to initial guesses.