• No results found

Evaluating the Performance of TEWA Systems

N/A
N/A
Protected

Academic year: 2021

Share "Evaluating the Performance of TEWA Systems"

Copied!
2
0
0

Loading.... (view fulltext now)

Full text

(1)

Evaluating the Performance of TEWA Systems

av

Fredrik Johansson

Akademisk avhandling

Avhandling för teknologie doktorsexamen i datavetenskap, som enligt beslut av rektor kommer att försvaras offentligt

onsdagen den 1 december 2010 kl. 13.15, Insikten, Högskolan i Skövde Opponent: Professor Martin Holmberg

Militärvetenskapliga institutionen Försvarshögskolan

Örebro universitet Akademin för naturvetenskap och teknik

(2)

Abstract

It is in military engagements the task of the air defense to protect valuable assets such as air bases from being destroyed by hostile aircrafts and missiles. In order to fulfill this mission, the defenders are equipped with sensors and firing units. To infer whether a target is hostile and threatening or not is far from a trivial task. This is dealt with in a threat evaluation process, in which the targets are ranked based upon their estimated level of threat posed to the defended assets. Once the degree of threat has been estimated, the problem of weapon allocation comes into the picture. Given that a number of threatening targets have been identified, the defenders need to decide on whether any firing units shall be al-located to the targets, and if so, which firing unit to engage which target. To complicate matters, the outcomes of such engagements are usually stochastic. Moreover, there are often tight time constraints on how fast the threat evalu-ation and weapon allocevalu-ation processes need to be executed. There are already today a large number of threat evaluation and weapon allocation (TEWA) sys-tems in use, i.e. decision support syssys-tems aiding military decision makers with the threat evaluation and weapon allocation processes. However, despite the critical role of such systems, it is not clear how to evaluate the performance of the systems and their algorithms. Hence, the work in thesis is focused on the development and evaluation of TEWA systems, and the algorithms for threat evaluation and weapon allocation being part of such systems. A number of al-gorithms for threat evaluation and static weapon allocation are suggested and implemented, and testbeds for facilitating the evaluation of these are developed. Experimental results show that the use of particle swarm optimization is suit-able for real-time target-based weapon allocation in situations involving up to approximately ten targets and ten firing units, while it for larger problem sizes gives better results to make use of an enhanced greedy maximum marginal re-turn algorithm, or a genetic algorithm seeded with the solution rere-turned by the greedy algorithm.

Keywords: air defense, information fusion, performance evaluation, threat

References

Related documents

Figure 4.11: Comparison CDFs for deriving best value, change number of particle(s) reset position For RPSO, as it is shown in Figure 4.11 we selected different number of particle

If we take a look at our first research question, “How scalable are fluid-particle systems of today?”, we are able to conclude that when using a grid-based

The main objective of this thesis is to develop an algorithm based on particle swarm optimization and apply it to the wireless sensor network to optimize

Throughout this thesis, CCN peek and peek is used interchangably in order to describe the round trip time from initiating a request to the time when that data has been

We leave the calibrated deep parameters unchanged and ask how well our model accounts for the allocation of time in France if we feed in the French initial and terminal capital

Figure 1: A sliding wall plowing through the accumulated snow (consisting of 75.6K particles) on the ground simulated using our method, supporting both physics and visualization

As shown from the results for the case of the single expansion chamber with extended inlet/outlets, optimization of maximum transmission loss, maximum insertion

In Table 14 we have showed an overall difference between Netstrings and other implemented approaches when it comes to time required for serializing and deserializing the