@inproceedings{669dbe00a77542be9b6774f95a74c7d1,
title = "Convex Method for Ascent Trajectory Optimization Using Iterative Narrowing Trust Region",
abstract = "To solve the non-convex ascent trajectory optimization problem with non-convex dynamic equations and constraints, a convex optimization method is proposed in this paper. The ascent trajectory optimization problem is formulated by giving the ascent dynamic equations and analyzing constraint conditions, which is discretized into a nonlinear programming problem by trapezoidal integration. Then convex methods are researched on discrete constraints and dynamic equations, and an iterative algorithm is proposed based on narrowing trust region constraint. Simulation result proves that the method is faster and more accurate than the pseudo spectral method, and its low requirement of initial value and suitability for the change of terminal state in large range highly improve the efficiency of the ascent optimization.",
keywords = "ascent optimization, convex method, iteration algorithm, trust region",
author = "Sun Zhengxiang and Chao Tao and Wang Songyan and Yang Ming",
note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE CSAA Guidance, Navigation and Control Conference, CGNCC 2018 ; Conference date: 10-08-2018 Through 12-08-2018",
year = "2018",
month = aug,
doi = "10.1109/GNCC42960.2018.9019086",
language = "英语",
series = "2018 IEEE CSAA Guidance, Navigation and Control Conference, CGNCC 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE CSAA Guidance, Navigation and Control Conference, CGNCC 2018",
address = "美国",
}