Sequential team form and its simplification using graphical models

Authors:
Aditya Mahajan;Sekhar Tatikonda
Affiliations:
Dept. of Electrical Engineering, Yale University, New Haven, CT;Dept. of Electrical Engineering, Yale University, New Haven, CT
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 4
Cited 0

The decentralized Wald problem

Information and Computation
Stochastic systems: estimation, identification and adaptive control

Stochastic systems: estimation, identification and adaptive control
d-Separation: From Theorems to Algorithms

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Bayes-ball: Rational pastime (for determining irrelevance and requisite information in belief networks and influence diagrams)

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a sequential team form for dynamic teams is defined. A team form captures the properties of teams that only depend on the independence relation between the system variables but do not depend on the exact functional form of these relationships or on the state space of the variables. A notion of simplifying team forms is presented. We represent team forms using a directed acyclic factor graph and present a graphical model algorithm to simplify the team form.