.png){kind=icon}
.png){kind=icon}
Return
Randomized Group-Greedy Method for Large-Scale Sensor Selection Problems
.png){kind=icon}
OA
AI
DOI：10.1109/JSEN.2023.3258223.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The randomized group-greedy (RGG) method and its customized method for large-scale sensor selection problems are proposed. The randomized greedy sensor selection algorithm is applied straightforwardly to the group-greedy (GG) method, and a customized method is also considered. In the customized method, a part of the compressed sensor candidates is selected using the common greedy method or other low-cost methods. This strategy compensates for the deterioration of the solution due to compressed sensor candidates. The proposed methods are implemented based on the D- and E-optimal design of experiments, and numerical experiments are conducted using randomly generated sensor candidate matrices with potential sensor locations of 10000-1000000. The proposed method can provide better optimization results than those obtained by the original GG method when a similar computational cost is spent as for the original GG method. This is because the group size for the GG method can be increased as a result of the compressed sensor candidates by the randomized algorithm. Similar results were also obtained in the real dataset. The proposed method is effective for the E-optimality criterion, in which the objective function that the optimization by the common greedy method is difficult due to the absence of submodularity of the objective function. The idea of the present method can improve the performance of all optimizations using a greedy algorithm.
Keywords:
Sensors
Optimization
Sensor phenomena and characterization
Computational efficiency
Linear programming
Sensor systems
Inverse problems
Greedy method
linear inverse problem
optimal design of experiment
randomized algorithm
sensor selection