TY - JOUR N2 - The article introduces an innovative approch for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its priciple idea is to visit continuous areas (circles) in a way, that minimizes travelled distance. In practice, the problem can be defined as an issue of scheduling unmanned aerial vehicle which has discrete-continuous nature. In order to solve this problem the use of local search algorithms is proposed. L1 - http://www.journals.pan.pl/Content/118767/PDF/art02.pdf L2 - http://www.journals.pan.pl/Content/118767 PY - 2020 IS - No 4 EP - 666 DO - 10.24425/acs.2020.135845 KW - discrete-continuous optimization KW - UAV KW - VTOL KW - autonomous drone KW - zero emission A1 - Grymin, Radosław A1 - Bożejko, Wojciech A1 - Chaczko, Zenon A1 - Pempera, Jarosław A1 - Wodecki, Mieczysław PB - Committee of Automatic Control and Robotics PAS VL - vol. 30 DA - 2020.12.28 T1 - Algorithm for solving the Discrete-Continuous Inspection Problem SP - 653 UR - http://www.journals.pan.pl/dlibra/publication/edition/118767 T2 - Archives of Control Sciences ER -