Next Article in Journal
Acoustic Detection Module Design of a Quartz-Enhanced Photoacoustic Sensor
Previous Article in Journal
A New Image Registration Algorithm Based on Evidential Reasoning
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Locating Hazardous Chemical Leakage Source Based on Cooperative Moving and Fixing Sensors

1
Automation, Hangzhou Dianzi University, Hangzhou 310000, China
2
Quzhou Juhua Polyamide Fibre LLC, Quzhou 324000, China
*
Author to whom correspondence should be addressed.
Sensors 2019, 19(5), 1092; https://doi.org/10.3390/s19051092
Submission received: 11 December 2018 / Revised: 22 February 2019 / Accepted: 25 February 2019 / Published: 4 March 2019
(This article belongs to the Section Sensor Networks)

Abstract

:
In dealing with sudden hazardous chemical leakage accidents, the key to solving the evacuation and transfer of personnel and important property is to determine the location of the leakage source and the information of the source strength to gauge the scope of the impact of leakage. The particle swarm optimization algorithm with an adaptive mutation factor is applied to the inverse calculation of leakage source strength to obtain the leakage source information, and the leakage source location problem is transformed into an optimization problem. The mobile sensor is then introduced into the fixed sensor network. The mobile sensor moving strategy based on an extended Kalman filter is proposed. The estimated value of the previous moment and the current time are used to update the estimation of the state variable, and then the mobile strategy is planned. The interference of the random error of the optimization algorithm on the path planning of the mobile sensor is reduced by introducing the optimized result memory and, thus, location efficiency is improved. Simulation results showed that the proposed method, which combines mobile with fixed sensors, greatly expanded the monitoring function of the network, reduced the number of fixed sensors, and enhanced the positioning accuracy.

1. Introduction

With the deepening of the industrial revolution, the number of hazardous chemicals has increased dramatically, which has increased the consequent emergencies dramatically. Figure 1 shows the total number of hazardous chemical leakage accidents and the total number of casualties in China from 2010 to 2015 [1].
Cases of heavy losses caused by the leakage of hazardous chemicals are commonplace at home and abroad. For example, at 10:15 on 21 September 2001, an explosion occurred at the AZF chemical plant in Toulouse, an industrial town in southwestern France. The accident killed 31 people and injured more than 2500. On 12 August 2015, the Ruihai Company’s dangerous goods warehouse in the Binhai New Area of Tianjin caught fire in the area, followed by two violent explosions, resulting in 165 deaths, eight missing, and 798 injured.
After a hazardous chemical accident occurs, the information of source strength of the leakage source can determine the dynamic distribution of the leaking material in different space and time positions in the atmosphere. Such information can then be used for early warning, prediction, and emergency treatment of the accident. For many years, various methods have been forwarded and achievements have been made. In 2007, Rao et al. classified source estimation methods into forward model method and backward model method [2]. The backward method is based on reverse propagation and diffusion simulation, i.e., reverse simulation from receiver to source. The forward model method performs multiple transport and diffusion simulations, iteratively calculates from different candidate solutions, and compares the simulation results with the actual measured concentration, in order to find the relevant characteristics of the release source and minimize the difference between the simulated concentration and the actual measured concentration. In 2018, Qiu et al. used artificial neural network to estimate the location of hazardous chemicals leakage source [3]. The method used a large amount of pre-determined scenarios to train the artificial neural network for dispersion prediction, so that the artificial neural network can predict concentration distribution. Combining with recent research results, two ways are used to obtain the source strength information of the leakage source:
The first way is to establish a quantitative estimation model by combining the probabilistic mathematical statistics model with the gas diffusion model, which means performing various characteristics of leakage sources. For example, in 2003, Sohn et al. continuously improved the error estimation by quantifying Monte Carlo sampling with continuous likelihood function, and finally obtained the source strength information of leakage source [4]. In 2018, Kim et al. used a deep neural network to track chemical gas leakage sources [5].
The second way is to establish the relationship between the location and concentration monitoring of the leakage source by using the diffusion law of hazardous chemicals. After which, the concentration calculated by the diffusion model with the concentration value monitored by the sensor can be compared. The optimal solution is obtained by optimization method, while leakage source information can be calculated back. In 2009, Chen Qiang et al. applied the hybrid Genetic-Pattern search algorithm to the inverse calculation of leakage source strength [6]. In 2018, Yan et al. applied the improved Particle Swarm Optimization algorithm to the problem of multi-robot leakage source localization [7].
Generally, source strength location can be divided into two categories, namely, one based on probability and statistics theory and the other based on optimization theory.
The location method based on probability and statistics theory requires much data to be analyzed to solve the problem of fixed sensor network location. Given limited data, the method is not practical. The location method based on optimization theory only needs to provide the concentration measurements at the accident site, which is sui for the case of limited data in emergencies. However, the accuracy of the algorithm should be taken into account while considering calculation efficiency. For example, the genetic algorithm [8] and annealing simulation methods [9] can obtain the global optimal solution of the problem, but the computational efficiency is greatly reduced because of the need to obtain the approximate optimal solution through multiple operations. Nonetheless, several methods can converge quickly, such as traditional particle swarm optimization algorithm, and easily fall into local optimal solution. Subsequently, these methods cannot guarantee global optimal solution, which leads to low positioning accuracy.
Zhang et al. proposed a self-localization method based on Improved Particle Swarm Optimization in 2011 [10]. The inertia weight and learning factor are set as linear decreasing. Component variation method is used to jump out of local optimum when search stagnation occurs. Although localization performance is improved, the method is still not ideal, given the addition of computational complexity. In 2013, Liu et al. proposed a fast gas leakage source location method based on the combination of real-time monitoring data and Gauss diffusion model from a fixed sensor network monitoring platform [11]. The fixed sensor network mainly relies on a large number of redundant sensors, which require large cost and is not suitable for large-area sites, such as chemical industry parks. In 2015, Jiang et al. proposed the problem of using mobile robots for gas leak source localization [12]. The matrix half-tensor product method was used to plan the robot’s moving path, but the location efficiency was low and the robot was only suitable for small-scale leakage accidents. In 2015, Cheng et al. proposed the combination of wireless sensor networks and mobile robots to solve the problem of gas leakage source location [13]. For the data acquisition method based on the combination of fixed sensor network and mobile sensor, given that the error of the optimization algorithm is derived from random error, the path of the mobile sensor oscillates, which reduces efficiency.
Based on previous research, this paper proposes to combine the mobile with the fixed sensor networks and use an extended Kalman filter algorithm to update the moving path of the mobile sensor. The particle swarm optimization algorithm of adaptive variation factor is applied to the inverse calculation of the leakage source strength. Using the sum of the squared error of the concentration data calculated by the Gaussian plume diffusion model and the monitoring concentration data as the objective function, the leakage source location is transformed into an optimal matching problem of finding the calculated and the monitoring concentrations. The mobile sensor is introduced in the fixed sensor network and the mobile sensor movement strategy based on the extended Kalman filter is proposed. The estimation of the state variable is updated by using the estimation value of the previous time and the observation value of the current time, and the mobile strategy is planned. Introducing the optimized result memory reduces the interference of the random error of the optimization algorithm on the path planning of the mobile sensor. Subsequently, path oscillation of the mobile sensor is avoided and location efficiency is improved. The simulation results showed that the proposed source-strength location method, which combines mobile and fixed sensors, greatly expanded the monitoring function of the network, improved the effectiveness, accuracy, and flexibility of monitoring, reduced the number of fixed sensors, and improved positioning accuracy.

2. Leakage Location of Hazardous Chemicals Based on Adaptive Mutation Particle Swarm Optimization Algorithm

This chapter optimizes the modeling of the leak source, combines the diffusion model with the inversion algorithm, and establishes a leak source location optimization method based on the cooperative positioning network. The particle swarm optimization algorithm is mainly used to estimate the location of the leak source, and the extended Kalman filter algorithm is applied to the planning mobile sensor mobility strategy.

2.1. Gas Diffusion Model

To locate the leakage source, the basic law and theory of gas diffusion must be studied to master the characteristics of gas diffusion in space. According to these characteristics, relevant mathematical control methods are used to locate the leakage source of hazardous chemicals [14].
To represent the diffusion form of the leakage material, the diffusion process is described as the fluid movement process. The diffusion model is a Gaussian plume model from a continuous point source at H high above the ground. The equation is as follows:
C ( x , y , z ) = Q 0 2 π σ x σ y u exp ( 1 2 y 2 σ y 2 ) · { exp [ 1 2 ( ( z H ) 2 σ z 2 ) ] + exp [ 1 2 ( ( z + H ) 2 σ z 2 ) ] }
where:
  • C(x,y,z): concentration of (x,y,z) points;
  • Q: source strength;
  • u: wind speed;
  • σx, σy, and σz: diffusion coefficient in the x, y and z directions, respectively; and
  • H: effective source is high.
In the Gauss diffusion model, atmospheric stability is divided into six grades according to wind speed and sunshine intensity. Table 1 shows the corresponding diffusion coefficient calculation. The value of σx is not given because there is reason to assume σx = σy [15].
The Gauss diffusion model is used to simulate the concentration distribution of hazardous chemicals in windy condition, as shown in Figure 2.

2.2. Leakage Source Location Method Based on Self-adaptive Variation Particle Swarm Optimization and Collaborative Location Network

In this paper, the collaborative leakage source localization network of the mobile sensor and fixed sensor network is called the “cooperative localization network”. A fixed sensor network is composed of fixed sensor nodes in the observed area, which can collect, analyze, and process information in the observed area through wireless communication [16]. However, if precise positioning is required, densely fixed sensor networks should be arranged [17]. The introduction of mobile sensors in fixed sensor networks can greatly expand the monitoring function of networks and improve the effectiveness, accuracy, and flexibility of monitoring. The essence of collaborative leakage source localization of the mobile sensor and fixed sensor network is to make up for the shortage of fixed sensor quantity by introducing mobile sensor, cycle iteration, reduce cost, and improve positioning accuracy [18].
The coordinate system is established according to the layout of the fixed sensor network. Taking the fixed sensor network with a spacing of 1000 m and a layout of 5 × 5 as an example, the schematic diagram is shown in Figure 3.
Given a certain deviation between the coordinate systems of the fixed sensor network and gas diffusion with the leakage source as the origin, coordinate transformation calculation is needed. The deviation obtained from the two coordinate systems results in the coordinates of the hazardous chemical leakage source in the fixed sensor network coordinate system.
In this paper, the Gauss plume model is used as a forward model to calculate the theoretical value of leakage concentration, that is, the calculated data. The actual concentration value obtained by sensor detection provides monitoring data for the inverse calculation research, and provides data verification for the establishment and correction of diffusion model. Diffusion simulation will also provide simulation data for inverse calculation research. The location of the leak source and its source strength back-calculation will be the best match between the calculated and the monitoring data. By optimizing the solution, the model parameters are continuously corrected to locate the leak source. The determination of the location of the leak source is transformed into a multi-parameter single-object unconstrained optimization problem.
Particle swarm optimization algorithm is applied to the inverse calculation of hazardous chemical leakage source to obtain the data of leakage source rapidly and accurately in the process of chemical leakage accident. As particle swarm optimization algorithm easily falls into local optimal solution, adaptive mutation factor is introduced to avoid this situation [19]. Using a diffusion model and downwind concentration measurement data, the sum of error squared between the calculated concentration data C c o m p and monitored concentration data C m e s is taken as the objective function [20]. That is:
min f ( Q ) = i = 1 N + t ( C m e s i C c o m p i ) 2
C c o m p is derived from Equation (1), that is:
min f ( Q ) = i = 1 N + t ( C m e s i C c o m p i ) 2 = i = 1 N + t { C m e s i Q 2 π σ x σ y u exp ( 1 2 y 2 σ y 2 ) · [ exp ( 1 2 ( ( z H ) 2 σ z 2 ) ) + exp ( 1 2 ( ( z + H ) 2 σ z 2 ) ) ] } 2
where N is the number of fixed sensors in the cooperative localization network and t is the number of steps of the moving sensor.
The process of inverse calculation of source strength using adaptive mutation particle swarm optimization algorithm is as follows:
Initialize the particle swarm, determine the number of particles m, which is the initial velocity and the initial position (that is, the initial parameter value). In this paper, the source strength inversion problem is considered as a three-dimensional space and the parameters are the leakage source position information ( x , y ) (height is known) and source strength Q, namely, the ith particle is represented as X i = ( x i , y i , Q i ) and the velocity is V i = ( v x i , v y i , v Q i ) .
Calculate the fitness fit of each particle, store the best values of each particle P b e s t and fit (add one variable), and select the fittest particle from the population as G b e s t of the population:
V i ( n + 1 ) = w V i ( n ) + c 1 r 1 ( P b e s t X i ( n ) ) + c 2 r 2 ( G b e s t X i ( n ) )
X i ( n + 1 ) = X i ( n ) + V i ( n + 1 )
V i ( n ) represents the speed of the nth iteration of the ith particle, w represents the inertia weight, c 1 and c 2 represent the learning parameters, r 1 and r 2 represent the random number between 0 and 1, P b e s t represents the optimal value searched by the ith particle, G b e s t represents the optimal value searched by the whole cluster, and X i ( n ) represents the current position of the nth iteration of the ith particle.
According to Equations (4) and (5), the velocity and size of each particle are updated, and the variation factor [21] is introduced to avoid falling into local optimum.
Calculate the fitness of each particle after the update, compare the fit of each particle to the fit corresponding to the best value it has experienced before, and if the result is better, use its current value as the P b e s t of the particle.
Compare the fitness of each particle P b e s t with the best value G b e s t experienced by all particles; if better, the value of G b e s t will be updated.
Determine whether the search results meet the end conditions set by the algorithm (usually to achieve a good enough fitness or to reach the maximum number of iteration steps), if not to meet the preset conditions, then return to step (3). If the preset conditions are met, then stop the iteration and solve the optimal solution.

