Search

Observation task planning is a key issue and the first step in the development of automated Satellite Laser Ranging (SLR) systems. Aiming at the problem of dynamic change of cloud cover during SLR operation, this paper proposes an autonomous mission planning algorithm for SLR based on the Rolling Horizon Optimization (RHO) framework. A hybrid event- and cycle-driven replanning mechanism is adopted, and four functional modules, rolling, planning, information acquisition and decision-making, are established to decompose the SLR observation task planning process into a series of static planning intervals. An improved ant colony algorithm is proposed and utilized to realize the autonomous planning of SLR system observation tasks, and the above autonomous planning algorithm is verified and analyzed based on the SLR system at station 7237. The results show that the above algorithm can effectively increase the number of observation satellites and revenue under cloud disturbance, solve the problems of low efficiency and poor interference resistance of conventional static algorithms, and provide a new research idea for the establishment of an unattended SLR system. [ABSTRACT FROM AUTHOR]

As a meta-heuristic algorithm, the ant colony algorithm has been successfully used to solve various combinatorial optimization problems. However, the existing algorithm that takes the power of ants to solve distributed constraint optimization problems (ACO_DCOP) is easy to fall into local optima. To deal with this issue, this paper presents an adaptive ant colony algorithm based on local information entropy to solve distributed constraint optimization problems, named LIEAD. In LIEAD, the local information entropy is introduced to help agents adaptively select the pheromone update strategy and value selection strategy, which improves the convergence speed and the quality of the solution. Moreover, a restart mechanism is designed to break the accumulation state of pheromone, which increases the population diversity and helps the algorithm jump out of the local optima. The extensive experimental results indicate that LIEAD can significantly outperform ACO_DCOP and is competitive with the state-of-the-art DCOPs algorithms. [ABSTRACT FROM AUTHOR]

In order to improve the efficiency and adaptability of cognitive radar jamming decision-making, a fusion algorithm (Ant-QL) based on ant colony and Q-Learning is proposed in this paper. The algorithm does not rely on a priori information and enhances adaptability through real-time interactions between the jammer and the target radar. At the same time, it can be applied to single jammer and multiple jammer countermeasure scenarios with high jamming effects. First, traditional Q-Learning and DQN algorithms are discussed, and a radar jamming decision-making model is built for the simulation verification of each algorithm. Then, an improved Q-Learning algorithm is proposed to address the shortcomings of both algorithms. By introducing the pheromone mechanism of ant colony algorithms in Q-Learning and using the ε -greedy algorithm to balance the contradictory relationship between exploration and exploitation, the algorithm greatly avoids falling into a local optimum, thus accelerating the convergence speed of the algorithm with good stability and robustness in the convergence process. In order to better adapt to the cluster countermeasure environment in future battlefields, the algorithm and model are extended to cluster cooperative jamming decision-making. We map each jammer in the cluster to an intelligent ant searching for the optimal path, and multiple jammers interact with each other to obtain information. During the process of confrontation, the method greatly improves the convergence speed and stability and reduces the need for hardware and power resources of the jammer. Assuming that the number of jammers is three, the experimental simulation results of the convergence speed of the Ant-QL algorithm improve by 85.4%, 80.56% and 72% compared with the Q-Learning, DQN and improved Q-Learning algorithms, respectively. During the convergence process, the Ant-QL algorithm is very stable and efficient, and the algorithm complexity is low. After the algorithms converge, the average response times of the four algorithms are 6.99 × 10−4 s, 2.234 × 10−3 s, 2.21 × 10−4 s and 1.7 × 10−4 s, respectively. The results show that the improved Q-Learning algorithm and Ant-QL algorithm also have more advantages in terms of average response time after convergence. [ABSTRACT FROM AUTHOR]

Aiming at the problem of slow search speed and insufficient solution quality of ant colony algorithm, this paper proposed an ant colony algorithm combining dynamic hierarchical clustering and neighborhood interval reorganization. In the ini-tial stage, the algorithm adjusted the hierarchical clustering threshold and iterated to the target cluster based on the principle of minimum inter-cluster distance merging, and then merged the clusters according to the pre-merging coefficient. In the next place it used ant colony system to generate subclass paths, disconnected and reorganized the initial paths to improve the overall convergence speed of the algorithm. Then the algorithm used ant colony system to optimize the solution space, and at the same time, carried out neighborhood interval diffusion reorganization between clusters to increase the diversity of solutions. Furthermore, if the quality of the reconstructed solution was better than the current optimization solution at a fixed number of iterations, the recommendation process would be carried out to improve the accuracy of the solution. When the algorithm stagnated, it introduced an adjustment factor to reduce the differences between pheromones of each path to enhance the ant search ability, which could help the algorithm jump out of the local optimal. The experiment result shows that the accuracy of the algorithm is about 3% when facing large-scale problems, which can effectively improve the accuracy and convergence rate of the solution. [ABSTRACT FROM AUTHOR]

Wireless Sensor Network (WSN) has become a solution for real-time monitoring environments and is widely used in various fields. A substantial number of sensors in WSNs are prone to succumb to failures due to faulty attributes, complex working environments, and their hardware, resulting in transmission error data. To resolve the existing problem of fault detection in WSN, this paper presents a WSN node fault detection method based on ant colony optimization-graph convolutional network (ACO-GCN) models, which consists of an input layer, a space-time processing layer, and an output layer. First, the users apply the random search algorithm and the search strategy of the ant colony algorithm (ACO) to find the optimal path and locate the WSN node failures to grasp the overall situation. Then, the WSN fault node information obtained by the GCN model is learned. During the data training process, where the WSN fault node is used for error prediction, the weights and thresholds of the network are further adjusted to increase the accuracy of fault diagnosis. To evaluate the performance of the ACO-GCN model, the results show that the ACO-GCN model significantly improves the fault detection rate and reduces the false alarm rate compared with the benchmark algorithms. Moreover, the proposed ACO-GCN fusion algorithm can identify fault sensors more effectively, improve the service quality of WSN and enhance the stability of the system. [ABSTRACT FROM AUTHOR]

