An algorithm for allocating artillery support in the Airland Research Model.
Geddes, John M. Jr.
Parry, Samuel H.
MetadataShow full item record
This thesis extends the development of algorithms for modeling planning processes in the AirLand Research Model (ALARM), an on-going research effort at the Naval Postgraduate School. An algorithm is developed to determine optimal mission assignments for supporting combat resources based on the determination of optimal firer-target combinations. The method of differential games is adopted as the optimizer for the algorithm. The algorithm is applied to a problem of determining artillery battalion mission assignments in supporting a U.S. brigade engaged with an enemy division. The algorithm is solved using FORTRAN 77 and the IMSL routine DGEAR.
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.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Oral, Sabri Onur (Monterey, California. Naval Postgraduate School, 1991-09);The process of finding an exact minimization for a multiple-valued logic (MVL) expression requires an extensive search and enormous computation time. One of the heuristics to reduce this computation time is the Neighborhood ...