Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2411.07570 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915032122523648 |
|---|---|
| author | Sun, Mingxuan Li, Xing Wang, Han |
| author_facet | Sun, Mingxuan Li, Xing Wang, Han |
| contents | When facing time-variant problems in analog computing, the desirable RNN design requires finite-time convergence and robustness with respect to various types of uncertainties, due to the time-variant nature and difficulties in implementation. It is very worthwhile to explore terminal zeroing neural networks, through examining and applying available attracting laws. In this paper, from a control-theoretic point of view, an error recurrence system approach is presented by equipping with uncertainty compensation in the pre-specified error dynamics, capable of enhancing robustness properly. Novel rectifying actions are designed to make finite-time settling so that the convergence speed and the computing accuracy of time-variant computing can be improved. Double-power and power-exponential rectifying actions are respectively formed to construct specific models, while the particular expressions of settling time function for the former are presented, and for the latter the proximate settling-time estimations are given, with which the fixed-time convergence of the corresponding models is in turn established. Moreover, the uncertainty compensation by the signum/smoothing-signum techniques are adopted for finite-duration stabilization. Theoretical results are presented to demonstrate effectiveness (involving fixed-time convergence and robustness) of the proposed computing schemes for the time-variant QP problem solving. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_07570 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Constructive RNNs: An Error-Recurrence Perspective on Time-Variant Zero Finding Problem Solving Under Uncertainty Sun, Mingxuan Li, Xing Wang, Han Systems and Control When facing time-variant problems in analog computing, the desirable RNN design requires finite-time convergence and robustness with respect to various types of uncertainties, due to the time-variant nature and difficulties in implementation. It is very worthwhile to explore terminal zeroing neural networks, through examining and applying available attracting laws. In this paper, from a control-theoretic point of view, an error recurrence system approach is presented by equipping with uncertainty compensation in the pre-specified error dynamics, capable of enhancing robustness properly. Novel rectifying actions are designed to make finite-time settling so that the convergence speed and the computing accuracy of time-variant computing can be improved. Double-power and power-exponential rectifying actions are respectively formed to construct specific models, while the particular expressions of settling time function for the former are presented, and for the latter the proximate settling-time estimations are given, with which the fixed-time convergence of the corresponding models is in turn established. Moreover, the uncertainty compensation by the signum/smoothing-signum techniques are adopted for finite-duration stabilization. Theoretical results are presented to demonstrate effectiveness (involving fixed-time convergence and robustness) of the proposed computing schemes for the time-variant QP problem solving. |
| title | Constructive RNNs: An Error-Recurrence Perspective on Time-Variant Zero Finding Problem Solving Under Uncertainty |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2411.07570 |