Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Bi-objective missile rescheduling for a naval task group with dynamic disruptions
Date
2019-10-01
Author
Silav, Ahmet
Karasakal, Orhan
Karasakal, Esra
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
116
views
0
downloads
Cite This
This paper considers the rescheduling of surface-to-air missiles (SAMs) for a naval task group (TG), where a set of SAMs have already been scheduled to intercept a set of anti-ship missiles (ASMs). In missile defense, the initial engagement schedule is developed according to the initial state of the defensive and attacking units. However, unforeseen events may arise during the engagement, creating a dynamic environment to be handled, and making the initial schedule infeasible or inefficient. In this study, the initial engagement schedule of a TG is assumed to be disrupted by the occurrence of a destroyed ASM, the breakdown of a SAM system, or an incoming new target ASM. To produce an updated schedule, a new biobjective mathematical model is formulated that maximizes the no-leaker probability value for the TG and minimizes the total deviation from the initial schedule. With the problem shown to be NP-hard, some special cases are presented that can be solved in polynomial time. We solve small size problems by the augmented epsilon-constraint method and propose heuristic procedures to generate a set of nondominated solutions for larger problems. The results are presented for different size problems and the total effectiveness of the model is evaluated.
Subject Keywords
Air defense
,
Naval task group
,
Rescheduling
,
Weapon target allocation problem
URI
https://hdl.handle.net/11511/33194
Journal
NAVAL RESEARCH LOGISTICS
DOI
https://doi.org/10.1002/nav.21867
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
ANALYSIS OF AIR DEFENSE EFFECTIVENESS OF A NAVAL TASK GROUP UNDER PARTIAL AND FULL COORDINATION
Köse, Bala İlkim; Karasakal, Esra; Karasakal, Orhan; Department of Industrial Engineering (2022-5-10)
The purpose of this thesis is to analyze the air defense effectiveness of a naval task group (TG) under different coordination levels. Event Graphs methodology, and component-based discrete-event simulation modeling techniques are used. The simulation model is built using Simkit, an open-source java package, which enables the use of component-based modeling. TG is analyzed under different coordination policies consisting of no-coordination, partial coordination, and full coordination within TG, then these c...
Varying mass missile dynamics, guidance & control
Günbatar, Yakup; Leblebicioğlu, Mehmet Kemal; Department of Electrical and Electronics Engineering (2007)
The focus of this study is to be able to control the air-to-surface missile throughout the entire flight, with emphasis on the propulsion phase to increase the impact range of the missile. A major difficulty in controlling the missile during the propulsion phase is the important change in mass of the missile. This results in sliding the center of gravity (cg) point and changing inertias. Moreover, aerodynamic coefficients and stability derivatives are not assumed to be constant at predetermined ranges; conv...
End-to-end networks for detection and tracking of micro unmanned aerial vehicles
Aker, Cemal; Kalkan, Sinan; Department of Computer Engineering (2018)
As the number of micro unmanned aerial vehicles (mUAV) increases, several threats arise. Hence, there is a need for a system that can detect and track them. In this thesis, an object detection model based on convolutional neural networks for mUAV detection, and a novel end-to-end object tracking architecture are proposed. To solve the scarce data problem for training the detection network, an algorithm for creating an extensive artificial dataset by combining background-subtracted real images is proposed. I...
Cooperative Guidance Law for High-Speed and High-Maneuverability Air Targets
Cevher, Firat Yilmaz; Leblebicioğlu, Mehmet Kemal (2023-2-01)
In this paper, a novel cooperative and predictive guidance law is proposed to intercept high-speed and high-maneuverability targets with inferior interceptors. The purpose of guidance is cooperatively covering the most-probable locations where the target may be in the future. To fulfill this purpose, predicted target states in the form of a probability density function were obtained using limited target information, i.e., noisy position data for one case and maneuverability limits for the second case, at fi...
Sliding mode guidance of an air-to-air missile
Ulu, Muharrem; Leblebicioğlu, Mehmet Kemal; Department of Electrical and Electronics Engineering (2013)
Pursuit of a highly maneuverable aircraft by an air-to-air missile requires a solution to a challenging guidance and control problem. Precision is the most important need for these missiles. Appropriate guidance commands that are generated by the guidance method and an autopilot that can fulfil the agility needs of such a missile are the keys of minimizing the distance between the missile and the target and a successful interception. In this thesis, autopilot and guidance method design of an air-to-air miss...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Silav, O. Karasakal, and E. Karasakal, “Bi-objective missile rescheduling for a naval task group with dynamic disruptions,”
NAVAL RESEARCH LOGISTICS
, pp. 596–615, 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/33194.