Long-range energy-state maneuvers for minimum time to specified terminal conditions
dc.contributor.author | Parsons, Michael G. | en_US |
dc.contributor.author | Bryson, A. E. | en_US |
dc.contributor.author | Hoffman, William C. | en_US |
dc.date.accessioned | 2006-09-11T15:47:34Z | |
dc.date.available | 2006-09-11T15:47:34Z | |
dc.date.issued | 1975-12 | en_US |
dc.identifier.citation | Parsons, M. G.; Bryson, A. E.; Hoffman, W. C.; (1975). "Long-range energy-state maneuvers for minimum time to specified terminal conditions." Journal of Optimization Theory and Applications 17 (5-6): 447-463. <http://hdl.handle.net/2027.42/45204> | en_US |
dc.identifier.issn | 1573-2878 | en_US |
dc.identifier.issn | 0022-3239 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/45204 | |
dc.description.abstract | Some three-dimensional minimum-time paths to a specified final line (or point), heading, and energy are presented for an example supersonic aircraft. The optimum maneuvers have been determined using the calculus of variations and the energy-state approximation. These are compared with suboptimal solutions obtained with the additional assumption that only three discrete values of bank angle (−φ max , 0, +φ max ) are available. Constraints on thrust, Mach number, angle-of-attack, dynamic pressure, and load factor are included. For ranges long enough that maximum velocity is attained en route, the initial and final ares can be determined separately, which greatly simplifies the solutions. | en_US |
dc.format.extent | 805957 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers-Plenum Publishers; Plenum Publishing Corporation ; Springer Science+Business Media | en_US |
dc.subject.other | Theory of Computation | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Flight Mechanics | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Applications of Mathematics | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Engineering, General | en_US |
dc.subject.other | Calculus of Variations and Applications | en_US |
dc.subject.other | Suboptimal Control | en_US |
dc.subject.other | Bounded Control Problems | en_US |
dc.subject.other | Chattering Phenomena | en_US |
dc.title | Long-range energy-state maneuvers for minimum time to specified terminal conditions | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Naval Architecture and Marine Engineering, University of Michigan, Ann Arbor, Michigan | en_US |
dc.contributor.affiliationother | Aerospace Systems, Inc., Burlington, Massachusetts | en_US |
dc.contributor.affiliationother | Department of Aeronautics and Astronautics, Stanford University, Stanford, California; Aerospace Systems, Inc., Burlington, Massachusetts | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/45204/1/10957_2004_Article_BF00932783.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF00932783 | en_US |
dc.identifier.source | Journal of Optimization Theory and Applications | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.