2.3. Mobile Sensor Movement Strategy Planning Based on Extended Kalman Filtering

Kalman filtering is widely used in signal processing and system control, which uses the dynamic information of the target [22], tries to get rid of the influence of noise, and obtain good estimation about the target location. The basic idea is based on minimum mean square error as the best estimate criterion, using the state space model of signal and noise, as well as the estimation of state variables is updated by using the estimated value of the previous moment and the observed value of the current moment, and the estimated value of the current moment is obtained. The algorithm is based on establishing the system of equation and observation equation of the need to deal with the signal to meet the minimum mean square error of the estimate [23].
The state and the observation equations are substituted into the extended Kalman filter equation [24]. The parameters of the filter are determined according to measurement error. The optimal estimation of the position of the mobile sensor can be obtained by starting the filter for recursive calculation and, thus, the trajectory of the mobile sensor can be planned. However, the state and observation equations cannot be all linear. Compared with the Kalman filtering algorithm that is only applicable to linear systems, the extended Kalman filtering algorithm can better plan the mobile sensor’s path [25].
The extended Kalman filtering algorithm is mainly applied to nonlinear systems, which are subsequently linearized, and then the Kalman filtering is carried out [26]. Since the process may be affected by various uncertainties, such as the turbulence of the environment, we assume that the uncertainties of each state component obey normal distribution and are expressed by w and v. The state equation is used to describe the change process of system state over time, which can be expressed as:
x t = f ( x t 1 ) + w t 1
In the formula, xt is the state vector of the observed target at step t, w t 1 is the process noise, the mean is 0, and the variance is Q t 1 .
The observation equation is used to describe the observational information of the system state, which is controlled by the nonlinear function h, that is:
z t = h ( x t ) + v t
In the formula, z t is the measurement value of the observation target at step t, h is the non-linear function mapping the prediction value to the measurement space, v t is the observation noise, the mean value is 0, and the variance is R t .
The extended Kalman filter contains prediction and stages [27]. In the prediction stage, the state equation is used to estimate the state of the system at the next moment, and in the update stage, the observation information at the latest moment is obtained from the observation equation to update the state of the system, which makes the state estimation more accurate.
Prediction stage:
x ^ t | t 1 = F t x t 1
P t | t 1 = F t P t 1 F t T + Q t
Update stage:
K t = P t | t 1 H t T ( H t P t | t 1 H t T + R t ) 1
x ^ t = x ^ t | t 1 + K t ( z t H t x t | t 1 )
P t = ( I K t H t ) P t | t 1
In the above formulas, K t is called the gain matrix of Kalman filter; F t is the system matrix, which is derived from partial derivative of f; and H t is the Jacobian determinant of a nonlinear system, which is derived from partial derivative of h.
In the location problem of hazardous chemical leakage source, by assuming that the height of the leak source is known, the mobile sensor can be regarded as moving on a two-dimensional plane, and the position coordinates of the mobile sensor in step t are set as ( p t , q t ) . The source strength of the point is derived from Equation (3) of the particle swarm optimization algorithm. The calculated concentration of the position ( p t , q t ) is C M c o m p t and the measured concentration is C M m e s t . The square of the difference between the calculated and the measured concentrations is C M d t :
C M d t = ( C M m e s t C M c o m p t ) 2
Definition 1: Let X t be the state vector of the mobile sensor at step t, including the square of the difference between the calculated value of sensor position and concentration and the measured value of concentration, and its expression is X t = [ p t q t C M d t ] .
Then, the state vector of step t + 1 is:
X t + 1 = [ p t + 1 q t + 1 C M d t + 1 ] = [ p t + η p t · C d t q t + η q t · C d t ( C M m e s t + 1 C M c o m p t + 1 ) 2 ] + ξ
where η p t and η q t are the moving strategy coefficients of the horizontal and vertical coordinates of the mobile sensor, respectively.
According to the equation of state, the Jacobian matrix is calculated. The diffusion coefficient equation used in C M d t is found in Table 1 according to the atmospheric stability level, that is, the system matrix F t is obtained and its expression is:
F t = [ p t + 1 p t p t + 1 q t p t + 1 C M d t q t + 1 p t q t + 1 q t q t + 1 C M d t C M d t + 1 p t C M d t + 1 q t C M d t + 1 C M d t ] = [ 1 0 η p t 0 1 η q t α β γ ]
where α , β , and γ are the partial derivatives of C M d t + 1 with respect to p t , q t , and C M d t , respectively, and can be obtained by Equation (1) and Table 1.
The leakage source information inversely calculated from the co-located network is recorded as ( x t , y t , Q t ) , where ( x t , y t ) is the estimated leak source position coordinate and Q t is the source intensity.
Definition 2: Set the result as the observation vector of mobile sensor in step t, including the coordinate of leakage source position, and its expression is Z t = [ x t y t ] T .
The nonlinear function h of the predicted value mapped to the measurement space can be determined by Equation (2), that is:
min f ( Q ) = i = 1 N + t ( C m e s i C c o m p i ) 2 = i = 1 N { C m e s i Q 2 π σ x i x t σ y i y t exp ( 1 2 ( y i y t ) 2 σ y i y t 2 ) · [ exp ( 1 2 ( ( z H ) 2 σ z 2 ) ) + exp ( 1 2 ( ( z + H ) 2 σ z 2 ) ) ] } 2 + { C m e s t Q 2 π σ p t x t σ q t y t exp ( 1 2 ( q t y t ) 2 σ q t y t 2 ) · [ exp ( 1 2 ( ( z H ) 2 σ z 2 ) ) + exp ( 1 2 ( ( z + H ) 2 σ z 2 ) ) ] } 2
where N is the number of groups of all data collected by the collaborative location network before step t of the mobile sensor.
From Equation (16), the relationship between Z t and X t can be obtained, and h can be obtained. Hence, the Jacobian determinant H t of nonlinear system can be obtained from the partial derivation of h.
The next position ( p t + 1 , q t + 1 ) of the mobile sensor is planned according to Equations (8) to (12).

