期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到8篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Entry trajectory optimization for cross-domain morphing vehicles using oscillation-avoidance-based multistage trust-region sequential convex programming 认领 引用
1
作者 Zheng LI Zheng FANG +1 位作者 Zhenyue JIA Jianqiao YU 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2026年第4期310-333,共24页
This paper develops an Oscillation-avoidance-based Multistage Trust-region Sequential Convex Programming(OMTSCP)method for the highly nonlinear entry trajectory optimization problem of Cross-Domain Morphing Vehicles(C... This paper develops an Oscillation-avoidance-based Multistage Trust-region Sequential Convex Programming(OMTSCP)method for the highly nonlinear entry trajectory optimization problem of Cross-Domain Morphing Vehicles(CDMVs).The decoupling of states and controls for complex nonlinear dynamics is achieved by defining new control and state variables.A series of sub convex problems is formulated by successive linearization and discretization of the constraints.The proposed Trust-region Sequential Convex Programming(TSCP)scheme consists of three stages:an initial guess generation stage,a basic solution stage,and an optimal solution stage.An approach to penalize the dynamic relaxation is firstly developed to obtain an initial guess with considerable accuracy and significantly improve the robustness of the algorithm by overcoming the drawbacks of potential artificial infeasibility.The oscillation phenomenon of the TSCP method under rectangular trust region is then investigated,and a novel N-shape-based oscillation identification method is proposed to identify the oscillation accurately.Finally,an oscillation-avoidance method based on the sort trust-region is proposed to improve the convergence of the TSCP algorithm.Numerical comparisons of the proposed method and a typical TSCP method,as well as the morphing and fixed-morphing vehicles are provided to demonstrate the effectiveness and efficiency of the proposed method and the performance advantages of the morphing vehicle.The robustness of the method is further verified by Monte Carlo simulation. 展开更多
关键词 Convex optimization Cross-domain vehicle Entry trajectory optimization Morphing vehicle Multistage Oscillation phenomenon Trust-region sequential convex programming
暂未订购 下载PDF
Safe flight corridor constrained sequential convex programming for efficient trajectory generation of fixed-wing UAVs 认领 引用 被引量：7
2
作者 Jing SUN Guangtong XU +2 位作者 Zhu WANG Teng LONG Jingliang SUN 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2025年第1期537-550,共14页
Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequent... Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A*Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time. 展开更多
关键词 Fixed-wing unmanned aerial vehicle Efficient trajectory planning Safe flight corridor Sequential convex programming Customized convex optimizer
暂未订购 下载PDF
Real-time autonomous guidance generation around small bodies via Sequential Convex Programming 认领 引用
3
作者 Enrico Belloni Michèle Lavagna 《Astrodynamics》 EI CSCD 2026年第2期319-337,共19页
This paper introduces a novel approach to real-time convex guidance generation for spacecraft navigating in proximity to small celestial bodies,such as asteroids or small moons.The proposed method leverages Sequential... This paper introduces a novel approach to real-time convex guidance generation for spacecraft navigating in proximity to small celestial bodies,such as asteroids or small moons.The proposed method leverages Sequential Convex Programming(SCP)techniques to model and navigate irregular gravity fields encountered near these bodies,addressing the strong nonlinearities by iteratively refining a convex guidance sub-problem.The key contribution is the development of an adaptive algorithm that autonomously determines the optimal time of flight and dynamically adjusts to the gravitational environment,enabling spacecraft to autonomously generate robust guidance trajectories in real time including a non-convex collision avoidance constraint.The algorithm is developed in library-free C code to be ready for real-time embedded implementation and gain a realistic understanding on possible onboard application.The efficacy of the proposed method is validated for both asteroids and small moons through numerical simulations including sliding-mode close-loop control,showcasing high accuracy,computational efficiency,and flexibility to different environments. 展开更多
关键词 sequential convex programming(SCP) real-time trajectory optimization asteroid exploration model predictive control(MPC)
Fast trajectory replanning for cooperative vehicles using sequential convex programming 认领 引用 被引量：1
4
作者 Peng Zhang Lin Cheng Shengping Gong 《Astrodynamics》 EI CSCD 2025年第3期369-388,共20页
With the rapid changes of the flight environment and situation,there will be various unexpected situations while multiple missiles are performing the missions.To fast cope with the various situations in mission execut... With the rapid changes of the flight environment and situation,there will be various unexpected situations while multiple missiles are performing the missions.To fast cope with the various situations in mission executions,the conventional sequential convex programming algorithm and the parallel-based sequential convex programming algorithm for multiple missiles fast trajectory replanning are proposed in this paper.The originally non-convex trajectory optimization problem is reformulated into a series of convex optimization subproblems based on the sequential convex programming method.The conventional sequential convex programming algorithm is developed through linearization,successive convexification,and relaxation techniques to solve the convex optimization subproblems iteratively.However,multiple missiles are related through various cooperative constraints.When the trajectory optimization of multiple missiles is formulated as an optimal control problem to solve,the complexity of the problem will increase dramatically as the number of missiles increases.To alleviate the coupled effect caused by multiple aerodynamically controlled missiles,the parallel-based sequential convex programming algorithm is proposed to solve the trajectory optimization problem for multiple missiles in parallel,reducing the complexity of the trajectory optimization problem and significantly shortening the computation time.Numerical simulations are provided to verify the convergence and effectiveness of the conventional sequential convex programming algorithm and the parallel-based sequential convex programming algorithm to cope with the trajectory optimization problem with various constraints.Furthermore,the optimality and the real-time performance of the proposed algorithms are discussed in comparative simulation examples. 展开更多
关键词 cooperative missiles midcourse trajectory replanning max terminal velocity sequential convex programming(SCP)
SEQUENTIAL CONVEX PROGRAMMING METHODS FOR SOLVING LARGE TOPOLOGY OPTIMIZATION PROBLEMS: IMPLEMENTATION AND COMPUTATIONAL RESULTS 认领 引用
5
作者 Qin Ni Ch.Zillober K.Schittkowski 《Journal of Computational Mathematics》 SCIE EI 2005年第5期491-502,共12页
In this paper, we describe a method to solve large-scale structural optimization problems by sequential convex programming （SCP）. A predictor-corrector interior point method is applied to solve the strictly convex s... In this paper, we describe a method to solve large-scale structural optimization problems by sequential convex programming （SCP）. A predictor-corrector interior point method is applied to solve the strictly convex subproblems. The SCP algorithm and the topology optimization approach are introduced. Especially, different strategies to solve certain linear systems of equations are analyzed. Numerical results are presented to show the efficiency of the proposed method for solving topology optimization problems and to compare different variants. 展开更多
关键词 Large scale optimization Topology optimization Sequential convex programming method Predictor-corrector interior point method Method of moving asymptotes
暂未订购 下载PDF
Preventive-corrective Control for Static Voltage Stability Under Multiple N-1 Contingencies Considering Wind Power Uncertainty 认领 引用
6
作者 Yuerong Yang Shunjiang Lin +2 位作者 Qiong Wang Mingbo Liu Qifeng Li 《CSEE Journal of Power and Energy Systems》 SCIE EI CSCD 2025年第4期1466-1480,共15页
An optimal preventive-corrective control model for static voltage stability under multiple N-1 contingencies considering the wind power uncertainty is established in this paper.The objective is to minimize the control... An optimal preventive-corrective control model for static voltage stability under multiple N-1 contingencies considering the wind power uncertainty is established in this paper.The objective is to minimize the control variable adjustment cost including the load shedding cost of each contingency.The chance constraints of the static voltage stability margins(SvSMs)in the normal operation state and after each N-1 contingency are included.The approximate functions between the probability density functions(PDFs)of SVSMs and load shedding quantity with respect to preventive control variables are obtained to transform the expectation of load shedding quantity and the SvSM chance constraints into deterministic expressions.An approximate sequential convex quadratically constrained quadratic programming iteration method is proposed to solve the optimal control model.In each iteration,the approximate expressions and range are determined by the generated data samples.Moreover,a fast approximation calculation method of second-order matrices is proposed.By the naive Bayes classifier,the most severe N-1 contingencies are selected to replace all the contingencies to be added to the optimization model to improve the computational efficiency.Case studies on the IEEE-39 bus system and an actual provincial power grid demonstrate the effectiveness and efficiency of the proposed method. 展开更多
关键词 Multiple N-1 contingencies preventivecorrective control probabilistic distribution control sequential convex quadratically constrained quadratic programming static voltage stability margin wind power uncertainty
暂未订购 下载PDF
An efficient method for collision-free and jerk-constrained trajectory generation with sparse desired way-points for a flying robot 认领 引用 被引量：4
7
作者 CHEN YongXue DONG Wei DING Ye 《Science China(Technological Sciences)》 SCIE EI CAS CSCD 2021年第8期1719-1731,共13页
In this paper,an efficient approach is developed to plan jerk-constrained smooth trajectories passing through desired way-points with allowable accuracy for an autonomous quadrotor.First,based on the B-spline model,we... In this paper,an efficient approach is developed to plan jerk-constrained smooth trajectories passing through desired way-points with allowable accuracy for an autonomous quadrotor.First,based on the B-spline model,we introduce the sequential convex programming(SCP)into the flexible path planning method to satisfy the way-points constraints.By approximating the quadrotor and obstacles as spheres and directed planes,the length-optimal and collision-free path planning problem is formulated as a nonconvex optimization problem and solved by SCP.The initial C3 continuous path curve for optimization is constructed efficiently based on a proposed strategy of generating new way-points near the obstacles without the need to calculate the embedding distance between the curve and the obstacles.On this basis,the time-optimal speed planning problem is addressed in two steps.In the first step,the forward-backward approach is introduced to solve the problem under the chord error,velocity,and acceleration constraints by changing the variables and deforming the constraints.Then by relaxing the constraints appropriately,the problem under jerk constraints is formulated into a linear programming(LP)problem.The feasibility of the proposed approach is verified through simulations and an indoor navigation experiment.The proposed approach can generate a C3 continuous collision-free trajectory that passes through the sparse desired way-points with allowable accuracy while guaranteeing the chord error,velocity,acceleration,and jerk constraints.When the number of sample points is 3000,the proposed speed planning method reduces the calculation time by 40%compared to an existing method. 展开更多
关键词 collision avoidance speed optimization motion planning sequential convex programming quadrotor
暂未订购 下载PDF
Efficient optimization method for variable-specific-impulse low-thrust trajectories with shutdown constraint 认领 引用 被引量：2
8
作者 JIA FeiDa QIAO Dong +1 位作者 HAN HongWei LI XiangYu 《Science China(Technological Sciences)》 SCIE EI CAS CSCD 2022年第3期581-594,共14页
This paper develops a sequential convex programming(SCP)-based method to solve the minimum-fuel variable-specific-impulse low-thrust transfer problem considering shutdown constraint,with emphasize on improving the com... This paper develops a sequential convex programming(SCP)-based method to solve the minimum-fuel variable-specific-impulse low-thrust transfer problem considering shutdown constraint,with emphasize on improving the computational efficiency.The variable parameter engine is more applicable for many low-thrust scenarios,therefore,both a continuously variable model and a ladder variable model are adopted.First,the original problem is convexified by processing the constraint feasible domain,which is composed of the nonlinear dynamic equations and second-order equality constraint,into convex sets.Then,the approximation is generated to close the optimal solution of the low-thrust problem by iteratively solving the convexified subproblem.Moreover,the switching self-detection and adaptive node refinement methods are presented,which can improve the accuracy of the solution and accelerate the convergence during the approximation process and is especially necessary and effective in the scenarios with shutdown constraint.In numerical simulations,the comparison with the homotopic approach shows that the proposed method only needs 4%computational time as that of the homotopic approach,and two variable-specificimpulse examples further demonstrate the effectiveness and efficiency of the proposed method. 展开更多
关键词 low-thrust trajectory variable-specific-impulse shutdown constraint sequential convex programming switching self-detection and adaptive node refinement
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