Loading…
Reachable Set Analysis for Dynamic Neural Networks with Polytopic Uncertainties
In this paper,the reachable set estimation problem is studied for a class of dynamic neural networks subject to polytopic uncertainties.The problem addressed here is to find a set as small as possible to bound the states starting from the origin by inputs with peak values.The maximal Lyapunov functi...
Saved in:
Published in: | Communications in theoretical physics 2012-05, Vol.57 (5), p.904-908 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper,the reachable set estimation problem is studied for a class of dynamic neural networks subject to polytopic uncertainties.The problem addressed here is to find a set as small as possible to bound the states starting from the origin by inputs with peak values.The maximal Lyapunov functional is proposed to derive a sufficient condition for the existence of a non-ellipsoidal bound to estimate the states of neural networks.It is theoretically shown that this method is superior to the traditional one based on the common Lyapunov function.Finally,two examples illustrate the advantages of our proposed result. |
---|---|
ISSN: | 0253-6102 |
DOI: | 10.1088/0253-6102/57/5/23 |