Midcourse and final phase path planning for air vehicles to avoid countermeasures

Download

index.pdf

Date

2021-3-25

Author

Ataeli, Berk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

580
views

353
downloads

Path planning is a fundamental element of various common fields, such as robotics, computer animation, and wireless sensor networks. In this study, path planning for air vehicles is investigated in two phases. For the midcourse phase, the path with the minimum length, fuel consumption, and risk of being detected is sought between two particular points in 3D complicated environments. To achieve this aim, a Genetic Algorithm is utilized with a special feasible initial population creation method. Also, some problem dependent operators are defined in order to make the convergence faster and more accurate, which is very crucial when the environment involves complex obstacles. On the other hand, since there are typically air defense systems located close to targets, safety becomes more important in the final phase. In order to avoid these dangerous situations, evasive maneuvers must be carried out within short ranges near the target. Thus, the mathematical modeling of air vehicles, guidance systems, and Control Actuation Systems are integrated and several tactical strategies are examined against the Close-In Weapon System that is also modeled in this dissertation.

Subject Keywords

Path planning, Genetic algorithm, Flight mechanics, Evasive maneuver, CIWS

URI

https://hdl.handle.net/11511/89699

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Distributed Connectivity Restoration in Underwater Acoustic Sensor Networks via Depth Adjustment Uzun, Erkay; ŞENEL, FATİH; Akkaya, Kemal; Yazıcı, Adnan (2015-06-12) In most applications of Underwater Acoustic Sensor Networks, network connectivity is required for data exchange, data aggregation and relaying the data to a surface station. However, such connectivity can be lost due to failure of some sensor nodes which creates disruptions to the network operations. In this paper, we present two algorithms, namely BMR and DURA, which can detect network partitioning due to such node failures and re-establish network connectivity through controlled depth adjustment of nodes ...
On the performance, availability and energy consumption modelling of clustered IoT systems Ever, Enver; Shah, Purav; Mostarda, Leonardo; Omondi, Fredrick; Gemikonakli, Orhan (Springer Science and Business Media LLC, 2019-12-01) Wireless sensor networks (WSNs) form a large part of the ecosystem of the Internet of Things (IoT), hence they have numerous application domains with varying performance and availability requirements. Limited resources that include processing capability, queue capacity, and available energy in addition to frequent node and link failures degrade the performance and availability of these networks. In an attempt to efficiently utilise the limited resources and to maintain the reliable network with efficient da...
Optimal deployment in randomly deployed heterogeneous WSNs: A connected coverage approach SEVGİ, CÜNEYT; Koçyiğit, Altan (2014-11-01) Wireless sensor networks (WSNs) are resource-scarce networks and the optimization of the resources is challenging. As far as random deployment is concerned, the optimization of these resources becomes even more difficult In this paper, a novel framework is proposed for solving optimal deployment problems for randomly deployed and clustered WSNs. In several existing approaches to solve these problems, either only partial-coverage is considered or only connectivity is analyzed when full-coverage is assured. T...
Poster Abstract: iSDR: SDR-in-the-loop Simulation Ergenc, Doganalp; Onur, Ertan (2019-01-01) Discrete event network simulators are used to evaluate the performance of a variety of designs in the wireless communication field. They enable researchers to build new network protocols and architectures in a simplified and organized development environment with adherence to the fundamental software engineering principles. However, even though they embody different mathematical models to simulate wireless medium, it is still far from taking an excessive number of channel conditions that directly affect wir...
Safe and Efficient Path Planning for Omni-directional Robots using an Inflated Voronoi Boundary Aldahhan, Mohammed Rabeea Hashim; Schmidt, Klaus Verner (2019-11-01) Path planning algorithms for mobile robots are concerned with finding a feasible path between a start and goal location in a given environment without hitting obstacles. In the existing literature, important performance metrics for path planning algorithms are the path length, computation time and path safety, which is quantified by the minimum distance of a path from obstacles. The subject of this paper is the development of path planning algorithms for omni-directional robots, which have the ability ...

Citation Formats

B. Ataeli, “Midcourse and final phase path planning for air vehicles to avoid countermeasures,” M.S. - Master of Science, Middle East Technical University, 2021.