
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Utilization of Unmanned Aerial Vehicles (UAVs) in military and civil operations is getting popular. One of
the challenges in effectively tasking these expensive vehicles is planning the flight routes to monitor the
targets. In this work, we aim to develop an algorithm which produces routing plans for a limited number of
UAVs to cover maximum number of targets considering their flight range.
The proposed solution for this practical optimization problem is designed by modifying the MaxMin Ant
System (MMAS) algorithm. To evaluate the success of the proposed method, an alternative approach,
based on the Nearest Neighbour (NN) heuristic, has been developed as well. The results showed the success
of the proposed MMAS method by increasing the number of covered targets compared to the solution based
on the NN heuristic.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment