Towards a Continuous Solution of the d-Visibility Watchman Route Problem in a Polygon With Holes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00357807" target="_blank" >RIV/68407700:21230/22:00357807 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/22:00357807
Result on the web
<a href="https://doi.org/10.1109/LRA.2022.3159824" target="_blank" >https://doi.org/10.1109/LRA.2022.3159824</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/LRA.2022.3159824" target="_blank" >10.1109/LRA.2022.3159824</a>
Alternative languages
Result language
angličtina
Original language name
Towards a Continuous Solution of the d-Visibility Watchman Route Problem in a Polygon With Holes
Original language description
A new heuristic solution framework is proposed to address the challenging watchman route problem (WRP) in a polygonal domain, which can be viewed as an offline version of the robot exploration task. The solution is the shortest route from which the robot can visually inspect a known 2D environment. Our framework considers a circular robot with radius r equipped with an omnidirectional sensor with limited visibility range d . Instead of a standard decoupled solution, the framework generates a set of specifically constrained regions covering the domain and then solves the traveling salesman problem with continuous neighborhoods (TSPN) to obtain the solution route. The TSPN is solved by another proposed heuristic algorithm that finds a discretized solution first and then improves it back in the continuous domain. The whole framework is evaluated experimentally, compared to two approaches from the literature, and shown to provide the highest-quality solutions. The current version of the framework is one step from a fully continuous approach to the WRP that we will address in the future.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20204 - Robotics and automatic control
Result continuities
Project
<a href="/en/project/EF15_003%2F0000470" target="_blank" >EF15_003/0000470: Robotics 4 Industry 4.0</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Robotics and Automation Letters
ISSN
2377-3766
e-ISSN
2377-3766
Volume of the periodical
7
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
8
Pages from-to
5934-5941
UT code for WoS article
000783540700002
EID of the result in the Scopus database
2-s2.0-85126557588