Back to results

Massachusetts Institute of Technology

Accurate belief state update for probabilistic constraint automata

Abstract

dc:description.abstract

As autonomous spacecraft and other robotic systems grow increasingly complex, there is a pressing need for capabilities that more accurately monitor and diagnose system state while maintaining reactivity. Mode estimation addresses this problem by reasoning over declarative models of the physical plant, represented as a factored variant of Hidden Markov Models (HMMs), called Probabilistic Concurrent Constraint Automata (PCCA). Previous mode estimation approaches track a set of most likely PCCA state trajectories, enumerating them in order of trajectory probability. Although Best-First Trajectory Enumeration (BFTE) is efficient, ignoring the additional trajectories that lead to the same target state can significantly underestimate the true state probability and result in misdiagnosis. This thesis introduces two innovative belief state approximation techniques, called Best-First Belief State Enumeration (BFBSE) and Best-First Belief State Update (BFBSU), that address this limitation by computing estimate probabilities directly from the HMM belief state update equations. Theoretical and empirical results show that I3FBSE and BFBSU significantly increases estimator accuracy, uses less memory, and have no increase in computation time when enumerating a moderate number of estimates for the approximate belief state of subsystem sized models.

Degree

thesis:*
Department dc:contributor.department
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2005

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Martin, Oliver B., 1979-
Advisor dc:contributor.advisor
  • Brian C. Williams.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • 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.
Language dc:language.iso
eng

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1721.1/32446
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/32446

Chain of custody

source
Harvested from
MIT
Base URL
dspace.mit.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Martin, Oliver B., 1979-. Accurate belief state update for probabilistic constraint automata. Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/32446