2.4. Collaborative Leakage Source Location of Mobile Sensor and Fixed Sensor Network

Fixed sensor networks rely mainly on a large number of fixed sensors for positioning and the cost is high. When the mobile sensor is introduced into the fixed sensor network, the number of fixed sensors is reduced and the positioning accuracy is improved.
As the optimization algorithm used in each iteration is a particle swarm optimization algorithm, the result has certain randomness. If the optimization result oscillates, a certain impact will affect the route planning of the mobile sensor. To avoid this situation, the optimization result storage is designed, that is, the result is stored after each iteration. Then, the result of the best matching is selected in the storage, that is, the group with the least fitness as the information of the mobile sensing prediction route. Each iteration selects the optimization result with the least fitness. Hence, as the number of steps increases, the optimization result tends to be the best match, such that the back-calculation result is gradually closer to the real leakage source.
The algorithm for cooperative source location of the mobile sensor and fixed sensor network is as follows:
Step 1: Establish a coordinate system according to the fixed sensor network layout, determine the approximate range of leakage according to the distribution of the fixed sensor reaching the threshold c, and record the moving step of the mobile sensor t = 1;
Step 2: Set the particle swarm algorithm to repeat the number of calculations k = 1, the maximum value of which is K;
Step 3: The collected gas concentration data are located by adaptive mutation particle swarm optimization algorithm, and the result of Equation (3) objective function is recorded as fitness value. Before Step6 starts the mobile sensor, the value of t is 0. After Step 6 starts the mobile sensor, the value of t is determined by Step 8. The optimal solution fit k is obtained by running the particle swarm optimization algorithm, and the leakage source is recorded as ( x k , y k , Q k ) , where x k and y k are the x coordinates and y coordinates of the optimal solution of the leakage source obtained by the kth particle swarm optimization algorithm, respectively. Q k represents the leakage intensity of the leakage source obtained by the kth particle swarm optimization algorithm;
Step 4: If f i t k ε p s o , then return to Step 3 and run the particle swarm optimization algorithm again. ε p s o is the set inversion calculation accuracy, Otherwise, enter Step 5;
Step 5: Store Step 3 ( x k , y k , Q k , f i t k ) in the optimization result store psobest; find the smallest f i t k in psobest, denote f i t r . If f i t r < ε f i n a l , ε f i n a l represents the final threshold and εfinal < εpso, then, the ( x k , y k , Q k ) corresponding to f i t r is taken as the leak source position and the leak source intensity, and the method ends. Otherwise, the process proceeds to Step 6;
Step 6: The particle swarm algorithm repeats the number of calculations k = k + 1. If k < K , return to Step 3, and repeat the particle swarm algorithm, re-execute from Step 3, otherwise, start the mobile sensor and proceed to Step 7;
Step 7: If t < 1 , then the mobile sensor is placed in the random initial position ( p 0 , q 0 ) . Otherwise, the extended Kalman filter algorithm is used to determine the next moving position ( p t + 1 , q t + 1 ) of the mobile sensor. The position coordinate of the mobile sensor in step t is ( p t , q t ) . The calculated value of the concentration is C M co m p t and the measured value is C M mes t . The square C M d t of the difference between the calculated and the measured values can be calculated by Equation (13). The state vector of step t in mobile sensor can be expressed as X t = [ p t q t C M d t ] T . Step 5 obtains the coordinate ( x r , y r ) of the leakage source, and the observation vector of the mobile sensor’s step t can be expressed as z t = [ x r y r ] T . The extended Kalman filter algorithm, i.e., Equations (8) to (16) are used to plan the mobile sensor’s moving strategy to estimate the next position ( p t + 1 , q t + 1 ) of the mobile sensor.
Step 8: Calculate the theoretical concentration value C M c o m p t + 1 at the position of ( p t + 1 , q t + 1 ) ; move the mobile sensor to ( p t + 1 , q t + 1 ) and measure the coordinate concentration to obtain the actual concentration value C M m e s t + 1 ; and move the sensor step t = t + 1;
Step 9: If C M m e s t + 1 c , that is, the point is in the leakage range. Calculate C d t = i = 1 N + t ( C m e s i C c o m p i ) 2 , where N is the cooperative localization network collected before step t of the mobile sensor. If C d t < ε f i n a l , the position ( p t + 1 , q t + 1 ) is used as the leak source position, and the method is terminated, otherwise, record ( p t + 1 , q t + 1 , C M m e s t + 1 ) as the new data collected by the mobile sensor, and jump to Step 2 to execute. If C M m e s t + 1 < c , return to Step 2 to execute again.
The flowchart of the algorithm is shown in Figure 4.

3. Simulation and Analysis

In order to verify the feasibility of the algorithm in the problem of locating leakage sources, assuming that the source strength is Q = 10,000 g/s, the atmospheric stability is C, and the average wind speed is 2.5 m/s, the simulated measured concentration values at different (x, y, z) locations are generated according to Equation (1). The feasibility of the algorithm is verified by using this data.

3.1. Influence of Factors in Fixed Sensor Networks on Location Accuracy of Leakage Source

The influence of factors, such as sensor spacing, sensor layout, and layout on the positioning accuracy in fixed sensor networks is important. The error formula is:
e = ( x x 0 ) 2 + ( y y 0 ) 2
  • e: error distance;
  • x: abscissa of the leak source obtained from the experimental results;
  • y: ordinate of the leak source obtained from the experimental result;
  • x0: actual leak source abscissa; and
  • y0: actual leak source ordinate.
The leakage source coordinate is assumed to be (650,400) regardless of the height, and 100 sets of experiments are performed in each case.
The first set of experiments discussed the same layout, that is, the layout is 9 × 9 fixed sensor network, and the impact of sensor spacing on positioning accuracy.
The sensor spacings are 10, 50, 100, 500, 1000 and 2000 m, and the error is shown in Figure 5.
When the layout is the same, the average positioning error of different sensor intervals is shown in Table 2.
The second set of experiments explores the effect of layout on positioning accuracy in the case of the same sensor spacing.
The sensor layout is taken as 3 × 3, 4 × 4, 5 × 5 and 9 × 9. The positioning accuracy of the sensor spacing is 1000 and 2000 m. The error is shown in Figure 6 and Figure 7.
The average positioning error of different layouts is shown in Table 3 when the sensor spacing is the same.
The experimental results show that the larger the distribution range of the fixed sensor networks is under the same sensor spacing, the better the positioning effect is when the number of fixed sensors is greater. The smaller the sensor spacing is, the better the positioning accuracy. With the increase of the distance between sensors in fixed sensor networks, the location error will increase as well. To obtain relatively accurate positioning results, increasing the distribution density of sensors, such as 10 m, is necessary. However, this scheme will increase the cost for chemical industry parks.

3.2. Effect of Coordinated Leakage Source Location on Positioning Accuracy Between the Mobile Sensor and Fixed Sensor Network

As the error of the optimization algorithm is derived from random error, the path of the mobile sensor oscillates. Hence, the introduction of optimization result memory will reduce the interference of the random error of the optimization algorithm on the planned path of the mobile sensor and avoids the oscillation of the path of the mobile sensor, thereby improving positioning efficiency. The following is an example of introducing a motion sensor cooperative positioning experiment in a fixed sensor network with a layout of 8000 m × 8000 m, a sensor spacing of 1000 m, and a layout of 9 × 9. The path of the leakage source is (650,400). The path of the mobile sensor is shown in Figure 8, where (a) is the path of the moving sensor before introducing the optimization result memory and (b) is the path of the moving sensor after introducing the optimization result memory, where red is the true coordinate of the leak source and blue is the moving path of the moving sensor.
To represent more intuitively the moving steps of the mobile sensor, the variable step t is introduced into the path image of the mobile sensor, as shown in Figure 9.
Under the condition of introducing mobile sensors, the influence of factors, such as sensor spacing, sensor layout range, and layout on the positioning accuracy in fixed sensor networks are discussed.
The leakage source coordinate is assumed to be (650,400) regardless of the height and 100 sets of experiments are performed in each case.
The first group discusses the positioning error of cooperative location networks with different layouts when the sensor spacing is 1000 m.
The sensor layout is 3 × 3, 4 × 4, 5 × 5 and 9 × 9, and the error is shown in Figure 10.
The second group discusses the positioning error of cooperative location networks with different layouts when the sensor spacing is 2000 m.
The sensor layout is 3 × 3, 4 × 4, 5 × 5 and 9 × 9 and the error is shown in Figure 11.
The comparison of the positioning error results of different sensor networks is shown in Table 4.
The comparison of the positioning accuracy between the fixed sensor network and the collaborative location network is shown in Figure 12.
Experimental results show that the positioning accuracy is greatly improved after the introduction of the mobile sensor. The coordinated source location method of the mobile and the fixed sensor networks improves accuracy of the leak source localization result. The use of a fixed sensor network combined with a mobile sensor can effectively obtain accident information, make up for the shortcomings of relying solely on fixed sensor network monitoring to cause malfunction, and improve the flexibility of accident monitoring. The introduction of a mobile sensor reduces the distribution density of fixed sensors in a fixed sensor network. For example, in a 16 km2 sensor network, the positioning accuracy of the collaborative location network with 9 fixed sensors spacing 2000 m is 25.79% higher than that of the fixed sensor network with 25 fixed sensors spacing 1000 m, and the number of fixed sensors is reduced by 16. In a 64 km2 sensor network, 25 fixed sensors are used. The positioning accuracy of collaborative location network with sensor spacing of 2000 m is 55.89% higher than that of 81 fixed sensor networks with fixed sensor spacing of 1000 m, and the number of fixed sensors is reduced by 56. The collaborative location network combined with mobile sensor and fixed sensor network can reduce the number of fixed sensor distribution, thus greatly reducing the cost.

3.3. Running Time Statistics of the Algorithm

Since the mobile sensor in this paper is regarded as the theoretical state, that is, there is no speed limit, the moving time of the mobile sensor is not added in the running time of the algorithm. The average running time of the collaborative location network positioning algorithm for different layouts is shown in Figure 13.
As shown in the figure, for sensor networks with different layouts, the average running time of the algorithm is less than 1 min, which ensures fast location of the leakage source.

3.4. Comparison with other Algorithms

We compared the Random forest classifier for real-time chemical leak source tracking using fence-monitoring sensors method [28]. Random forest (RF) classification is an ensemble learning method for classification and other tasks. It is operated by constructing a multitude of decision trees using training data and outputting the results.
When the chemical leak occurs, 11 sensors which are optimally placed on the fence of the plant detect the leak. The data was split in a 7:3 ratio for the training and test datasets. In Model 1, 50 trees were used in the forest with Gini criterion (data split method). It was designed with 13 features and 40 labeled data (40-class). After training the model, the error rate was 58.04%. Model 2 was designed by adding one more class, which is the no leak release class, the error rate 46.75%. Model 3, which was designed with 90 features and 40-class, the error rate 14.01%. Model 4 gave the maximum accuracy when the optimal tuned parameters are being used: 400 trees, 20% maximum-feature, and one minimum-sample-leaf, the error rate was 13.15%.
We use the collaborative location network with a distance of 1000 m as a comparison. When the layout is 3 × 3, the error rate is 11.95%. When the layout is 4 × 4, the error rate is 2.16%. When the layout is 5 × 5, the error rate is 1.26%. When the layout is 9 × 9, the error rate is 0.92%.
It can be seen that locating hazardous chemical leakage source based on cooperative moving and fixing sensors has good positioning accuracy while ensuring efficiency.

4. Conclusions

Aiming at the problem of hazardous chemical leakage source location, this paper studies the existing diffusion mode and the model method of source strength inversion and location. A mobile sensor and a fixed sensor network based on the extended Kalman filter are proposed to locate a hazardous chemical leakage source, and the feasibility of the algorithm is verified. The particle swarm optimization algorithm with adaptive mutation is applied to the source strength inversion problem. Subsequently, the source strength inversion problem of hazardous chemicals leakage is transformed into the traditional optimization model. A mobile sensor mobile strategy based on extended Kalman filtering is then proposed. Due to the randomness of the results obtained by the particle swarm optimization algorithm, the calculated path of the mobile sensor will oscillate, resulting in the long path of the mobile sensor and inaccurate location. To improve this situation, an optimal value memory is designed. After adding the optimal value memory, the route oscillation of the mobile sensor is obviously improved. Compared with values before the improvement, the mobile path of the mobile sensor is shortened, which can locate the location of the leakage source quickly and accurately. Thus, the improved working efficiency of the mobile sensor saves time and cost and is more suitable for the needs of emergency response process. The cooperative positioning scheme of the mobile sensor and fixed sensor network can improve effectiveness, accuracy, and flexibility of monitoring. The scheme can quickly and accurately obtain source strength information and provide support for emergency rescue. The collaborative location network, which combines mobile with fixed sensor networks, can reduce the number of fixed sensors and, thus, greatly reduces cost.
Given that the leak model used in the algorithm is the plume model of a continuous point source, the meteorological environment is relatively stable. However, real-time meteorological changes are not considered, which makes the algorithm unsuitable for an environment with large meteorological changes. In the follow-up study, a time factor can be added to guide the mobile sensor through real-time updating data, which could ensure that effective concentration information can be monitored in the case of large changes in meteorological environment, and provide sufficient data support for the leak source location.
By comparing the positioning accuracy of fixed sensor networks with that of a collaborative location network, when sensors are enough in fixed sensor networks, such as 9 × 9 distribution, the positioning accuracy of cooperative positioning networks with mobile sensors is not much improved compared with that of the 5 × 5 distribution, indicating that they are not fixed sensors. The more sensors in the network, the better. In the follow-up research, we can study the number of fixed sensors in the collaborative location network and find the minimum number of fixed sensors while ensuring positioning accuracy.

Author Contributions

Y.K.: put forward research ideas and design research programs; M.G.: Responsible for simulation program writing and manuscript writing; S.Z. and P.J.: Provide suggestions for revision; L.W., X.Y. and J.L.: Responsible for data collection; C.X. and F.W.: Responsible for data analysis.

Funding

This work is supported by Provincial Key R&D Program of Zhejiang Province (No.2017C03019), National Key R&D Program of China (No.2016YFC0201400), Zhejiang Joint Fund for Integrating of Informatization and Industrialization (No. U1509217), International Science and Technology Cooperation Program of Zhejiang Province for Joint Research in High-tech Industry (No.2016C54007) and National Natural Science Foundation of China (No. U1609212).

Conflicts of Interest

All authors have no conflicts of interest.

References

  1. Liao, C.; Zhao, S.; Liu, S.; He, L.; Zhou, Y.; Huang, M. Statistical analysis of hazardous chemical leakage accidents in China during 2010–2015 and its countermeasures. Saf. Environ. Eng. 2017, 24, 151–157. [Google Scholar]
  2. Rao, K.S. Source estimation methods for atmospheric dispersion. Atmos. Environ. 2007, 41, 6964–6973. [Google Scholar]
  3. Qiu, S.; Chen, B.; Wang, R.; Zhu, Z.; Wang, Y.; Qiu, X. Atmospheric dispersion prediction and source estimation of hazardous gas using artificial neural network, particle swarm optimization and expectation maximization. Atmos. Environ. 2018, 178, 158–163. [Google Scholar] [CrossRef]
  4. Sohn, M.D.; Sextro, R.G.; Gadgil, A.J.; Daisey, J.M. Responding to sudden pollutant releases in office buildings: 1. Framework and analysis tools. Indoor Air 2010, 13, 267–276. [Google Scholar] [CrossRef]
  5. Kim, H.; Yoon, E.S.; Shin, D. Deep Neural Networks for Source Tracking of Chemical Leaks and Improved Chemical Process Safety. Comput. Aided Chem. Eng. 2018, 44, 2359–2364. [Google Scholar]
  6. Chen, Q. Research on Source Identification Approaches for Hazardous Chemical Releases. Ph.D. Thesis, Beijing University of Chemical Technology, Beijing, China, 2009. [Google Scholar]
  7. Yan, Y.; Zhang, R.; Wang, J.; Li, J. Modified PSO algorithms with “Request and Reset” for leak source localization using multiple robots. Neurocomputing 2018, 292, 82–90. [Google Scholar] [CrossRef]
  8. Haupt, S.E.; Haupt, R.L.; Young, G.S. A mixed integer genetic algorithm used in biological and chemical defense applications. Soft Comput. 2011, 15, 51–59. [Google Scholar] [CrossRef]
  9. Martinez-Rios, F. A new hybridized algorithm based on Population-Based Simulated Annealing with an experimental study of phase transition in 3-SAT. Procedia Comput. Sci. 2017, 116, 427–434. [Google Scholar] [CrossRef]
  10. Zhang, J.Y. An Improved Decoding Algorithm of Repeat Accumulate (RA) Codes. J. Electron. Inf. Technol. 2011, 33, 2616–2621. [Google Scholar] [CrossRef]
  11. Liu, Q.; Bernie, S.; Sheng, W.; Hong, H.; Hui, Z.; Xiumin, W. Study on fast gas identification sources based on wireless sensor networks. China Saf. Sci. J. 2013, 23, 142–147. [Google Scholar]
  12. Jiang, P.; Wang, Y. Mobile robot gas source localization: A semi-tensor product approach. Control Theory Appl. 2015, 32, 1676–1683. [Google Scholar]
  13. Cheng, L.; Zhang, D.; Liu, B.; Wu, H.; Wang, Y. Design of gas leak source localization robot based on wireless sensor networks. Transducer Microsyst. Technol. 2015, 34, 85–87. [Google Scholar]
  14. Zajaczkowski, F.J.; Haupt, S.E.; Schmehl, K.J. A preliminary study of assimilating numerical weather prediction data into computational fluid dynamics models for wind prediction. J. Wind Eng. Ind. Aerodynam. 2011, 99, 320–329. [Google Scholar] [CrossRef]
  15. Crowl, D.A.; Louvar, J.F. Chemical Process Safety: Fundamentals with Applications; Prentice Hall: Upper Saddle River, NJ, USA, 2007; Volume 34, pp. 169–175. [Google Scholar]
  16. Uciński, D.; Patan, M. Sensor network design for the estimation of spatially distributed processes. Int. J. Appl. Math. Comput. Sci. 2010, 20, 459–481. [Google Scholar] [CrossRef] [Green Version]
  17. Wen, L. Location Technology of Mobile Sensor Networks Based on Distance Optimization; Beijing University of Technology: Beijing, China, 2015. [Google Scholar]
  18. Patwari, N.; Ash, J.N.; Kyperountas, S.; Hero, A.O.; Moses, R.L.; Correal, N.S. Locating the nodes: Cooperative localization in wireless sensor networks. IEEE Signal Process. Mag. 2005, 22, 54–69. [Google Scholar] [CrossRef]
  19. Shi, J.; Jiang, S.; Han, H.; Wang, L. Adaptive Particle Swarm Optimization algorithm and its application in test data generation. Acta Electron. Sin. 2013, 41, 1555–1559. [Google Scholar]
  20. Brits, R. Locating multiple optima using particle swarm optimization. Appl. Math. Comput. 2007, 189, 1859–1883. [Google Scholar] [CrossRef]
  21. Huang, G.; Zhang, J.; Liu, H. Route planning for unmanned aerial vehicles base on Adaptive Mutation Particle Swarm Optimization. Electron. Opt. Control 2009, 16, 18–21. [Google Scholar]
  22. Zhu, J.; Wang, P. Ensemble Kalman Smoother and Ensemble Kalman Filter approaches to the joint air quality state and emission estimation problem. Chin. J. Atmos. Sci. 2006, 30, 871–882. [Google Scholar]
  23. Peng, D. Pseudo-linear Kalman Filter in passive target tracking. Softw. Guide 2009, 11, 32–34. [Google Scholar]
  24. Gustafsson, F.; Hendeby, G. Some Relations Between Extended and Unscented Kalman Filters. IEEE Trans. Signal Process. 2012, 60, 545–555. [Google Scholar] [CrossRef] [Green Version]
  25. Chen, Q.; Zhang, Z.; He, Y.; Han, M.; Huang, X. Research on positioning method of mobile robot based on improved Extended Kalman Filtering algorithm. J. Test Meas. Technol. 2018, 32, 292–299. [Google Scholar]
  26. Castellanos, J.A.; Martinez-Cantin, R.; Tardós, J.D.; Neira, J. Robocentric map joining: Improving the consistency of EKF-SLAM. Robot. Auton. Syst. 2007, 55, 21–29. [Google Scholar] [CrossRef] [Green Version]
  27. Simon, D. Kalman filtering with state constraints: A survey of linear and nonlinear algorithms. IET Control Theory Appl. 2010, 4, 1303–1318. [Google Scholar] [CrossRef]
  28. Kim, H.; Gebreselassie, A.L.; Dan, S.; Shin, D. Random forest classifier for real-time chemical leak source tracking using fence-monitoring sensors. Korean J. Chem. Eng. 2018, 35, 1231–1239. [Google Scholar] [CrossRef]
Figure 1. Total number of deaths and total casualties of hazardous chemicals spills in China from 2010 to 2015.
Figure 1. Total number of deaths and total casualties of hazardous chemicals spills in China from 2010 to 2015.
Sensors 19 01092 g001
Figure 2. Concentration distribution of hazardous chemicals after leakage in windy conditions.
Figure 2. Concentration distribution of hazardous chemicals after leakage in windy conditions.
Sensors 19 01092 g002
Figure 3. Schematic diagram of establishing coordinate system for the fixed sensor network.
Figure 3. Schematic diagram of establishing coordinate system for the fixed sensor network.
Sensors 19 01092 g003
Figure 4. Flowchart of collaborative leak source localization algorithm for mobile sensor and fixed sensor network.
Figure 4. Flowchart of collaborative leak source localization algorithm for mobile sensor and fixed sensor network.
Sensors 19 01092 g004
Figure 5. Positioning the error of different sensor spacings with the same layout.
Figure 5. Positioning the error of different sensor spacings with the same layout.
Sensors 19 01092 g005aSensors 19 01092 g005b
Figure 6. Positioning error of fixed sensor networks with different layouts at 1000 m intervals.
Figure 6. Positioning error of fixed sensor networks with different layouts at 1000 m intervals.
Sensors 19 01092 g006aSensors 19 01092 g006b
Figure 7. Positioning error of fixed sensor networks with different layouts at 2000 m intervals.
Figure 7. Positioning error of fixed sensor networks with different layouts at 2000 m intervals.
Sensors 19 01092 g007
Figure 8. Mobile sensor path (a) before introducing the optimization result memory; and (b) after introducing the optimization result memory.
Figure 8. Mobile sensor path (a) before introducing the optimization result memory; and (b) after introducing the optimization result memory.
Sensors 19 01092 g008
Figure 9. Mobile sensor moving steps (a) before introducing the optimization result memory; and (b) after introducing the optimization result memory.
Figure 9. Mobile sensor moving steps (a) before introducing the optimization result memory; and (b) after introducing the optimization result memory.
Sensors 19 01092 g009
Figure 10. Positioning error of cooperative location network with different layouts of sensors at 1000 m intervals.
Figure 10. Positioning error of cooperative location network with different layouts of sensors at 1000 m intervals.
Sensors 19 01092 g010aSensors 19 01092 g010b
Figure 11. Positioning error of cooperative location network with different layouts of sensors at 2000 m intervals.
Figure 11. Positioning error of cooperative location network with different layouts of sensors at 2000 m intervals.
Sensors 19 01092 g011
Figure 12. Comparison of positioning accuracy between the fixed sensor network and collaborative location network.
Figure 12. Comparison of positioning accuracy between the fixed sensor network and collaborative location network.
Sensors 19 01092 g012
Figure 13. Statistics of the average running time of the algorithm.
Figure 13. Statistics of the average running time of the algorithm.
Sensors 19 01092 g013
Table 1. Diffusion coefficient equation of the Gauss diffusion model.
Table 1. Diffusion coefficient equation of the Gauss diffusion model.
Stability Grade of Gauss Diffusion Modelσy/mσz/m
Rural conditions
A0.22 × (1 + 0.0001×)−1/20.20×
B0.16 × (1 + 0.0001×)−1/20.12×
C0.11 × (1 + 0.0001×)−1/20.08 × (1 + 0.0002×)−1/2
D0.08 × (1 + 0.0001×)−1/20.06 × (1 + 0.0015×)−1/2
E0.06 × (1 + 0.0001×)−1/20.03 × (1 + 0.0003×)−1/2
F0.04 × (1 + 0.0001×)−1/20.016 × (1 + 0.0003×)−1/2
Urban conditions
A–B0.32 × (1 + 0.0004×)−1/20.24 × (1 + 0.0001×)−1/2
C0.22 × (1 + 0.0004×)−1/20.20 ×
D0.16 × (1 + 0.0004×)−1/20.14 × (1 + 0.0003×)−1/2
E–F0.11 × (1 + 0.0004×)−1/20.08 × (1 + 0.0015×)−1/2
Table 2. Average positioning error of different sensor intervals with the same layout.
Table 2. Average positioning error of different sensor intervals with the same layout.
Sensor LayoutSensor Spacing (m)Sensor Layout Range (m × m)Fixed Sensor Network Positioning Error (m)
9 × 91080 × 8010.49
50400 × 40040.63
100800 × 80050.39
5004000 × 400055.16
10008000 × 800063.01
200016,000 × 16,00090.30
Table 3. Average positioning error of different layouts with the same sensor interval.
Table 3. Average positioning error of different layouts with the same sensor interval.
Sensor Spacing (m)Sensor LayoutSensor Layout Range (m × m)Fixed Sensor Network Positioning Error (m)
10003 × 32000 × 2000249.32
4 × 43000 × 3000176.09
5 × 54000 × 4000146.45
9 × 98000 × 800063.01
20003 × 34000 × 4000397.55
4 × 46000 × 6000239.94
5 × 58000 × 8000232.09
9 × 916,000 × 16,00090.30
Table 4. Test positioning error results of different sensor networks.
Table 4. Test positioning error results of different sensor networks.
Sensor Spacing (m)Sensor LayoutSensor Layout Range (m × m)Fixed Sensor Network Positioning Error (m)Collaborative Location Network Positioning Error (m)Positioning Accuracy Improvement Rate
+10003 × 32000 × 2000249.3291.2263.41%
4 × 43000 × 3000176.0916.5090.62%
5 × 54000 × 4000146.459.6093.44%
9 × 98000 × 800063.017.0188.87%
20003 × 34000 × 4000397.55130.4867.17%
4 × 46000 × 6000239.94108.6754.70%
5 × 58000 × 8000232.0927.7988.02%
9 × 916,000 × 16,00090.3013.9784.52%

Share and Cite

MDPI and ACS Style

Kong, Y.; Guan, M.; Zheng, S.; Jiang, P.; Wang, L.; Yao, X.; Lu, J.; Xie, C.; Wang, F. Locating Hazardous Chemical Leakage Source Based on Cooperative Moving and Fixing Sensors. Sensors 2019, 19, 1092. https://doi.org/10.3390/s19051092

AMA Style

Kong Y, Guan M, Zheng S, Jiang P, Wang L, Yao X, Lu J, Xie C, Wang F. Locating Hazardous Chemical Leakage Source Based on Cooperative Moving and Fixing Sensors. Sensors. 2019; 19(5):1092. https://doi.org/10.3390/s19051092

Chicago/Turabian Style

Kong, Yaguang, Meng Guan, Song Zheng, Peng Jiang, Ling Wang, Xuefei Yao, Jian Lu, Chenfeng Xie, and Fang Wang. 2019. "Locating Hazardous Chemical Leakage Source Based on Cooperative Moving and Fixing Sensors" Sensors 19, no. 5: 1092. https://doi.org/10.3390/s19051092

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop