Combat Identification Modeling Using Robust Optimization Techniques

The purposes of this research were: (1) the modeling of a CID situation and (2) the search for robust and controllable input variable settings. The inputs were defined as controllable and noise variables and the confusion matrices in ROC theory were adapted to act as controllable factors. In this research a simple virtual battlespace representation is employed. The experimental results of the CID system are summarized by a posterior confusion matrix and throughout the confusion matrix analysis we can obtain all various types of data such as accuracy, error cost, error rates, and so forth. To find the optimal parameters three evaluation techniques were applied: (1) Linearly constrained discrete optimization, (2) Taguchi's SN ratio method and (3) Robust parameter design with a combined array. The results are compared and contrasted across different objective functions.

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.

This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.

As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.