Improved Adaptive Multi-Objective Particle Swarm Optimization of Sensor Layout for Shape Sensing with Inverse Finite Element Method

The inverse finite element method (iFEM) is one of the most effective deformation reconstruction techniques for shape sensing, which is widely applied in structural health monitoring. The distribution of strain sensors affects the reconstruction accuracy of the structure in iFEM. This paper proposes a method to optimize the layout of sensors rationally. Firstly, this paper constructs a dual-objective model based on the accuracy and robustness indexes. Then, an improved adaptive multi-objective particle swarm optimization (IAMOPSO) algorithm is developed for this model, which introduces initialization strategy, the adaptive inertia weight strategy, the guided particle selection strategy and the external candidate solution (ECS) set maintenance strategy to multi-objective particle swarm optimization (MOPSO). Afterwards, the performance of IAMOPSO is verified by comparing with MOPSO applied on the existing inverse beam model. Finally, the IAMOPSO is employed to the deformation reconstruction of complex plate-beam model. The numerical and experimental results demonstrate that the IAMOPSO is an excellent tool for sensor layout in iFEM.


Introduction
The deformation of engineering structures under complex working conditions seriously affects the safety and life of the structure. In the past two decades, related scholars in the engineering field have begun to study structural health monitoring (SHM) technology [1][2][3][4]. The monitoring of the structure is divided into static monitoring and dynamic monitoring according to the state of the measured structure. Monitoring of static structures has lower requirements on real-time performance, which can be measured directly using measuring equipment, and focuses more on the analysis of the measurement data [5][6][7]. However, the monitoring of dynamic structures requires higher real-time performance. Structural deformation reconstruction is an important branch of dynamic structural health monitoring. In order to meet the requirements of practical engineering, the deformation reconstruction algorithm should be suitable under various boundary and working conditions. In Gherlone's analysis on shape sensing of structural deformation [8], the inverse finite element method (iFEM) is an effective deformation reconstruction method. Based on the least square theory, iFEM minimizes the error between surface theoretical strain and actual strain, and then realizes the conversion of surface strain and displacement, which was proposed by Tessler et al. [9,10]. Afterward, Gherlone et al. utilized the mathematical concepts of the iFEM methodology to developed an inverse frame element based on the kinematic assumptions of Timoshenko beam theory, which reconstructed the mode of stretching, bending, transverse-shear, and torsion-deformation [11]. Then, Gherlone et al. numerically and experimentally validated the superior capability of the inverse-frame element for shape sensing of three-dimensional frame structures undergoing static or Sensors 2022, 22, 5203 2 of 18 dynamic loading [12]. Zhao et al. reconstructed the displacement fields without the knowledge of structural mode shapes, material properties, and applied loading [13]. Niu et al. reconstructed the structural displacements based on strain data collected from the single surface of the structure [14]. Moreover, Chen et al. proposed a unified reconstruction method for the beam-like structure based on the framework of the iFEM, which reduces the structure identification error by adopting some generalized quantities [15].
In the application of the iFEM, some scholars found that the distribution of strain sensors will affect the reconstruction effect. In order to reduce the influence of external environmental factors on the measurement strain, Yuen et al. proposed a Bayesian sequential sensor placement algorithm for multi-type of sensors, based on the robust information entropy [16]. Zhao et al. adopted the particle swarm optimization algorithm to optimize the sensor placement, but it may lead to the degradation of the reconstruction accuracy [17]. Afterwards, Zhao et al. introduced multi-objective particle swarm optimization (MOPSO) to optimize the layout of the sensor, which optimizes both the robustness and the accuracy simultaneously [18]. However, due to the lack of a strategy to jump out of the local optimum, MOPSO is prone to ineffective exploration, with poor effect and low efficiency. The goal of this paper is to propose an optimization algorithm that can be better applied to sensor layout problems.
Optimization of sensor layout in iFEM is a multi-objective optimization problem where model gradient information is not easy to obtain. Traditional methods such as the Conjugate gradient method are no longer applicable. However, with the development of computer technology and biological research, evolutionary algorithms (EA) are gradually used in complex optimization problems. EA is a kind of heuristic random search algorithm based on population evolution, which has the ability to explore the real Pareto front (PF) without gradient information [19]. The key of the multi-objective evolutionary algorithm (MOEA) is that the algorithm achieves a balance between diversity and convergence, so as to effectively generate a set of Pareto optimal solutions that satisfy multiple conflicting objectives at the same time.
The multi-objective particle swarm optimization (MOPSO) [20][21][22], multi-objective ant colony optimization (MOACO) [23], and multi-objective bee colony optimization (MOBCO) [24,25] are typical multi-objective evolutionary algorithms that are widely used in practical engineering problems. Among them, MOPSO has the advantages of simple implementation and fast convergence speed, which is widely used in the optimization of practical engineering problems [26][27][28]. However, due to the existence of non-dominated solutions, the quality of the solution cannot be easily assessed, which brings difficulties to the selection of guiding particles. In particular, as the dimension of decision variables gradually increases, the MOPSO can no longer explore effectively.
The current research focuses on how to improve the optimization efficiency on the basis of balancing the convergence and diversity of the algorithm. At present, the improvement for MOPSO is mainly divided into three aspects. On the one hand, the multi-objective problem is solved using a competitive strategy. The competitive particle swarm optimization algorithm introduces a competitive mechanism, which selects the appropriate evolution direction through the game between particles [29][30][31]. On the other hand, multiobjective problems are optimized through a decomposition strategy. Yu et al. proposed a decomposition-based comprehensive learning particle swarm optimization algorithm, which optimizes each objective in the early stage and cooperates with each other in the later stage [32]. In addition, some scholars improve the guided particle selection strategy to optimize multi-objective problems. Zhu et al. proposed a novel archive-guided velocity update method to guide the transfer of the population [33]. Li et al. introduced a strategy based on ranking dominance to select the elite particles, which can obtain a more diverse and uniform distribution external archive [34]. The above algorithms introduce strategies on MOPSO to improve the performance of the algorithm, but as the target dimension increases, a single strategy will make the algorithm enter into long-term ineffective exploration, or even fall into local optimum. The IAMOPSO algorithm proposed in this paper focuses not only on convergence and diversity, but also on the efficiency of exploration.
To evaluate the effect of reconstruction, not only the accuracy, but also the robustness (the ability to resist external interference when the sensor is installed) should be considered. In this paper, the reconstruction accuracy is evaluated using the root mean square error (RMSE) of the actual displacement and theoretical displacement, and the robustness is evaluated by the composite sensitivity matrix. This paper is organized as follows. Section 2 briefly introduces the inverse finite element method for beam elements, and then establishes an optimization model of sensor distribution based on reconstruction accuracy and stability metrics. Section 3 proposes an improved adaptive multi-objective particle swarm optimization (IAMOPSO) algorithm. Section 4 applies IAMOPSO to the sensor layout problem on the deformation reconstruction of the circular beam model. The numerical and experimental verification results confirm that IAMOPSO is an excellent tool for sensor placement in iFEM.

Inverse Finite Element Method
The inverse finite element method (iFEM) is described in detail in Ref. [11]. The principle is briefly described in this section. As shown in Figure 1, for a Timoshenko beam, the deformation of the neutral axis can be represented by the displacement along each axis and the rotation angle around each axis. The displacement of the neutral axis u can be expressed as Equation (1).
(the ability to resist external interference when the sensor is installed ered. In this paper, the reconstruction accuracy is evaluated using th error (RMSE) of the actual displacement and theoretical displacement is evaluated by the composite sensitivity matrix. This paper is organized as follows. Section 2 briefly introduces t ment method for beam elements, and then establishes an optimizati distribution based on reconstruction accuracy and stability metrics. Se improved adaptive multi-objective particle swarm optimization (IA Section 4 applies IAMOPSO to the sensor layout problem on the defo tion of the circular beam model. The numerical and experimental ver firm that IAMOPSO is an excellent tool for sensor placement in iFEM

Inverse Finite Element Method
The inverse finite element method (iFEM) is described in detail in ciple is briefly described in this section. As shown in Figure 1, for a Tim deformation of the neutral axis can be represented by the displacem and the rotation angle around each axis. The displacement of the neu expressed as Equation (1). The displacement of any point on the beam cross-section along th tion y, and direction z can be represented by the neutral axis displace Define arbitrary section strain as:  The displacement of any point on the beam cross-section along the direction x, direction y, and direction z can be represented by the neutral axis displacement: Define arbitrary section strain as: e(u) = [e 1 , e 2 , e 3 , e 4 , e 5 , e 6 ] T . The strain along the axis at any point is the derivation of Equation (2) with respect to x: ε x (x, y, z) = e 1 (x) + ze 2 (x) + ye 3 (x) γ xz (x, y) = e 4 (x) + ye 6 (x) γ xy (x, y) = e 5 (x) − ze 6 (x) The section strain can be described as Equation (4).
Based on the least square method, iFEM minimizes the theoretical strain and experimental strain errors. The fitting function φ(u) between the theoretical section strain e(u) and the actual section strain e ε is defined as follows: The displacement at any section position can be represented by the shape function N(x) and the nodal degrees of freedom u e : After that, the strain at any section position can be calculated by Equation (7).
where B(x) is called the strain function matrix, which is the derivative of N(x). In order to minimize the error of theoretical strain and actual strain, let the derivative function of Equation (5) with respect to u be zero, then Equation (8) can be obtained.
k e and f ε can be expressed as: where L denotes the element length, n is the number of section strain distributions on the neutral axis, and x i represents the location where the section strains are evaluated; w k is a weighting factor considering the mutual influence of the axial stretching, bending, twisting, and transverse shearing; e ε k (x i ) are the section strains at the location x i , which is computed from strain-sensor values ε * 2 , shown in Ref. [11]. k e is a function of x i , whereas f ε depends on x i and the measured strain values ε * 2 . After splicing multiple inverse finite elements, Equation (10) can be obtained.
where K is global stiffness matrix, which is related to section position x i ; F is the global load vector, which depends on x i and ε * 2 . The matrix-vector equation provides a solution for the nodal freedom of structural deformation, U = K −1 F. Then, through Equation (6), the deformation of any section position can be obtained by interpolation. According to Equation (2), the deformation of any point can be calculated eventually.

Indexes to Evaluate the Effect of Deformation Reconstruction
After reconstructing the displacement field of the structure based on the iFEM, this section proposes two indicators to evaluate the effect of the reconstruction: reconstruction accuracy and robustness metrics. The former estimates the accuracy of reconstruction, and the latter reflects the stability of the reconstructed model.
When the sensor layout scheme X is selected, the reconstruction accuracy index RRMSE(X) is defined as follows: where disp F represents the theoretical displacement, which refers to the deformation value from simulation; disp P represents the displacement obtained by deformation reconstruction; N is the number of check points.
To explicitly the influence of strain-sensor values on reconstruction stability, Equation (10) can be transformed as where A(X) is referred as a strain-deformation converted matrix, which is only related to the location of sensors; ε * 2 is the measurement strain vector, and U is the nodal freedom of structural deformation.
The method proposed in Ref. [35] is used to measure the reconstruction stability, as shown in Equation (14).
where A i (X) is the i-th row vector of matrix A(X), and A i (X) consists of the remaining row vectors of A(X) minus A i (X). θ i (X) is calculated for each row vector, and the robustness index selects its maximum value. The reconstruction robustness index is defined as where m denotes the dimension of the structural node degrees of freedom. The bigger the value of RBI(X), the higher the error tolerance of matrix A(X) to sensor errors. The purpose of the sensor layout problem in iFEM is to find a sensor scheme that achieves a balance between reconstruction accuracy and reconstruction stability. The optimization model of sensor distribution is described as follows: where the number of sensors used in the reconstruction method is six; Index(X) represents objective function, consists of accuracy index RRMSE(X) and robustness index −RBI(X). The IAMOPSO proposed in Section 3 is used to find sensor schemes that minimize both metrics simultaneously.

Multi-Objective Particle Swarm Optimization Algorithm
The Particle Swarm Optimization (PSO) algorithm is a swarm intelligence optimization algorithm, which was proposed by Kennedy and Eberhart [36]. It guides individuals to transfer through the coordination among individuals, as shown in Equation (18) [37].
where pb i (t) is the individual optimal, which represents the optimal position of particle X i (t) in the past generation. gb i (t) is the group optimal, which represents the optimal location explored by all individuals in the group. w is the inertia weight (all w in Section 3 represent inertia weight). c 1 and c 2 are acceleration factors. r 1 and r 2 are random values between 0 and 1. The velocity at the next moment V i (t + 1) of the particle X i (t) is deter- mined by the current velocity V i (t), individual optimal pb i (t), and group optimal gb i (t). The particle moves from X i (t) to X i (t + 1) with an updated velocity V i (t + 1), as shown in Figure 2.
, and optimal i () t gb . The particle moves from , as shown in Figure 2. In multi-objective problems (MOP), there may be multiple exclusive objectiv tions, which make the quality of the solutions impossible to be simply compare Pareto dominance relation is defined as follows: If for X and Throughout the exploration, for MOP, the following issues need to be consid 1. How to guide particles to converge: Algorithm convergence is the foundation of an optimization algorithm. As sh Figure 2, the global optimum i gb and the individual optimum i pb influence th tive direction in each generation; hence, it is crucial to adopt an appropriate guide cle selection strategy.

How to balance the exploration and exploitation of algorithm:
If the algorithm focuses on exploitation and ignores exploration, particles m verge rapidly and fall into a local optimum. If the algorithm focuses on explorati neglects exploitation, the algorithm may explore ineffectively.
3. How to search the target space fully: For problems with complex shapes of the Pareto front, the algorithm needs explore the target space to ensure the integrity of the Pareto front.

How to improve exploration efficiency in a high-dimensional space:
Algorithms need to explore the Pareto front in a finite time, so the particles explore as efficiently as possible. In the guidance process, the particle information to be fully utilized to help the particles make better transfer strategies. In multi-objective problems (MOP), there may be multiple exclusive objective functions, which make the quality of the solutions impossible to be simply compared. The Pareto dominance relation is defined as follows: , m represents the number of objective functions, then the decision variable X is defined to dominate the decision variable Y. The final solution of MOP is not a single solution, but a set of non-dominated solutions.
Throughout the exploration, for MOP, the following issues need to be considered: 1.
How to guide particles to converge: Algorithm convergence is the foundation of an optimization algorithm. As shown in Figure 2, the global optimum gb i and the individual optimum pb i influence the iterative direction in each generation; hence, it is crucial to adopt an appropriate guided particle selection strategy.

2.
How to balance the exploration and exploitation of algorithm: If the algorithm focuses on exploitation and ignores exploration, particles may converge rapidly and fall into a local optimum. If the algorithm focuses on exploration and neglects exploitation, the algorithm may explore ineffectively.

3.
How to search the target space fully: For problems with complex shapes of the Pareto front, the algorithm needs to fully explore the target space to ensure the integrity of the Pareto front.

4.
How to improve exploration efficiency in a high-dimensional space: Algorithms need to explore the Pareto front in a finite time, so the particles should explore as efficiently as possible. In the guidance process, the particle information needs to be fully utilized to help the particles make better transfer strategies.

Improved Adaptive Multi-Objective Particle Swarm Optimization Algorithm
In this section, in order to balance the convergence and development of the algorithm and improve the efficiency of the algorithm, the IAMOPSO introduces the following four strategies on the basis of MOPSO. Moreover, the strategies employ external candidate solution (ECS) set consisting of non-dominated solutions obtained by the dominance relationship, which is updated after each particle transfer.

Initialization Strategy
MOPSO usually adopts the method of uniform initialization to generate the initial population. When the variable dimension is high and the target space is large, the population needs to explore for a long time. In addition, there are few particles in the ECS set in the early stage, which tends to trap the population in local optima. To solve this problem, an initialization method based on a single-objective problem is proposed in this paper.
Before formally entering the multi-objective optimization with m objectives, m times of single-objective optimization are carried out, respectively. In the single-objective optimization, the population size generally takes N Ini < N/5 and the number of iterations takes T Ini < T/10, where N is the number of particles and T is the maximum number of iterations. Some particles of each generation retained in the single-objective optimization process, which constitute the initial population P = P IniF1 ∪ P IniF2 · · · ∪ P IniFm , where P Ini−Fi represents the population composed of particles retained by single-objective optimization for the i-th objective. Take m = 2 as an example, Figure 3 shows the composition of the initial population for dual-objective optimization. The red particles are the particles retained in the process of optimizing the objective function F1, while the blue particles are the particles retained in the process of optimizing the objective function, F2. This is because, in the whole optimization process of single-objective optimization, each particle tends to cluster around the optimal position of the objective. Using the initialization strategy proposed in this section to synthesize a multi-objective initial population can maintain this trend and produce initial solutions with better performance.

Initialization Strategy
MOPSO usually adopts the method of uniform initialization to generate the in population. When the variable dimension is high and the target space is large, the po lation needs to explore for a long time. In addition, there are few particles in the ECS in the early stage, which tends to trap the population in local optima. To solve this p lem, an initialization method based on a single-objective problem is proposed in this per.
Before formally entering the multi-objective optimization with m objectives, m ti of single-objective optimization are carried out, respectively. In the single-objective o mization, the population size generally takes Ini N N/5  and the number of iterat takes Ini T < T/10 , where N is the number of particles and T is the maximum numbe iterations. Some particles of each generation retained in the single-objective optimiza process, which constitute the initial population IniF1 IniF2 IniFm P = P P P  , where In P represents the population composed of particles retained by single-objective optimiza for the i-th objective. Take m = 2 as an example, Figure 3 shows the composition of initial population for dual-objective optimization. The red particles are the particles tained in the process of optimizing the objective function F1, while the blue particles the particles retained in the process of optimizing the objective function, F2. This is cause, in the whole optimization process of single-objective optimization, each par tends to cluster around the optimal position of the objective. Using the initialization s egy proposed in this section to synthesize a multi-objective initial population can main this trend and produce initial solutions with better performance.

Adaptive Inertia Weight Strategy
The adaptive inertia weight strategy makes the algorithm focus on exploration ab in the early stage and exploitation ability in the later stage. It can be observed from Equation (19) that the algorithm has better exploration ability when 1 w  , and gradu converges when  1 w . IAMOPSO introduces a time factor to the inertia weight w , maps the Sigmoid function to the curve of w .

Adaptive Inertia Weight Strategy
The adaptive inertia weight strategy makes the algorithm focus on exploration ability in the early stage and exploitation ability in the later stage. It can be observed from the Equation (19) that the algorithm has better exploration ability when w > 1, and gradually converges when w < 1. IAMOPSO introduces a time factor to the inertia weight w, and maps the Sigmoid function to the curve of w.
where T represents the maximum number of iterations. Taking different S min and S max can dynamically adjust w, so as to control the exploration and exploitation of the algorithm. As shown in Figure 4, w max takes 1.2 and w min

Guided Particle Selection Strategy
In order to improve the efficiency of IAMOPSO, this paper adopts the fol adaptive method to select the guiding particle: When ECS is improved, the pop maintains the state of exploitation, and selects the particle closest to the origin in E as gb . when the ECS is not improved in a long time, the population enters the s exploration, and selects an individual in the sparse region of the ECS set as gb . T set is partitioned by angle in each generation, as shown in Figure 5. When the pop is in an exploitation state, the algorithm calculates the Euclidean distance betwee point and the origin. The distance between particle A and the origin is the smal particle A is selected as gb . When the population is in exploration state, particle no longer effectively guide particles, while particle B in the sparse region can guide cles to explore a uniformly distributed Pareto front. Particle B is selected as gb iteration.

Guided Particle Selection Strategy
In order to improve the efficiency of IAMOPSO, this paper adopts the following adaptive method to select the guiding particle: When ECS is improved, the population maintains the state of exploitation, and selects the particle closest to the origin in ECS set as gb. when the ECS is not improved in a long time, the population enters the state of exploration, and selects an individual in the sparse region of the ECS set as gb. The ECS set is partitioned by angle in each generation, as shown in Figure 5. When the population is in an exploitation state, the algorithm calculates the Euclidean distance between each point and the origin. The distance between particle A and the origin is the smallest, so particle A is selected as gb. When the population is in exploration state, particle A can no longer effectively guide particles, while particle B in the sparse region can guide particles to explore a uniformly distributed Pareto front. Particle B is selected as gb in this iteration.

Guided Particle Selection Strategy
In order to improve the efficiency of IAMOPSO, this paper adopts the fol adaptive method to select the guiding particle: When ECS is improved, the pop maintains the state of exploitation, and selects the particle closest to the origin in E as gb . when the ECS is not improved in a long time, the population enters the s exploration, and selects an individual in the sparse region of the ECS set as gb . T set is partitioned by angle in each generation, as shown in Figure 5. When the pop is in an exploitation state, the algorithm calculates the Euclidean distance betwee point and the origin. The distance between particle A and the origin is the smal particle A is selected as gb . When the population is in exploration state, particle no longer effectively guide particles, while particle B in the sparse region can guid cles to explore a uniformly distributed Pareto front. Particle B is selected as gb iteration.  Since different objective functions have different scales in practical applications, it is necessary to normalize the values of each objective function before partitioning. The maximum and minimum values of particles in the ECS set are used for normalization, as in Equation (23). F j (X i ) is the actual target value, and F j (X i ) is the value after normalization of the particle X i . As shown in Figure 5, the particle M corresponds to F min 1 and F max 2 , while the particle N corresponds to F max 1 and F min 2 . In this way, the particles in the ECS In the early stage of the iterative algorithm, there are few solutions in the ECS. If there are many partitions, many continuous sparse regions will be generated, resulting in low efficiency. In the later stage of the iterative algorithm, the number of solutions in the ECS set is large. If there are too few partitions, the sparse regions cannot be effectively identified during partitioning. In order to solve the above problems, the algorithm adopts an adaptive partition strategy according to the number of particles in the ECS set, which guides the population to explore sparse regions more efficiently.

External Candidate Solution Set Maintenance Strategy
In the later stage of the iterative algorithm, the number of particles in ECS set explodes, resulting in too much computational time. To reduce the selection pressure, some redundant particles need to be dynamically removed when the number of particles in ECS set reaches the threshold. The maintenance of non-dominated solutions focuses on how to reduce the selection pressure while maintaining the shape of PF.
Here, we use the partitioning strategy proposed in Section 3.2.3. We specify the maximum capacity of the ECS set N MaxArc . After each iteration, the ECS set is updated according to the Pareto dominance relationship. If the number of particles in the ECS set N Arc > N MaxArc , the algorithm maintains the external candidate solution. The algorithm first calculates the number of redundant particles, and then divides the ECS set into D regions: A = {A 1, , A 2 , · · · , A D }. Select a set of dense regions A dense , and randomly delete particles in dense region A dense according to the proportion.
A dense region is defined as: if the number of particles in the region k satisfy ρ( , then A k belongs to A dense , where ρ(A i ) is the particle density (number of particles) in region A i .
As shown in Figure 6, the maximum capacity of ECS N MaxArc is set to 20, while the current number of particles in ECS N Arc is 25. At this time, redundant particles need to be dynamically removed, and the number of redundant particles N remove is 5. Calculating the particle density in each region ρ(A i ), it can be found A sparse = min A i ρ(A i ) = A 5 , and ρ(A sparse = ρ(A 5 ) = 1. Since ρ(A 1 ) = 9 and ρ(A 3 ) = 6, which satisfy ρ(A k ) − ρ(A sparse ) ≥ N remove , then A 1 and A 3 belong to the dense region. Three redundant particles in A 1 and two redundant particles in A 3 are randomly removed according to the proportion (the red particles in Figure 6 will be dynamically deleted).

Algorithm Framework
The general framework of IAMOPSO is described as follows (see Algorithm 1).

Algorithm Framework
The general framework of IAMOPSO is described as follows (see Algorithm 1).

Algorithm 1: Framework of IAMOPSO
Input: Initialized population size N Ini , initialized number of iterations T Ini , number of particles N, maximum number of iterations T, maximum capacity of ECS set N MaxArc , adaptive inertia weight parameters w max , w min , S min , and S max , and number of initial partitions D = 3 Termination condition: The maximum number of iterations is reached.
Step 1: Initialize 1. Use the initialization strategy to generate the initial population.
2. Select the non-dominated solutions in the initial population and store them in the ECS set.

Technical Route
The sensor layout optimization employing the proposed IAMOPSO algorithm comprises three steps, which are illustrated in the schematic diagram of Figure 7. After the model of sensor distribution is established, the accuracy index RRMSE(X) and robustness index RBI(X) of sensor scheme are used as fitness functions in the IAMOPSO algorithm to evaluate the quality of each scheme. After optimization with IAMOPSO, a set of nondominated sensor schemes are obtained. Then, the evaluation of IAMOPSO is achieved through numerical and experimental evaluation on circular beams and complex models.

Numerical Examples
In this section, to evaluate the effect of the IAMOPSO algorithm on the sensor layou in the iFEM, a cantilever beam is reconsidered for the simulation example compared with

Numerical Examples
In this section, to evaluate the effect of the IAMOPSO algorithm on the sensor layout in the iFEM, a cantilever beam is reconsidered for the simulation example compared with the MOPSO proposed in Ref. [18]. The model employs a beam of homogeneous solid with the engineering simulation finite element analysis, which is divided into 200 elements and the cross-section of the beam is divided into 36 segments, as shown in Figure 8. The length of the beam model is L = 660 mm, the outer radius is R = 13 mm, and the inner radius is r = 11.5 mm. The target space is a series of position points, which carry strain information. The Young's modulus is E = 7.03 GPa, the Poisson's ratio is v = 0.3, and the density is p = 2700 kg/m 3 .

Numerical Examples
In this section, to evaluate the effect of the IAMOPSO algorithm on the sens in the iFEM, a cantilever beam is reconsidered for the simulation example compa the MOPSO proposed in Ref. [18]. The model employs a beam of homogeneous s the engineering simulation finite element analysis, which is divided into 200 elem the cross-section of the beam is divided into 36 segments, as shown in Figure 8. T of the beam model is = 660 mm L , the outer radius is = 13 mm R , and the inner = 11.5 mm r . The target space is a series of position points, which carry strain info The Young's modulus is = 7.03 GPa  Different loads are subjected to the free end of cantilever beam, which are fo the simultaneous application of two loads, as shown in Table 1. Different loads are subjected to the free end of cantilever beam, which are formed by the simultaneous application of two loads, as shown in Table 1. Six sensors (a sensor distribution scheme) were used to reconstruct the displacement field of the beam, and 200 checkpoints were selected to calculate the RRMSE. Based on the optimization model of sensor distribution proposed in Section 2, the IAMOPSO algorithm is used to optimize the layout of sensor, while the MOPSO proposed in Ref. [17] is used to compare and verify the performance of IAMOPSO. All sensor distribution schemes obtained and the Pareto front with IAMOPSO are shown in Figure 9.
As shown in Figure 9b, the distribution of the Pareto front shows that the reconstruction effect with IAMOPSO exceeds with MOPSO significantly. Moreover, by observing the particle transfer in the optimization process, it can be found that the MOPSO lacks the ability to jump out of the local optimum, which is inefficient. Meanwhile IAMOPSO can make full use of the information of particles and jump out of the local optimum, which is efficient.
Six sensors (a sensor distribution scheme) were used to reconstruct the displacement field of the beam, and 200 checkpoints were selected to calculate the RRMSE . Based on the optimization model of sensor distribution proposed in Section 2, the IAMOPSO algorithm is used to optimize the layout of sensor, while the MOPSO proposed in Ref. [17] is used to compare and verify the performance of IAMOPSO. All sensor distribution schemes obtained and the Pareto front with IAMOPSO are shown in Figure 9. As shown in Figure 9b, the distribution of the Pareto front shows that the reconstruction effect with IAMOPSO exceeds with MOPSO significantly. Moreover, by observing the particle transfer in the optimization process, it can be found that the MOPSO lacks the ability to jump out of the local optimum, which is inefficient. Meanwhile IAMOPSO can make full use of the information of particles and jump out of the local optimum, which is efficient.
The typical positions C1 and C2 on the Pareto front are selected for comparison with the position C3 obtained by the MOPSO algorithm, and the position information is shown in Table 2. In order to intuitively measure the reconstruction effect, the maximum error ( ERR max ) is introduced, which is defined as Equation (24).
where F i () disp X represents the theoretical displacement of i-th check points and P i () disp X represents the displacement of the i-th check point obtained by deformation reconstruction.  The typical positions C1 and C2 on the Pareto front are selected for comparison with the position C3 obtained by the MOPSO algorithm, and the position information is shown in Table 2. In order to intuitively measure the reconstruction effect, the maximum error (ERR max ) is introduced, which is defined as Equation (24).
where disp F i (X) represents the theoretical displacement of i-th check points and disp P i (X) represents the displacement of the i-th check point obtained by deformation reconstruction.  Table 3 compares the ERR max of the three typical schemes without interference, where Max_disp represents the maximum theoretical deformation displacement. The result shows that the reconstruction accuracy of the schemes C1 and C2 are better than that of the scheme C3. In order to verify the robustness, interferences are applied to three schemes, as shown in Equation (25). When the sensor distribution scheme is determined, these interferences  Table 4 shows the values of robustness and accuracy index on three schemes. The RRMSE of the three schemes is 2.6%, 2.8% and 3.4% without interference, while they degrade to 6.9%, 5.1% and 11.3% with interference applied, respectively. Obviously, C2 has excellent resistance to interference, which is more suitable for complex working conditions. In conclusion, according to the above analysis results, the sensor scheme C2 dominates C3 on all evaluation metrics, which indicates that the optimization effect of IAMOPSO obviously exceeds that of MOPSO.

Numerical and Experimental Validation
In this section, to demonstrate the universality of IAMOPSO algorithm for sensor layout applications, numerical and experimental verifications are performed on a complex plate-beam structure, which consists of three beams and one plate. The length of the beam is L c = 2200 mm, the outer radius is R = 20 mm, and the inner radius is r = 16 mm. The length of the board is 1500 mm, the width is 400 mm, and the thickness is 8 mm. The board is 470 mm from the fixed end. The distance between the main beam (middle beam) and the two symmetrical sub-beams is 130 mm. The ribs are 400 mm long, 50 mm wide, and 20 mm thick. The distances from the six ribs to the fixed end are 250 mm, 520 mm, 870 mm, 1220 mm, 1570 mm, and 1920 mm, respectively, as shown in Figure 10. The Young's modulus is E = 7.03 GPa, the Poisson's ratio is v = 0.3, and the density is p = 2700 kg/m 3 . In the simulation, a static load of 350 N was applied to the free end of the beam. Considering robustness and accuracy as indexes, the sensor distribution model is established. Then, the IAMOPSO algorithm is used to optimize the sensor placement, and the Pareto front is shown in Figure 11. Non-dominated schemes P1~P4 on PF are selected Considering robustness and accuracy as indexes, the sensor distribution model is established. Then, the IAMOPSO algorithm is used to optimize the sensor placement, and the Pareto front is shown in Figure 11. Non-dominated schemes P 1~P4 on PF are selected for detailed description, whose location information is shown in Table 5. Considering robustness and accuracy as indexes, the sensor distribution model is established. Then, the IAMOPSO algorithm is used to optimize the sensor placement, and the Pareto front is shown in Figure 11. Non-dominated schemes P1~P4 on PF are selected for detailed description, whose location information is shown in Table 5.   Figure 12 shows the corresponding sensor location of the four schemes P1~P4 in the model. It can be observed that a position of scheme P2 is relatively close to the rib, hence scheme P2 is not given priority considering the difficulty of installation. The remaining layout schemes are finally selected according to the actual engineering needs.   Figure 12 shows the corresponding sensor location of the four schemes P 1~P4 in the model. It can be observed that a position of scheme P 2 is relatively close to the rib, hence scheme P 2 is not given priority considering the difficulty of installation. The remaining layout schemes are finally selected according to the actual engineering needs. In the experiments, two types of sensors are used, one is the fiber Bragg grating (FBG) sensor that captures the surface strain, and the other is the position sensor that captures the true displacement of the marked points (check points). According to the sensor distribution scheme obtained by simulation, six fiber FBG sensors are installed on the main beam to reconstruct the displacement field, and position sensors are installed at the In the experiments, two types of sensors are used, one is the fiber Bragg grating (FBG) sensor that captures the surface strain, and the other is the position sensor that captures the true displacement of the marked points (check points). According to the sensor distribution scheme obtained by simulation, six fiber FBG sensors are installed on the main beam to reconstruct the displacement field, and position sensors are installed at the marked points of the plate, the positions of which are captured by a 3D optical measurement device (NDI Optotrak Certus, Northern Digital Incorporation, Waterloo, ON, Canada), as shown in Figure 13.
(c) (d) In the experiments, two types of sensors are used, one is the fiber Bragg grating (FBG) sensor that captures the surface strain, and the other is the position sensor that captures the true displacement of the marked points (check points). According to the sensor distribution scheme obtained by simulation, six fiber FBG sensors are installed on the main beam to reconstruct the displacement field, and position sensors are installed at the marked points of the plate, the positions of which are captured by a 3D optical measurement device (NDI Optotrak Certus, Northern Digital Incorporation, Waterloo, ON, Canada), as shown in Figure 13. Remove the unreasonable sensor scheme P2, and select the sensor schemes P1 and P3 with higher accuracy for experimental tests with different end node loads in the Z direction. The accuracy analysis is shown in Table 6, and max iFEM represents the maximum reconstructed deformation, while max NDI represents maximum experimental deformation measured by NDI. Remove the unreasonable sensor scheme P 2 , and select the sensor schemes P 1 and P 3 with higher accuracy for experimental tests with different end node loads in the Z direction. The accuracy analysis is shown in Table 6, and iFEM max represents the maximum reconstructed deformation, while NDI max represents maximum experimental deformation measured by NDI. It can be observed from Table 6 that under the load of 200 N, the maximum experimental deformation NDI max is 100.29 mm. With scheme P 1 , the maximum reconstructed displacement iFEM max is 103.09 mm, while with scheme P 3 , iFEM max is 104.26 mm. The error is controlled within 4 mm. Under the load of 350 N, the NDI max is 144.09 mm, the iFEM max with scheme P 1 is 148.21 mm, while iFEM max with scheme P 3 is 149.21 mm, the error is controlled within 5 mm, and the RRMSE can also be kept within 5%. The results demonstrate that the reconstruction effect of the sensor schemes P 1 and P 3 is excellent.
Since the reconstruction accuracy of the sensor layout scheme P 1 is similar to that of the sensor layout scheme P 3 , the scheme P 1 is selected for visualization. Figure 14 shows the deformation measured by NDI and reconstructed deformation with scheme P 1 under two concentrated loading conditions, and the reconstructed deformation is coincided with the reference value from the NDI, which indicates that the reconstruction effect is excellent with scheme P 1 .
Since the reconstruction accuracy of the sensor layout scheme P1 is similar to that of the sensor layout scheme P3, the scheme P1 is selected for visualization. Figure 14 shows the deformation measured by NDI and reconstructed deformation with scheme P1 under two concentrated loading conditions, and the reconstructed deformation is coincided with the reference value from the NDI, which indicates that the reconstruction effect is excellent with scheme P1. In conclusion, IAMOPSO can well solve the sensor distribution problem in iFEM. In practical engineering applications, under complex working conditions, on the basis of meeting the accuracy requirements, a sensor distribution scheme with higher stability should be selected, while under other conditions, a sensor distribution with high accuracy has priority.

Conclusions
This paper focuses on an optimization algorithm that can be better applied to sensor layout problems. This paper first constructs a multi-objective optimization model of sensor distribution in iFEM based on the accuracy and robustness metrics. To balance the optimization of the two objectives and improve the efficiency of the algorithm, this paper In conclusion, IAMOPSO can well solve the sensor distribution problem in iFEM. In practical engineering applications, under complex working conditions, on the basis of meeting the accuracy requirements, a sensor distribution scheme with higher stability should be selected, while under other conditions, a sensor distribution with high accuracy has priority.

Conclusions
This paper focuses on an optimization algorithm that can be better applied to sensor layout problems. This paper first constructs a multi-objective optimization model of sensor distribution in iFEM based on the accuracy and robustness metrics. To balance the optimization of the two objectives and improve the efficiency of the algorithm, this paper proposes an improved adaptive multi-objective particle swarm optimization algorithm, which introduces an initialization strategy, adaptive inertia weight strategy, guided particle selection strategy, and ECS set maintenance strategy. The results on the beam model validate the performance of the algorithm. Finally, the algorithm is applied to the deformation reconstruction of the complex plate-beam model, which can maintain high reconstruction accuracy and stability. The numerical and experimental results demonstrate that the optimization algorithm IAMOPSO proposed in this paper can well solve the sensor distribution problem in iFEM. Future work will focus on solving high-dimensional optimization problems in complex structural reconstruction.

Conflicts of Interest:
The authors declare no conflict of interest.