Skip to main content

Heuristic Method of Air Defense Planning for an Area Object with the Use of Very Short Range Air Defense

  • Conference paper
  • First Online:
Intelligent Decision Technologies 2017 (IDT 2017)

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 72))

Included in the following conference series:

Abstract

This paper presents a heuristic method of planning the deployment of very short-range anti-air missile and artillery sets (VSHORAD) around the protected area object. The function dependent on the distance between the earliest feasible points of destroying targets and the center of the protected area object is taken as an objective function. This is a different indicator from those commonly used in the literature based on the likelihood of a defense zone penetration by the means of air attack (MAA), the kill probability of the MAA and the probability of area object losses. The model constraints result directly from the restrictions imposed by the real air defense system and the nature of the area objects. The presented sub-optimal heuristic method has been implemented. In the final part of the paper computational results have been presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ghode, D., Prasad, U.R., Guruprasad, K.: Missile battery placement for air defense: a dynamic programming approach. Appl. Math. Model. 17(9), 450–458 (1993). doi:10.1016/0307-904X(93)90086-V

    Article  MATH  Google Scholar 

  2. Pant, M., Deep, K.: Building a better air defence system using genetic algorithms. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds.) Knowledge-Based Intelligent Information and Engineering Systems, KES 2006. LNCS, vol. 4251, pp. 951–959. Springer, Heidelberg (2006). doi:10.1007/11892960_114

  3. Ahner, D.K., Parson, C.R.: Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming. Optim. Lett. 9(8), 1689–1701 (2015). doi:10.1007/s11590-014-0823-x

    Article  MathSciNet  MATH  Google Scholar 

  4. Pietkiewicz, T., Kawalec, A., Wajszczyk, B.: An optimization problem of air defense planning for an area object. In: Intelligent Decision Technologies 2017. Smart Innovation, Systems and Technologies. Proceedings of the 9th KES International Conference on Intelligent Decision Technologies (KES-IDT 2017). Springer

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tadeusz Pietkiewicz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Pietkiewicz, T., Kawalec, A., Wajszczyk, B. (2018). Heuristic Method of Air Defense Planning for an Area Object with the Use of Very Short Range Air Defense. In: Czarnowski, I., Howlett, R., Jain, L. (eds) Intelligent Decision Technologies 2017. IDT 2017. Smart Innovation, Systems and Technologies, vol 72. Springer, Cham. https://doi.org/10.1007/978-3-319-59421-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59421-7_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59420-0

  • Online ISBN: 978-3-319-59421-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics