Standard

Comparison of Multi-Sensor Task Assignment Methods : Linear Matrix Inequalities vs. Brute Force. / Erofeeva, Victoria; Granichin, Oleg; Leonova, Anna.

In: IFAC-PapersOnLine, Vol. 51, No. 32, 2018, p. 648-653.

Research output: Contribution to journal › Article › peer-review

Harvard

Erofeeva, V, Granichin, O & Leonova, A 2018, 'Comparison of Multi-Sensor Task Assignment Methods: Linear Matrix Inequalities vs. Brute Force', IFAC-PapersOnLine, vol. 51, no. 32, pp. 648-653. https://doi.org/10.1016/j.ifacol.2018.11.498

APA

Erofeeva, V., Granichin, O., & Leonova, A. (2018). Comparison of Multi-Sensor Task Assignment Methods: Linear Matrix Inequalities vs. Brute Force. IFAC-PapersOnLine, 51(32), 648-653. https://doi.org/10.1016/j.ifacol.2018.11.498

Vancouver

Erofeeva V, Granichin O, Leonova A. Comparison of Multi-Sensor Task Assignment Methods: Linear Matrix Inequalities vs. Brute Force. IFAC-PapersOnLine. 2018;51(32):648-653. https://doi.org/10.1016/j.ifacol.2018.11.498

Author

Erofeeva, Victoria ; Granichin, Oleg ; Leonova, Anna. / Comparison of Multi-Sensor Task Assignment Methods : Linear Matrix Inequalities vs. Brute Force. In: IFAC-PapersOnLine. 2018 ; Vol. 51, No. 32. pp. 648-653.

BibTeX

@article{1a39e1d04cd64a8c888f3182d4a48edc,
title = "Comparison of Multi-Sensor Task Assignment Methods: Linear Matrix Inequalities vs. Brute Force",
abstract = "Due to significant advancements in embedded systems, sensor devices, and wireless communication technology, sensor networks have been attracting widespread attention in areas such as target tracking, monitoring, and surveillance. Technological advancements made it possible to deploy a large number of inexpensive but technically advanced sensors to cover wide areas. However, when a tracking system has to track a large number of targets, the computation and communication loads arise. In this paper, we compare two task assignment methods that might be used in the multiple target tracking problem. The first one is the brute force method and the second one is based on linear matrix inequalities. We provide performance and load testing results for these methods.",
keywords = "sensor network, task assignments, multiple target tracking, linear matrix inequalities, ellipsoidal approximation, brute force",
author = "Victoria Erofeeva and Oleg Granichin and Anna Leonova",
year = "2018",
doi = "10.1016/j.ifacol.2018.11.498",
language = "Английский",
volume = "51",
pages = "648--653",
journal = "IFAC-PapersOnLine",
issn = "2405-8963",
publisher = "Elsevier",
number = "32",
note = "null ; Conference date: 15-10-2018 Through 19-12-2018",
url = "https://www.ipu.ru/node/43678",

}

RIS

TY - JOUR

T1 - Comparison of Multi-Sensor Task Assignment Methods

AU - Erofeeva, Victoria

AU - Granichin, Oleg

AU - Leonova, Anna

N1 - Conference code: 17

PY - 2018

Y1 - 2018

N2 - Due to significant advancements in embedded systems, sensor devices, and wireless communication technology, sensor networks have been attracting widespread attention in areas such as target tracking, monitoring, and surveillance. Technological advancements made it possible to deploy a large number of inexpensive but technically advanced sensors to cover wide areas. However, when a tracking system has to track a large number of targets, the computation and communication loads arise. In this paper, we compare two task assignment methods that might be used in the multiple target tracking problem. The first one is the brute force method and the second one is based on linear matrix inequalities. We provide performance and load testing results for these methods.

AB - Due to significant advancements in embedded systems, sensor devices, and wireless communication technology, sensor networks have been attracting widespread attention in areas such as target tracking, monitoring, and surveillance. Technological advancements made it possible to deploy a large number of inexpensive but technically advanced sensors to cover wide areas. However, when a tracking system has to track a large number of targets, the computation and communication loads arise. In this paper, we compare two task assignment methods that might be used in the multiple target tracking problem. The first one is the brute force method and the second one is based on linear matrix inequalities. We provide performance and load testing results for these methods.

KW - sensor network, task assignments, multiple target tracking, linear matrix inequalities, ellipsoidal approximation, brute force

UR - http://www.scopus.com/inward/record.url?scp=85058214363&partnerID=8YFLogxK

U2 - 10.1016/j.ifacol.2018.11.498

DO - 10.1016/j.ifacol.2018.11.498

M3 - статья

AN - SCOPUS:85058214363

VL - 51

SP - 648

EP - 653

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

SN - 2405-8963

IS - 32

Y2 - 15 October 2018 through 19 December 2018

ER -

ID: 35254451