Complexity of constrained sensor placement problems for optimal observability

DOI10.1016/J.AUTOMATICA.2021.109758MaRDI QIDQ2665404zbMATH OpenOpenAlexFDO

Authors Priyanka Dey, Niranjan Balachandran, Debasish Chatterjee

Publication date 19 November 2021

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2021.109758

zbMATH Keywords

graph theorymatchingstructural observabilitysubmodular functions

Mathematics Subject Classification ID

Observability (93B07) Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55)

Recommendations

• The PMU Placement Problem
• Computational complexity analysis of the sensor location flow observability problem
• Minimum structural sensor placement for switched linear time-invariant systems and unknown inputs
• State and input observability recovering by additional sensor implementation: a graph-theoretic approach
• A randomized approach to sensor placement with observability assurance

Cites work

• A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
• A Linear Tree Partitioning Algorithm
• An analysis of approximations for maximizing submodular set functions—I
• Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
• Approximation algorithms for NP-hard problems.
• Combinatorial optimization. Theory and applications.
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Control of Boolean networks: hardness results and algorithms for tree structured networks
• Control of vehicle platoons for highway safety and efficient utility: consensus with communications and vehicle dynamics
• Controllability indices for structured systems
• scientific article; zbMATH DE number 3891169 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1987700 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Introduction to algorithms.
• Minimal Controllability Problems
• Multivariable Control
• Observability Preservation Under Sensor Failure
• On Submodularity and Controllability in Complex Dynamical Networks
• Structural controllability
• Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems
• Submodularity in dynamics and control of networked systems. With a foreword by John Baillieul

Cited in

(9)

• On the computational complexity of the secure state-reconstruction problem
• Minimum structural sensor placement for switched linear time-invariant systems and unknown inputs
• A randomized approach to sensor placement with observability assurance
• On Most Permissive Observers in Dynamic Sensor Activation Problems
• Partial state observability recovering for linear systems by additional sensor implementation
• Computational complexity analysis of the sensor location flow observability problem
• Sensor selection cost optimisation for tracking structurally cyclic systems: a P-order solution
• Minimum jointly structural input and output selection
• A note on structural controllability and observability indices

This page was built for publication: Complexity of constrained sensor placement problems for optimal observability

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