This paper proposed an ant colony algorithm based on directional guidance to address the problems of slow convergence, many folding points, and long paths. The algorithm also incorporated the interpolation strategy to further optimize the generated paths, shortened the path length, reduced the number of path folds, and made the path smoother. Finally, the experimental verification shows that the algorithm has obvious optimization effect in terms of convergence times and path folding points. In the simulated raster map, the average number of convergence are reduced by 68%, the average number of path folding points are reduced by 42%, and the average path length is reduced by 8%. [ABSTRACT FROM AUTHOR]

Logistics delivery is an important part of online shopping services. Excellent delivery path planning can not only improve consumer experience but also greatly reduce costs. This paper studied the optimization of multi-point logistics distribution paths, calculated distribution paths by the ant colony algorithm and the genetic algorithm, performed simulation experiments on the two algorithms, and compared them with the traditional greedy algorithm. The results showed that the total transportation cost of the distribution path planned by the greedy algorithm was the highest, followed by the ant colony algorithm and the genetic algorithm, and the computation time of the ant colony algorithm was the longest, followed by the genetic algorithm and the greedy algorithm. [ABSTRACT FROM AUTHOR]

• A constrained path planning algorithm for Ackerman mobile robot is proposed. • An improved ant colony algorithm with angle constraint is introduced. • An improved B-spline curve smoothing method with curvature constraint is proposed to ensure that the smooth path follows the maximum curvature limit of the mobile robot. In this paper, a new approach is proposed for the smooth path planning of Ackermann mobile robots based on an improved ant colony algorithm and B-spline curves. Firstly, by incorporating path length constraints and path smoothing constraints into the objective function, the smooth path planning problem for Ackermann mobile robots is transformed into a multi-objective optimization problem. Secondly, to address the limitations of the traditional ant colony algorithm, an improved ant colony algorithm based on the turning angle constraint (IACO-TAC) is proposed. IACO-TAC incorporates the distance factor and steering angle penalty factor in the heuristic function to reduce the path search's blindness. Moreover, the pheromone update method is improved, consisting of local pheromone update and global pheromone update, which uses a reward penalty mechanism to improve the convergence speed of the algorithm and increases the pheromone concentration of the global optimal path, respectively. Thirdly, an improved B-spline curve smoothing algorithm that considers the minimum turning radius constraint is proposed to generate a path that satisfies the kinematic constraints of the Ackermann mobile robot. Finally, the proposed method is evaluated by conducting gradient comparison experiments and ant colony algorithm comparison experiments on maps of different sizes. The experimental results demonstrate that our method exhibits a fast convergence rate and plans a path that balances path length and turn frequency while satisfying the kinematic constraints of the mobile robot. Thus, the proposed method offers an efficient and smooth path planning solution for Ackermann mobile robots in complex environments. [ABSTRACT FROM AUTHOR]

In order to construct an efficient and reliable global path for unmanned surface vehicles (USVs), this paper proposes a USV global path planning algorithm based on an optimized ant colony algorithm (OACA). The algorithm constructs a USV global path planning model by comprehensively considering energy consumption costs and turning control costs. In order to ensure the adaptability of the model to the task environment, the USV's motion characteristics are analyzed with full consideration of external interference, and on this basis, the characterization of energy consumption costs and turning control costs is completed. In order to obtain the global optimal solution of the model and accelerate the convergence speed of the model, in the initialization process of the ant colony algorithm, the initial pheromone is distributed unevenly by introducing the distance relationship among the intermediate node, the starting point, and ending point to improve the initial search efficiency. In the iterative process of searching for the optimal solution, enhancing the guidance effect of the current optimal solution on the offspring ants by introducing a weight factor to improve the update rule of pheromone, which accelerates the convergence speed of the algorithm. In the last two steps of the deadlock path, the number of lost ants is reduced by introducing a penalty factor to punish the pheromone which can guarantee the diversity of ants, and the algorithm's premature convergence is overcome. The simulation results prove the effectiveness of this algorithm. © 2022 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

As the key technology of edge computing, computing offloading has attracted the attention of many scholars in recent years. Many people use heuristic algorithm as the basic algorithm to study the algorithm of computing offloading, but a single heuristic algorithm has some defects, such as some will fall into local optimal, and some will converge prematurely. In order to make up for the defects of single heuristic algorithm applied to the calculation offloading and improve the efficiency of the algorithm, this paper combines genetic algorithm with ant colony algorithm, and designs the calculation offloading strategy of gene-ant colony fusion algorithm. Firstly, a group of solutions are obtained through the selection, crossover, mutation and other operations of genetic algorithm, and the solution is improved as the initial solution of ant colony algorithm. The fusion algorithm makes full use of the feedback value of genetic algorithm and the high efficiency of ant colony algorithm to overcome the shortcomings of the two algorithms. The feasibility of the algorithm is verified by several groups of experiments. The simulation results show that compared with GA, ACA and PSO, the number of iterations is reduced by 17.96%, 24.43% and 36.25% respectively. When the base station remains unchanged, the G-ACA has the lowest objective function value. Compared with GA, ACA and PSO algorithm, the objective function value is reduced by 36.68%, 16.15% and 11.35% respectively. That is, the fused algorithm is better than the non fused GA,ACA and PSO in time delay, energy consumption and objective function value. [ABSTRACT FROM AUTHOR]