| Tag |
First Indicator |
Second Indicator |
Subfields |
| LEADER |
00000cam a2200000Ka 4500 |
| 001 |
in00002783497 |
| 005 |
20150922151142.0 |
| 006 |
m fo d |
| 007 |
cr unu|||||||| |
| 008 |
121127s2012 txu obm 000 0 eng d |
| 035 |
|
|
|a (OCoLC)ocn819421555
|
| 035 |
|
|
|a (TxCM)http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694
|
| 040 |
|
|
|a TXA
|c TXA
|d UtOrBLW
|
| 049 |
|
|
|a TXAM
|
| 099 |
|
|
|a 2012
|a Thesis
|a 1969.1/ETD-TAMU-2012-08-11694
|
| 100 |
1 |
|
|a Sundar, Kaarthik.
|
| 245 |
1 |
0 |
|a Motion planning for unmanned aerial vehicles with resource constraints /
|c by Kaarthik Sundar.
|
| 264 |
|
1 |
|a [College Station, Tex.] :
|b [Texas A&M University],
|c [2012]
|
| 300 |
|
|
|a 1 online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a "Major Subject: Electrical Engineering"
|
| 588 |
|
|
|a Description from author supplied metadata (automated record created 2012-10-22 13:24:58).
|
| 502 |
|
|
|b Master of Science
|c Texas A&M University
|d 2012
|o http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694
|
| 504 |
|
|
|a Includes bibliographical references.
|
| 516 |
|
|
|a Text (Thesis)
|
| 520 |
3 |
|
|a Small Unmanned Aerial Vehicles (UAVs) are currently used in several surveillance applications to monitor a set of targets and collect relevant data. One of the main constraints that characterize a small UAV is the maximum amount of fuel the vehicle can carry. In the thesis, we consider a single UAV routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot. The objective of the problem is to find a path for the UAV such that each target is visited at least once by the vehicle, the fuel constraint is never violated along the path for the UAV, and the total length of the path is a minimum. Mixed integer, linear programming formulations are proposed to solve the problem optimally. As solving these formulations to optimality may take a large amount of time, fast and efficient construction and improvement heuristics are developed to find good sub-optimal solutions to the problem. Simulation results are also presented to corroborate the performance of all the algorithms. In addition to the above contributions, this thesis develops an approximation algorithm for a multiple UAV routing problem with fuel constraints.
|
| 500 |
|
|
|a Electronic resource.
|
| 650 |
|
4 |
|a Major Electrical Engineering.
|
| 653 |
|
|
|a Resource constraints
|
| 653 |
|
|
|a Approximation algorithm
|
| 653 |
|
|
|a Motion planning
|
| 700 |
1 |
|
|a Rathinam, Sivakumar,
|e thesis advisor.
|
| 700 |
1 |
|
|a Bhattacharyya, Shankar P.,
|e thesis advisor.
|
| 856 |
4 |
0 |
|u http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694
|z Link to OAK Trust copy
|t 0
|
| 948 |
|
|
|a cataloged
|b h
|c 2012/11/27
|d c
|e ceaton
|f 1:27:56 pm
|
| 994 |
|
|
|a C0
|b TXA
|
| 999 |
|
|
|a MARS
|
| 999 |
f |
f |
|s 5a6ae105-9f99-3d2f-b68c-932a75b8a954
|i c7044c0c-b040-3ad1-a6f2-9f5ca684b307
|t 0
|
| 952 |
f |
f |
|a Texas A&M University
|b College Station
|c Electronic Resources
|d Available Online
|t 0
|e 2012 Thesis 1969.1/ETD-TAMU-2012-08-11694
|h Other scheme
|
| 998 |
f |
f |
|a 2012 Thesis 1969.1/ETD-TAMU-2012-08-11694
|t 0
|l Available Online
|