Dynamic Optimization of Path-Constrained Switched Systems with Multiple Time-Delays

A dynamic optimization algorithm is designed for the optimal control problem of path-constrained switched systems with multiple time-delays. Firstly, the control vector parametrization technique is utilized to parameterize continuous control input into finite numbers of piecewise constant functions. Then, the gradient information of the objective function with respect to the decision variables (switching times and control input) is evaluated by solving an auxiliary costate system. Secondly, the dynamic optimization algorithm based on the gradient information is proposed to locate an optimal solution of the path-constrained switched systems with multiple time-delays, which satisfies the Karush-Kuhn-Tucker conditions to a specific tolerance, meanwhile guaranteeing rigorous satisfaction of the path constraints. Thirdly, it is proved that the proposed algorithm terminates within finite iterations. Finally, the developed algorithm is validated through a numerical simulation.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10865248
Primary Topic
Advanced Optical Network Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Optimization of Path-Constrained Switched Systems with Multiple Time-Delays

Manyi Zeng, Xiaochen Zhu, Huan Li, Jun Fu
Advanced Optical Network Technologies
article

Dynamic Optimization of Path-Constrained Switched Systems with Multiple Time-Delays

Manyi Zeng, Xiaochen Zhu, Huan Li, Jun Fu
article en

Abstract

A dynamic optimization algorithm is designed for the optimal control problem of path-constrained switched systems with multiple time-delays. Firstly, the control vector parametrization technique is utilized to parameterize continuous control input into finite numbers of piecewise constant functions. Then, the gradient information of the objective function with respect to the decision variables (switching times and control input) is evaluated by solving an auxiliary costate system. Secondly, the dynamic optimization algorithm based on the gradient information is proposed to locate an optimal solution of the path-constrained switched systems with multiple time-delays, which satisfies the Karush-Kuhn-Tucker conditions to a specific tolerance, meanwhile guaranteeing rigorous satisfaction of the path constraints. Thirdly, it is proved that the proposed algorithm terminates within finite iterations. Finally, the developed algorithm is validated through a numerical simulation.

State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University (CN)
Affordable and clean energy
Openalex Percentile: Top 75%
Advanced Optical Network Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.