Back to results

Massachusetts Institute of Technology

A hierarchical framework for constructing computationally efficient algorithms for distributed inference problems

Abstract

dc:description.abstract

In this thesis, we present a methodology for designing computationally efficient algorithms for large-scale inference systems on system architectures with distributed autonomous agents. The principle of information-based computation is the underlying idea driving elements of this methodology. The methodology consists of a layered information processing architecture, which organizes specific inference tasks into layers so that the information extracted from these tasks can be exploited to design an efficient inference system, and the hierarchy, which is a representation combining elements of circuits and branching programs from which efficient distributed local algorithms implementing global tasks on general system architectures can be generated. The general issues addressed by this methodology are: (1) how to efficiently collect distributed information for estimation when collecting information is expensive, (2) how to distribute a global algorithm among multiple agents, and (3) how to take advantage of prior computations to aid in subsequent computations. To demonstrate that the methodology is a good one, we present an application of sensor networks to battlefield awareness. The problem is to gain intelligence about targets in the environment from the information collected by a set of sensor nodes which are distributed over a field and have real physical constraints on energy and communication. In particular, solutions to the problem of information collection for target localization and the problem of multiple target tracking and classification are formulated and demonstrated using the proposed methodology.

Degree

thesis:*
Department dc:contributor.department
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Grantor dc:publisher
Massachusetts Institute of Technology
Year dc:date.issued
2003

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chu, Maurice Kyojin, 1973-
Advisor dc:contributor.advisor
  • Sanjoy K. Mitter.

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/16912
OAI identifier oai:identifier
oai:dspace.mit.edu:1721.1/16912

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

Chu, Maurice Kyojin, 1973-. A hierarchical framework for constructing computationally efficient algorithms for distributed inference problems. Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/16912