 Ellipsoid Targeting with OverlapNicholas J. Daras ()
A chapter in Operations Research, Engineering, and Cyber Security, 2017, pp 135-154 from Springer Abstract: Abstract First, we investigate the possibility of destruction of a passive point target. Subsequently, we study the problem of determination of best targeting points in an area within which stationary or mobile targets are distributed uniformly or normally. Partial results are given in the case in which the number of targeting points is less than seven or four, respectively. Thereafter, we study the case where there is no information on the enemy distribution. Then, the targeting should be organized in such a way that the surface defined by the kill radii of the missiles fully covers each point within a desired region of space-time. The problem is equivalent to the problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container in ℝ 4 $$\mathbb{R}^{4}$$ so as to minimize a measure of overlap between ellipsoids is considered. Keywords: Function of damage; Distribution of targets; Ellipsoid targeting with overlap; Sphere packing; Ellipsoid packing; Overlap measure; 65K10; 90C22; 65C50 (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-51500-7_7 Ordering information: This item can be ordered from DOI: 10.1007/978-3-319-51500-7_7 Access Statistics for this chapter More chapters in Springer Optimization and Its Applications from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.