Algorithm for solving the discrete-continuous inspection problem

Grymin, R; Bożejko, W; Chaczko, Z; Pempera, J; Wodecki, M

Algorithm for solving the discrete-continuous inspection problem

Grymin, R Bożejko, W Chaczko, Z

Pempera, J Wodecki, M

Permalink

Publication Type:: Journal Article
Citation:: Archives of Control Sciences, 2020, 30, (4), pp. 653-666
Issue Date:: 2020-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (863.56 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Grymin, R
dc.contributor.author	Bożejko, W
dc.contributor.author	Chaczko, Z https://orcid.org/0000-0002-2816-7510
dc.contributor.author	Pempera, J
dc.contributor.author	Wodecki, M
dc.date.accessioned	2021-02-09T19:24:32Z
dc.date.available	2021-02-09T19:24:32Z
dc.date.issued	2020-01-01
dc.identifier.citation	Archives of Control Sciences, 2020, 30, (4), pp. 653-666
dc.identifier.issn	1230-2384
dc.identifier.issn	2300-2611
dc.identifier.uri	http://hdl.handle.net/10453/145997
dc.description.abstract	© 2020. The Author(s). This is an open-access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives License (CC BY-NC-ND 4.0 https://creativecommons.org/licenses/by-nc-nd/4.0/), which permits use, distribution, and reproduction in any medium, provided that the article is properly cited, the use is non-commercial, and no modifications or adaptations are made 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.
dc.language	en
dc.relation.ispartof	Archives of Control Sciences
dc.relation.isbasedon	10.24425/acs.2020.135845
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	0102 Applied Mathematics, 0103 Numerical and Computational Mathematics, 0801 Artificial Intelligence and Image Processing
dc.title	Algorithm for solving the discrete-continuous inspection problem
dc.type	Journal Article
utslib.citation.volume	30
utslib.for	0102 Applied Mathematics
utslib.for	0103 Numerical and Computational Mathematics
utslib.for	0801 Artificial Intelligence and Image Processing
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	open_access	*
dc.date.updated	2021-02-09T19:24:25Z
pubs.issue	4
pubs.publication-status	Published
pubs.volume	30
utslib.citation.issue	4

Abstract:

© 2020. The Author(s). This is an open-access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives License (CC BY-NC-ND 4.0 https://creativecommons.org/licenses/by-nc-nd/4.0/), which permits use, distribution, and reproduction in any medium, provided that the article is properly cited, the use is non-commercial, and no modifications or adaptations are made 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/145997