MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Operational planning for multiple heterogeneous unmanned aerial vehicles in three dimensions

Author(s)
Negron, Blair Ellen Leake
Thumbnail
DownloadFull printable version (27.97Mb)
Other Contributors
Massachusetts Institute of Technology. Operations Research Center.
Advisor
Stephan E. Kolitz and Hamsa Balakrishnan.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Unmanned aerial vehicles are being incorporated in an increasing variety of operations. To take full advantage of the vehicles, the plans for the operations should integrate each vehicle's capabilities when planning the operations. This thesis focuses on planning operations for multiple, heterogeneous UAVs for the purpose of monitoring Earth's phenomena through data collection. The planning is done for flight in three dimensions. The problem also includes time window constraints for data collection and incorporates human input in the planning process. Two solution methods are presented: (1) a mixed-integer program, and (2) an algorithm that utilizes a meta-heuristic to generate composite variables for a linear program, called the Composite Operations Planning Algorithm. The suitability of the two methods to solve the operations planning problem is compared based on the ability of each of the methods to find high-value, feasible solutions for large-scale, operationally sized problems in a reasonable amount of time. The analysis shows that the Composite Operations Planning Algorithm can develop operations plans for problems including 15 UAVs and 5000 nodes in less than 25 minutes using a desktop computer.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2009.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (p. 133-135).
 
Date issued
2009
URI
http://hdl.handle.net/1721.1/53299
Department
Massachusetts Institute of Technology. Operations Research Center; Sloan School of Management
Publisher
Massachusetts Institute of Technology
Keywords
Operations Research Center.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.