Interactive approaches for bi-objective UAV route planning in continuous space

Türeci, Hannan
We study the route planning problem of unmanned air vehicles (UAVs). We consider two objectives; minimizing total distance traveled and minimizing total radar detection threat since these objectives cover most of the other related factors. We consider routing in a two-dimensional continuous terrain, in which we have infinitely many efficient trajectories between target pairs. We develop interactive algorithms that find the most preferred solution of a route planner (RP), who has either of the underlying preference function structures: linear or quasiconvex. To implement the algorithms to route planning problems, we use approximated nondominated frontiers of the trajectories between targets. In the linear case, we search for supported efficient solutions in two stages. In the first stage, we find the best trajectory between each target pair. In the second stage, we find the tour visiting all targets (traveling salesperson problem, TSP). In the quasiconvex case, we search for both supported and unsupported efficient solutions. We first reduce the objective space to rectangular regions around at most three supported efficient solutions. We then search inside these rectangular regions to find supported/unsupported efficient solutions and narrow our search region. We proceed with pairwise comparisons from the RP and reduce our search space until the two solutions to be compared are close enough. To generate random problem instances, we develop a mathematical model that randomly locates radars in a terrain with known target locations. We then demonstrate the interactive algorithm developed for linear preference functions on two randomly generated problems.


Coordinated guidance for multiple UAVs
Cakici, Ferit; Ergezer, Halit; Irmak, Ufuk; Leblebicioğlu, Mehmet Kemal (2016-05-01)
This paper addresses the path planning problem of multiple unmanned aerial vehicles (UAVs). The paths are planned to maximize collected amount of information from desired regions (DRs), while avoiding forbidden regions (FRs) and reaching the destination. This study focuses on maximizing collected information instead of minimizing total mission time, as in previous studies. The problem is solved by a genetic algorithm (GA) with the proposal of novel evolutionary operators. The initial populations are generat...
Biobjective route planning of an unmanned air vehicle in continuous space
TEZCANER ÖZTÜRK, DİCLEHAN; Köksalan, Mustafa Murat (2023-02-01)
We consider the route planning problem of an unmanned air vehicle (UAV) in a continuous space that is monitored by radars. The UAV visits multiple targets and returns to the base. The routes are constructed considering the total distance traveled and the total radar detection threat objectives. The UAV is capable of moving to any point in the terrain. This leads to infinitely many efficient trajectories between target pairs and infinitely many efficient routes to visit all targets. We use a two stage approa...
Conceptual design of a stealth unmanned combat aerial vehicle with multidisciplinary design optimization
Çakın, Uğur; Alemdaroğlu, Hüseyin Nafiz; Department of Aerospace Engineering (2018)
The present study aims to develop a methodology for multi-disciplinary design optimization (MDO) of an unmanned combat aerial vehicle. At the current stage of optimization study, three disciplines are considered, which are aerodynamics, structural weight and radar cross section (RCS) signature. As objective functions, maximum range and minimum RCS signature are employed. To generate pareto-optimal solutions, multi-objective particle swarm optimization (MOPSO) function of MATLAB® is performed. To get aerodyn...
Online path planning for unmanned aerial vehicles to maximize instantaneous information
Ergezer, Halit; Leblebicioğlu, Mehmet Kemal (2021-01-01)
In this article, an online path planning algorithm for multiple unmanned aerial vehicles (UAVs) has been proposed. The aim is to gather information from target areas (desired regions) while avoiding forbidden regions in a fixed time window starting from the present time. Vehicles should not violate forbidden zones during a mission. Additionally, the significance and reliability of the information collected about a target are assumed to decrease with time. The proposed solution finds each vehicle’s path by s...
Situation Aware UAV Mission Route Planning
Tulum, Kamil; Durak, Umut; Ider, S. Kemal (2009-03-14)
This paper outlines an agent based approach for UAV (Unmanned Air Vehicles) mission route planning problem. In this context, mission route planning can be defined as finding the "best" set of waypoints for the UAV that will enhance its probability of success in its mission. Mission route planning may be carried out either in premission or in mission time. It may be done either by an onboard control system or by a ground mission planning system. Regardless of these considerations, a problem solving agent for...
Citation Formats
H. Türeci, “Interactive approaches for bi-objective UAV route planning in continuous space,” M.S. - Master of Science, Middle East Technical University, 2017.