Nowadays, based on the Cruise missiles' potency in identifying and destroying specific and important targets, hindering even one missile operation could have a great effect on the combat result. In this research, by a meticulous and appropriate analysis of the missile's movement, path detection, navigation, flight altitude, and other technical information of the missile, the missile's most probable path between the launcher and target would be obtained. For doing this, first, the navigation and locating systems of Cruise missile are analyzed. Then, the path detection algorithms of missile and the used algorithms in terrain aided navigation are taken into account. And based on the produced DEM maps of the desired area, a cost map method is proposed. Finally, upon the path detecting and the shortest path algorithms, the missile's most probable path between two points is extracted and simulated. The results have shown that by having a very specific data, it is possible to predict the probable direction of Cruise missile between two hypothetical points. As a result, this can help us to have a powerful defense system and missile defense shield. So it would be possible to discover, identify, detect, and explode the enemy's invading Cruise missiles in the obtained paths
رضوانی حسین، مهر ماه 1389.تعیین مسیرهای احتمالی حرکت موشک کروز بین دو نقطه فرضی بر اساس الگوریتم های مسیر یابی و شبیه سازی آن، پایان نامه کارشناسی ارشد نرم افزار، دانشگاه صنعتی مالک اشتر،
رحمتی محمد، باوفای حقیقی الهام، "مسیر یابی با استفاده از عاملهای هوشمند در نقشه رقومی جهت سیستم های اطلاع رسانی"دانشگاه صنعتی امیر کبیر.
زردشتی، ر، باقریان، م ,1388، یک مدل جدید برای مسئله طراحی مسیر پرواز بهینه TF/TA ، مجله فضانوردی
طرح فراسازمانی فاوا ن .م (کمیته الکترونیک) شهریور 88، ضروریات، مطالبات عملیاتی و مطالعات امکانپذیری ساخت رادار کشف ، شناسائی وردگیری موشک کروزدر صنایع دفاعی،
Hyeon Cheol Gong, “Development Of Terrain Contour Matching Algorithm For The Aided Inertial Navigation Using Radial Basis Functions”, Koreasat Group, Space Division Korea Aerospace Research Institute
Dmitry B. Goldgof, Thomas S. Huang, Hua Lee , “Feature Extraction And Terrain Matching” , IEEE Transactions CH2605-4/88/0000/0899$01.00 , 1998 , Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign Urbana, IL 61801.
LARRY D. HOSTETLER, RONALD D ANDREAS, “Nonlinear Kalman Filtering Techniques for Terrain-Aided Navigation”, 001 8-9286/83/0300-03 15$01 .OO 01983 IEEE
Niclas Bergman, Lennart Ljung, Fredrik Gustafsson, “Point-mass filter and Cramer-Rao bound for Terrain- Aided Navigation”, 0-7803-3970-8/97 $10.00 0 1997 IEEE
Fredrik Gustafsson, Fredrik Gunnarsson, Nicolas Bergman, Urban Forssell, Jonas Jansson, Rickard Karlsson, and Per-Johan Nordlund , “Particle Filters for Positioning, Navigation, and Tracking ”, IEEE Transactions On Signal Processing , VOL. 50, NO. 2, February 2002.
Newton Johnson, Wang Tang, PH.D. , Gene Howell, “Terrain Aided Navigation Using Maximum Aposteriori Estimation”, 1990 IEEE
N. Bergman, L. Ljung, and F. Gustafsson, “Terrain navigation using Bayesian statistics,” IEEE Contr. System Management., vol. 19, no. 3, pp. 33–40, 1999.
Kjetil Bergh Ånonsen, Oddvar Hallingstad, “Terrain Aided AUV Navigation .A Comparison of the Point Mass Filter and Terrain Contour Matching Algorithms”, University Graduate Center (UniK)
Niclas Bergman, “Recursive Bayesian Estimation Navigation and Tracking Applications”, Link¨oping Studies in Science and Technology. Dissertations No. 579, Department of Electrical Engineering Link¨oping University, PH.D Thesis
YINGRONG XIE, “Terrain aided navigation”, Master of Science Thesis Stockholm, Sweden 2005-05-05 ,
Liu, Y.H. and S. Arimoto. (1994). “Computation of the Tangent Graph of Polygonal Obstacles by Moving-Line Processing.” IEEE Transactions on Robotics and Automation 10(6), 823–830.
O’Rourke, J. (1994). Computational Geometry in C. Cambridge: Cambridge University Press.
Welzl, E. (1985). “Constructing the Visibility Graph for n Line Segments in O(n2) Time.” IPL 20, 167–171.
Ghosh, S. and D. Mount. (1987). “An Output Sensitive Algorithm for Computing Visibility Graphs.” In Proc. Of the 28th Ann. Symp. on Foundations of Computer Science. Los Angeles, California: 12–14 October 1987, IEEE, pp. 11–19.
Helgason, R., J. Kennington, and B. Stewart. (1993). “The One-to-One Shortest-Path Problem: An Empirical Analysis with the Two-Tree Dijkstra Algorithm,” Computational Optimization and Applications 1,47–75.
Dijkstra, E. (1959). “A Note on Two Problems in Connection with Graphs.” Numerische Mathematik 1, 269–271.
Boroujerdi, A., C. Dong, Q. Ma, and B. Moret. (1993). “Joint Routing in Networks,” Undated Technical Report, Department of Computer Science, University of New Mexico, Albuquerque, NM.
Helgason, R., J. Kennington, and K. Lewis. (1996).“Finding Safe Paths in Networks,” Technical Report 96-CSE-7, Department of Computer Science and Engineering, SMU, Dallas, TX 75275–0122.
Solka, J., J. Perry, B. Poellinger, and G. Rogers. (1995a). “Fast Computation of Optimal Paths Using a Parallel Dijkstra Algorithm with Embedded Constraints.” Neurocomputing 8, 195–212.
Solka, J., J. Perry, B. Poellinger, and G. Rogers. (1995b). “Autorouting Using a Parallel Dijkstra Algorithm with Embedded Constraints,” Technical Report, The Naval Surface Warfare Center, Dahlgren, VA.
Zuniga, M. and P. Gorman. (1995). “Threat Site Overflight Modeling for Strike Route Optimization,” Undated Technical Report, Naval Research Laboratory, Washington, D.C.
Zuniga, M., J. Uhlmann, and J. Hofmann. (1995). “The Interdependent Joint Routing Problem: Description and Algorithmic Approach,” Technical Report, Naval Research Laboratory, Washington, D.C.
rezvani,H , mohammad zahraie,S , ghadimi,G and kaviani,F . (2015). Determining the most likely route cruise missile based on routing algorithms. Military Science and Tactics, 11(32), 25-51.
MLA
rezvani,H , , mohammad zahraie,S , , ghadimi,G , and kaviani,F . "Determining the most likely route cruise missile based on routing algorithms", Military Science and Tactics, 11, 32, 2015, 25-51.
HARVARD
rezvani H, mohammad zahraie S, ghadimi G, kaviani F. (2015). 'Determining the most likely route cruise missile based on routing algorithms', Military Science and Tactics, 11(32), pp. 25-51.
CHICAGO
H rezvani, S mohammad zahraie, G ghadimi and F kaviani, "Determining the most likely route cruise missile based on routing algorithms," Military Science and Tactics, 11 32 (2015): 25-51,
VANCOUVER
rezvani H, mohammad zahraie S, ghadimi G, kaviani F. Determining the most likely route cruise missile based on routing algorithms. Military Science and Tactics. 2015;11(32):25-51 (In Persian).
