Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Air Force Institute of Technology

2008

Aerospace Engineering

Trajectory optimization

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Optimal Re-Entry Trajectory Terminal State Due To Variations In Waypoint Locations., William J. Karasz Dec 2008

Optimal Re-Entry Trajectory Terminal State Due To Variations In Waypoint Locations., William J. Karasz

Theses and Dissertations

The Air Force's Prompt Global Reach concept describes the desire to have a capability to reach any target within a 9000 nautical mile radius within two hours of launch. To meet this objective, much effort is being devoted to hypersonics and re-entry vehicles. Given the limited maneuverability of hypersonic vehicles, computational modeling is used to generate trajectories before launch to strike intended targets. In addition to endpoint (target) constraints, additional waypoints may constrain the trajectory. This research finds the optimal trajectory which satisfies the endpoint and waypoint constraints, and then investigates where else the vehicle can go while still meeting …


Real-Time Navigation And Flight Path Generation For Tracking Stop-And-Go Targets With Miniature Air Vehicles, Nate A. Terning Mar 2008

Real-Time Navigation And Flight Path Generation For Tracking Stop-And-Go Targets With Miniature Air Vehicles, Nate A. Terning

Theses and Dissertations

This research effort focuses on using a heuristic approach to determine the optimal flight path required to put an Unmanned Aircraft System’s (UAS) sensor on a moving target in the presence of a constant wind field. This thesis builds on past work using dynamic optimization techniques to calculate minimum time to target. The computationally intensive dynamic optimization routines in their current form take a prohibitive amount of time to calculate and ultimately result in erroneous flight path predictions due to inherent execution time latencies. Therefore an iterative, suboptimal heuristic approach was explored to mitigate excessive calculation times and ultimately yield …