MIT 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.

Unifying model-based programming and randomized path planning through optimal search

Author(s)
Walcott, Aisha, 1978-
Thumbnail
DownloadFull printable version (16.74Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Brian Williams.
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
The deployment of robots at the World Trade Center (WTC) site after September 11, 2001, highlighted the potential for robots to aid in search and rescue missions that pose great threats and challenges to humans. However, robots that are tele-operated and tethered for power and communication are restricted in terms of their operational area. Thus, rescue robots must be equipped with onboard autonomy that enables them to select feasible plans on their own, within their physical and computational limitations. There are three main characteristics that a rescue robot's onboard system must posses. First, the system must be able to generate plans for mobile systems, that is, plans with activities and paths. Second, in order to operate as efficiently as possible, particularly in emergency situations, the system must be globally optimal. Third, the system must be able to generate plans quickly. This thesis introduces a novel autonomous control system that interleaves methods for spatial and activity planning, by merging model-based programming with roadmap-based path planning. The primary contributions are threefold. The first contribution is a model that represents possible mission strategies with activities that have cost and are constrained to a location. The second is an optimal pre-planner that reasons through the possible mission strategies in order to quickly find the optimal feasible strategy. The third contribution is a unified, global activity and path planning system. The system unifies the optimal pre-planner with a randomized roadmap-based path planner, in order to find the optimal feasible strategy to achieve a mission. The impact of these contributions is highlighted in the context of an urban search and rescue (USAR) mission.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
 
Includes bibliographical references (p. 120-122).
 
Date issued
2004
URI
http://hdl.handle.net/1721.1/18056
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

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
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.