Real-time sensor selection for time-varying networks with guaranteed performance

DOI10.1016/J.AUTOMATICA.2024.111550MaRDI QIDQ6546822zbMATH OpenFDO

Authors Reza Vafaee, Milad Siami

Publication date 30 May 2024

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2024.111550

zbMATH Keywords

network estimation and controlon-the-fly sensor and actuator selectionsrandomizationsparsificationtime-varying dynamics

Mathematics Subject Classification ID

Large-scale systems (93A15) Controllability (93B05) Observability (93B07) Networked control (93B70) Linear systems in control theory (93C05)

Recommendations

• On efficient sensor scheduling for linear dynamical systems
• Sparse sensor selection for distributed systems: an l₁-relaxation approach
• Algorithms for joint sensor and control nodes selection in dynamic networks
• A complete greedy algorithm for infinite-horizon sensor scheduling
• Stochastic sensor scheduling via distributed convex optimization

Cites work

• A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds
• Analysis and optimization of certain qualities of controllability and observability for linear dynamical systems
• Complex networks: principles, methods and applications
• Control Profiles of Complex Networks
• Controllability of multi-agent systems from a graph-theoretic perspective
• Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds
• Eigenvalues of rank-one updated matrices with some applications
• Growing Linear Dynamical Networks Endowed by Spectral Systemic Performance Measures
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Joint Centrality Distinguishes Optimal Leaders in Noisy Networks
• Leader-Following Connectivity Preservation Rendezvous of Multiple Double Integrator Systems Based on Position Measurement Only
• LQG Control and Sensing Co-Design
• Minimal Controllability Problems
• Minimizing unobservability in inferential control schemes
• Network Abstraction With Guaranteed Performance Bounds
• On Submodularity and Controllability in Complex Dynamical Networks
• On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering
• Online row sampling
• Optimal Sensor and Actuator Selection Using Balanced Model Reduction
• Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms
• Sensor Selection via Convex Optimization
• Single pass spectral sparsification in dynamic streams
• Spectral sparsification in the semi-streaming setting
• Uniform sampling for matrix approximation
• User-friendly tail bounds for sums of random matrices

Cited in

(1)

• Data scheduling and state estimation for large-scale event-based sensor arrays

This page was built for publication: Real-time sensor selection for time-varying networks with guaranteed performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546822)