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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
3D Path Planning for UAVs for Maximum Information Collection
Date
2013-01-01
Author
Ergezer, Halit
Leblebicioğlu, Mehmet Kemal
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
189
views
0
downloads
Cite This
This paper addresses the problem of path planning for multiple UAVs. The paths are planned to maximize collected amount of information from Desired Regions (DR) while avoiding Forbidden Regions (FR) violation and reaching the destination. The approach extends prior study for multiple UAVs by considering 3D environment constraints. The path planning problem is studied as an optimization problem. The problem has been solved by a Genetic Algorithm (GA) with the proposal of novel evolutionary operators. The initial populations have been generated from a seed-path for each UAV. The seed-paths have been obtained both by utilizing the Pattern Search method and solving the multiple-Traveling Salesman Problem (mTSP). Utilizing the mTSP solves both the visiting sequences of DRs and the assignment problem of "which DR should be visited by which UAV". It should be emphasized that all of the paths in population in any generation of the GA have been constructed using the dynamical mathematical model of an UAV equipped with the autopilot and guidance algorithms. Simulations are realized in the MATLAB/Simulink environment. The path planning algorithm has been tested with different scenarios, and the results are presented in Section V. Although there are previous studies in this field, this paper focuses on maximizing the collected information instead of minimizing the total mission time. Even though, a direct comparison of our results with those in the literature is not possible, it has been observed that the proposed methodology generates satisfactory and intuitively expected solutions. Keywords
Subject Keywords
Maximum information collection
,
Multiple-travelling salesman problem (mTSP)
,
Evolutionary computation
,
Path planning
,
Unmanned aerial vehicles
,
Optimization
,
URI
https://hdl.handle.net/11511/37625
DOI
https://doi.org/10.1109/icuas.2013.6564676
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
3D Path Planning for Multiple UAVs for Maximum Information Collection
Ergezer, Halit; Leblebicioğlu, Mehmet Kemal (Springer Science and Business Media LLC, 2014-01-01)
This paper addresses the problem of path planning for multiple UAVs. The paths are planned to maximize collected amount of information from Desired Regions (DR) while avoiding Forbidden Regions (FR) violation and reaching the destination. The approach extends prior study for multiple UAVs by considering 3D environment constraints. The path planning problem is studied as an optimization problem. The problem has been solved by a Genetic Algorithm (GA) with the proposal of novel evolutionary operators. The ini...
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...
Feedback motion planning of a novel fully actuated unmanned surface vehicle via sequential composition of random elliptical funnels
Özdemir, Oğuz; Ankaralı, Mustafa Mert; Department of Electrical and Electronics Engineering (2022-12-27)
This thesis proposes and analyzes a motion planning and control schema for unmanned surface vehicles that fuses sampling-based approaches’ probabilistic completeness with closed-loop approaches’ robustness. The Proposed schema is based on the sequential composition of elliptical funnels, and it consists of two stages: tree generation and motion control. For validation of the approach, we carried out experiments using both simulation and physical setup besides the mathematical analysis. In order to have a co...
3D path planning for unmanned aerial vehicles
Halit, Ergezer; Leblebicioğlu, Mehmet Kemal (2013-05-31)
Path planning considers the problem of designing the path a vehicle is supposed to follow. Along the designed path, the objectives are to maximize the collected information from Desired Regions (DR) while avoiding flying over Forbidden Regions (FR) and reaching the destination. In this paper, the path planning problem for a multiple Unmanned Air Vehicles (UAVs) is studied with the proposal of novel evolutionary operators. The initial populations seed-path for each UAV have been obtained both by utilizing th...
Hybrid Approach for Mobile Couriers Election in Smart-cities
Al-Turjman, Fadi (2016-11-10)
In this paper we propose a hybrid heuristic approach for public data delivery under ultra-large-scale smart-city settings. In this approach, public transportation vehicles are going into election process to be utilized as Mobile Couriers (MCs) that read public Access Points (APs) data loads and relay it back to a central processing base-station. We also introduce a cost-based fitness function for the MCs election in the smart-city project which forms a real implementation for the Internet of Things (IoT) pa...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. Ergezer and M. K. Leblebicioğlu, “3D Path Planning for UAVs for Maximum Information Collection,” 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37625.