MIT Libraries logoDSpace@MIT

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

Simultaneous stochastic mapping and localization

Author(s)
Feder, Hans Jacob Sverdrup
Thumbnail
DownloadFull printable version (16.66Mb)
Advisor
John J. Leonard.
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
In order to create truly autonomous mobile robots, the task of building an accurate map of an a priori unknown environment and concurrently using that map to navigate is a central problem. This thesis focuses on methods for performing concurrent map­ping and localization using a feature-based approach. The concurrent mapping and localization problem is cast as a stochastic estimation problem. Based on Kalman filtering techniques, augmented stochastic mapping is introduced as a method for performing concurrent mapping and localization in realistic scenario simulations and experiments. The role of data association ambiguity, track initiation and track dele­tion in the presence of uncertainty and non-linear system dynamics are addressed. A novel approach is introduced to overcome the computational complexity inherent in mapping large areas with many features. Adaptive concurrent mapping and local­ization based on choosing the robot's action so as to maximize the expected Fisher information is introduced in order to achieve improved performance. Results from simulations, land and underwater experiments, and post-processing of oceanic data are presented to demonstrate the validity of the proposed approaches. Once a region is mapped and localization information is available, planning collision free trajecto­ries from the current position to the goal position is important for reliable mobile robot operations. In this context, a novel path-planning algorithm based on har­monic potentials is introduced for performing path-planning and obstacle avoidance in dynamic environments.
Description
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1999.
 
Includes bibliographical references (p. 229-242).
 
Date issued
1999
URI
http://hdl.handle.net/1721.1/9411
Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Publisher
Massachusetts Institute of Technology
Keywords
Mechanical Engineering

Collections
  • Doctoral 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.