2019
DOI: 10.1109/lra.2019.2928208
|View full text |Cite
|
Sign up to set email alerts
|

Randomized Sensor Selection for Nonlinear Systems With Application to Target Localization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 27 publications
0
9
0
Order By: Relevance
“…As such, the sensor selection problem is posed as an integer programming (IP) problem which objective is maximizing the logarithmic determinant of the Gramian. The third approach, developed in [43], introduces a randomized algorithm for dealing with the sensor placement problem and accordingly, theoretical bounds for eigenvalue and condition number of observability Gramian are proposed. The last and most recent approach is established in [44] where the authors make use of the numerous observer designs for some classes of nonlinear systems posed as semidefinite programs (SDP).…”
Section: Motivation and Paper Contributionsmentioning
confidence: 99%
“…As such, the sensor selection problem is posed as an integer programming (IP) problem which objective is maximizing the logarithmic determinant of the Gramian. The third approach, developed in [43], introduces a randomized algorithm for dealing with the sensor placement problem and accordingly, theoretical bounds for eigenvalue and condition number of observability Gramian are proposed. The last and most recent approach is established in [44] where the authors make use of the numerous observer designs for some classes of nonlinear systems posed as semidefinite programs (SDP).…”
Section: Motivation and Paper Contributionsmentioning
confidence: 99%
“…Prior works [15], [16], and [17] employed randomized sampling strategies to establish bounds on observability Gramian metrics. In [16] and [17], matrix-valued concentration inequalities, like the Ahlswede-Winter inequality [18], are used to study dynamical systems with no process or measurement noise.…”
Section: A Literature Reviewmentioning
confidence: 99%
“…Prior works [15], [16], and [17] employed randomized sampling strategies to establish bounds on observability Gramian metrics. In [16] and [17], matrix-valued concentration inequalities, like the Ahlswede-Winter inequality [18], are used to study dynamical systems with no process or measurement noise. This paper investigates the more practical estimation problem, where the sensor network and the process it is attempting to estimate are corrupted by Gaussian noise.…”
Section: A Literature Reviewmentioning
confidence: 99%
“…For target tracking, sensors can be chosen based on their capabilities of location [38], [39] or to best provide coverage of an entire area [40]. Selection methods have also been introduced based on task allocation algorithms [41], sparsity [8], [42], cross entropy [43], and even randomized algorithms [44], [45].…”
Section: B Feature Selectionmentioning
confidence: 99%