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

Communication-protocol-based analysis and synthesis of networked systems: progress, prospects and challenges

In recent years, the communication-protocol-based synthesis and analysis issues have gained substantial research interest owing mainly to their significance in networked systems. In this work, we survey the control and filtering problems of networked systems under the effects induced by communication protocols. First, we introduce the engineering background of networked systems as well as the theoretical frameworks established to deal with the communication-protocol-based analysis and synthesis problems. Then, recent advances (especially the latest results) are reviewed on the stability analysis issue subject to protocol scheduling. Subsequently, the particular effort is devoted to presenting the latest progress on various communication-protocol-based control and filtering problems according to the characteristics of networked systems (e.g. time-varying nature, random behaviours, types of parameter uncertainties, and kinds of distributed structure). After that, we provide a systematic review of the communication-protocol-based fault diagnosis problems. Finally, some research challenges of communication-protocol-based control and filtering problems are outlined for future research

Fault estimation for time-varying systems with Round-Robin protocol

summary:This paper is concerned with the design problem of finite-horizon $H_\infty$ fault estimator for a class of nonlinear time-varying systems with Round-Robin protocol scheduling. The faults are assumed to occur in a random way governed by a Bernoulli distributed white sequence. The communication between the sensor nodes and fault estimators is implemented via a shared network. In order to prevent the data from collisions, a Round-Robin protocol is utilized to orchestrate the transmission of sensor nodes. By means of the stochastic analysis technique and the completing squares method, a necessary and sufficient condition is established for the existence of fault estimator ensuring that the estimation error dynamics satisfies the prescribed $H_\infty$ constraint. The time-varying parameters of fault estimator are obtained by recursively solving a set of coupled backward Riccati difference equations. A simulation example is given to demonstrate the effectiveness of the proposed design scheme of the fault estimator

Non-fragile estimation for discrete-time T-S fuzzy systems with event-triggered protocol

summary:This paper investigates the non-fragile state estimation problem for a class of discrete-time T-S fuzzy systems with time-delays and multiple missing measurements under event-triggered mechanism. First of all, the plant is subject to the time-varying delays and the stochastic disturbances. Next, a random white sequence, the element of which obeys a general probabilistic distribution defined on $[0,1]$, is utilized to formulate the occurrence of the missing measurements. Also, an event generator function is employed to regulate the transmission of data to save the precious energy. Then, a non-fragile state estimator is constructed to reflect the randomly occurring gain variations in the implementing process. By means of the Lyapunov-Krasovskii functional, the desired sufficient conditions are obtained such that the Takagi-Sugeno (T-S) fuzzy estimation error system is exponentially ultimately bounded in the mean square. And then the upper bound is minimized via the robust optimization technique and the estimator gain matrices can be calculated. Finally, a simulation example is utilized to demonstrate the effectiveness of the state estimation scheme proposed in this paper

On State Estimation for Discrete Time-Delayed Memristive Neural Networks Under the WTOD Protocol: A Resilient Set-Membership Approach

In this article, a resilient set-membership approach is put forward to deal with the state estimation problem for a sort of discrete-time memristive neural networks (DMNNs) with hybrid time delays under the weighted try-once-discard protocol (WTODP). The WTODP is utilized to mitigate unnecessary network congestion occurring in the channel between DMNNs and the state estimator. In order to ensure resilience against possible realization errors, the estimator gain is permitted to undergo some norm-bounded parameter drifts. Our objective is to design a resilient set-membership estimator (RSME) that is capable of resisting gain variations and unknown-but-bounded noises by confining the estimation error to certain ellipsoidal regions. By resorting to the recursive matrix inequality technique, sufficient conditions are acquired for the existence of the expected RSME and, subsequently, an optimization problem is formalized by minimizing the constraint ellipsoid (with respect to the estimation error) under WTODP. Finally, numerical simulation is carried out to validate the usefulness of RSME.10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61873058, 61873148 and 61933007); AHPU Youth Top-Notch Talent Support Program of China (Grant Number: 2018BJRC009); Natural Science Foundation of Universities in Anhui Province of China (Grant Number: gxyqZD2019053); Heilongjiang Postdoctoral Sustentation Fund of China (Grant Number: LBH-Z19048); Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany

