A review on analysis and synthesis of nonlinear stochastic systems with randomly occurring incomplete information

Copyright q 2012 Hongli Dong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In the context of systems and control, incomplete information refers to a dynamical system in which knowledge about the system states is limited due to the difficulties in modeling complexity in a quantitative way. The well-known types of incomplete information include parameter uncertainties and norm-bounded nonlinearities. Recently, in response to the development of network technologies, the phenomenon of randomly occurring incomplete information has become more and more prevalent. Such a phenomenon typically appears in a networked environment. Examples include, but are not limited to, randomly occurring uncertainties, randomly occurring nonlinearities, randomly occurring saturation, randomly missing measurements and randomly occurring quantization. Randomly occurring incomplete information, if not properly handled, would seriously deteriorate the performance of a control system. In this paper, we aim to survey some recent advances on the analysis and synthesis problems for nonlinear stochastic systems with randomly occurring incomplete information. The developments of the filtering, control and fault detection problems are systematically reviewed. Latest results on analysis and synthesis of nonlinear stochastic systems are discussed in great detail. In addition, various distributed filtering technologies over sensor networks are highlighted. Finally, some concluding remarks are given and some possible future research directions are pointed out. © 2012 Hongli Dong et al.This work was supported in part by the National Natural Science Foundation of China under Grants 61273156, 61134009, 61273201, 61021002, and 61004067, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, the National Science Foundation of the USA under Grant No. HRD-1137732, and the Alexander von Humboldt Foundation of German

Event-based H∞ consensus control of multi-agent systems with relative output feedback: The finite-horizon case

In this technical note, the H∞ consensus control problem is investigated over a finite horizon for general discrete time-varying multi-agent systems subject to energy-bounded external disturbances. A decentralized estimation-based output feedback control protocol is put forward via the relative output measurements. A novel event-based mechanism is proposed for each intelligent agent to utilize the available information in order to decide when to broadcast messages and update control input. The aim of the problem addressed is to co-design the time-varying controller and estimator parameters such that the controlled multi-agent systems achieve consensus with a disturbance attenuation level γ over a finite horizon [0,T]. A constrained recursive Riccati difference equation approach is developed to derive the sufficient conditions under which the H∞ consensus performance is guaranteed in the framework of event-based scheme. Furthermore, the desired controller and estimator parameters can be iteratively computed by resorting to the Moore-Penrose pseudo inverse. Finally, the effectiveness of the developed event-based H∞ consensus control strategy is demonstrated in the numerical simulation

Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Semi-global leader-following consensus of linear multi-agent systems with input saturation via low gain feedback

published_or_final_versio

Bibliographic Review on Distributed Kalman Filtering

In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area

Active Perception by Interaction with Other Agents in a Predictive Coding Framework: Application to Internet of Things Environment

Predicting the state of an agent\u27s partially-observable environment is a problem of interest in many domains. Typically in the real world, the environment consists of multiple agents, not necessarily working towards a common goal. Though the goal and sensory observation for each agent is unique, one agent might have acquired some knowledge that may benefit the other. In essence, the knowledge base regarding the environment is distributed among the agents. An agent can sample this distributed knowledge base by communicating with other agents. Since an agent is not storing the entire knowledge base, its model can be small and its inference can be efficient and fault-tolerant. However, the agent needs to learn -- when, with whom and what -- to communicate (in general interact) under different situations.This dissertation presents an agent model that actively and selectively communicates with other agents to predict the state of its environment efficiently. Communication is a challenge when the internal models of other agents is unknown and unobservable. The proposed agent learns communication policies as mappings from its belief state to when, with whom and what to communicate. The policies are learned using predictive coding in an online manner, without any reinforcement. The proposed agent model is evaluated on widely-studied applications, such as human activity recognition from multimodal, multisource and heterogeneous sensor data, and transferring knowledge across sensor networks. In the applications, either each sensor or each sensor network is assumed to be monitored by an agent. The recognition accuracy on benchmark datasets is comparable to the state-of-the-art, even though our model has significantly fewer parameters and infers the state in a localized manner. The learned policy reduces number of communications. The agent is tolerant to communication failures and can recognize the reliability of each agent from its communication messages. To the best of our knowledge, this is the first work on learning communication policies by an agent for predicting the state of its environment

Coordination schemes for distributed boundary coverage with a swarm of miniature robots:synthesis, analysis and experimental validation

We provide a comparison of a series of original coordination mechanisms for the distributed boundary coverage problem with a swarm of miniature robots. Our analysis is based on real robot experimentation and models at different levels of abstraction. Distributed boundary coverage is an instance of the distributed coverage problem and has applications such as inspection of structures, de-mining, cleaning, and painting. Coverage is a particularly good example for the benefits of a multi-robot approach due to the potential for parallel task execution and additional robustness out of redundancy. The constraints imposed by a potential application, the autonomous inspection of a jet turbine engine, were our motivation for the algorithms considered in this thesis. Thus, there is particular emphasis on how algorithms perform under the influence of sensor and actuator noise, limited computational and communication capabilities, as well as on the policies about how to cope with such problems. The algorithms developed in this dissertation can be classified into reactive and deliberative algorithms, as well as non-collaborative and collaborative algorithms. The performance of these algorithms ranges from very low to very high, corresponding to highly redundant coverage to near-optimal partitioning of the environments, respectively. At the same time, requirements and assumptions on the robotic platform and the environment (from no communication to global communication, and from no localization to global localization) are incrementally raised. All the algorithms are robust to sensor and actuator noise and gracefully decay to the performance of a randomized algorithm as a function of an increased noise level and/or additional hardware constraints. Although the deliberative algorithms are fully deterministic, the actual performance is probabilistic due to inevitable sensor and actuator noise. For this reason, probabilistic models are used for predicting time to complete coverage and take into account sensor and actuator noise calibrated by using real hardware. For reactive systems with limited memory, the performance is captured using a compact representation based on rate equations that track the expected number of robots in a certain state. As the number of states explode for the deliberative algorithms that require a substantial use of memory, this approach becomes less tractable with the amount of deliberation performed, and we use Discrete Event System (DES) simulation in these cases. Our contribution to the domain of multi-robot systems is three-fold. First, we provide a methodology for system identification and optimal control of a robot swarm using probabilistic models. Second, we develop a series of algorithms for distributed coverage by a team of miniature robots that gracefully decay from a near-optimal performance to the performance of a randomized approach under the influence of sensor and actuator noise. Third, we design an implement a miniature inspection platform based on the miniature robot Alice with ZigBee ready communication capabilities and color vision on a foot-print smaller than 2 × 2 × 3 cm3