A constant factor approximation algorithm for event-based sampling

6Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider a control system in which sensor data is transmitted from the plant to a receiver over a communication channel, and the receiver uses the data to estimate the state of the plant. Using a feedback policy to choose when to transmit data, the goal is to schedule transmissions to balance a trade-off between communication rate and estimation error. Computing an optimal policy for this problem is generally computationally intensive. Here we provide a simple algorithm for computing a suboptimal policy for scheduling state transmissions which incurs a cost within a factor of six of the optimal achievable cost. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cogill, R., Lall, S., & Hespanha, J. P. (2010). A constant factor approximation algorithm for event-based sampling. Lecture Notes in Control and Information Sciences, 398, 51–60. https://doi.org/10.1007/978-3-540-93918-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free