Archived

This content is available here for research, reference, and/or recordkeeping.

Date Available

12-14-2011

Year of Publication

2001

Document Type

Dissertation

College

Engineering

Department/School/Program

Computer Science

Faculty

Judy Goldsmith

Abstract

This dissertation makes contributions to areas of research on planning with POMDPs: complexity theoretic results and heuristic techniques. The most important contributions are probably the complexity of approximating the optimal history-dependent finite-horizon policy for a POMDP, and the idea of heuristic search over the space of FFTs.

Share

COinS