Coding strategies for a class of decentralized control problems with limited communication

Reza Mirghaderi, Sanjay Lall, Andrea Goldsmith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a large class of decentralized control problems with non-classical information structure for which a coding strategy is optimal. This class is a generalized version of the hats problem with statistically dependent hat colors where implicit communication via action is allowed. We propose a sufficient condition on the joint distribution of the hat colors which guarantees the optimality of a binary sum coding strategy. We explore the connection between this version of the hats problem and hypercube graph theory, and use that to show that verifying our proposed sufficient condition is computationally tractable.

Original languageEnglish (US)
Title of host publication2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
Pages4809-4816
Number of pages8
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 - Orlando, FL, United States
Duration: Dec 12 2011Dec 15 2011

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
Country/TerritoryUnited States
CityOrlando, FL
Period12/12/1112/15/11

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Coding strategies for a class of decentralized control problems with limited communication'. Together they form a unique fingerprint.

Cite this