Sparse Actuator Control of Discrete-Time Linear Dynamical Systems

G Joseph - Foundations and Trends® in Systems and …, 2024 - nowpublishers.com
This monograph presents some exciting and new results on the analysis and design of
control of discrete-time linear dynamical systems using sparse actuator control. Sparsity …

Sensor selection by greedy method for linear dynamical systems: Comparative study on Fisher-information-matrix, observability-Gramian and Kalman-filter-based …

S Takahashi, Y Sasaki, T Nagata, K Yamada… - IEEE …, 2023 - ieeexplore.ieee.org
Objective functions for sensor selection are investigated in linear time-invariant systems with
a large number of sensor candidates. This study compared the performance of sensor sets …

Efficient sensor node selection for observability Gramian optimization

K Yamada, Y Sasaki, T Nagata, K Nakai, D Tsubakino… - Sensors, 2023 - mdpi.com
Optimization approaches that determine sensitive sensor nodes in a large-scale, linear time-
invariant, and discrete-time dynamical system are examined under the assumption of …

Goal-oriented scheduling in sensor networks with application timing awareness

J Holm, F Chiariotti, AE Kalør, B Soret… - IEEE Transactions …, 2023 - ieeexplore.ieee.org
Taking inspiration from linguistics, the communications theoretical community has recently
shown a significant recent interest in pragmatic, or goal-oriented, communication. In this …

Randomized group-greedy method for large-scale sensor selection problems

T Nagata, K Yamada, K Nakai, Y Saito… - IEEE Sensors …, 2023 - ieeexplore.ieee.org
The randomized group-greedy (RGG) method and its customized method for large-scale
sensor selection problems are proposed. The randomized greedy sensor selection …

Extremum information transfer over networks for remote estimation and distributed learning

MM Vasconcelos, U Mitra - Frontiers in Complex Systems, 2024 - frontiersin.org
Most modern large-scale multi-agent systems operate by taking actions based on local data
and cooperate by exchanging information over communication networks. Due to the …

Low-complexity graph sampling with noise and signal reconstruction via Neumann series

F Wang, G Cheung, Y Wang - IEEE Transactions on Signal …, 2019 - ieeexplore.ieee.org
Graph sampling addresses the problem of selecting a node subset in a graph to collect
samples, so that a K-bandlimited signal can be reconstructed with high fidelity. Assuming an …

Greedy sensor selection for weighted linear least squares estimation under correlated noise

K Yamada, Y Saito, T Nonomura, K Asai - IEEE Access, 2022 - ieeexplore.ieee.org
Optimization of sensor selection has been studied to monitor complex and large-scale
systems with data-driven linear reduced-order modeling. An algorithm for greedy sensor …

Scheduling of sensor transmissions based on value of information for summary statistics

F Chiariotti, AE Kalør, J Holm, B Soret… - IEEE Networking …, 2022 - ieeexplore.ieee.org
The optimization of Value of Information (VoI) in sensor networks integrates awareness of
the measured process in the communication system. However, most existing scheduling …

Information-based sensor placement for data-driven estimation of unsteady flows

J Graff, A Medina, FD Lagor - AIAA Journal, 2023 - arc.aiaa.org
Estimation of unsteady flowfields around flight vehicles may improve flow interactions and
lead to enhanced vehicle performance. Although flowfield representations can be very high …