Protocol-Based Tobit Kalman Filter under Integral Measurements and Probabilistic Sensor Failures

This paper is concerned with the Tobit Kalman filtering problem for a class of discrete time-varying systems subject to censored observations, integral measurements and probabilistic sensor failures under the Round-Robin protocol (RRP). The censored observations are characterized by the Tobit observation model, the integral measurements are described as functions of system states over a certain time interval required for data acquisition, and the sensor failures are governed by a set of uncorrelated random variables. The RRP is employed to decide the transmission sequence of sensors in order to alleviate undesirable data collisions. By resorting to the augmentation technique and the orthogonality projection principle, a protocol-based Tobit Kalman filter (TKF) is developed with the coexistence of integral measurements and sensor failures that lead to a couple of augmentation-induced terms. Moreover, the performance of the proposed filter is analyzed through examining the statistical property of the error covariance of the state estimation. Further analysis shows the existence of self-propagating upper and lower bounds on the estimation error covariance. A case study on ballistic roll rate estimation is presented to illustrate the efficacy of the developed filter.10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61803074, 61703245, U2030205, 61903065, 61671109, U1830207 and U1830133); 10.13039/501100002858-China Postdoctoral Science Foundation (Grant Number: 2018T110702, 2018M643441, 2017M623005 and 2015M5825); Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany

H∞ State Estimation for BAM Neural Networks With Binary Mode Switching and Distributed Leakage Delays Under Periodic Scheduling Protocol

Research and Development Office Ministry of Education Kingdom of Saudi Arabia (Grant Number: HIQI-2-2019); National Natural Science Foundation of China (Grant Number: 61903254)

Information fusion architectures for security and resource management in cyber physical systems

Data acquisition through sensors is very crucial in determining the operability of the observed physical entity. Cyber Physical Systems (CPSs) are an example of distributed systems where sensors embedded into the physical system are used in sensing and data acquisition. CPSs are a collaboration between the physical and the computational cyber components. The control decisions sent back to the actuators on the physical components from the computational cyber components closes the feedback loop of the CPS. Since, this feedback is solely based on the data collected through the embedded sensors, information acquisition from the data plays an extremely vital role in determining the operational stability of the CPS. Data collection process may be hindered by disturbances such as system faults, noise and security attacks. Hence, simple data acquisition techniques will not suffice as accurate system representation cannot be obtained. Therefore, more powerful methods of inferring information from collected data such as Information Fusion have to be used. Information fusion is analogous to the cognitive process used by humans to integrate data continuously from their senses to make inferences about their environment. Data from the sensors is combined using techniques drawn from several disciplines such as Adaptive Filtering, Machine Learning and Pattern Recognition. Decisions made from such combination of data form the crux of information fusion and differentiates it from a flat structured data aggregation. In this dissertation, multi-layered information fusion models are used to develop automated decision making architectures to service security and resource management requirements in Cyber Physical Systems --Abstract, page iv

Distributed consensus in multi-robot systems with visual perception

