Show simple item record

dc.contributor.advisorBrian C. Williams.en_US
dc.contributor.authorBadaro, Henrien_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.en_US
dc.date.accessioned2011-04-25T16:05:37Z
dc.date.available2011-04-25T16:05:37Z
dc.date.copyright2010en_US
dc.date.issued2010en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/62477
dc.descriptionThesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2010.en_US
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (p. 131-134).en_US
dc.description.abstractLarge-scale autonomous systems such as modern ships or spacecrafts require reliable monitoring capabilities. One of the main challenges in large-scale system monitoring is the difficulty of reliably and efficiently troubleshooting component failure and deviant behavior. Diagnosing large-scale systems is difficult because of the fast increase in combinatorial complexity. Hence, efficient problem encoding and knowledge propagation between time steps is crucial. Moreover, concentrating all the diagnosis processing power in one machine is risky, as it creates a potential critical failure point. Therefore, we want to distribute the online estimation procedure. We introduce here a model-based method that performs robust, online mode estimation of complex, hardware or software systems in a distributed manner. Prior work introduced the concept of probabilistic hierarchical constraint automata (PHCA) to compactly model both complex software and hardware behavior. Our method, inspired by this previous work, translates the PHCA model to a constraint representation. This approach handles a more precise initial state description, scales to larger systems, and to allow online belief state updates. Additionally, a tree-clustering of the dual constraint graph associated with the multi-step trellis diagram representation of the system makes the search distributable. Our search algorithm enumerates the optimal solutions of a hard-constraint satisfaction problem in a best-first order by passing local constraints and conflicts between neighbor sub-problems of the decomposed global problem. The solutions computed online determine the most likely trajectories in the state space of a system. Unlike prior work on distributed constraint solving, we use optimal hard constraint satisfaction problems to increase encoding compactness. We present and demonstrate this approach on a simple example and an electric power-distribution plant model taken from a naval research project involving a large number of modules. We measure the overhead caused by distributing mode estimation and analyze the practicality of our approach.en_US
dc.description.statementofresponsibilityby Henri Badaro.en_US
dc.format.extent134 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectAeronautics and Astronautics.en_US
dc.titleDistributed mode estimation through constraint decompositionen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics
dc.identifier.oclc712044783en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record