2018
DOI: 10.1080/00207179.2018.1484171
|View full text |Cite
|
Sign up to set email alerts
|

Sensor selection for fault diagnosis in uncertain systems

Abstract: Finding the cheapest, or smallest, set of sensors such that a specified level of diagnosis performance is maintained is important to decrease cost while controlling performance. Algorithms have been developed to find sets of sensors that make faults detectable and isolable under ideal circumstances. However, due to model uncertainties and measurement noise, different sets of sensors result in different achievable diagnosability performance in practice. In this paper, the sensor selection problem is formulated … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 25 publications
0
7
0
Order By: Relevance
“…While many algorithms exist to solve the SCP for UAV photogrammetry, the base greedy algorithm often serves as the base comparison of other solutions due to leveraging both a quick solve time and a feasible (but not necessarily optimal and a low possibility of being the worst) solution [38,[47][48][49][50][51]. Adjustments to the base algorithm fine-tune the balance between solve-time and the necessary output, but the concept remains the same.…”
Section: A Priori Informationmentioning
confidence: 99%
“…While many algorithms exist to solve the SCP for UAV photogrammetry, the base greedy algorithm often serves as the base comparison of other solutions due to leveraging both a quick solve time and a feasible (but not necessarily optimal and a low possibility of being the worst) solution [38,[47][48][49][50][51]. Adjustments to the base algorithm fine-tune the balance between solve-time and the necessary output, but the concept remains the same.…”
Section: A Priori Informationmentioning
confidence: 99%
“…Greedy algorithms are simple but effective. Research continues to refine adjustments to the basic greedy heuristic [24,25]. The basic greedy heuristic is explained in Freeman et al [7].…”
Section: Point-grouping Bounds Grouped Pointsmentioning
confidence: 99%
“…Ludington et al [52] takes georeferenced SfM and uses bundle adjustment to model uncertainty in SfM. Also of particular note, Jung et al [24] uses a stochastic greedy algorithm for optimal sensor (non-UAV) placement.…”
Section: Grid Independence Of Cg Parametersmentioning
confidence: 99%
“…To overcome the downsides of the nadir grid approach and obtain better orthogonal views of Pescara del Tronto, a view-planning algorithm delineates optimized photo locations and angles through greedy heuristics [25]. View-planning identifies the best sensor locations for observing an object or site by planning oblique images for optimized SfM [26,27].…”
Section: Optimized View and Path Planning Algorithmsmentioning
confidence: 99%