Dynamic weapon-target assignment problem

Download
index.pdf
2008
Günsel, Emrah
Show full item record
167
views
56
downloads
The Weapon-Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. Optimizing the WTA is about the selection of the most appropriate weapon for each target in the problem. Basically the aim is to have the maximum effect on targets. Different algorithms; branch and bound (B&B), genetic algorithm (GA), variable neighborhood search (VNS), are used to solve this problem. In this thesis, a more complex version of this problem is defined and adapted to fire support automation (Command Control Communication Computer Intelligence, C4I) systems. For each target, a weapon with appropriate ammunition, fuel, timing, status, risk is moved to an appropriate ammunitions, economy of fuel, risk analysis and time scheduling are all integrated into the solution. B&B, GA and VNS are used to solve static and dynamic WTA problem. Simulations have shown that GA and VNS are the best suited methods to solve the WTA problem.
Electrical engineering., Electronics.
http://etd.lib.metu.edu.tr/upload/12610025/index.pdf
https://hdl.handle.net/11511/17870
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Efficient solution of optimization problems with constraints and/or cost functions expensive to evaluate
Kurtdere, Ahmet Gökhan; Leblebicioğlu, Mehmet Kemal; Department of Electrical and Electronics Engineering (2009)
There are many optimization problems motivated by engineering applications, whose constraints and/or cost functions are computationally expensive to evaluate. What is more derivative information is usually not available or available at a considerable cost. For that reason, classical optimization methods, based on derivatives, are not applicable. This study presents a framework based on available methods in literature to overcome this important problem. First, a penalized model is constructed where the viola...
A comparative evaluation of conventional and particle filter based radar target tracking
Yıldırım, Berkin; Demirekler, Mübeccel; Department of Electrical and Electronics Engineering (2007)
In this thesis the radar target tracking problem in Bayesian estimation framework is studied. Traditionally, linear or linearized models, where the uncertainty in the system and measurement models is typically represented by Gaussian densities, are used in this area. Therefore, classical sub-optimal Bayesian methods based on linearized Kalman filters can be used. The sequential Monte Carlo methods, i.e. particle filters, make it possible to utilize the inherent non-linear state relations and non-Gaussian no...
Image segmentation based on variational techniques
Duramaz, Alper; Ünver, Baki Zafer; Department of Electrical and Electronics Engineering (2006)
Recently, solutions to the problem of image segmentation and denoising are developed based on the Mumford-Shah model. The model provides an energy functional, called the Mumford-Shah functional, which should be minimized. Since the minimization of the functional has some difficulties, approximate approaches are proposed. Two such methods are the gradient flows method and the Chan-Vese active contour method. The performance evolution in terms of speed shows that the gradient flows method converges to the bou...
Hierarchical parallelisation strategy for multilevel fast multipole algorithm in computational electromagnetics
Ergül, Özgür Salih (Institution of Engineering and Technology (IET), 2008-01-03)
A hierarchical parallelisation of the multilevel fast multipole algorithm (MLFMA) for the efficient solution of large-scale problems in computational electromagnetics is presented. The tree structure of MLFMA is distributed among the processors by partitioning both the clusters and the samples of the fields appropriately for each level. The parallelisation efficiency is significantly improved compared to previous approaches, where only the clusters or only the fields are partitioned in a level.
The implementation complexity of finite impulse response digital filters under different coefficient quantization schemes and realization structures
Akyürek, Sefa; Çiloğlu, Tolga; Department of Electrical and Electronics Engineering (2004)
It has been aimed to investigate the complexity of discrete-coefficient FIR filters when they are implemented in transposed form and the coefficient redundancy is removed by the n-Dimensional Reduced Adder Graph (RAG-n) approach. Filters with coefficients represented by different quantization schemes have been designed or selected from the literture; their transposed form implemetations after RAG-n process have been compared in terms of complexity. A Genetic Algorithm (GA) based design algorithm has been im...
Citation Formats
E. Günsel, “Dynamic weapon-target assignment problem,” M.S. - Master of Science, Middle East Technical University, 2008.
METU IIS - Integrated Information Service open@metu.edu.tr