Multi-Objective optimization of Sensor Placement in a 3D Body for Underwater Localization

Accurate localization is a critical task in underwater navigation. Typical localization methods use a set of acoustic sensors and beacons to estimate relative position, whose geometric configuration has a significant impact on the localization accuracy. Although there is much effort in the literature to define optimal 2D or 3D sensor placement, the optimal sensor placement in irregular and constrained 3D surfaces, such as autonomous underwater vehicles (AUVs) or other structures, is not exploited for improving localization. Additionally, most applications using AUVs employ commercial acoustic modems or compact arrays, therefore the optimization of the placement of spatially independent sensors is not a considered issue. This article tackles acoustic sensor placement optimization in irregular and constrained 3D surfaces, for inverted ultra-short baseline (USBL) approaches, to improve localization accuracy. The implemented multi-objective memetic algorithm combines an evaluation of the geometric sensor's configuration, using the Cramer-Rao Lower Bound (CRLB), with the incidence angle of the received signal. A case study is presented over a simulated homing and docking scenario to demonstrate the proposed optimization algorithm.

In an increasing number of scientific and commercial mission scenarios at sea, it is required to simultaneously localize a group of underwater targets. The latter may include moored systems, autonomous vehicles, and even human divers. For reasons that have to do with the unavailability of Global Positioning System underwater, cost reduction, and simplicity of operation, there is currently a surge of interest in the development of range-based multiple target localization systems that rely on the computation of the distances between the targets and a number of sensor nodes deployed at the ocean surface, equipped with acoustic range measuring devices. In the case of a single target, there is a wealth of literature on the problem of optimal acoustic sensor placement to maximize the information available for target localization using trilateration methods. In the case of multiple targets, however, the literature is scarce. Motivated by these considerations, we address the problem of optimal sensor placement for multiple underwater target positioning. In this setup, we are naturally led to a multiple objective optimization problem, the solution of which allows for the analysis of the trade-offs involved in the localization of the targets simultaneously. To this end, we resort to tools from estimation theory and multi-objective optimization. For each target, the function to be minimized (by proper choice of the sensor configuration) is related to the determinant of the corresponding Fisher information matrix, which yields information on the minimum possible covariance of the error with which the position of the target can be estimated using any non-biased estimator. To deal with the fact that more than one target is involved, we exploit the concept of multiple objective Pareto-optimal solutions to characterize the best possible accuracy with which each of the targets can be positioned, given constraints on the desired positioning accuracy of the other targets. Simulation examples illustrate how, for a three-sensor network and two targets, it is possible to define an optimal sensor configuration that yields large positioning accuracy for both targets simultaneously, using convex optimization tools. When more than two targets are involved, however, more than three sensors are required to exploit an adequate trade-off of the accuracy with which each target can be positioned by resorting to non-convex and Pareto-optimization tools. We show how in this case the optimal sensor configurations depend on the Pareto weights assigned to each of the targets, as well as on the number of sensors, the number of targets, and the uncertainty with which the positions of the targets are known a priori.

The optimal placement method of sensors is carried out based on improved genetic algorithm for solving the sensors optimal placement problem of the health monitoring system for long-span railway bridge. Dual structure coding method is introduced to improve the individual encoding method in the Genetic Algorithm. Adaptive partial matching crossover and inversus mutation method is adopted in the optimal preservation strategy, and the probabilities of crossover and mutation are changed automatically according to the fitness value for obtaining the global optimal solution of the sensor placement. So some defects in other Genetic Algorithm applied in the optimal placement of sensors for major bridge structure, such as slow convergence speed and easily falling into local optimum etc., are overcome, and the convergence is ensured. Then the optimal sensors placement of the health monitoring system for one certain long-span railway steel truss cable-stayed bridge is taken as the example to verify the proposed improved genetic algorithm. The result shows that the proposed method has better global optimization, computational efficiency and reliability in compare with the Simple Genetic Algorithm and General Genetic Algorithm, and can be applied to the actual railway cable-stayed bridge health monitoring system for the optimal sensors placement.

