A Sequential Operator-Splitting Framework for Exploration of Nonconvex Trajectory Optimization Solution Spaces
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912716897124352 |
|---|---|
| author | Ganiban, Justin Pavlasek, Natalia Acikmese, Behcet |
| author_facet | Ganiban, Justin Pavlasek, Natalia Acikmese, Behcet |
| contents | Trajectory optimization methods provide an efficient and reliable means of computing feasible trajectories in nonconvex solution spaces. However, a well-known limitation of these algorithms is that they are inherently local in nature, and typically converge to a solution in the neighborhood of their initial guess. This paper presents a sequential operator-splitting framework, based on the alternating direction method of multipliers (ADMM), aimed at promoting exploration within the sequential convex programming (SCP) framework. In particular, diverse initial solutions are modeled as agents within the consensus ADMM framework. Driving these agents toward consensus facilitates exploration of the nonconvex optimization landscape. Numerical simulations demonstrate that the proposed method consistently yields equivalent or lower-cost solutions compared to the standard SCP approach, with the same number of or fewer agents. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_14752 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Sequential Operator-Splitting Framework for Exploration of Nonconvex Trajectory Optimization Solution Spaces Ganiban, Justin Pavlasek, Natalia Acikmese, Behcet Optimization and Control Systems and Control Trajectory optimization methods provide an efficient and reliable means of computing feasible trajectories in nonconvex solution spaces. However, a well-known limitation of these algorithms is that they are inherently local in nature, and typically converge to a solution in the neighborhood of their initial guess. This paper presents a sequential operator-splitting framework, based on the alternating direction method of multipliers (ADMM), aimed at promoting exploration within the sequential convex programming (SCP) framework. In particular, diverse initial solutions are modeled as agents within the consensus ADMM framework. Driving these agents toward consensus facilitates exploration of the nonconvex optimization landscape. Numerical simulations demonstrate that the proposed method consistently yields equivalent or lower-cost solutions compared to the standard SCP approach, with the same number of or fewer agents. |
| title | A Sequential Operator-Splitting Framework for Exploration of Nonconvex Trajectory Optimization Solution Spaces |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2511.14752 |