Towards Understanding Sensor and Control Nodes Selection in Nonlinear Dynamic Systems: Lyapunov Theory Meets Branch-and-Bound
Sebastian A. Nugroho, Ahmad F. Taha

TL;DR
This paper introduces a novel framework combining Lyapunov theory and branch-and-bound algorithms to optimally select sensors and actuators in nonlinear dynamic systems, addressing limitations of linear approximations.
Contribution
It develops a general nonlinear system framework, classifies nonlinear functions, and designs a customized branch-and-bound algorithm for sensor and actuator selection.
Findings
The new BnB algorithm is more computationally efficient.
The approach applies to both stable and unstable nonlinear systems.
It ensures stabilization of estimation and control through optimal sensor/actuator placement.
Abstract
Sensor and actuator selection problems (SASP) are some of the core problems in dynamic systems design and control. These problems correspond to determining the optimal selection of sensors (measurements) or actuators (control nodes) such that certain estimation/control objectives can be achieved. While the literature on SASP is indeed inveterate, the vast majority of the work focuses on linear(ized) representation of the network dynamics, resulting in the placements of sensors or actuators (SA) that are valid for confined operating regions. As an alternative, herein we propose a new general framework for addressing SASP in nonlinear dynamic systems (NDS), assuming that the inputs and outputs are linearly coupled with the nonlinear dynamics. This is investigated through (i) classifying and parameterizing the NDS into various nonlinear function sets, (ii) utilizing rich Lyapunov theoretic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
