Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Joint optimization of wireless communication and networked control systems
Dept. of Aeronautics and Astronautics, Stanford University.
KTH, School of Electrical Engineering (EES), Automatic Control.
Systems and Practices Laboratory, PARC.
Electrical Engineering Department, Stanford University.
Show others and affiliations
2005 (English)In: SWITCHING AND LEARNING IN FEEDBACK SYSTEMS, 2005, Vol. 3355, 248-272 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider a linear system, such as an estimator or a controller, in which several signals are transmitted over wireless communication channels. With the coding and medium access schemes of the communication system fixed, the achievable bit rates axe determined by the allocation of communications resources such as transmit powers and bandwidths, to different channels. Assuming conventional uniform quantization and a standard white-noise model for quantization errors, we consider two specific problems. In the first, we assume that the linear system is fixed and address the problem of allocating communication resources to optimize system performance. We observe that this problem is often convex (at least, when we ignore the constraint that individual quantizers have an integral number of bits), hence readily solved. We describe a dual decomposition method for solving these problems that exploits the problem structure. We briefly describe how the integer bit constraints can be handled, and give a bound on how suboptimal these heuristics can be. The second problem we consider is that of jointly allocating communication resources and designing the linear system in order to optimize system performance. This problem is in general not convex. We present an iterative heuristic method based on alternating convex optimization over subsets of variables, which appeaxs to work well in practice.

Place, publisher, year, edition, pages
2005. Vol. 3355, 248-272 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3355
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-26581ISI: 000228664100011Scopus ID: 2-s2.0-24144464250OAI: oai:DiVA.org:kth-26581DiVA: diva2:378772
Conference
European Summer School on Multi-Agent Control Hamilton Inst Maynooth, Maynooth, ICELAND, SEP 08-10, 2003
Note
QC 20101216Available from: 2010-12-16 Created: 2010-11-25 Last updated: 2010-12-16Bibliographically approved

Open Access in DiVA

No full text

Scopus

Search in DiVA

By author/editor
Johansson, Mikael
By organisation
Automatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf