Automated software design using ant colony optimization with semantic network support

2015 ◽  
Vol 109 ◽  
pp. 1-17 ◽  
Author(s):  
Vali Tawosi ◽  
Saeed Jalili ◽  
Seyed Mohammad Hossein Hasheminejad
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Fenglang Wu ◽  
Xinran Liu ◽  
Yudan Wang

With the advent of robots combined with artificial intelligence, robots have become an indispensable part of production and life. Especially in recent years, the collaboration between humans and machines has become a research trend in the field of robotics, with high work efficiency and flexibility. The advantages of safety and stability make intelligent robots the best choice for the current industrial and service industries with high labor intensity and hazardous working environments. This paper is aimed at studying the software design of an intelligent sensor robot system based on multidata fusion. In this paper, through the needle robot’s high precision requirements and the problem of fast response, a path design method based on the ant colony optimization (ACO) algorithm is proposed. Path planning is performed by intelligent robots for obstacle avoidance experiments, while global optimization is performed by the ant colony optimization (ACO) algorithm. For adaptive functions including obstacle reduction and path information length, the safest and shortest path is finally achieved through the ant colony optimization (ACO) algorithm. The experimental results show that using the ant colony optimization algorithm to perform simulation experiments and preprocessing operations on the data collected by the sensor can improve the accuracy and effectiveness of the data. The ant colony algorithm performs fusion and path planning, and on the basis of ensuring accuracy, it can speed up the convergence speed. Through the data analysis of obstacle avoidance experiments of intelligent robots, it can be concluded that it is very necessary for intelligent robots to install ultrasonic sensors and infrared sensors in obstacle avoidance, because the error between the test distance of the ultrasonic sensor and the infrared sensor and the actual distance is 0.001.


2014 ◽  
Vol 8 (2) ◽  
pp. 139-157 ◽  
Author(s):  
Christopher L. Simons ◽  
Jim Smith ◽  
Paul White

2012 ◽  
Author(s):  
Earth B. Ugat ◽  
Jennifer Joyce M. Montemayor ◽  
Mark Anthony N. Manlimos ◽  
Dante D. Dinawanao

2012 ◽  
Vol 3 (3) ◽  
pp. 122-125
Author(s):  
THAHASSIN C THAHASSIN C ◽  
◽  
A. GEETHA A. GEETHA ◽  
RASEEK C RASEEK C

Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.


2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov

Subject. This article discusses the issues related to the creation of a technology of modeling and optimization of economic, financial, information, and logistics cluster-cluster cooperation within a federal district. Objectives. The article aims to propose a model for determining the optimal center of industrial agglomeration for innovation and industry clusters located in a federal district. Methods. For the study, we used the ant colony optimization algorithm. Results. The article proposes an original model of cluster-cluster cooperation, showing the best version of industrial agglomeration, the cities of Samara, Ulyanovsk, and Dimitrovgrad, for the Volga Federal District as a case study. Conclusions. If the industrial agglomeration center is located in these three cities, the cutting of the overall transportation costs and natural population decline in the Volga Federal District will make it possible to qualitatively improve the foresight of evolution of the large innovation system of the district under study.


Sign in / Sign up

Export Citation Format

Share Document