Mission planning for multiple UAVs based on ant colony optimization and improved Dubins path

2016 ◽  
Author(s):  
Teng Li ◽  
Ju Jiang ◽  
Ziyang Zhen ◽  
Chen Gao
Keyword(s):  
Ant Colony Optimization ◽  
Mission Planning ◽  
Ant Colony ◽  
Multiple Uavs ◽  
Dubins Path

PROBABILISTIC ROADMAPS AND ANT COLONY OPTIMIZATION FOR UAV MISSION PLANNING

2007 ◽  
Vol 40 (15) ◽  
pp. 264-269 ◽  
Author(s):  
Florian Adolf ◽  
Augusto Langer ◽  
Lucas de Melo Pontes e Silva ◽  
Frank Thielecke
Keyword(s):  
Ant Colony Optimization ◽  
Mission Planning ◽  
Ant Colony ◽  
Probabilistic Roadmaps

scholarly journals A Hierarchical Decision-Making Method with a Fuzzy Ant Colony Algorithm for Mission Planning of Multiple UAVs

Information ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 226
Author(s):  
Lin Zhang ◽  
Yian Zhu ◽  
Xianchen Shi
Keyword(s):  
Decision Making ◽  
Cooperative Communication ◽  
Ant Colony Algorithm ◽  
Communication Strategy ◽  
Mission Planning ◽  
Ant Colony ◽  
Hierarchical Decision Making ◽  
Multiple Uavs ◽  
Single Target ◽  
Hierarchical Decision

Unmanned aerial vehicles (UAVs) received an unprecedented surge of people’s interest worldwide in recent years. This paper investigates the specific problem of cooperative mission planning for multiple UAVs on the battlefield from a hierarchical decision-making perspective. From the view of the actual mission planning issue, the two key problems to be solved in UAV collaborative mission planning are mission allocation and route planning. In this paper, both of these problems are taken into account via a hierarchical decision-making model. Firstly, we use a target clustering algorithm to divide the original targets into target subgroups, where each target subgroup contains multiple targets. Secondly, a fuzzy ant colony algorithm is used to calculate the global path between target subgroups for a single-target group. Thirdly, a fuzzy ant colony algorithm is also used to calculate the local path between multiple targets for a single-target subgroup. After three levels of decision-making, the complete path for multiple UAVs can be obtained. In order to improve the efficiency of a collaborative task between different types of UAVs, a cooperative communication strategy is developed, which can reduce the number of UAVs performing tasks. Finally, experimental results demonstrate the effectiveness of the proposed cooperative mission planning and cooperative communication strategy for multiple UAVs.

Parallel Ant Colony Optimization on the University Course-Faculty Timetabling Problem in MSU-IIT

2012 ◽  
Author(s):  
Earth B. Ugat ◽  
Jennifer Joyce M. Montemayor ◽  
Mark Anthony N. Manlimos ◽  
Dante D. Dinawanao
Keyword(s):  
Ant Colony Optimization ◽  
Ant Colony ◽  
Timetabling Problem ◽  
University Course ◽  
The University

Achievement of Cost-Effective Datasets Transference in The Cloud Through Ant Colony Optimization

2012 ◽  
Vol 3 (3) ◽  
pp. 122-125
Author(s):  
THAHASSIN C THAHASSIN C ◽  
◽  
A. GEETHA A. GEETHA ◽  
RASEEK C RASEEK C
Keyword(s):  
Ant Colony Optimization ◽  
Cost Effective ◽  
Ant Colony

The Map-Based Shortest Route Selection by Using Ant Colony Optimization Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 15
Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Agusma Wajiansyah ◽  
Supriadi Supriadi
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Google Earth ◽  
Ant Colony ◽  
Food Sources ◽  
Shortest Route ◽  
Study Results ◽  
Destination Point

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.

Modeling and optimizing logistics, information, economic and financial intercluster cooperation using the ant colony optimization algorithm

2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Population Decline ◽  
Innovation System ◽  
Federal District ◽  
Original Model ◽  
Ant Colony ◽  
Industrial Agglomeration ◽  
Ant Colony Optimization Algorithm

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