La idea de equipos de robots actuando con autonomía y de manera cooperativa está cada día más cerca de convertirse en realidad. Los sistemas multi robot pueden ejecutar tareas de gran complejidad con mayor robustez y en menos tiempo que un robot trabajando solo. Por otra parte, la coordinación de un equipo de robots introduce complicaciones que los ingenieros encargados de diseñar estos sistemas deben afrontar. Conseguir que la percepción del entorno sea consistente en todos los robots es uno de los aspectos más importantes requeridos en cualquier tarea cooperativa, lo que implica que las observaciones de cada robot del equipo deben ser transmitidas a todos los otros miembros. Cuando dos o más robots poseen información común del entorno, el equipo debe alcanzar un consenso usando toda la información disponible. Esto se debe hacer considerando las limitaciones de cada robot, teniendo en cuenta que no todos los robots se pueden comunicar unos con otros. Con este objetivo, se aborda la tarea de diseñar algoritmos distribuidos que consigan que un equipo de robots llegue a un consenso acerca de la información percibida por todos los miembros. Específicamente, nos centramos en resolver este problema cuando los robots usan la visión como sensor para percibir el entorno. Las cámaras convencionales son muy útiles a la hora de ejecutar tareas como la navegación y la construcción de mapas, esenciales en el ámbito de la robótica, gracias a la gran cantidad de información que contiene cada imagen. Sin embargo, el uso de estos sensores en un marco distribuido introduce una gran cantidad de complicaciones adicionales que deben ser abordadas si se quiere cumplir el objetivo propuesto. En esta Tesis presentamos un estudio profundo de los algoritmos distribuidos de consenso y cómo estos pueden ser usados por un equipo de robots equipados con cámaras convencionales, resolviendo los aspectos más importantes relacionados con el uso de estos sensores. En la primera parte de la Tesis nos centramos en encontrar correspondencias globales entre las observaciones de todos los robots. De esta manera, los robots son capaces de detectar que observaciones deben ser combinadas para el cálculo del consenso. También lidiamos con el problema de la robustez y la detección distribuida de espurios durante el cálculo del consenso. Para contrarrestar el incremento del tamaño de los mensajes intercambiados por los robots en las etapas anteriores, usamos las propiedades de los polinomios de Chebyshev, reduciendo el número de iteraciones que se requieren para alcanzar el consenso. En la segunda parte de la Tesis, centramos nuestra atención en los problemas de crear un mapa y controlar el movimiento del equipo de robots. Presentamos soluciones para alcanzar un consenso en estos escenarios mediante el uso de técnicas de visión por computador ampliamente conocidas. El uso de algoritmos de estructura y movimiento nos permite obviar restricciones tales como que los robots tengan que observarse unos a otros directamente durante el control o la necesidad de especificar un marco de referencia común. Adicionalmente, nuestros algoritmos tienen un comportamiento robusto cuando la calibración de las cámaras no se conoce. Finalmente, la evaluación de las propuestas se realiza utilizando un data set de un entorno urbano y robots reales con restricciones de movimiento no holónomas. Todos los algoritmos que se presentan en esta Tesis han sido diseñados para ser ejecutados de manera distribuida. En la Tesis demostramos de manera teórica las principales propiedades de los algoritmos que se proponen y evaluamos la calidad de los mismos con datos simulados e imágenes reales. En resumen, las principales contribuciones de esta Tesis son: • Un conjunto de algoritmos distribuidos que permiten a un equipo de robots equipados con cámaras convencionales alcanzar un consenso acerca de la información que perciben. En particular, proponemos tres algoritmos distribuidos con el objetivo de resolver los problemas de encontrar correspondencias globales entre la información de todos los robots, detectar y descartar información espuria, y reducir el número de veces que los robots tienen que comunicarse entre ellos antes de alcanzar el consenso. • La combinación de técnicas de consenso distribuido y estructura y movimiento en tareas de control y percepción. Se ha diseñado un algoritmo para construir un mapa topológico de manera cooperativa usando planos como características del mapa y restricciones de homografía como elementos para relacionar las observaciones de los robots. También se ha propuesto una ley de control distribuida utilizando la geometría epipolar con el objetivo de hacer que el equipo de robots alcance una orientación común sin la necesidad de observarse directamente unos a otros

ℓ<inf>2</inf>–ℓ<inf>∞</inf> proportional–integral observer design for systems with mixed time-delays under round–robin protocol

The Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah, Saudi Arabia, FP-21-42; National Natural Science Foundation of China, 61873148; 61873169; 61933007; Alexander von Humboldt Foundation of Germany