2021
DOI: 10.1007/s00521-021-06250-w
|View full text |Cite
|
Sign up to set email alerts
|

Evasion guidance for air-breathing hypersonic vehicles against unknown pursuer dynamics

Abstract: The rapid development of hypersonic vehicles has motivated the related research dramatically while the evasion of the hypersonic vehicles becomes one of the challenging issues. Different from the work based on the premise that the pursuers’ information is fully known, in this paper the evasion guidance for air-breathing hypersonic vehicles (AHVs) against unknown pursuer dynamics is studied. The gradient descent is employed for parameter estimation of the unknown dynamics of the pursuer. The energy-optimized ev… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 40 publications
0
3
0
Order By: Relevance
“…According to References 44 and 45, the interval of r()tf$$ r\left({t}_f\right) $$ for achieving hit‐to‐kill accuracy is chosen as [0,1.5]$$ \left[0,1.5\right] $$ m. in the interception cases of this paper.…”
Section: Simulationmentioning
confidence: 99%
“…According to References 44 and 45, the interval of r()tf$$ r\left({t}_f\right) $$ for achieving hit‐to‐kill accuracy is chosen as [0,1.5]$$ \left[0,1.5\right] $$ m. in the interception cases of this paper.…”
Section: Simulationmentioning
confidence: 99%
“…Some existing work circumvents this problem using relatively simple propulsion system models. 14,15 In this work, we build a hybrid algorithm for ABHV with complex propulsion-pneumatic coupling based on convex optimization, 8 which has shown great application potential in recent years because of its serval superior features: 16 Every local minimum is a global minimum; if the objective function is strictly convex, then the problem has at most one optimal point. Some kinds of convex problems, like the second-order cone programing (SOCP), can be solved efficiently by primal-dual interior-point methods (IPMs) that only have polynomial complexity.…”
Section: Introductionmentioning
confidence: 99%
“…Tan et al [15] propose a novel algorithm based on minimizing the area of a boundary enclosing partial scan data points for detecting both the pose and assembly of tubular joints with the aid of reference ideal models. Yan et al [16] study the evasion guidance for airbreathing hypersonic vehicles (AHVs) against unknown pursuer dynamics, where the gradient descent is employed for parameter estimation of the unknown dynamics of the pursuer. Fang et al [17] present a method for minimizing the power consumption of a data-center cooling system by optimizing the airflow pattern and the supplied cold air temperature simultaneously.…”
mentioning
confidence: 99%