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

This paper deals with stabilization of discrete-time switched linear systemswhen explicit knowledge of the state-space models of their subsystems is notavailable. Given the set of admissible switches between the subsystems, theadmissible dwell times on the subsystems and a set of finite traces of statetrajectories of the subsystems that satisfies certain properties, we devise analgorithm that designs periodic switching logics which preserve stability ofthe resulting switched system. We combine two ingredients: (a) data-basedstability analysis of discrete-time linear systems and (b) multipleLyapunov-like functions and graph walks based design of stabilizing switchinglogics, for this purpose. A numerical example is presented to demonstrate theproposed algorithm.

Data-driven switching logic design for switched linear systems