z-logo
Premium
Application of an advanced trajectory optimization method to ramjet propelled missiles
Author(s) -
Paris S. W.,
Joosten B. K.,
Fink L. E.
Publication year - 1980
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.4660010403
Subject(s) - trajectory optimization , trajectory , climb , missile , ramjet , control theory (sociology) , aerospace engineering , cruise missile , optimal control , computer science , propulsion , missile guidance , air to air missile , gauss pseudospectral method , optimization problem , mathematical optimization , engineering , mathematics , physics , control (management) , algorithm , pseudo spectral method , artificial intelligence , combustor , fourier analysis , mathematical analysis , chemistry , fourier transform , combustion , organic chemistry , astronomy
The mission performance characteristics of ramjet‐propelled missiles are highly dependent upon the trajectory flown. Integration of the trajectory profile with the ramjet propulsion system performance characteristics to achieve optimal missile performance is very complex. Past trajectory optimization methods have been extremely problem dependent and require a high degree of familiarity to achieve success. A general computer code (CTOP) has been applied to ramjet‐powered missiles to compute open‐loop optimal trajectories. CTOP employs Chebyshev polynomial representations of the states and controls. This allows a transformation of the continuous optimal control problem to one of parameter optimization. With this method, the trajectory boundary conditions are always satisfied. State dynamics and path constraints are enforced via penalty functions. The presented results include solutions to minimum fuel‐to‐climb, minimumtime‐to‐climb, and minimum time‐to‐target intercept problems.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here