Underwater four-quadrant dual-beam circumferential scanning laser fuze using nonlinear adaptive backscatter filter based on pauseable SAF-LMS algorithm

The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance.

Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm-Based Clustering Scheme for Augmenting Network Lifetime in WSNs

In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches.

Inversion of Seabed Geotechnical Properties in the Arctic Chukchi Deep Sea Basin Based on Time Domain Adaptive Search Matching Algorithm

The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement.

Vibration Suppression for Active Magnetic Bearings Using Adaptive Filter with Iterative Search Algorithm

Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively.

Novel Adaptive Memory Event-Triggered-Based Fuzzy Robust Control for Nonlinear Networked Systems via the Differential Evolution Algorithm

This article mainly investigates the fuzzy optimization robust control issue for nonlinear networked systems characterized by the interval type-2(IT2)fuzzy technique under a differential evolution algorithm.To provide a more reasonable utilization of the constrained communication channel,a novel adaptive memory event-triggered(AMET)mechanism is developed,where two event-triggered thresholds can be dynamically adjusted in the light of the current system information and the transmitted historical data.Sufficient conditions with less conservative design of the fuzzy imperfect premise matching(IPM)controller are presented by introducing the Wirtinger-based integral inequality,the information of membership functions(MFs)and slack matrices.Subsequently,under the IPM policy,a new MFs intelligent optimization technique that takes advantage of the differential evolution algorithm is first provided for IT2 TakagiSugeno(T-S)fuzzy systems to update the fuzzy controller MFs in real-time and achieve a better system control effect.Finally,simulation results demonstrate that the proposed control scheme can obtain better system performance in the case of using fewer communication resources.

A Reference Vector-Assisted Many-Objective Optimization Algorithm with Adaptive Niche Dominance Relation

It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive.

Adaptive genetic algorithm with the criterion of premature convergence

To counter the defect of traditional genetic algorithms, an improved adaptivegenetic algorithm with the criterion of premature convergence is provided. The occurrence ofpremature convergence is forecasted using colony entropy and colony variance. When prematureconvergence occurs, new individuals are generated in proper scale randomly based on superiorindividuals in the colony. We use these new individuals to replace some individuals in the oldcolony. The updated individuals account for 30 percent - 40 percent of all individuals and the sizeof scale is related to the distribution of the extreme value of the target function. Simulationtests show that there is much improvement in the speed of convergence and the probability of globalconvergence.

ADAPTIVE GENETIC ALGORITHM BASED ON SIX FUZZY LOGIC CONTROLLERS

The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimization relationship. The use of six fuzzy logic controllers(6FLCs) is proposed for dynamic control genetic operating parameters of a symbolic-coded GA. This paper uses AGA based on 6FLCs to deal with the travelling salesman problem (TSP). Experimental results show that AGA based on 6FLCs is more efficient than a standard GA in solving combinatorial optimization problems similar to TSP.

MESH FREE ADAPTIVE ALGORITHM FOR SOLVING EULER EQUATIONS ON STRUCTURED GRID POINTS

A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.

The Algorithms of Adaptive Active Noise Control Systems in a Duct

On the basis of the theory of adaptive active noise control(AANC) in a duct, this article discusses the algorithms of the adaptive control, compares the algorithm characteristics using LMS, RLS and LSL algorithms in the adaptive filter in the AANC system, derives the recursive formulas of LMS algorithm. and obtains the LMS algorithm in computer simulation using FIR and IIR filters in AANC system. By means of simulation, we compare the attenuation levels with various input signals in AANC system and discuss the effects of step factor, order of filters and sound delay on the algorithm's convergence rate and attenuation level.We also discuss the attenuation levels with sound feedback using are and IIR filters in AANC system.

ADAPTIVE EXPONENT SMOOTHING GRADIENT ALGORITHM

A new algorithm, called the adaptive exponent smoothing gradient algorithm (AESGA), is developed from Widrow′s LMS algorithm. It is based on the fact that LMS algorithm has properties of time delaying and low pass filtering. This paper shows that the algorithm, on the domain of {Ω 1:α∈(0,1)}×{Ω 2:β(0,∞)} , unbiasedly and asymptotically converges to the Winner solution when the signal is a stationary Gauss stochastic process. The convergent property and the performance misadjustment are analyzed in theory. And calculation method of the algorithm is also suggested. Numerical results given by computer simulations show that the algorithm is effective.

Adaptive Antenna Utilizing Power Inversion and Linearly Constrained Minimum Variance Algorithms

This paper presents a new algorithm based on the power inversion （PI） and the linearly constrained minimum variance （LCMV）. This algorithm is capable of adjusting the weights of the antenna array in real time to respond to and improve the global positioning system （GPS） received signals coming from the desired directions and at the same time to highly suppress the jammers coming from the other directions. The simulation is performed for fixed and moving jammers. It indicates that this structure can give deeper nulls, more than 115 dB depths for fixed jammers and more than 94 dB depths for moving jammers.

A new adaptive mutative scale chaos optimization algorithm and its application

Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin（2/x） with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with finite collapses （e.g., Logistic map, Tent map, and Chebyshev map）, a new adaptive mutative scale chaos optimization algorithm （AMSCOA） is proposed by using the chaos model x = sin（2/x）. In the optimization algorithm, in order to ensure its advantage of speed convergence and high precision in the seeking optimization process, some measures are taken： 1） the searching space of optimized variables is reduced continuously due to adaptive mutative scale method and the searching precision is enhanced accordingly; 2） the most circle time is regarded as its control guideline. The calculation examples about three testing functions reveal that the adaptive mutative scale chaos optimization algorithm has both high searching speed and precision.

A Linear Domain System Identification for Small Unmanned Aerial Rotorcraft Based on Adaptive Genetic Algorithm

This paper proposes a new adaptive linear domain system identification method for small unmanned aerial rotorcraft.Byusing the flash memory integrated into the micro guide navigation control module, system records the data sequences of flighttests as inputs (control signals for servos) and outputs (aircraft’s attitude and velocity information).After data preprocessing, thesystem constructs the horizontal and vertical dynamic model for the small unmanned aerial rotorcraft using adaptive geneticalgorithm.The identified model is verified by a series of simulations and tests.Comparison between flight data and the one-stepprediction data obtained from the identification model shows that the dynamic model has a good estimation for real unmannedaerial rotorcraft system.Based on the proposed dynamic model, the small unmanned aerial rotorcraft can perform hovering,turning, and straight flight tasks in real flight tests.

A Parallel Algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection

Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.

Adaptive inverse control of random vibration based on the filtered-X LMS algorithm

Random vibration control is aimed at reproducing the power spectral density （PSD） at specified control points. The classical frequency-spectrum equalization algorithm needs to compute the average of the multiple frequency response functions （FRFs）, which lengthens the control loop time in the equalization process. Likewise, the feedback control algorithm has a very slow convergence rate due to the small value of the feedback gain parameter to ensure stability of the system. To overcome these limitations, an adaptive inverse control of random vibrations based on the filtered-X least mean-square （LMS） algorithm is proposed. Furthermore, according to the description and iteration characteristics of random vibration tests in the frequency domain, the frequency domain LMS algorithm is adopted to refine the inverse characteristics of the FRF instead of the traditional time domain LMS algorithm. This inverse characteristic, which is called the impedance function of the system under control, is used to update the drive PSD directly. The test results indicated that in addition to successfully avoiding the instability problem that occurs during the iteration process, the adaptive control strategy minimizes the amount of time needed to obtain a short control loop and achieve equalization.

Satellite Constellation Design with Adaptively Continuous Ant System Algorithm

The ant system algorithm （ASA） has proved to be a novel meta-heuristic algorithm to solve many multivariable problems. In this paper, the earth coverage of satellite constellation is analyzed and a n ＋ 1^ -fold coverage rate is put forward to evaluate the coverage performance of a satellite constellation. An optimization model of constellation parameters is established on the basis of the coverage performance. As a newly developed method, ASA can be applied to optimize the constellation parameters. In order to improve the ASA, a rule for adaptive number of ants is proposed, by which the search range is obviously enlarged and the convergence speed increased. Simulation results have shown that the ASA is more quick and efficient than other methodV211.71s.

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm

Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.

IMPROVED FXLMS ALGORITHM BASED ON ADAPTIVE NOTCH FILTER APPROACH

An improved algorithm is presented to identify the secondary path based on the adaptive notch filter approach. Since the interference from the narrow band excitation signal is suppressed by the adaptive notch filter, the convergent speed of the on-line control path identification process is significantly improved. As a result, the controller performance is greatly enhanced. Besides the algorithm development, some important factors, such as the influence of reference signal on the controller convergent speed, are also discussed. The effectiveness of the algorithm is verified by experimental results.

A Chaos Sparrow Search Algorithm with Logarithmic Spiral and Adaptive Step for Engineering Problems

The sparrow search algorithm(SSA)is a newly proposed meta-heuristic optimization algorithm based on the sparrowforaging principle.Similar to other meta-heuristic algorithms,SSA has problems such as slowconvergence speed and difficulty in jumping out of the local optimum.In order to overcome these shortcomings,a chaotic sparrow search algorithm based on logarithmic spiral strategy and adaptive step strategy(CLSSA)is proposed in this paper.Firstly,in order to balance the exploration and exploitation ability of the algorithm,chaotic mapping is introduced to adjust the main parameters of SSA.Secondly,in order to improve the diversity of the population and enhance the search of the surrounding space,the logarithmic spiral strategy is introduced to improve the sparrow search mechanism.Finally,the adaptive step strategy is introduced to better control the process of algorithm exploitation and exploration.The best chaotic map is determined by different test functions,and the CLSSA with the best chaotic map is applied to solve 23 benchmark functions and 3 classical engineering problems.The simulation results show that the iterative map is the best chaotic map,and CLSSA is efficient and useful for engineering problems,which is better than all comparison algorithms.