Estimation for decentralized safety control under communication delay and measurement uncertainty

International audienceThis paper addresses the design of a decentralized safety controller for two agents, subject to communication delay and imperfect measurements. The control objective is to ensure safety, meaning that the state of the two-agent system does not enter an undesired set in the state space. Assuming that we know a feedback map designed for the delay free-case, we propose a state estimation strategy which guarantees control agreement between the two agents. We present an estimation technique for bounded communication delays, assuming that the agents share the same internal clock, and extend it for infinitely-distributed communication delays by determining a lower bound for the probability of safety. We also explain how the proposed approach can be extended to a general system of N agents and discuss efficient computation of our estimation strategy. Performance of the controller and relevance of the proposed approach are discussed in light of simulations performed for a collision avoidance problem between two semi-autonomous vehicles at an intersection

Estimation for decentralized safety control under communication delay and measurement uncertainty

This paper addresses the design of a decentralized safety controller for two agents, subject to communication delay and imperfect measurements. The control objective is to ensure safety, meaning that the state of the two-agent system does not enter an undesired set in the state space. Assuming that we know a feedback map designed for the delay free-case, we propose a state estimation strategy which guarantees control agreement between the two agents. We present an estimation technique for bounded communication delays, assuming that the agents share the same internal clock, and extend it for infinitely-distributed communication delays by determining a lower bound for the probability of safety. We also explain how the proposed approach can be extended to a general system of N agents and discuss efficient computation of our estimation strategy. Performance of the controller and relevance of the proposed approach are discussed in light of simulations performed for a collision avoidance problem between two semi-autonomous vehicles at an intersection. Keywords: Multi-agent systems; Communication delay; Estimation/prediction approaches; Safety contro

Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation

Sensor networks potentially feature large numbers of nodes that can sense their environment over time, communicate with each other over a wireless network, and process information. They differ from data networks in that the network as a whole may be designed for a specific application. We study the theoretical foundations of such large scale sensor networks, addressing four fundamental issues- connectivity, capacity, clocks and function computation. To begin with, a sensor network must be connected so that information can indeed be exchanged between nodes. The connectivity graph of an ad-hoc network is modeled as a random graph and the critical range for asymptotic connectivity is determined, as well as the critical number of neighbors that a node needs to connect to. Next, given connectivity, we address the issue of how much data can be transported over the sensor network. We present fundamental bounds on capacity under several models, as well as architectural implications for how wireless communication should be organized. Temporal information is important both for the applications of sensor networks as well as their operation.We present fundamental bounds on the synchronizability of clocks in networks, and also present and analyze algorithms for clock synchronization. Finally we turn to the issue of gathering relevant information, that sensor networks are designed to do. One needs to study optimal strategies for in-network aggregation of data, in order to reliably compute a composite function of sensor measurements, as well as the complexity of doing so. We address the issue of how such computation can be performed efficiently in a sensor network and the algorithms for doing so, for some classes of functions.Comment: 10 pages, 3 figures, Submitted to the Proceedings of the IEE

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

H∞ fault estimation with randomly occurring uncertainties, quantization effects and successive packet dropouts: The finite-horizon case

In this paper, the finite-horizon H∞ fault estimation problem is investigated for a class of uncertain nonlinear time-varying systems subject to multiple stochastic delays. The randomly occurring uncertainties (ROUs) enter into the system due to the random fluctuations of network conditions. The measured output is quantized by a logarithmic quantizer before being transmitted to the fault estimator. Also, successive packet dropouts (SPDs) happen when the quantized signals are transmitted through an unreliable network medium. Three mutually independent sets of Bernoulli-distributed white sequences are introduced to govern the multiple stochastic delays, ROUs and SPDs. By employing the stochastic analysis approach, some sufficient conditions are established for the desired finite-horizon fault estimator to achieve the specified H∞ performance. The time-varying parameters of the fault estimator are obtained by solving a set of recursive linear matrix inequalities. Finally, an illustrative numerical example is provided to show the effectiveness of the proposed fault estimation approach