This article addresses the problem of moving source localization in 3-D using the time-difference-of-arrival and frequency-difference-of-arrival measurements without accurate sensor location information. Different from the previous studies, we focus on improving the localization performance by introducing two approaches with a limited number of sensors, including optimal sensor placement and velocity configuration, as well as successive measurements for a time period. This article first determines the sensor placement and velocity (including speed and orientation) configuration to achieve optimal localization based on a criterion devised from the Fisher information matrix, in which the restrictions for the two-stage weighted-least-squares (TSWLS) positioning algorithm and the geographical conditions are taken into considerations. Then, to utilize successive measurements while the source is in motion, we separate the sensor velocity into two components for achieving the localization optimality and compensating the source motion, and propose a practical sensor placement and velocity configuration strategy. Finally, combining with the TSWLS-based prelocalization, Kalman filtering and the proposed sensor motion strategy, we develop a source tracking scheme that simultaneously obeys the optimal sensor placement and velocity configuration during tracking. Mathematical analyses and numerical simulations validate the optimal sensor placement and the efficiencies of the source tracking scheme.

Performance-based optimal sensor placement method for single-layer reticulated shells considering modal observability and damage identifiability

Optimal sensor placement is an important yet unsolved problem in control theory. In biological organisms, genetic activity is often highly nonlinear, making it difficult to design libraries of promoters to act as reporters of the cell state. We make use of the Koopman observability gramian to develop an algorithm for optimal sensor (or reporter) placement for discrete time nonlinear dynamical systems to ease the difficulty of design of the promoter library. This ease is enabled due to the fact that the Koopman operator represents the evolution of a nonlinear system linearly by lifting the states to an infinite-dimensional space of observables. The Koopman framework ideally demands high temporal resolution, but data in biology are often sampled sparsely in time. Therefore we compute what we call the temporally fine-grained Koopman operator from the temporally coarse-grained Koopman operator, the latter of which is identified from the sparse data. The optimal placement of sensors then corresponds to maximizing the observability of the fine-grained system. We demonstrate the algorithm on a simulation example of a circadian oscillator.

Inspired by recent advances in multistatic radar systems, the problem of sensor placement is investigated. Our study is motivated by the fact that it is not always clear what the placement of the radars giving the best performance for the targets of interest might be. To account for the issue, we derive the multistatic Cramer-Rao lower bounds (CRLBs) for range and velocity estimation as the fitness function. Then we use genetic algorithms (GAs) to perform the optimized sensor placement as one of global optimization. The simulation example indicates that our proposed approach is a flexible and effective tool and is capable of suggesting optimal sensor placement strategies to meet required radar performance goals.

A novel tensor-based modal decomposition method for reduced order modeling and optimal sparse sensor placement

Localization is the key perceptual process closing the loop of autonomous navigation, allowing self-driving vehicles to operate in a deliberate way. To ensure robust localization, autonomous vehicles have to implement redundant estimation processes, ideally independent in terms of the underlying physics behind sensing principles. This paper presents a stereo radar odometry system, which can be used as such a redundant system, complementary to other odometry estimation processes, providing robustness for long-term operability. The presented work is novel with respect to previously published methods in that it contains: (i) a detailed formulation of the Doppler error and its associated uncertainty; (ii) an observability analysis that gives the minimal conditions to infer a 2D twist from radar readings; and (iii) a numerical analysis for optimal vehicle sensor placement. Experimental results are also detailed that validate the theoretical insights.

The mechanical design of wind turbines requires a profound understanding of the dynamic behaviour. Even though highly detailed simulation models are already in use to support wind turbine design, modal testing on a real prototype is irreplaceable to identify site-specific conditions such as the stiffness of the tower foundation. Correct identification of the mode shapes of a complex mechanical structure much depends on the placement of the sensors. For operational modal analysis of a 3 MW wind turbine with a 120 m rotor on a 100 m tower developed by W2E Wind to Energy, algorithms for optimal placement of acceleration sensors are applied. The mode shapes used for the optimisation are calculated by means of a detailed flexible multibody model of the wind turbine. Among the three algorithms in this study, the genetic algorithm with weighted off-diagonal criterion yields the sensor configuration with the highest quality. The ongoing measurements on the prototype will be the basis for the development of optimised wind turbine designs.

