Data collection path planning with spatially correlated measurements using growing self-organizing array

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00326573" target="_blank" >RIV/68407700:21230/19:00326573 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1016/j.asoc.2018.11.005" target="_blank" >https://doi.org/10.1016/j.asoc.2018.11.005</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.asoc.2018.11.005" target="_blank" >10.1016/j.asoc.2018.11.005</a>

Result language

angličtina

Original language name

Data collection path planning with spatially correlated measurements using growing self-organizing array

Original language description

Data collection path planning is a problem to determine a cost-efficient path to read the most valuable data from a given set of sensors. The problem can be formulated as a variant of the combinatorial optimization problems that are called the price-collecting traveling salesman problem or the orienteering problem in a case of the explicitly limited travel budget. In these problems, each location is associated with a reward characterizing the importance of the data from the particular sensor location. The used simplifying assumption is to consider the measurements at particular locations independent, which may be valid, e.g., for very distant locations. However, measurements taken from spatially close locations can be correlated, and data collected from one location may also include information about the nearby locations. Then, the particular importance of the data depends on the currently selected sensors to be visited by the data collection path, and the travel cost can be saved by avoiding visitation of the locations that do not provide added value to the collected data. This is a computationally challenging problem because of mutual dependency on the cost of data collection path and the possibly collected rewards along such a path. A novel solution based on unsupervised learning method called the Growing Self-Organizing Array (GSOA) is proposed to address computational challenges of these problems and provide a solution in tens of milliseconds using conventional computational resources. Moreover, the employed GSOA-based approach allows to exploit capability to retrieve data by wireless communication or remote sensing, and thus further save the travel cost.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Applied Soft Computing

ISSN

1568-4946

e-ISSN

1872-9681

Volume of the periodical

75

Issue of the periodical within the volume

February

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

18

Pages from-to

130-147

UT code for WoS article

000454941500010

EID of the result in the Scopus database

2-s2.0-85056835349