TY - JOUR
T1 - Protocol-Based State Estimation for a Type of Delayed Neural Networks Subject to Probability Constraint
AU - Yang, Juanjuan
AU - Ma, Lifeng
AU - Chen, Yonggang
AU - Yi, Xiaojian
N1 - Publisher Copyright:
© 2026 by the authors.
PY - 2026
Y1 - 2026
N2 - This article discusses the state estimation issue for a type of delayed neural networks (NNs). The investigated NN systems are assumed to face adversarial threats which posed on the data propagation process. Also, the information transmission delays between the sensor and estimator are taken into consideration. Moreover, with hope to better characterize the real-world situations, a constraint is posed on the measurement output by using a saturation function. The purpose of this article is to provide a framework for estimation of the state of NNs, ensuring that the estimation error is enforced not to escape a specific range in probability not less than a predetermined value. With the hope to coordinate the information propagation, the so-called Round-Robin protocol is used in the signal transmission channel. The main results are obtained by virtue of convex optimization algorithms, where the requested estimator parameters can be computed by solving the provided inequalities. On basis of the acquired main results, we further proceed to seek the locally optimal parameters according to different engineering demands. At last, the main theoretical results as well as the design method are demonstrated via an example.
AB - This article discusses the state estimation issue for a type of delayed neural networks (NNs). The investigated NN systems are assumed to face adversarial threats which posed on the data propagation process. Also, the information transmission delays between the sensor and estimator are taken into consideration. Moreover, with hope to better characterize the real-world situations, a constraint is posed on the measurement output by using a saturation function. The purpose of this article is to provide a framework for estimation of the state of NNs, ensuring that the estimation error is enforced not to escape a specific range in probability not less than a predetermined value. With the hope to coordinate the information propagation, the so-called Round-Robin protocol is used in the signal transmission channel. The main results are obtained by virtue of convex optimization algorithms, where the requested estimator parameters can be computed by solving the provided inequalities. On basis of the acquired main results, we further proceed to seek the locally optimal parameters according to different engineering demands. At last, the main theoretical results as well as the design method are demonstrated via an example.
KW - Round-Robin protocol
KW - deception attacks
KW - delayed neural networks
KW - probability constraint
KW - sensor saturations
UR - https://www.scopus.com/pages/publications/105041563271
U2 - 10.53941/ijndi.2026.100008
DO - 10.53941/ijndi.2026.100008
M3 - Article
AN - SCOPUS:105041563271
SN - 2653-6226
VL - 5
JO - International Journal of Network Dynamics and Intelligence
JF - International Journal of Network Dynamics and Intelligence
IS - 2
M1 - 8
ER -