Weak Loss Convexification for Sequential Convex Programming

This article presents a methodology to reduce the convexification loss in sequential convex programming for a class of nonconvex optimal control problems. The nonconvexity arises from the presence of smooth concave inequality constraints or polyhedral exclusion constraints. The concave inequality co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on aerospace and electronic systems Jg. 61; H. 2; S. 4020 - 4029
Hauptverfasser: Deng, Yunshan, Xia, Yuanqing, Sun, Zhongqi, Li, Chang, Hu, Rui
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.04.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Aerospace and electronic systems
Approximation
Collision avoidance
Constraints
Convergence
Convex functions
convex optimization
Convexity
Cost function
Hyperplanes
Optimal control
Programming
Quadratic programming
sequential convex programming (SCP)
Simulation
Sun
Symbols
trajectory planning
Vectors
ISSN:0018-9251, 1557-9603
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This article presents a methodology to reduce the convexification loss in sequential convex programming for a class of nonconvex optimal control problems. The nonconvexity arises from the presence of smooth concave inequality constraints or polyhedral exclusion constraints. The concave inequality constraints are approximated by successive linearization, with the convexification loss reduced either by reconstructing concave functions or revising expansion points. The expansion point revision results in a weak loss convexification. Moreover, polyhedral exclusion constraints are approximated by separating hyperplanes. The convexification loss can be reduced by solving additional dual problems or identifying the supporting hyperplanes, both of which result in weak loss convexifications. The four methods are demonstrated to have no impact on the iterative feasibility and convergence of sequential convex programming. Simulation demonstrates that the reduction of convexification loss can reduce the conservatism during the iteration process, which in turn has the potential to reduce the number of iterations and computation time.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2024.3495614