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

02/06/2020
∙
by   Atreyee Kundu, et al.
∙
0
∙

We present an algorithm to compute stabilizing minimum dwell times for discrete-time switched linear systems without the knowledge of mathematical models of their subsystems. Given a simulation model from which finite traces of state trajectories of the subsystems can be collected, our algorithm involves the following tasks: first, a set of data that satisfies certain properties is collected by performing simulation experiments, second, multiple Lyapunov functions are designed from the above data and a set of relevant scalars is computed from these functions, and third, a stabilizing minimum dwell time is determined as a function of these scalars. A numerical example is presented to demonstrate the proposed algorithm.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment