Professional Documents
Culture Documents
A New Optimal Sensor Placement Strategy Based On
A New Optimal Sensor Placement Strategy Based On
Research Article
A New Optimal Sensor Placement Strategy Based on
Modified Modal Assurance Criterion and Improved Adaptive
Genetic Algorithm for Structural Health Monitoring
Can He,1 Jianchun Xing,1 Juelong Li,2 Qiliang Yang,1 Ronghao Wang,1 and Xun Zhang1
1
College of Defense Engineering, PLA University of Science and Technology, Nanjing 210007, China
2
Technical Management Office of Naval Defense Engineering, Beijing 100841, China
Copyright © 2015 Can He 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.
Optimal sensor placement (OSP) is an important part in the structural health monitoring. Due to the ability of ensuring the linear
independence of the tested modal vectors, the minimum modal assurance criterion (minMAC) is considered as an effective method
and is used widely. However, some defects are present in this method, such as the low modal energy and the long computation
time. A new OSP method named IAGA-MMAC is presented in this study to settle the issue. First, a modified modal assurance
criterion (MMAC) is proposed to improve the modal energy of the selected locations. Then, an improved adaptive genetic algorithm
(IAGA), which uses the root mean square of off-diagonal elements in the MMAC matrix as the fitness function, is proposed to
enhance computation efficiency. A case study of sensor placement on a numerically simulated wharf structure is provided to verify
the effectiveness of the IAGA-MMAC strategy, and two different methods are used as contrast experiments. A comparison of
these strategies shows that the optimal results obtained by the IAGA-MMAC method have a high modal strain energy, a quick
computational speed, and small off-diagonal elements in the MMAC matrix.
information entropy method [13, 14]. Carne and Dohrmann locations. The excellent calculation efficiency and global opti-
[15] considered that distinguishing one modal vector from mization ability of IAGA assist to enhance the computational
another is essential to realize modal parameter identification speed of IAGA-MMAC.
and proposed a famous OSP method named minMAC. The The remaining parts of the paper are organized as follows.
minMAC method includes two parts. The first section is Section 2 introduces the traditional MAC and presents
modal assurance criterion (MAC). In the criterion, the off- MMAC. The IAGA-MMAC strategy is described in Section 3.
diagonal element of the MAC matrix is considered to be Section 4 provides a case study of sensor placement on a
an index for evaluating the angle of the corresponding two numerically simulated wharf structure to verify the effective-
modal vectors. The smaller element indicates bigger angle ness of the IAGA-MMAC method. Section 5 is the conclusion
and less correlation between two modal vectors. The second and the future work.
section is to achieve sensor placement using MAC. First,
some locations are selected as an initial set based on experi- 2. The Modified Modal Assurance Criterion
ence and structural topology, and the remaining locations are
considered as a candidate set. Second, the candidate locations 2.1. Introduction of the Traditional MAC. A basic requirement
are added one by one to the initial set and the combination to distinguish the measured modes is that the measured
that minimizes the maximum off-diagonal element of the modal vectors must be as linearly independent as possible.
MAC matrix is selected as the new initial set. Third, the MAC provides a useful criterion to evaluate the correlation
second step is repeated till the fixed sensors number is gained. of modal vectors. MAC matrix is defined as
Although minMAC is considered as an effective OSP 2
(Φ𝑖 𝑇 Φ𝑗 )
method and used widely, some defects still exist. Firstly, the MAC𝑖𝑗 = , (1)
core idea of MAC is to evaluate the correlation of the modal (Φ𝑖 𝑇 Φ𝑖 ) (Φ𝑗 𝑇 Φ𝑗 )
vectors for different placement scheme, but the modal energy
of the selected location cannot be guaranteed. It means that where Φ𝑖 and Φ𝑗 are the 𝑖th and 𝑗th column vectors in the
some degree of freedoms (DOFs) with low signal to noise modal shape matrix Φ.
ratio may be selected as the optimal sensor positions; this The off-diagonal elements in the MAC matrix express the
defect could decrease the precision of the acquired data and correlation between two modal vectors. Identifying the 𝑖th
the accuracy of modal parameters identification. Secondly, mode and the 𝑗th mode is easy if the value of MAC𝑖𝑗 is small.
the minMAC method has a large computational complexity.
To determine one location, the minMAC method needs to 2.2. Description of MMAC. The main idea of MAC is to
compute the MAC matrices of the variable combinations guarantee the linear independence of the modal vectors.
until all candidate locations have been selected. In order However, some DOFs with low energy may be selected as
to improve the computational efficiency of the minMAC sensor locations using MAC; this defect could decrease the
method, computational intelligence technology has been signal to noise ratio of the acquired data and make troubles in
used, such as simulated annealing algorithm [16], ant colony modal shape identification and structural damage detection.
optimization algorithm [17], particle swarm optimization As shown in (1), the element of the MAC matrix is com-
algorithm [18], and monkey algorithm [19]. Due to easy cod- puted using the column vectors of the modal shape matrix
ing method and quick evolution velocity, genetic algorithm Φ. In general, modal shape matrix should be composed by all
(GA) has become a hot research direction. Liu et al. [20] orders of modes. But for the sake of reducing computation
presented a modified GA using two-dimensional array cod- complexity, only a few modal orders are selected to compose
ing method instead of binary coding method; generalized the modal shape matrix. To improve the modal energy of the
genetic algorithm (GGA) was proposed by Yi et al. [21] to selected locations, the modal orders having large dynamical
solve the OSP problem for high-rise buildings. Javadi et al. response should be selected. Therefore, how to evaluate the
[22] adopted a hybrid intelligent method which was based dynamical feature of different modal orders becomes an
on a combination of neural network and GA. Although these important work. In tradition, the first several modes are
modifications make great progress, there are still some defects considered to have large dynamical response. Nevertheless,
existing in GA [23]. The main drawback is that the crossover the modal energy of a structure is not always concentrated
and mutation factors are invariant during the whole iteration on the low-order modes. To some complex structures, such as
cycle; this defect drops the searching ability of GA. high-rise building and suspension bridge, some high modal
The objective of this study is to present a modified orders also have large dynamical response [24]. Therefore, it
minMAC method that has a big modal energy index and a is not suitable that only the first several modes are selected
quick computational speed. A new method termed IAGA- to compose the modal shape matrix. In order to improve the
MMAC is proposed to achieve this goal. First, a modified modal energy of sensor locations, a modified MAC is pre-
modal assurance criterion (MMAC) is proposed to improve sented to settle the issue in this study. In the new criterion,
the modal energy of the selected locations by constructing modal participation factor (MPF) is presented as the criterion
the new modal shape matrix. And then, an improved to evaluate the dynamical response of different modal orders.
adaptive genetic algorithm (IAGA), which uses root mean And then, the new modal shape matrix Φ is composed by
square of off-diagonal elements in the MMAC matrix as the the modal orders with big MPF. Finally, the modified MAC
fitness function, is adopted to determine the optimal sensor matrix is computed using Φ.
Mathematical Problems in Engineering 3
Initial population
scheme, this method does not depend on the concrete values
of individual fitness; therefore, it can avoid the scale conver-
sion of fitness values. This advantage can inhibit the algorithm
premature convergence:
Dual-structure
coding 𝑖−1
𝑃 (𝑥𝑛 ) = 𝑞(1 − 𝑞) , (14)
Improved adaptive
mutation where 𝑞 is the selection probability of best individual and 𝑖 is
the sort number of the fitness value of 𝑥𝑛 .
Fitness evaluation
based on MMAC Improved adaptive 3.3. Crossover and Mutation. The crossover and mutation
crossover factors can make great influence on the computation effi-
ciency of GA. In the traditional GA, the factors keep invariant
during the whole iteration cycle. This defect drops the
Terminal No Nonlinear rank
evolution velocity and optimization ability of the algorithm.
condition
Therefore, the adaptive mechanism is introduced into this
selection
algorithm [26]. The adaptive adjustment processes of the two
Yes factors are defined as
{ (𝑓 − 𝑓avg )
{𝑘 𝑐 , 𝑓𝑐 ≥ 𝑓avg ,
End 𝑃𝑐 = { 1 𝑓max − 𝑓avg
{
{𝑘2 , 𝑓𝑐 < 𝑓avg ,
Figure 2: Flowchart of the IAGA-MMAC method. (15)
{ (𝑓𝑚 − 𝑓avg )
{𝑘 , 𝑓𝑚 ≥ 𝑓avg ,
𝑃𝑚 = { 3 𝑓max − 𝑓avg
{
3. Optimal Sensor Placement Based on {𝑘4 , 𝑓𝑚 < 𝑓avg ,
the IAGA-MMAC Method
where 𝑓max is the maximum of fitness value, 𝑓avg is the average
The traditional GA has a shortcoming that its crossover and of population fitness value, 𝑓𝑐 represents the bigger fitness
mutation factors are stationary during the whole iteration value between the two crossover individuals, 𝑓𝑚 is the biggest
cycle; this defect could drop the evolution velocity and sear- fitness value among the mutation individuals, 𝑘1 and 𝑘2 are
ching ability of the algorithm. Therefore, a new OSP method the adjustment coefficients of crossover factor, and 𝑘3 and 𝑘4
named IAGA-MMAC is presented to settle the issue. The are the adjustment coefficients of mutation factor.
flowchart of the IAGA-MMAC is shown in Figure 2. As shown in (15), when 𝑓𝑐 and 𝑓𝑚 are close or equal to
𝑓max , the 𝑃𝑐 and 𝑃𝑚 will decline to zero. This problem leads to
3.1. Coding Method. In the traditional coding method, the the good individuals update very slowly at the beginning of
gene number of value 1 could be changed in the processes the evolution process. In order to address this issue, the
of crossover and mutation, which may result in two or more improved adaptive crossover and mutation factors are pre-
sensors placed on one location. Therefore, the dual-structure sented as
coding method is used in this study. The chromosome of (𝑝 − 𝑝2 ) (𝑓𝑐 − 𝑓avg )
individual is composed of two rows, where the upper row 𝑠(𝑖) {
{𝑝1 − 1 , 𝑓𝑐 ≥ 𝑓avg ,
named append code indicates all of the locations, and the 𝑃𝑐 = { 𝑓max − 𝑓avg
{
lower row 𝑋𝑠(𝑖) named variable code represents whether the {𝑝1 , 𝑓𝑐 < 𝑓avg ,
location 𝑠(𝑖) places a sensor with the value 0 or 1. The dual- (16)
structure coding method is shown as Table 1. { (𝑝 − 𝑝4 ) (𝑓𝑚 − 𝑓avg )
{𝑝3 − 3 , 𝑓𝑚 ≥ 𝑓avg ,
𝑃𝑚 = { 𝑓max − 𝑓avg
{
3.2. Selection Scheme. The nonlinear ranking selection sch- {𝑝3 , 𝑓𝑚 < 𝑓avg ,
eme is used to choose the good individual in one generation.
Firstly, the individuals are sorted by comparing their fitness where 𝑝1 and 𝑝2 represent the maximum and minimum
values. And then, the nonlinear function (14) is adopted values of the crossover probability, respectively, and 𝑝3 and 𝑝4
to determine the selection probability of different individ- are the maximum and minimum values of the mutation prob-
uals. Compared with the common roulette wheel selection ability, respectively.
Mathematical Problems in Engineering 5
Modal order 1 2 3 4 5
Frequency (Hz) 2.592 2.620 2.818 6.902 7.339
Mode order 6 7 8 9 10
Frequency (Hz) 7.501 8.011 8.261 9.035 9.948
Population Generation 𝑃1 𝑃2 𝑃3 𝑃4
Figure 3: FE model of the wharf. 100 500 0.9 0.6 0.1 0.01
When 𝑓𝑐 and 𝑓𝑚 are close to 𝑓max , the new adaptive mech- structure are received as Table 2 and Figure 4 by modal
anism ensures that the crossover and mutation factors of analysis.
good individual increased to 𝑝2 and 𝑝4 . This advantage can
help the good individual update quickly in the whole evolu- 4.2. Computation of the MMAC Matrix. The MPFs of the
tion cycle. modes are computed using (7) to (9). The results of the first
50 modes are shown in Figures 5, 6, and 7.
As shown in Figures 5 to 7, the 1st, 3rd, 5th, and 11th
3.4. Fitness Function. The off-diagonal element of the MMAC
modal orders have big MPFs in 𝑥 direction. The 2nd, 4th,
matrix expresses the correlation between the corresponding
and 6th modal orders have large MPFs in 𝑦 direction. MPFs
two modal vectors. The elements are valued between 0 and
of the 4th, 6th, and 8th modal orders are big in 𝑧 direction.
1, and it is easy to identify the 𝑖th mode and 𝑗th mode if the
Therefore the 1st, 2nd, 3rd, 4th, 5th, 6th, 8th, and 11th
value of MMAC𝑖𝑗 is small. When MMAC𝑖𝑗 = 0, the two modal
modes are selected as the optimal combination. The modal
vectors are orthogonal. Therefore, the off-diagonal elements
participating mass ratio of the combination in each direction
of MMAC matrix can be considered as an optimization
is computed using (10) to (12), and the results are presented
objective for the OSP problem: the smaller element value
as
represents the better sensor placement result.
The fitness function in IAGA is asked to be a maximiza- 𝑟𝑥 = 95.2%; 𝑟𝑦 = 95.1%; 𝑟𝑧 = 98.9%, (18)
tion problem. Therefore, the fitness function is constructed
as where 𝑟𝑥 is the modal participating mass ratio in 𝑥 direction.
The results show that 𝑟𝑥 , 𝑟𝑦 , and 𝑟𝑧 are all over 90%. There-
1 𝑁 2 fore, the selected modal order combination is reasonable.
𝑓=1−√ ∑𝑋 , (17)
The new modal shape matrix Φ is composed as
𝑁𝑖=1 𝑖
Φ = [Φ1 , Φ2 , Φ3 , Φ4 , Φ5 , Φ6 , Φ8 , Φ11 ] , (19)
where 𝑋𝑖 is the off-diagonal elements of the MMAC matrix.
where Φ𝑖 is the 𝑖th column vector of the original modal shape
4. Demonstration Case matrix Φ.
The MMAC matrix is computed using Φ according to
In order to verify the effectiveness of the IAGA-MMAC (13).
method, a case study of sensor placement on a numerically
simulated wharf structure is provided below. 4.3. Optimal Sensor Placement Using IAGA-MMAC. IAGA,
which uses the off-diagonal elements of the MMAC matrix as
4.1. Modeling and Modal Analysis. A high-piled wharf is fitness function, is adopted to achieve the sensor placement.
selected as a case study. The total length of wharf is 55 m, and According to the advice of [26], the parameters of IAGA are
the width of anterior bearing platform is 30 m. The upper set as in Table 3.
structure of the platform is composition of cross beams, lon- The optimal process of IAGA-MMAC is executed accord-
gitudinal beams, and reinforced concrete decks. The platform ing to Figure 2. The algorithm has been run for 50 times with
is supported by six rows of vertical piles, each row has five a certain sensor number. The best fitness function values with
piles, and the distance between adjacent piles is 5.50 m. The different sensors numbers are shown in Figure 8.
finite element (FE) model of the wharf is established using As shown in Figure 8, when the sensor number is set
commercial software Ansys, and the FE model is shown in between 5 and 11, the fitness increases with sensor added. The
Figure 3. fitness function reaches its maximum when the sensor num-
The cross beams and longitudinal beams are modeled by ber is set at 11. But if the sensor number is more than 11, the
beam4, vertical piles are simulated by pipe16, and reinforced fitness does not increase with sensor added. The reason for the
concrete decks are built by shell63. 15147 nodes are generated contradiction is that the row vector determined at the newly
in total. The natural frequency and modal shape of the included sensor location has a strong linear relationship with
6 Mathematical Problems in Engineering
1400 1600
1200 1400
Participation factors of x direction
1000 1200
1000
800
800
600
600
400
400
200
200
0 0
−200 −200
0 10 20 30 40 50 0 10 20 30 40 50
Mode Mode
1400
1200
Participation factors of z direction
1000
800
600
400
200
Figure 9: Sensor placement result of AGA-MAC.
0
−200
0 10 20 30 40 50
Mode
0.98
0.96
Value of fitness function
0.94
Figure 10: Sensor placement result of IAGA-MAC.
0.92
0.9
0.88
0.86
0.84
5 10 15 20 25 30
Sensor number
6000
5000
1
Modal strain energy
4000 0.8
0.6
MAC
3000
0.4
2000 0.2
0
1000 1
2
3
4 8
0 M 7
1 2 3 4 5 6 7 8 9 10 11 od 5 6 6
e 5
Sensor 7 4
8 3 de
2 Mo
1
AGA-MAC IAGA-MMAC
IAGA-MAC Figure 15: MAC matrix of IAGA-MAC.
Figure 13: MSE of single sensor location.
0.8
1
0.6
MAC
0.8
0.4
0.6
MAC
0.2
0.4
0
0.2
1
2
0 3
4 8
1 Mo 5 7
2 de 6 6
3 7 5
4 8 4
M 7 8 3 de
od 5 6 6 2 Mo
e 5 1
7 4
8 3 de
2 Mo Figure 16: MMAC matrix of IAGA-MMAC.
1
0.98
International
Journal of Journal of
Mathematics and
Mathematical
Discrete Mathematics
Sciences