Whole cycle ambiguity resolving method based on simulated annealing ant lion algorithm
By improving the integer ambiguity resolution method of the antlion algorithm through simulated annealing, the problem of low efficiency in integer ambiguity resolution in carrier phase precision positioning is solved, and a fast and accurate improvement in positioning accuracy is achieved.
Patent Information
- Application Number
- CN202411134619.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-19
- Publication Date
- 2024-11-26
AI Technical Summary
In existing technologies for carrier phase precise positioning in global satellite navigation systems, integer ambiguity resolution methods suffer from problems such as large search space, long search time, and low search efficiency. Furthermore, genetic algorithms are prone to causing the population to get trapped in local optima, making it impossible to find the global optimum.
An integer fuzzy resolution method based on simulated annealing antlion algorithm is adopted. By initializing the positions of ant and antlion populations, the ant random walk function is improved by using the roulette wheel algorithm. Combined with the least squares criterion and simulated annealing algorithm, the search capability of antlion algorithm is improved, allowing it to escape local optima and find the global optimum.
It effectively reduces ambiguity search time, improves the success rate of resolution, enhances positioning accuracy and search efficiency, avoids the population getting trapped in local optima, and achieves fast and accurate integer ambiguity resolution.
Smart Images

Figure CN119024391A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of satellite navigation signal processing, and in particular to an integer ambiguity resolution method based on a simulated annealing ant lion algorithm. Background Art
[0002] In the global satellite navigation system, carrier phase technology is usually used for positioning. First, a double-difference carrier phase observation model is constructed, and then the algorithm is used to solve the correct number of carrier phase integers between the satellite and the receiver in the model, that is, the integer ambiguity, so that the position coordinates with higher accuracy can be solved. Before calculating the carrier phase, the integer ambiguity needs to be fixed, so how to quickly and accurately fix the integer ambiguity is a key issue in carrier phase measurement.
[0003] With the rapid development of carrier phase precision positioning technology, integer ambiguity resolution methods have attracted extensive attention from scholars at home and abroad. In recent years, many integer ambiguity resolution methods have been proposed. The ambiguity resolution is generally implemented according to the steps of "floating point solution resolution - integer solution search, fixed - integer solution confirmation". At present, the most widely used method for solving integer ambiguity is the LAMBDA (Least-square Ambiguity Decorrelation Adjustment) algorithm. The LAMBDA algorithm is divided into two steps of reducing correlation and ambiguity search for solving integer ambiguity. First, the ambiguity floating point solution and its corresponding ambiguity variance-covariance matrix are obtained by the ambiguity double difference model. On the basis of the floating point solution, an integer solution set around the floating point solution is used as the solution space, and the ambiguity variance-covariance matrix is reduced in correlation to reduce the solution space range; then, the corresponding search strategy and search technology are used in the solution space area centered on the floating point solution to solve the optimal ambiguity solution. Since a single point can only provide a limited amount of search information, and the search process needs to traverse all candidate points in the search space, when there are more observation data, the search space of the LAMBDA algorithm is larger, which increases the search overhead and prolongs the search time. Therefore, the algorithm search efficiency can be further improved. In addition, some scholars use genetic algorithms (GA) to search for integer fuzziness. They use the unique global search characteristics of genetic algorithms to start the search for the optimal solution from many individuals, and perform genetic operations such as selection, crossover, and mutation on the population to search for the optimal solution for fuzziness. However, during the entire search process of the genetic algorithm, the crossover probability and mutation probability values remain constant, which can easily lead to the loss of diversity of individuals in the population, causing the population to fall into premature maturity, and the fuzzy search cannot jump out of the local optimum, and ultimately cannot obtain the global optimal solution. Summary of the invention
[0004] The purpose of the present invention is to provide an integer ambiguity resolution method based on simulated annealing ant lion algorithm, aiming to reduce the ambiguity search time, increase the success rate of ambiguity resolution, solve the problem that the integer ambiguity cannot be correctly fixed in the carrier phase precision positioning technology of the global satellite navigation system, and improve the positioning accuracy.
[0005] To achieve the above object, the present invention provides an integer ambiguity resolution method based on a simulated annealing ant lion algorithm, comprising the following steps:
[0006] Step 1: Determine the initial position of the ant population based on the floating point solution, and set the population size and the maximum number of iterations;
[0007] Step 2: The roulette algorithm improves the random walk function, and the ants update their position information according to the improved walk function;
[0008] Step 3: Construct a cost loss function based on the least squares criterion and calculate the fitness values of all ant locations;
[0009] Step 4: The ant lion eats the ants, compares the fitness values, and uses the simulated annealing algorithm to decide whether the population should migrate and determine the location of the ant colony at the next moment;
[0010] Step 5: If the number of iterations reaches the set threshold, output the optimal solution.
[0011] Optionally, the execution process of step 1 is specifically to initialize the individual dimensions and search space of the ant lion and ant population. During initialization, N ant lions and N ants are randomly initialized in the solution space, and the position is X=(x 1 ,x 2 …,x D ), each ant must select a target antlion for subsequent random walks. The selection process uses the roulette algorithm to improve the random walk ability of ants in the antlion algorithm.
[0012] Optionally, in step 2, the ant updates the position information and calculates the trap size according to the improved walk function to determine the position of the ant after random walk; then the relative value of the ant's random walk, the range of the antlion trap and the position of the ant are calculated, and the ant will randomly walk around the antlion it chooses and eventually stay in the trap of the selected antlion.
[0013] Optionally, in step 3, the position of the ant population at the next moment is determined by calculating the fitness values of the positions of all ants. Based on the least squares principle, the optimal solution to the ambiguity is the solution that minimizes the square of the distance between the ambiguity integer solution and the floating point solution.
[0014] Optionally, during the execution of step 4, a simulated annealing algorithm is used to improve the ability of the ant lion algorithm to jump out of the local optimum, and the fitness value of the current position of the ant lion group is compared with the fitness value of the position of the ant lion group at the previous moment to determine whether the random walk is effective. If the walk is effective, the position after the walk is used as the new position of the ant lion group. If the walk is invalid, the position of the ant lion group before the walk continues to be used, and return to step 2 for a new round of random walk.
[0015] Optionally, during the execution of step 5, the optimal position information of the population is determined by comparing the fitness values of the current optimal position of the population with the optimal position candidate group, and the optimal ant lion position information is output as the searched optimal solution.
[0016] The present invention provides an integer ambiguity resolution method based on a simulated annealing antlion algorithm. According to the solution space range determined by the floating point solution, the positions of ants and antlion populations are initialized, and the population size and the number of iterations are set. The roulette algorithm is used to improve the ant random walk function in the antlion algorithm. The ants find the corresponding position information according to the random walk function, and the fitness values of the positions of all ants are calculated using the least squares criterion. The antlion eats the ant and predicts the position of the ant's next migration. The simulated annealing algorithm is used to jump out of the local optimal population position and find the optimal antlion population position. If the number of iterations reaches the set threshold, the optimal solution is output. The present invention can effectively avoid the situation where the population falls into the local optimum and cannot search for the global optimal solution. In the case of multi-dimensional ambiguity resolution, it still has a fast resolution capability and a high resolution success rate. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0018] Figure 1 It is a schematic diagram of the steps of an integer ambiguity resolution method based on a simulated annealing ant lion algorithm of the present invention.
[0019] Figure 2 It is a specific flow chart of an integer ambiguity resolution method based on the simulated annealing ant lion algorithm of the present invention.
[0020] Figure 3 It is a schematic diagram of the fitness value evolution curve of each algorithm of PSO, SSO, ALO and SAALO in Example 2 of the specific embodiment of the present invention.
[0021] Figure 4It is a schematic diagram of the fitness value evolution curve of the ALO algorithm in Example 3 of the specific embodiment of the present invention.
[0022] Figure 5 It is a schematic diagram of the fitness value evolution curve of the SAALO algorithm in Example 3 of the specific embodiment of the present invention.
[0023] Figure 6 It is a running time diagram of the ALO algorithm in Example 3 of the specific embodiment of the present invention.
[0024] Figure 7 It is a running time diagram of the SAALO algorithm in Example 3 of the specific embodiment of the present invention.
[0025] Figure 8 It is a schematic diagram of the evolution curve of the six-dimensional fitness value solution of the SAALO algorithm in Example 4 of the specific embodiment of the present invention.
[0026] Fig. 9 It is a schematic diagram of the evolution curve of the 12-dimensional fitness value solution of the SAALO algorithm in Example 4 of the specific embodiment of the present invention.
[0027] Fig.10 It is a running time diagram of the six-dimensional fitness value solution of the SAALO algorithm in Example 4 of the specific embodiment of the present invention.
[0028] Fig.11 It is a running time diagram of the 12-dimensional fitness value solution of the SAALO algorithm in Example 4 of the specific embodiment of the present invention.
[0029] Fig.12 It is a diagram of the x-direction positioning result in Example 5 of the specific embodiment of the present invention.
[0030] Fig.13 It is a diagram of the y-direction positioning result in Example 5 of the specific embodiment of the present invention.
[0031] Fig.14 It is a diagram of the positioning results in the z direction in Example 5 of the specific embodiment of the present invention. DETAILED DESCRIPTION
[0032] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present invention, and should not be construed as limiting the present invention.
[0033] The following is a semantic explanation of some of the English term abbreviations that appear in this invention:
[0034] Particle Swarm Optimization (PSO);
[0035] Spherical search optimizer (SSO);
[0036] Ant lion optimizer (ALO);
[0037] Simulated Annealing Ant lion optimizer (SAALO).
[0038] See also Figure 1 The present invention provides an integer ambiguity resolution method based on a simulated annealing ant lion algorithm, comprising the following steps:
[0039] S1: Determine the initial position of the ant population based on the floating point solution, and set the population size and maximum number of iterations;
[0040] S2: Roulette algorithm improves the random walk function, and the ants update their position information according to the improved walk function;
[0041] S3: Construct a cost loss function based on the least squares criterion and calculate the fitness values of all ant locations;
[0042] S4: The ant lion eats the ants, compares the fitness values, and uses the simulated annealing algorithm to decide whether the population should migrate and determine the location of the ant colony at the next moment;
[0043] S5: If the number of iterations reaches the set threshold, the optimal solution is output.
[0044] The following is a further explanation of the specific implementation steps. Figure 2 As shown:
[0045] Step S1: Determine the initial position of the ant population based on the floating point solution, and set the population size and maximum number of iterations. Initialize the individual dimensions and search space of the ant lion and ant population. During initialization, N ant lions and N ants are randomly initialized in the solution space, and their positions are X = (x 1 ,x 2 …,x D ), each ant must select a target antlion for subsequent random walks. The selection process uses the roulette algorithm to improve the random walk ability of ants in the antlion algorithm.
[0046] Step S2: The roulette algorithm improves the random walk function, and the ants update their position information based on the improved walk function and the range of the antlion trap. The trap size is calculated to determine the position of the ants after random walk. The trap size calculation formula is as follows:
[0047]
[0048] Among them, t is the current iteration number and T is the maximum iteration number.
[0049] Ants walk randomly, and define the function rw as:
[0050]
[0051] Where r is a uniform random number in (0,1).
[0052] The random walk function is:
[0053]
[0054] Calculate the relative value of the ant's random walk. The random walk value of the i-th ant in the t-th generation is RW_i(t), then RW_i(t+1)=RW_i(t)+rw, the maximum value of the random walk in the t-th generation group is: Max(RW(t)), and the minimum value is: Min(RW(t)). Define ARW_i(t) as the relative position of the i-th ant in the t-th generation random walk, and the calculation formula is:
[0055]
[0056] Calculate the range of the antlion trap. The ant selects k antlions as its target antlions, and the calculated ratio ratio can be used to calculate the trap range trap where the antlion is located.
[0057]
[0058] Where, d min is the value range of the d-dimensional solution space, d max It is the upper bound of the value range of the d-dimensional solution space. is the d-dimensional position of the k-th antlion. Represents the value range of the dth dimension of the kth antlion trap.
[0059] Calculate the position of the ant. The ant will randomly walk around the ant lion it chooses and eventually stay in the trap of the selected ant lion. The formula for calculating the ant's position is:
[0060]
[0061] It can be seen from the formula that the position of the i-th ant is in the antlion trap it chooses, and the specific position is determined by the relative position of the ant's random walk results in the group. In addition, the ant will also randomly walk towards the global optimal antlion individual, and finally stay at the midpoint of the two positions:
[0062]
[0063] Step S3: Construct a cost loss function based on the least squares criterion and calculate the fitness values of all ant locations. By calculating the fitness values of all ant locations, it is convenient to determine the location of the ant population at the next moment in the subsequent steps. According to the least squares principle, the optimal solution to the ambiguity should be the solution that minimizes the square of the distance between the integer solution and the floating point solution of the ambiguity. Therefore, when the floating point solution of the double difference integer ambiguity is and the error covariance matrix Q y After Z transformation, the cost loss function is as follows:
[0064]
[0065] In the above formula: is the integer solution of the double difference integer ambiguity after being fixed; is the double difference integer ambiguity floating point solution after Z transformation; is the inverse matrix of the covariance matrix after Z transformation.
[0066] Step S4: The ant lion eats the ant, and the ant lion moves to the position of the specified ant. The fitness values are compared, and the simulated annealing algorithm determines whether the population migrates and retains the current optimal value. The core of the algorithm is the random walk of the ant. The improved random walk function provides the algorithm with a good search capability, and the proportion of traps determines its search range, whether it is a local search or a global search. However, the ant lion algorithm has a poor ability to jump out of the local optimum during the search process. When faced with the problem of local optimal values, it is often difficult to find the global optimal value. The simulated annealing algorithm is used to improve the ability of the ant lion algorithm to jump out of the local optimum. The fitness value of the current position of the ant lion group is compared with the fitness value of the position of the ant lion group at the previous moment to determine whether the random walk is effective. If the walk is effective, the position after the walk is used as the new position of the ant lion group. If the walk is invalid, the position of the ant lion group before the walk continues to be used, and return to step S2 for a new round of random walk.
[0067] The simulated annealing algorithm is based on the solid temperature drop process. It uses the Metropolis criterion to determine whether to accept new results. It has the ability to quickly search for the global optimal solution. At the same time, it can also perform mutations during the search process, which greatly increases the ability of the algorithm to jump out of the local optimal value. The description of the Metropolis criterion is as follows:
[0068] First, calculate the difference between the temperature at this moment and the previous moment, that is, the difference in fitness function, as shown in the following formula:
[0069] ΔT=f(x t+1 )-f(x t )
[0070] In the above formula: f(x t+1 ) represents the temperature at the current moment, f(x t ) indicates the temperature at the previous moment.
[0071] If ΔT < 0, the solution at time t+1 is accepted as the new solution; otherwise, the probability of selecting the solution as the new solution is calculated. The probability calculation formula is as follows:
[0072]
[0073] In the above formula: p represents the probability of accepting the solution at time t+1 as the new solution; E Tnew Indicates the state energy at the current temperature T. E Tcur Represents the state energy at the current temperature T.
[0074] Step S5: When the number of iterations reaches the set threshold, the fuzzy optimal solution is output. The optimal position information of the population is determined by comparing the fitness value of the current optimal position of the population with the optimal position candidate group, and the optimal ant lion position information is output as the searched optimal solution.
[0075] Furthermore, the present invention also proposes a specific embodiment, and the advantages of the present invention are supplemented by the following 5 examples:
[0076] Example 1: 3D double-difference integer ambiguity resolution
[0077] For the three-dimensional double-difference integer ambiguity float solution And the covariance matrix
[0078]
[0079] After searching the above ambiguity using the integer ambiguity resolution method based on the simulated annealing ant lion algorithm provided by the present invention, the optimal solution of the integer ambiguity is obtained as follows:
[0080]
[0081] Example 2: Algorithm performance test
[0082] This example uses 8 internationally common benchmark test functions for testing, as shown in Table 1. F1 to F5 are 5 unimodal test functions, which are single and can explore the local search capability of the algorithm; F6 to F8 are 3 multimodal test functions, which can explore the global search capability of the algorithm. The minimum values of all test functions are equal to 0. All experiments are run independently 30 times, the maximum number of iterations is set to 500, and the population size is 30. In order to intuitively test the performance of the optimization algorithm, the present invention calculates the mean and standard deviation of the 30 experimental data.
[0083] Table 1 Test functions
[0084]
[0085] Compare with different optimization algorithms. In order to verify the optimization ability of SAALO optimization algorithm, the present invention compares it with particle swarm optimization (PSO), spherical search optimizer (SSO), and ant lion optimizer (ALO). 30 independent experimental iteration tests were performed, and the mean and standard deviation were calculated. The results are shown in Table 2. A set of iterative data was randomly selected for plotting, as shown in Table 2. Figure 3 shown.
[0086] From the average values and standard deviations in Table 2, we can see that in the unimodal test function, SAALO has the best optimization ability and convergence speed. In the multimodal test function, SAALO has higher optimization ability and convergence speed than PSO, SSO, and ALO.
[0087] Table 2 Comparison of performance test results of four algorithms
[0088]
[0089] Column 3: Multi-algorithm performance analysis and comparison
[0090] This example compares the ALO algorithm, SAALO algorithm, LAMBDA algorithm, and MLAMBDA algorithm, a total of 4 algorithms, and analyzes their solution performance. The double-difference integer ambiguity floating-point solution and covariance matrix in three dimensions are as follows:
[0091]
[0092] After the descending correlation operation, the floating point solution and covariance matrix are transformed as follows:
[0093]
[0094] Assume that the initial ant population is 5, the population dimension is 3, and the maximum number of iterations is 50. Compare the ALO algorithm, SAALO algorithm, LAMBDA algorithm, and MLAMBDA algorithm to analyze the search performance of the new algorithm. The fitness change curves of the ALO algorithm and the SAALO algorithm are as follows: Figure 4 and Figure 5 As shown in Figure 2, multiple experiments have shown that the ALO algorithm can reach the area near the optimal fitness value after about 41 iterations, and the SAALO algorithm can reach the area near the optimal fitness value after about 6 iterations by improving the ability to jump out of the local optimal value through simulated annealing.
[0095] In order to have a more accurate understanding of the solution time for each experiment, the calculation time of the ALO and SAALO algorithms is displayed in a bar graph as follows: Figure 6 and Figure 7 By comparing the running time of the three algorithms, the ALO algorithm has the shortest solution time, while the SAALO algorithm has a slightly longer solution time.
[0096] In order to compare and analyze the accuracy and reliability of each algorithm in three dimensions, the above four algorithms were tested 100 times, with a maximum number of iterations of 50 each time. The solution results, average solution time and solution success rate are shown in Table 3.
[0097] Table 3 Comparison of five algorithms
[0098]
[0099] Although the ALO algorithm has a fast solution speed, the solution success rate is not high. The SAALO algorithm has a slightly slower solution speed, but a high solution success rate. By comparing with the LAMBDA algorithm and the M-LAMBDA algorithm, SAALO is slightly better than the LAMBDA algorithm and the M-LAMBDA algorithm in terms of solution time; and the solution success rate is the same as the two algorithms. The SAALO algorithm can solve the 3D ambiguity problem very well.
[0100] Example 4: Multi-dimensional Integer Ambiguity Resolution Experiment
[0101] With the development of satellite systems in various countries, the introduction of multiple systems has increased the number of satellites involved in the solution and increased the complexity of the ambiguity search and solution. Therefore, the multi-dimensional integer ambiguity solution performance is one of the key indicators of the integer ambiguity solution algorithm. The present invention conducts 3D, 6D and 12D ambiguity solution experiments for the SAALO algorithm. The 3D experimental data is consistent with Example 3, and the 6D and 12D floating point solution matrices are as follows:
[0102]
[0103] The fitness change curves of the 6-dimensional and 12-dimensional SAALO algorithm solution process are shown as follows: Figure 8 and Fig. 9 As shown in . Regardless of whether it is 6-dimensional or 12-dimensional ambiguity resolution, even if the SAALO algorithm falls into a local optimum for a short period of time, it can jump out of the local optimum later. The running time of the 6-dimensional and 12-dimensional SAALO algorithms is shown in Fig.10 and Fig.11 As shown in the figure, with the increase of ambiguity dimension, the complexity of ambiguity resolution increases and the resolution time increases accordingly.
[0104] In order to compare and analyze the accuracy and reliability of the SAALO algorithm in different dimensions, the SAALO algorithm was repeated 100 times for 3D, 6D and 12D ambiguity, and the maximum number of iterations each time was 50. The average solution time and solution success rate are shown in Table 4.
[0105] Table 4 Comparison of SAALO algorithms in different dimensions
[0106]
[0107] As the ambiguity dimension increases, the average solution time of the algorithm increases accordingly, and the solution success rate also decreases, but the algorithm's solution speed and solution success rate can still meet engineering needs.
[0108] Example 5: Practical Engineering Application
[0109] In order to verify the performance of the algorithm in the actual application environment, the SAALO algorithm was introduced into the RTK experiment. A single-frequency U-blox receiver was used for data collection, and a total of 644 epoch data were collected. The distance between the base station and the mobile station was 2m, and the collection location was the rooftop of the library of the Jinjiling Campus of Guilin University of Electronic Technology.
[0110] The RTK positioning experiment was carried out using the SAALO algorithm. The final positioning result is as follows: Figure 12 to Figure 14 As shown in the figure. The errors of the SAALO algorithm in the x, y, and z directions are ±0.8 cm, ±1.5 cm, and ±1 cm, respectively, which can achieve centimeter-level positioning. For a single-frequency single system, the SAALO algorithm has a fast enough solution speed. Introducing the algorithm into the engineering solution of a single-frequency single GPS system can well achieve the real-time and accuracy of the positioning process. The solution success rate and positioning accuracy can also be guaranteed, which can meet the requirements of single-frequency single-system engineering.
[0111] In summary, the present invention provides an integer ambiguity solution method based on simulated annealing antlion algorithm. According to the solution space range determined by the floating point solution, the positions of ants and antlion populations are initialized, and the population size and number of iterations are set. The roulette algorithm is used to improve the ant random walk function in the ant lion algorithm. The ants find the corresponding position information according to the random walk function, and the fitness values of the positions of all ants are calculated using the least squares criterion. The ant lion eats the ants and predicts the position of the next migration of the ants; the simulated annealing algorithm is used to jump out of the local optimal population position and find the optimal ant lion population position; if the number of iterations reaches the set threshold, the optimal solution is output. The present invention can effectively avoid the situation where the population falls into the local optimum and cannot search for the global optimal solution. In the case of multi-dimensional ambiguity solution, it still has a fast solution capability and a high solution success rate.
[0112] What is disclosed above is only a preferred embodiment of the present invention, and it certainly cannot be used to limit the scope of rights of the present invention. Ordinary technicians in this field can understand that all or part of the processes of the above embodiment and equivalent changes made according to the claims of the present invention still fall within the scope of the invention.
Claims
1. A method for integer ambiguity resolution based on simulated annealing ant lion algorithm, characterized in that: The following steps are involved: Step 1: Determine the initial position of the ant population based on the floating point solution, and set the population size and the maximum number of iterations; Step 2: The roulette algorithm improves the random walk function, and the ants update their position information according to the improved walk function; Step 3: Construct a cost loss function based on the least squares criterion and calculate the fitness values of all ant locations; Step 4: The ant lion eats the ants, compares the fitness values, and uses the simulated annealing algorithm to decide whether the population should migrate and determine the location of the ant colony at the next moment; Step 5: If the number of iterations reaches the set threshold, output the optimal solution.
2. The integer ambiguity resolution method based on the simulated annealing ant lion algorithm according to claim 1, characterized in that: The execution process of step 1 is to initialize the individual dimensions and search space of the ant lion and ant population. During initialization, N ant lions and N ants are randomly initialized in the solution space, and the position is X = (x 1 ,x 2 …,x D ), each ant must select a target antlion for subsequent random walks. The selection process uses the roulette algorithm to improve the random walk ability of ants in the antlion algorithm.
3. The integer ambiguity resolution method based on the simulated annealing ant lion algorithm according to claim 2, characterized in that: In step 2, the ant updates the position information and calculates the trap size according to the improved walk function to determine the position of the ant after random walk; then the relative value of the ant's random walk, the range of the antlion trap and the position of the ant are calculated. The ant will randomly walk around the antlion it chooses and eventually stay in the trap of the selected antlion.
4. The integer ambiguity resolution method based on the simulated annealing ant lion algorithm according to claim 3, characterized in that: In step 3, the position of the ant population at the next moment is determined by calculating the fitness values of all ant positions. Based on the least squares principle, the optimal solution to the ambiguity is the solution that minimizes the square of the distance between the ambiguity integer solution and the floating point solution.
5. The integer ambiguity resolution method based on the simulated annealing ant lion algorithm according to claim 4, characterized in that: During the execution of step 4, the simulated annealing algorithm is used to improve the ability of the ant lion algorithm to jump out of the local optimum. The fitness value of the current position of the ant lion group is compared with the fitness value of the position of the ant lion group at the previous moment to determine whether the random walk is effective. If the walk is effective, the position after the walk is used as the new position of the ant lion group. If the walk is invalid, the position of the ant lion group before the walk continues to be used, and return to step 2 for a new round of random walk.
6. The integer ambiguity resolution method based on the simulated annealing ant lion algorithm according to claim 5, characterized in that: During the execution of step 5, the optimal position information of the population is determined by comparing the fitness values of the current optimal position of the population with the optimal position candidate group, and the optimal ant lion position information is output as the searched optimal solution.
