A two-directional target optimization model.
Hamelin, Gregory R.
Howard, Gilbert T.
Hartman, James K.
MetadataShow full item record
This paper presents an algorithm for computing the optimal target path for two aircraft traversing a target area from different directions. There are constraints on the maneuverability of each aircraft which prohibit it from attacking every target. The algorithm chooses a subset of targets whose destruction will yield maximum value to the attacking force. The basis of the algorithm is the branch and bound method, with upper bounds computed by dynamic programming. Several variations are considered, such as payload limit, an increased number of aircraft from each direction, and a three-directional attack. An example problem is solved using the basic model. A Fortran IV computer program is included. Computation time versus problem characteristics is discussed.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Romano, M.; Agrawal, B. (2004);The dynamics equations of a spacecraft consisting of two bodies mutually rotating around a common gimbal axis are derived by the use of the Newton–Euler approach. One of the bodies contains a cluster of single-gimbal var ...
Sands, Timothy A. (Monterey California. Naval Postgraduate School, 2007-03);In 1923, Herman Oberth, considered by some to be “the father of it all” for spaceflight, wrote a book called “Die Rakete zu den Planetenräumen” (i.e., “Dreams of Planets”) inspiring today's modern spaceflight. Amongst his ...
Frantz, Natalie R. (Monterey California. Naval Postgraduate School, 2005-06);Unmanned Aerial Vehicles (UAVs) are becoming vital warfare platforms because they significantly reduce the risk of human life while accomplishing important missions. A UAV can be used for example, as stand-in sensor for ...