Steepest-Ascent Revisited: Unconstrained Missile Trajectory
A Steepest-Ascent numerical procedure for offline trajectory optimization of a surface-to-surface missile attacking a stationary target is presented. A detailed numerical solution, starting from building the mathematical formulation till generating an offline angle of attack control history, is illu...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | International Journal of Aerospace Engineering |
| Online Access: | http://dx.doi.org/10.1155/2014/249263 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558354627559424 |
|---|---|
| author | Elsayed M. Khalil Hao Zhou Wanchun Chen |
| author_facet | Elsayed M. Khalil Hao Zhou Wanchun Chen |
| author_sort | Elsayed M. Khalil |
| collection | DOAJ |
| description | A Steepest-Ascent numerical procedure for offline trajectory optimization of a surface-to-surface missile attacking a stationary target is presented. A detailed numerical solution, starting from building the mathematical formulation till generating an offline angle of attack control history, is illustrated. A novel approach for guessing a nominal control program is conducted. The formulation entails nonlinear 2-DOF missile flight dynamics with mixed boundary conditions. The technique of changing of variables is adopted to convert the free-final-time optimization problem to a fixed-final-time one. The influences of the optimization algorithm controlling parameters are investigated. A new form of the weighting matrix is proposed. A novel technique of relaxation factors for eliminating the terminal states violation is described. Finally, a comparison between the obtained control history and the one obtained by a nonlinear optimal control package “GPOPS” is presented. The results indicate that the use of Steepest-Ascent method, to a great extent, is comparable in accuracy and iteration time to the pseudospectral optimization package “GPOPS.” This paper, to a great extent, is a detailed procedure for the method of Steepest-Ascent analyzed and verified by the authors from many undetailed sources to disclosure of the main problems faced by user of Steepest-Ascent. |
| format | Article |
| id | doaj-art-f5fae7e9ea88403db85a7473be6a313e |
| institution | Kabale University |
| issn | 1687-5966 1687-5974 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Aerospace Engineering |
| spelling | doaj-art-f5fae7e9ea88403db85a7473be6a313e2025-02-03T01:32:41ZengWileyInternational Journal of Aerospace Engineering1687-59661687-59742014-01-01201410.1155/2014/249263249263Steepest-Ascent Revisited: Unconstrained Missile TrajectoryElsayed M. Khalil0Hao Zhou1Wanchun Chen2School of Astronautics, Beihang University (BUAA), Beijing 100083, ChinaSchool of Astronautics, Beihang University (BUAA), Beijing 100083, ChinaSchool of Astronautics, Beihang University (BUAA), Beijing 100083, ChinaA Steepest-Ascent numerical procedure for offline trajectory optimization of a surface-to-surface missile attacking a stationary target is presented. A detailed numerical solution, starting from building the mathematical formulation till generating an offline angle of attack control history, is illustrated. A novel approach for guessing a nominal control program is conducted. The formulation entails nonlinear 2-DOF missile flight dynamics with mixed boundary conditions. The technique of changing of variables is adopted to convert the free-final-time optimization problem to a fixed-final-time one. The influences of the optimization algorithm controlling parameters are investigated. A new form of the weighting matrix is proposed. A novel technique of relaxation factors for eliminating the terminal states violation is described. Finally, a comparison between the obtained control history and the one obtained by a nonlinear optimal control package “GPOPS” is presented. The results indicate that the use of Steepest-Ascent method, to a great extent, is comparable in accuracy and iteration time to the pseudospectral optimization package “GPOPS.” This paper, to a great extent, is a detailed procedure for the method of Steepest-Ascent analyzed and verified by the authors from many undetailed sources to disclosure of the main problems faced by user of Steepest-Ascent.http://dx.doi.org/10.1155/2014/249263 |
| spellingShingle | Elsayed M. Khalil Hao Zhou Wanchun Chen Steepest-Ascent Revisited: Unconstrained Missile Trajectory International Journal of Aerospace Engineering |
| title | Steepest-Ascent Revisited: Unconstrained Missile Trajectory |
| title_full | Steepest-Ascent Revisited: Unconstrained Missile Trajectory |
| title_fullStr | Steepest-Ascent Revisited: Unconstrained Missile Trajectory |
| title_full_unstemmed | Steepest-Ascent Revisited: Unconstrained Missile Trajectory |
| title_short | Steepest-Ascent Revisited: Unconstrained Missile Trajectory |
| title_sort | steepest ascent revisited unconstrained missile trajectory |
| url | http://dx.doi.org/10.1155/2014/249263 |
| work_keys_str_mv | AT elsayedmkhalil steepestascentrevisitedunconstrainedmissiletrajectory AT haozhou steepestascentrevisitedunconstrainedmissiletrajectory AT wanchunchen steepestascentrevisitedunconstrainedmissiletrajectory |