ant colony algorithm
Recently Published Documents


TOTAL DOCUMENTS

2881
(FIVE YEARS 719)

H-INDEX

36
(FIVE YEARS 8)

With the rapid development of mobile Internet technology, mobile network data traffic presents an explosive growth trend. Especially, the proportion of mobile video business has become a large proportion in mobile Internet business. Mobile video business is considered as a typical business in the 5G network, such as in online education. The growth of video traffic poses a great challenge to mobile network. In order to provide users with better quality of experience (QoE), it requires mobile network to provide higher data transmission rate and lower network delay. This paper adopts a combined optimization to minimize total cost and maximize QoE simultaneously. The optimization problem is solved by ant colony algorithm. The effectiveness is verified on experiment.


2022 ◽  
Vol 12 (2) ◽  
pp. 723
Author(s):  
Ye Dai ◽  
Chao-Fang Xiang ◽  
Zhao-Xu Liu ◽  
Zhao-Long Li ◽  
Wen-Yin Qu ◽  
...  

The modular robot is becoming a prevalent research object in robots because of its unique configuration advantages and performance characteristics. It is possible to form robot configurations with different functions by reconfiguring functional modules. This paper focuses on studying the modular robot’s configuration design and self-reconfiguration process and hopes to realize the industrial application of the modular self-reconfiguration robot to a certain extent. We design robotic configurations with different DOF based on the cellular module of the hexahedron and perform the kinematic analysis of the structure. An innovative design of a modular reconfiguration platform for conformational reorganization is presented, and the collaborative path planning between different modules in the reconfiguration platform is investigated. We propose an optimized ant colony algorithm for reconfiguration path planning and verify the superiority and rationality of this algorithm compared with the traditional ant colony algorithm for platform path planning through simulation experiments.


2022 ◽  
Vol 12 (2) ◽  
pp. 738
Author(s):  
Revital Marbel ◽  
Roi Yozevitch ◽  
Tal Grinshpoun ◽  
Boaz Ben-Moshe

Satellite network optimization is essential, particularly since the cost of manufacturing, launching and maintaining each satellite is significant. Moreover, classical communication optimization methods, such as Minimal Spanning Tree, cannot be applied directly in dynamic scenarios where the satellite constellation is constantly changing. Motivated by the rapid growth of the Star-Link constellation that, as of Q4 2021, consists of over 1600 operational LEO satellites with thousands more expected in the coming years, this paper focuses on the problem of constructing an optimal inter-satellite (laser) communication network. More formally, given a large set of LEO satellites, each equipped with a fixed number of laser links, we direct each laser module on each satellite such that the underlying laser network will be optimal with respect to a given objective function and communication demand. In this work, we present a novel heuristic to create an optimal dynamic optical network communication using an Ant Colony algorithm. This method takes into account both the time it takes to establish an optical link (acquisition time) and the bounded number of communication links, as each satellite has a fixed amount of optical communication modules installed. Based on a large number of simulations, we conclude that, although the underlying problem of bounded-degree-spanning-tree is NP-hard (even for static cases), the suggested ant-colony heuristic is able to compute cost-efficient solutions in semi-real-time.


2022 ◽  
pp. 1-10
Author(s):  
Huixian Wang ◽  
Hongjiang Zheng

This paper proposes a deep mining method of high-dimensional abnormal data in Internet of things based on improved ant colony algorithm. Preprocess the high-dimensional abnormal data of the Internet of things and extract the data correlation feature quantity; The ant colony algorithm is improved by updating the pheromone and state transition probability; With the help of the improved ant colony algorithm, the feature response signal of high-dimensional abnormal data in Internet of things is extracted, the judgment threshold of high-dimensional abnormal data in Internet of things is determined, and the objective function is constructed to optimize the mining depth, so as to realize the deep data mining. The results show that the average error of the proposed method is only 0.48%.


2022 ◽  
Vol 70 (1) ◽  
pp. 1069-1087
Author(s):  
R. Nithya ◽  
K. Amudha ◽  
A. Syed Musthafa ◽  
Dilip Kumar Sharma ◽  
Edwin Hernan Ramirez-Asis ◽  
...  

2022 ◽  
Vol 355 ◽  
pp. 03002
Author(s):  
Hongchao Zhao ◽  
Jianzhong Zhao

Aiming at the problems of long search time and local optimal solution of ant colony algorithm (ACA) in the path planning of unmanned aerial vehicle (UAV), an improved ant colony algorithm (IACA) was proposed from the aspects of simplicity and effectiveness. The flight performance constraints of fixed wing UAVs were treated as conditions of judging whether the candidate expanded nodes are feasible, thus the feasible nodes’ number was reduced and the search efficiency was effectively raised. In order to overcome the problem of local optimal solution, the pheromone update rule is improved by combining local pheromone update and global pheromone update. The heuristic function was improved by integrating the distance heuristic factor with the safety heuristic factor, and it enhanced the UAV flight safety performance. The transfer probability was improved to increase the IACA search speed. Simulation results show that the proposed IACA possesses stronger global search ability and higher practicability than the former IACA.


Sign in / Sign up

Export Citation Format

Share Document