Weight Try-Once-Discard Protocol-Based L_2 L_infinity State Estimation for Markovian Jumping Neural Networks with Partially Known Transition Probabilities
It was the L_2 L_infinity performance index that for the first time is initiated into the discussion on state estimation of delayed MJNNs with with partially known transition probabilities, which provides a more general promotion for the estimation error.The WTOD protocol is adopted to dispatch the sensor nodes so as to effectively alleviate the updating frequency of output signals. The hybrid effects of the time delays, Markov chain, and protocol parameters are apparently reflected in the co-designed estimator which can be solved by a combination of comprehensive matrix inequalities.
Code (0)
등록된 구현이 없습니다.
Tasks
State EstimationSimilar Papers 제목 키워드 기반
Lore: Repurposing Git Commit Messages as a Structured Knowledge Protocol for AI Coding Agents
As AI coding agents become both primary producers and consumers of source code, the software industry faces an accelerating loss of institutional knowledge. Each commit captures a code diff but discards the reasoning beh…
Uniform Convergence Rates for Lipschitz Learning on Graphs
Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uni…
Resilient Autonomous Control of Distributed Multi-agent Systems in Contested Environments
An autonomous and resilient controller is proposed for leader-follower multi-agent systems under uncertainties and cyber-physical attacks. The leader is assumed non-autonomous with a nonzero control input, which allows c…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Conquering High Packet-Loss Erasure: MoE Swin Transformer-Based Video Semantic Communication
Semantic communication with joint semantic-channel coding robustly transmits diverse data modalities but faces challenges in mitigating semantic information loss due to packet drops in packet-based systems. Under current…
Semantic CommunicationConvex Analysis at Infinity: An Introduction to Astral Space
Not all convex functions on $\mathbb{R}^n$ have finite minimizers; some can only be minimized by a sequence as it heads to infinity. In this work, we aim to develop a theory for understanding such minimizers at infinity.…
All