Unmanned aerial vehicles routing problem

The article deals with the problem of optimal routing for unmanned aerial vehicles. The unmanned aerial vehicle flights are planned for different purposes. In our article we deal with the situation when the unmanned aerial vehicle flights are planned to search for objects located in some predefined areas. These objects can represent, for example, a lost aircraft or a group of missing people. In the design of the model we suppose that the areas, in which the objects could be found with high probability, are identifiable. The article presents a mathematical model for solving the defined problem and an experiment which is used to validate the functionality of the model. The model is designed by means of mathematical programming methods.