A Survey on Multisensor Fusion and Consensus Filtering for Sensor Networks

Multisensor fusion and consensus filtering are two fascinating subjects in the research of sensor networks. In this survey, we will cover both classic results and recent advances developed in these two topics. First, we recall some important results in the development ofmultisensor fusion technology. Particularly, we pay great attention to the fusion with unknown correlations, which ubiquitously exist in most of distributed filtering problems. Next, we give a systematic review on several widely used consensus filtering approaches. Furthermore, some latest progress on multisensor fusion and consensus filtering is also presented. Finally, conclusions are drawn and several potential future research directions are outlined.the Royal Society of the UK, the National Natural Science Foundation of China under Grants 61329301, 61374039, 61304010, 11301118, and 61573246, the Hujiang Foundation of China under Grants C14002 and D15009, the Alexander von Humboldt Foundation of Germany, and the Innovation Fund Project for Graduate Student of Shanghai under Grant JWCXSL140

Self organizing distributed state estimators

Distributed solutions for signal processing techniques are important for establishing large-scale monitoring and control applications. They enable the deployment of scalable sensor networks for particular application areas. Typically, such networks consists of a large number of vulnerable components connected via unreliable communication links and are sometimes deployed in harsh environment. Therefore, dependability of sensor network is a challenging problem. An efficient and cost effective answer to this challenge is provided by employing runtime reconfiguration techniques that assure the integrity of the desired signal processing functionalities. Runtime reconfigurability has thorough impact both on system design, implementation, testing/validation and deployment. The presented research focuses on the widespreaded signal processing method known as state estimation with Kalman filtering in particular. To that extent, a number of distributed state estimation solutions that are suitable for networked systems in general are overviewed, after which robustness of the system is improved according to various runtime reconfiguration techniques

Distributed outer approximation of the intersection of ellipsoids

The outer Löwner-John method is widely used in sensor fusion applications to find the smallest ellipsoid that can approximate the intersection of a set of ellipsoids, described by positive definite covariance matrices modeling the quality of each sensor. We propose a distributed algorithm to solve this problem when these matrices are defined over the network’s nodes. This is of particular significance as it is the first decentralized algorithm capable of computing the covariance intersection ellipsoid by combining information from the entire network using only local interactions. The solution is based on a reformulation of the centralized problem, leading to a local protocol based on exact dynamic consensus tools. After reaching consensus, the protocol converges to an outer Löwner-John ellipsoid in finite time, and to the global optimum asymptotically. Formal convergence analysis and numerical experiments are provided to validate the proposal’s advantages

UK Rules For Unfired Pressure Vessels

The present code PD 5500, formerly BS 5500 [1] evolved partly from the well-known BS 1500 [2] in the 1950's and BS 1515 [3] first published in 1965; the latter permitted higher level allowable stresses and more advanced rules. In 1969, following a report from the Committee of Enquiry into the Pressure Vessel Industry, the British Standards Institution brought all the pressure vessel interests together under one general committee in order to rationalise the activity. This became PVE/ and presides over a large committee structure. There are a series of functional sub-committees who deal with specific aspects and a large number of technical committees as well as many additional sub committees and working groups. Most of these meet regularly. The technical committee PVE/1, Pressure Vessels, has overall responsibility for BS 5500. The functional committee PVE/1/15 Design Methods has an overall responsibility relating to 'Design' with particular reference to the design section of BS 5500 (Section 3). The first edition of BS 5500 was issued in 1976. The actual issue was delayed for some time because, in the early 1970's, there was an attempt in Europe to produce an international pressure vessel standard. A draft of the international standard appeared as ISO DIS 2694 [4] in 1973 but it was not generally accepted and the attempt was abandoned in the mid 70's. It was decided to use some of the material from 2694 within BS 5500 so that although the Standard was long delayed it benefited to some extent from the international efforts. Initially, committee PVE/l set out the concept of a "master" pressure vessel standard which could readily be applied to any vessel in either ferrous or non-ferrous materials and for highly specialised application with the minimum of supplementary requirements. The layout of BS 5500 is consistent with this concept and although the Standard has perhaps not fulfilled this high ideal, it has certainly been employed widely in many industries including non pressure vessel type applications. When issued it had a number of distinctive features compared with other pressure codes viz; weld joint factors were removed, the present three categories of construction were introduced, there was a new novel external pressure section, it has a loose leaf format and an annual updating was introduced. Further editions of BS 5500 have been issued every three years since 1982

A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding

Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a special case of the truncated moment problem in which only the zero-th order moment is known (i.e., the support). By writing the dual of the above semi-infinite linear programming problem, it is shown that, if the nonlinearities in the measurement and process equations are polynomial and if the bounding sets for initial state, process and measurement noises are described by polynomial inequalities, then an approximation of this semi-infinite linear programming problem can efficiently be obtained by using the theory of sum-of-squares polynomial optimization. We then derive a smart greedy procedure to compute a polytopic outer-approximation of the true membership-set, by computing the minimum-volume polytope that outer-bounds the set that includes all the means computed with respect to P

A scalable parallel finite element framework for growing geometries. Application to metal additive manufacturing

This work introduces an innovative parallel, fully-distributed finite element framework for growing geometries and its application to metal additive manufacturing. It is well-known that virtual part design and qualification in additive manufacturing requires highly-accurate multiscale and multiphysics analyses. Only high performance computing tools are able to handle such complexity in time frames compatible with time-to-market. However, efficiency, without loss of accuracy, has rarely held the centre stage in the numerical community. Here, in contrast, the framework is designed to adequately exploit the resources of high-end distributed-memory machines. It is grounded on three building blocks: (1) Hierarchical adaptive mesh refinement with octree-based meshes; (2) a parallel strategy to model the growth of the geometry; (3) state-of-the-art parallel iterative linear solvers. Computational experiments consider the heat transfer analysis at the part scale of the printing process by powder-bed technologies. After verification against a 3D benchmark, a strong-scaling analysis assesses performance and identifies major sources of parallel overhead. A third numerical example examines the efficiency and robustness of (2) in a curved 3D shape. Unprecedented parallelism and scalability were achieved in this work. Hence, this framework contributes to take on higher complexity and/or accuracy, not only of part-scale simulations of metal or polymer additive manufacturing, but also in welding, sedimentation, atherosclerosis, or any other physical problem where the physical domain of interest grows in time