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 unmanned aerial vehicles
Date
2013-05-31
Author
Halit, Ergezer
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
240
views
0
downloads
Cite This
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 the Pattern Search method and solving the multiple Traveling Salesman Problem (mTSP). Utilizing the mTSP solves 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 evolutionary algorithm (EA) 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.
Subject Keywords
Path planning
,
Evolutionary computation
,
Unmanned aerial vehicles
,
Mathematical model
,
MATLAB
URI
https://hdl.handle.net/11511/46116
DOI
https://doi.org/10.1109/siu.2013.6531346
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Planning unmanned aerial vehicle's path for maximum information collection using evolutionary algorithms
Ergezer, Halit; Leblebicioğlu, Mehmet Kemal (2011-01-01)
Path planning is a problem of designing the path the vehicle is supposed to follow in such a way that a certain objective is optimized. In our study the objective is to maximize collected amount of information from Desired Regions (DR), meanwhile flying over the Forbidden Regions is avoided. In this paper, the path planning problem for single unmanned air vehicle (UAV) is studied with the proposal of novel evolutionary operators; Pull-to-Desired-Region (PTDR), Push-From-Forbidden-Region (PFFR), Pull-to-Fini...
Path Planning for UAVs for Maximum Information Collection
Ergezer, Halit; Leblebicioğlu, Mehmet Kemal (2013-01-01)
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 (CI) from desired regions (DR), while avoiding flying over forbidden regions (FR) and reaching the destination. The path planning problem for a single unmanned air vehicle (UAV) is studied with the proposal of novel evolutionary operators: pull-to-desired-region (PTDR), push-from-forbidden-region (PFFR), and pull-to-final-point (PTFP). In...
3D Path Planning for UAVs for Maximum Information Collection
Ergezer, Halit; Leblebicioğlu, Mehmet Kemal (2013-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...
Trajectory planning and tracking for autonomous vehicles
Çiçek, Haluk Levent; Schmidt, Klaus Verner; Department of Electrical and Electronics Engineering (2022-12-27)
Finding appropriate paths is an essential issue for the development of autonomous vehicles and robots. Hereby, it has to be considered that autonomous vehicles cannot follow sharp corners, as they cannot turn on a single point. Therefore, it is important to compute smooth paths that have additional desirable properties such as minimum length and sufficient distance from obstacles. Furthermore, practical applications require the computation of such paths in real time. This thesis develops a general method...
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
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Halit and M. K. Leblebicioğlu, “3D path planning for unmanned aerial vehicles,” 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46116.