Structural health monitoring plays an increasingly significant role in detecting damages for large and complex structures to ensure their serviceability and sustainability. Optimal sensor placement is critical in the structural health monitoring system as the sensor configuration directly impacts the quality of collected data used for structural health diagnosis. Therefore, this study presents a comprehensive review of computational methodologies for optimal sensor placement in structural health monitoring. The problem formulation of optimal sensor placement is first introduced, including commonly used evaluation criteria for sensor configurations. Then, various existing optimization methodologies for sensor placement are summarized and introduced in detail, especially for the evolutionary algorithms and their improved variants. Finally, the suitability of computational methods for specific structural health monitoring applications is also discussed. The main goal of this study is to deliver a comprehensive reference of computational methodologies for optimal sensor placement in structural health monitoring studies and applications. This article is concluded by highlighting the most widely utilized evaluation criteria and optimization methodologies for sensor configuration determination.

The Environmental Awareness for Sensor and Emitter Employment (EASEE) software is designed to help in surveillance planning by predicting detection performance of sensors and optimizing sensor selection and placement for intrusion detection around any controlled area, including power plants, dams, borders, prisons, military bases, combat outposts, etc. By its flexible, object-oriented software architecture, EASEE can simulate the performance of a wide variety of sensor modalities-including optical, acoustic, seismic, magnetic, radio-frequency, chemical, and biological-in the realistic terrain and weather conditions of the surveillance environment. EASEE characterizes complex terrain and weather effects on target signatures, signal propagation, and sensor systems, using an expansive library of realistic physics models. Statistical methodologies are also used to account for uncertainties from random signal-generation and propagation mechanisms. A built-in sensor placement algorithm optimizes sensor selections and placements based on sensor supply limitations, coverage priorities, overlapping sensor coverage preferences, and wireless sensor communication requirements.

Source localization is a fundamental problem in underwater wireless sensor networks. From the observability analysis, we know that the sensor placement can significantly affect the localization performance. This letter is concerned with the optimal sensor placement for underwater source localization, and a parameter is introduced into the measurement model to represent the distance-dependent noise. The evaluation criterion used to solve the optimal placement is built by the Cramer-Rao lower bound theory. Subsequently, we mainly discuss the case when the distances between the sensors and the source are fixed, and the optimal sensor placement is affected by the relative magnitude of the distances.

Blasts can produce, in a very short time, an overload much greater than the design load of a building. The blast explosion nearby or within structures causes catastrophic damage to the building both externally and internally. This study intends to model a Cold-Formed Steel (CFS) building using Finite Element Method (FEM) in which material properties of the model are defined according to results of performed laboratory tests. Then accelerograph record of a standard blast was applied to the Finite Element (FE) model. Furthermore, various Optimal Sensor Placement (OSP) algorithms were used and Genetic Algorithm (GA) was selected to act as the solution of the optimization formulation in selection of the best sensor placement according to the blast loading response of the system. In this research a novel numerical algorithm was proposed for OSP procedure which utilizes the exact value of the structural response under blast excitation. Results show that with a proper OSP method for Structural Health Monitoring (SHM) can detect the weak points of CFS structures in different parts efficiently.

Given a water distribution network, where should we place sensors toquickly detect contaminants? Or, which blogs should we read to avoid missing important stories?.These seemingly different problems share common structure: Outbreak detection can be modeled as selecting nodes (sensor locations, blogs) in a network, in order to detect the spreading of a virus or information asquickly as possible. We present a general methodology for near optimal sensor placement in these and related problems. We demonstrate that many realistic outbreak detection objectives (e.g., detection likelihood, population affected) exhibit the property of submodularity. We exploit submodularity to develop an efficient algorithm that scales to large problems, achieving near optimal placements, while being 700 times faster than a simple greedy algorithm. We also derive online bounds on the quality of the placements obtained by any algorithm. Our algorithms and bounds also handle cases where nodes (sensor locations, blogs) have different costs.We evaluate our approach on several large real-world problems,including a model of a water distribution network from the EPA, andreal blog data. The obtained sensor placements are provably near optimal, providing a constant fraction of the optimal solution. We show that the approach scales, achieving speedups and savings in storage of several orders of magnitude. We also show how the approach leads to deeper insights in both applications, answering multicriteria trade-off, cost-sensitivity and generalization questions.