This thesis presents a dynamically feasible and real-time trajectory path generation algorithm for unmanned aerial vehicles (UAVs) flying through a sequence of a random N number of waypoints (WPs) in three dimensions. Pontryagin’s minimum principle was used to show that the straight-line path segments connecting the sequence of waypoints are time optimal [1]. An algorithm was designed so that the total trajectory path length of a UAV is approximately equal to the straight-line path of the waypoints. The trajectory path obtained was also compared with the one-circle method, and it was found that the proposed method has less path length. Issues related to this algorithm are explained in detail. Simulation results show the efficiency of the method. / Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science
| Identifer | oai:union.ndltd.org:WICHITA/oai:soar.wichita.edu:10057/5038 |
| Date | 07 1900 |
| Creators | Malisetty, Saideepthi |
| Contributors | Driessen, Brian J. |
| Publisher | Wichita State University |
| Source Sets | Wichita State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Format | x, 63 p. |
| Rights | © Copyright 2011 by Saideepthi Malisetty. All rights reserved |
Page generated in 0.0016 seconds