Observation of nonlinear systems via finite capacity channels: Constructive data rate limits

A. Matveev, A.Y. Pogromskiy

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

19 Citaties (Scopus)

Uittreksel

The paper deals with observation of nonlinear and deterministic, though maybe chaotic, discrete-time systems via finite capacity communication channels. We introduce several minimum data-rate limits associated with various types of observability, and offer new tractable analytical techniques for their both upper and lower estimation. Whereas the lower estimate is obtained by following the lines of the Lyapunov's linearization method, the proposed upper estimation technique is along the lines of the second Lyapunov approach. As an illustrative example, the potential of the presented results is demonstrated for the system which describes a ball vertically bouncing on a sinusoidally vibrating table. For this system, we provide an analytical computation of a closed-form expression for the threshold that separates the channel data rates for which reliable observation is and is not possible, respectively. Another illustration is concerned with the celebrated Hénon system. The offered sufficient data rate bound is accompanied with a constructive observer that works whenever the channel capacity fits this bound.

TaalEngels
Pagina's217-229
Aantal pagina's13
TijdschriftAutomatica
Volume70
DOI's
StatusGepubliceerd - 1 aug 2016

Vingerafdruk

Channel capacity
Nonlinear systems
Observability
Linearization

Trefwoorden

    Citeer dit

    @article{665f278c3fff4f18b3f28cb6a910ecf2,
    title = "Observation of nonlinear systems via finite capacity channels: Constructive data rate limits",
    abstract = "The paper deals with observation of nonlinear and deterministic, though maybe chaotic, discrete-time systems via finite capacity communication channels. We introduce several minimum data-rate limits associated with various types of observability, and offer new tractable analytical techniques for their both upper and lower estimation. Whereas the lower estimate is obtained by following the lines of the Lyapunov's linearization method, the proposed upper estimation technique is along the lines of the second Lyapunov approach. As an illustrative example, the potential of the presented results is demonstrated for the system which describes a ball vertically bouncing on a sinusoidally vibrating table. For this system, we provide an analytical computation of a closed-form expression for the threshold that separates the channel data rates for which reliable observation is and is not possible, respectively. Another illustration is concerned with the celebrated H{\'e}non system. The offered sufficient data rate bound is accompanied with a constructive observer that works whenever the channel capacity fits this bound.",
    keywords = "Entropy, Lyapunov function, Nonlinear systems",
    author = "A. Matveev and A.Y. Pogromskiy",
    year = "2016",
    month = "8",
    day = "1",
    doi = "10.1016/j.automatica.2016.04.005",
    language = "English",
    volume = "70",
    pages = "217--229",
    journal = "Automatica",
    issn = "0005-1098",
    publisher = "Agon Elsevier",

    }

    Observation of nonlinear systems via finite capacity channels : Constructive data rate limits. / Matveev, A.; Pogromskiy, A.Y.

    In: Automatica, Vol. 70, 01.08.2016, blz. 217-229.

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    TY - JOUR

    T1 - Observation of nonlinear systems via finite capacity channels

    T2 - Automatica

    AU - Matveev,A.

    AU - Pogromskiy,A.Y.

    PY - 2016/8/1

    Y1 - 2016/8/1

    N2 - The paper deals with observation of nonlinear and deterministic, though maybe chaotic, discrete-time systems via finite capacity communication channels. We introduce several minimum data-rate limits associated with various types of observability, and offer new tractable analytical techniques for their both upper and lower estimation. Whereas the lower estimate is obtained by following the lines of the Lyapunov's linearization method, the proposed upper estimation technique is along the lines of the second Lyapunov approach. As an illustrative example, the potential of the presented results is demonstrated for the system which describes a ball vertically bouncing on a sinusoidally vibrating table. For this system, we provide an analytical computation of a closed-form expression for the threshold that separates the channel data rates for which reliable observation is and is not possible, respectively. Another illustration is concerned with the celebrated Hénon system. The offered sufficient data rate bound is accompanied with a constructive observer that works whenever the channel capacity fits this bound.

    AB - The paper deals with observation of nonlinear and deterministic, though maybe chaotic, discrete-time systems via finite capacity communication channels. We introduce several minimum data-rate limits associated with various types of observability, and offer new tractable analytical techniques for their both upper and lower estimation. Whereas the lower estimate is obtained by following the lines of the Lyapunov's linearization method, the proposed upper estimation technique is along the lines of the second Lyapunov approach. As an illustrative example, the potential of the presented results is demonstrated for the system which describes a ball vertically bouncing on a sinusoidally vibrating table. For this system, we provide an analytical computation of a closed-form expression for the threshold that separates the channel data rates for which reliable observation is and is not possible, respectively. Another illustration is concerned with the celebrated Hénon system. The offered sufficient data rate bound is accompanied with a constructive observer that works whenever the channel capacity fits this bound.

    KW - Entropy

    KW - Lyapunov function

    KW - Nonlinear systems

    UR - http://www.scopus.com/inward/record.url?scp=84964317869&partnerID=8YFLogxK

    U2 - 10.1016/j.automatica.2016.04.005

    DO - 10.1016/j.automatica.2016.04.005

    M3 - Article

    VL - 70

    SP - 217

    EP - 229

    JO - Automatica

    JF - Automatica

    SN - 0005-1098

    ER -