Convex Optimization-Based Trajectory Planning for Quadrotors Landing on Aerial Vehicle Carriers,Zhipeng Shen, Guanzhong Zhou, Hailong Huang, Chao Huang, Yutong Wang, Fei-Yue Wang。也是讲如何对非凸问题进行无损凸化的,在之前论文推土机:火箭软着陆问题中非凸问题的无损凸化这个文章的解析中,有网友 @Zames...
什么是顺序凸规划Sequential Convex Programming ？这个叫序列凸规划，是将连续优化问题转化成有限纬凸规划...
Then we propose sequential convex programming (SCP) methods for solving them in which each iteration is obtained by solving a convex programming problem exactly or inexactly. Under some suitable assumptions, we establish that any accumulation point of the sequence generated by the methods is a KKT...
This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present an SCP algorithm for solving nonlinear optimization problems with DC constraints and prove its convergence. Then we...
In this paper, a receding horizon sequential convex programming (RH-SCP) method is proposed to solve the energy-efficient optimal G&C problem for spacecraft 6-DOF close proximity to a non-cooperative target. Using modified Rodrigues parameters (MRPs), the dynamics and kinematics with full states...
In [19], a homotopic iterative convex programming method was proposed to eliminate the need for initial guesses. In [20], a three-step continuation procedure was combined with the SCP framework to enhance convergence robustness by leveraging the solution of a simplified problem as an initial ...
We introduce a method for constrained nonlinear programming that is widely used in mechanical engineering and that is known under the name SCP for sequential convex programming. The algorithm consists of solving a sequence of convex and separable subproblems, where an augmented Lagrangian merit function...
sequential convex programmingThis article tackles the complex challenge of multi-vehicle motion planning by presenting the novel Sequential Convex Programming-based Distributed Model Predictive Control (SCP-DMPC) algorithm. Existing methods often struggle with the nonconvex nature of optimization in multi-...
什么是顺序凸规划Sequential Convex Programming ？这个叫序列凸规划，是将连续优化问题转化成有限纬凸规划问题的方法，用SCP可以处理带有复杂模型或者复杂任务的规划。
This paper presents an improved sequential convex programming (SCP) algorithm for ascent trajectory optimization of launch vehicles, by exploiting the state-of-the-art modified Chebyshev鈥揚icard iteration (MCPI) technique. In the proposed algorithm, the MCPI technique is first utilized to transcribe...