Route preparation for unmanned aerial vehicle (UAV) or unmanned aerial system (UAS) is one of the biggest challenges when it comes to carrying out any mission. Analysis of UAS path planning has gained significant attention from researchers as it is an essential aspect of the UAS collaboration project mission. With the objective of solving the path planning issue, we adapt the travelling salesmen problem (TSP) and propose to solve it by operating an improved Genetic Algorithm (GA) that can find out the path within the shortest distance and period. In this paper, we first develop an algorithm using the concept of GA to solve TSP as per the requirements of UAS path planning. The UAS is considered the travelling salesman in the TSP concept and the mission objective is regarded as the visiting city, since TSP is a complex NP-hard problem, this paper performs optimization algorithm as GA to solve TSP, which can be both successfully and expertly planned. Generally, the algorithm used to find the lowest possible distance to visit all of the TSP’s access points. The optimal solution to various challenges tends to require the use of GA. Some conditions and operators that depend on this algorithm are population size, selection method, mutation and crossover. We will present an improved way of the GA operator in this paper. In contrast with several other techniques, the suggested approach for TSP was more successful in the application of UAS path planning. This paper deals with GA as a part of the simulation to represent the TSP model for UAS route planning. The outcomes show that the approach of the GA is relatively effective in finding the minimum path direction. GA is efficient to solve TSP for UAS path planning problem within a reasonable period of less than 1 min for simple problem and less that 5 min for complex problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Adapting Travelling Salesmen Problem for Real-Time UAS Path Planning Using Genetic Algorithm


    Additional title:

    Lect.Notes Mechanical Engineering




    Publication date :

    2021-06-20


    Size :

    13 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English





    A Lagrangian-based algorithm for a multiple depot, multiple travelling salesmen problem

    Yadlapalli, S. / Malik, W.A. / Darbha, S. et al. | Tema Archive | 2007



    Higher pay for car salesmen is management problem

    Gourlie, J.C. | Engineering Index Backfile | 1928


    An Algorithm for Traveling Salesman Problem by n Salesmen and m Cities Using Neural Network

    Okada, T. / Uchida, S. / Yoshida, K. et al. | British Library Conference Proceedings | 1996