Search

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]

As the fourth fundamental circuit element, the memristor may execute computations while storing data. Fracmemristor takes advantage of the fractional calculate's long-term memory, non-locality, weak singularity, and the memristor's storage–computational integration. Since the physical structure of the fracmemristor is similar to the topology of the ant transfer probability flow in ACO, we propose the fractional-order memristive ant colony algorithm (FMAC), which uses the fracmemristor physical system to record the probabilistic transfer information of the nodes that the ant will crawl through in the future and pass it to the current node of the ant, so that the ant acquires the ability to predict the future transfer. After instigating the optimization capabilities with TSP, we discovered that FMAC is superior to PACO-3opt, the best integer-order ant colony algorithm currently available. FMAC operates substantially more quickly than the fractional-order memristor ant colony algorithm due to the transfer probability prediction module based on the physical fracmemristor system (FACA). [ABSTRACT FROM AUTHOR]