Benchmark problem for model abstraction techniques

Gary A. Plotz; Thomas A. Karle

doi:10.1117/12.351167

Translator Disclaimer

22 June 1999 Benchmark problem for model abstraction techniques

Gary A. Plotz, Thomas A. Karle

Author Affiliations +

Proceedings Volume 3696, Enabling Technology for Simulation Science III; (1999) https://doi.org/10.1117/12.351167
Event: AeroSense '99, 1999, Orlando, FL, United States

Abstract

Modeling of real systems relies on the arduous task of describing the physical phenomena in terms of mathematical models, which often require excessive amounts of computation time in their execution. In the last few years there has been a growing acceptance of model abstraction whose emphasis rests on the development of more manageable models. Abstraction refers to the intelligent capture of the essence of the behavior of a model, without all the details. In the past, metamodels have been generated from complex models, such as the Tactical Electronic Reconnaissance Simulation Model (TERSM). The scope of this paper is to explore the ability of previously developed TERSM metamodels to accurately simulate the benchmark model using both limited subsets of the original data, and data subsets whose values are interpolated or extrapolated from the original data set used to generate and fit the model. This paper establishes a baseline from which additional metamodels can be compared and analyzed.

Citation Download Citation

Gary A. Plotz and Thomas A. Karle "Benchmark problem for model abstraction techniques", Proc. SPIE 3696, Enabling Technology for Simulation Science III, (22 June 1999); https://doi.org/10.1117/12.351167

ACCESS THE FULL ARTICLE