Abstract

Given article is devoted features of the decision of a problem of planning of a route of a pilotless flying machine (UAV). The decision of a considered problem is offered to be carried out in two consecutive stages. At the first stage calculation of optimum closed route UAV is carried out. Thus as an efficiency indicator the fuel resource, and as criterion of an optimality of a route a minimum of the general expense of fuel is accepted. Efficiency of the received decision is estimated in relation to the known algorithm LinKernighan realised in application Concorde 1.1. At the second stage by means of the developed algorithm updating of found route UAV taking into account an available stock of fuel is carried out, i.e. The question on returning UAV or after replenishment of a stock of fuel in intermediate point of continuation of flight of the remained sites is solved.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.