English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We present an algorithm to compute stabilizing minimum dwell times fordiscrete-time switched linear systems without the explicit knowledge ofstate-space models of their subsystems. Given a set of finite traces of statetrajectories of the subsystems that satisfies certain properties, our algorithminvolves the following tasks: first, multiple Lyapunov functions are designedfrom the given data; second, a set of relevant scalars is computed from thesefunctions; and third, a stabilizing minimum dwell time is determined as afunction of these scalars. A numerical example is presented to demonstrate theproposed algorithm.

Data-based computation of stabilizing minimum dwell times for discrete-time switched linear systems