2019
DOI: 10.1109/access.2019.2947297
|View full text |Cite
|
Sign up to set email alerts
|

Ascent Trajectory Optimization for Hypersonic Vehicle Based on Improved Chicken Swarm Optimization

Abstract: Trajectory optimization problem for hypersonic vehicles has received wide attention as its high speed and large flight range. The strong nonlinear characteristic of the ascent phase aerodynamics makes the trajectory optimization problem difficult to be solved by the optimal control theory. In this paper, an improved chicken swarm optimization (ICSO) algorithm is proposed to optimize the hypersonic vehicle ascent trajectory. To overcome the obstacle of premature convergence, three improvement strategies are put… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
10
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 20 publications
(17 citation statements)
references
References 37 publications
(49 reference statements)
0
10
0
Order By: Relevance
“…Only it is necessary to continuously adjust the algorithm parameters according to the optimization results to obtain the purpose needed. Another advantage of treating the problem as a black box is flexibility, which means that stochastic algorithms can be conveniently applied to solve various engineering difficulties in different fields [3], [4].…”
Section: Introductionmentioning
confidence: 99%
“…Only it is necessary to continuously adjust the algorithm parameters according to the optimization results to obtain the purpose needed. Another advantage of treating the problem as a black box is flexibility, which means that stochastic algorithms can be conveniently applied to solve various engineering difficulties in different fields [3], [4].…”
Section: Introductionmentioning
confidence: 99%
“…Torabi and Safi-Esfahani [13] combined CSO with an improved raven roosting optimization (RRO) algorithm in order to balance the global and local searching capabilities. Fu et al [14] modified the update equation of roosters and introduced a mutation operator to solve the problem of easily falling into a trap of local optimal solutions. Furthermore, the CSO algorithm has also been extended to solve the constraint optimization problem [15] (see Section 6.1), 0-1 knapsack problem [16], and multiobjective optimization problem [17].…”
Section: Introductionmentioning
confidence: 99%
“…Trajectory optimization of the launch vehicle is in general considered a typical nonlinear optimal control problem [1]. Initially, analytical methods are developed to solve ascent trajectory optimization problems based on the optimal control theory [2][3][4], which usually appears in the indirect methods [5][6][7]. In this kind of method, the optimization problem is first converted by formulating a Hamilton function and then solved by solving a two-point boundary value problem using the maximum principle [8].…”
Section: Introductionmentioning
confidence: 99%