| Autor: |
Radosław, Grymin, Wojciech, Bożejko, Zenon, Chaczko, Jarosław, Pempera, Mieczysław, Wodecki |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
Archives of Control Sciences, Vol vol. 30, Iss No 4, Pp 653-666 (2020) |
| Druh dokumentu: |
article |
| ISSN: |
1230-2384 |
| DOI: |
10.24425/acs.2020.135845 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
