Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. CSAIL Digital Archive
  4. CSAIL Technical Reports (July 1, 2003 - present)
  5. Spatial and Temporal Abstractions in POMDPs Applied to Robot Navigation

Spatial and Temporal Abstractions in POMDPs Applied to Robot Navigation

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2005-058.ps

Size

70.06 MB

Format

PostScript

Checksum (MD5)

16986e7f332d5da2adef276f128e1b6b

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2005-058.pdf

Size

2.62 MB

Format

Adobe PDF

Checksum (MD5)

c82a1b43b43561f2bf44a4889cf6153b

Author(s)
Theocharous, Georgios
•
Mahadevan, Sridhar
•
Kaelbling, Leslie Pack
Date Issued
September 27, 2005
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Abstract
Partially observable Markov decision processes (POMDPs) are a well studied paradigm for programming autonomous robots, where the robot sequentially chooses actions to achieve long term goals efficiently. Unfortunately, for real world robots and other similar domains, the uncertain outcomes of the actions and the fact that the true world state may not be completely observable make learning of models of the world extremely difficult, and using them algorithmically infeasible. In this paper we show that learning POMDP models and planning with them can become significantly easier when we incorporate into our algorithms the notions of spatial and tempral abstraction. We demonstrate the superiority of our algorithms by comparing them with previous flat approaches for large scale robot navigation.
Subjects
AI
Persistent DSpace Link
http://hdl.handle.net/1721.1/30569
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.